Navigation

Program Committee




APPROX

Nikhil Bansal
Chandra Chekuri
Eden Chlamtac
Nikhil Devanur
Uriel Feige
Claire Mathieu
Ankur Moitra
Seffi Naor
Yuval Rabani
Prasad Raghavendra (chair)
Roy Schwartz
Mohit Singh
Ola Svensson
Mohammadtaghi Hajiaghayi
Madhur Tulsiani
Rico Zenklusen

RANDOM

Amit Chakrabarti
Nikolaos Fountoulakis
Ariel Gabizon
Parikshit Gopalan
Dan Gutfreund
Prahladh Harsha
Thomas Hayes
Michael Krivelevich
Shachar Lovett
Russell Martin
Dieter van Melkebeek
Sofya Raskhodnikova(Chair)
Shubhangi Saraf
Christian Sohler
David P. Woodruff
Amir Yehudayoff

Program Chairs


APPROX
Prasad Raghavendra,
University of California, Berkeley
email:
prasad@cs.berkeley.edu

RANDOM
Sofya Raskhodnikova,
Pennsylvania State University
email:
sofya@cse.psu.edu

Workshop Chairs


José Rolim,
U. of Geneva
e-mail: jose.rolim@unige.ch
Klaus Jansen,
U. of Kiel
e-mail: kj@informatik.uni-kiel.de
Important dates
Submission deadline
April 17, 2013
5PM PDT

Notification to authors
June 11, 2013

Camera ready
June 18, 2013
Call for papers
PDF Format

Plain Text

Submissions


Please use the following links to submit:

Random:
Click here

Approx:
Click here

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 (not including the title page and the references), using reasonable margins and at least 11-point font. 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. Abstracts deviating significantly from these guidelines risk being rejected without further review.

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


TOPICS

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

APPROX

  • 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
RANDOM

  • 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