Program Committee


Chandra Chekuri
Uriel Feige
Pierre Fraigniaud
Magnús M. Halldórsson
Christos Kaklamanis
Anna Karlin
Samir Khuller
Guy Kortsarz
Monaldo Mastrolilli
Claire Mathieu
Zeev Nutov
Giuseppe Persiano
Maria Serna (chair)
Martin Skutella
Maxim Sviridenko
David P. Williamson


Dimitris Achlioptas
Alexandr Andoni
Anna Gal
Valentine Kabanets
Swastik Kopparty
Michael Krivelevich
Sofya Raskhodnikova
Ran Raz
Atri Rudra
Rocco Servedio
Ronen Shaltiel (chair)
Angelika Steger
Christopher Umans
Eric Vigoda
Sergey Yekhanin

Program Chairs

Maria Serna,
Universitat Politècnica de Catalunya

Ronen Shaltiel,
University of Haifa

Workshop Chairs

Klaus Jansen,
U. of Kiel

José Rolim,
U. of Geneva

Local Chairs

Maria Blesa,
Universitat Politècnica de Catalunya
Maria Serna,
Universitat Politècnica de Catalunya
Important dates
Submission deadline
April 18 , 2010

Notification to authors
June 12 , 2010

Camera ready
June 23 , 2010

1-3 September 2010
Call for papers


Abstract Format: Electronic submissions are solicited. Please consult the following servers:

For submission of APPROX papers:
For submission of RANDOM papers:

Note: You will be asked to login using an EasyChair account. Directions on how to register for such an account are available at the submission servers (you may also have an old account from a previous conference submission).

The postscript must be received by 17:00pm (PDT) of April 18 for your submission to be considered.
Abstract Format: Authors should submit an extended abstract (not a full paper). An abstract should start with the title of the paper, each author's name, affiliation, and e-mail address, followed by a one-paragraph summary of the results to be presented.
This should then be followed by a technical exposition of the main ideas and techniques used to achieve these results including motivation and a clear comparison with related work. The abstract should not exceed 10 single-spaced pages on letter-size paper, using reasonable margins and at least 11-point font (not including the references). If the authors believe that more details are essential to substantiate the main claims of the paper, they may include a clearly marked appendix that will be read at the discretion of the program committee.

Simultaneous submission to other conferences with published proceedings is not allowed.


Papers are solicited in all research areas related to randomization and approximation, including, but not limited to:


  • design and analysis of approximation algorithms
  • hardness of approximation
  • small space, sub-linear time, and streaming algorithms
  • embeddings and metric space methods
  • mathematical programming methods
  • combinatorial problems in graphs and networks
  • game theory, markets, and economic applications
  • geometric problems
  • packing, covering, and scheduling
  • approximate learning
  • other applications

  • design and analysis of randomized algorithms
  • randomized complexity theory
  • pseudorandomness and derandomi-zation
  • random combinatorial structures
  • random walks/Markov chains
  • expander graphs and randomness extractors
  • probabilistic proof systems
  • random projections and embeddings
  • error-correcting codes
  • average-case analysis
  • property testing
  • computational learning theory

Valid XHTML 1.0 Transitional Valid CSS!

Maintained by Marios Karagiannis