Thursday, April 29, 2021

[DMANET] Last call for papers: RANDOM -- APPROX 2021

Call for Papers:
25th RANDOM & 24th APPROX

August 16-18, 2021 online


http://randomconference.com/
http://approxconference.wordpress.com

====================================================

Paper submission deadline: May 4, 2021

====================================================


SCOPE
The 25th International Workshop on Randomization and Computation
(RANDOM 2021) and the 24th International Workshop on Approximation
Algorithms for Combinatorial Optimization Problems (APPROX 2021) will
be held online on August 16-18, 2021.
RANDOM 2021 focuses on applications of randomness to computational and
combinatorial problems while APPROX 2021 focuses on algorithmic and
complexity theoretic issues relevant to the development of efficient
approximate solutions to computationally difficult problems.

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


RANDOM
- design and analysis of randomized algorithms
- randomized complexity theory
- pseudorandomness and derandomization
- 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
- smoothed analysis
- property testing
- computational learning theory


APPROX
- approximation algorithms
- hardness of approximation
- small space, sub-linear time and streaming algorithms
- online algorithms
- approaches that go beyond worst-case analysis
- distributed and parallel approximation
- embeddings and metric space methods
- mathematical programming methods
- spectral methods
- combinatorial optimization
- algorithmic game theory, mechanism design and economics
- computational geometric problems
- approximate learning


IMPORTANT DATES
Submissions: May 4, 2021
Notifications: June 23, 2021
Camera ready: July 12, 2021


SUBMISSIONS
Abstract Format: Electronic submissions are solicited. Please consult
the following servers:
For submission of APPROX papers:
https://easychair.org/my/conference?conf=approx2021
For submission of RANDOM papers:
https://easychair.org/my/conference?conf=random2021
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 submission must be received by 15:00 (PDT) of May 4, 2021 for your
submission to be considered.

Submission Format: Submissions 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 on single-spaced pages on
letter-size paper, using reasonable margins, page numbers, and at least
11-point font. The first 10 pages should contain the main ideas and
techniques used to achieve the results including motivation and a clear
comparison with related work (not including the references). There is
no page limit but any material beyond the first 10 pages will be read
at the sole discretion of the program committee.

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

PROCEEDINGS
Accepted papers will be published in the online proceedings of the
conference in the Leibniz International Proceedings in Informatics
(LIPIcs) series, based at Schloss Dagstuhl. This guarantees perennial,
free and easy electronic access, while the authors retain the rights
over their work.

RANDOM Program Chair
Mary Wootters, Stanford University
marykw@stanford.edu

APPROX Program Chair
Laura Sanita, TU Eindhoven
l.sanita@tue.nl

Local Organizing Committee Chair
Yin-Tat Lee, University of Washington
yintat@uw.edu

RANDOM Steering Committee
Oded Goldreich, Weizmann
Raghu Meka, UCLA, Steering Committee Chair
Cris Moore, SFI
Anup Rao, U Washington
Omer Reingold, Stanford
Dana Ron, Tel Aviv University
Ronitt Rubinfeld, MIT
Amit Sahai, UCLA
Ronen Shaltiel, U Haifa, Publicity Chair
Alistair Sinclair, UC Berkeley
Paul Spirakis, U Liverpool

APPROX Steering Committee
Jaroslaw Byrka, University of Wroclaw
Klaus Jansen, U Kiel
Samir Khuller, Northwestern University
Monaldo Mastrolilli, IDSIA
Laszlo A. Vegh, LSE


PROGRAM COMMITTEES

RANDOM
Sarah Cannon, Claremont McKenna College
Clement Canonne, The University of Sydney
Amit Chakrabarti, Dartmouth College
Karthekeyan Chandrasekaran, UIUC
Mahdi Cheraghchi, University of Michigan
Irit Dinur, Weizmann Institute
Dean Doron, Stanford University
Sumegha Garg, Harvard University
Badih Ghazi, Google
Elena Grigorescu, Purdue University
Shuichi Hirahara, National Institute of Informatics
Michael Kapralov, EPFL
Yi Li, Nanyang Technological University
Xin Li, Johns Hopkins University
Andrea Lincoln, UC Berkeley
Arya Mazumdar, UCSD
Daniel Reichman, WPI
Ramprasad Saptharishi, Tata Institute of Fundamental Research, Mumbai
Li-Yang Tan, Stanford University
Udi Wieder, VMware
Mary Wootters, Stanford University, (PC chair)


APPROX
Umang Bhaskar, Tata Institute of Fundamental research
Gwenael Joret, Universite libre de Bruxelles
Naonori Kakimura, Keio University
Jochen Koenemann, University of Waterloo
Michael Lampis, University of Paris Dauphine
Shi Li, University at Buffalo
Tobias Moemke, University of Augsburg
Viswanath Nagarajan, University of Michigan
Jesper Nederlof, Utrecht University
Alantha Newman, University of Grenoble
Debmalya Panigrahi, Duke University
Marcin Pilipczuk, University of Warsaw
Laura Sanita, TU Eindhoven, (PC chair)
Guido Schaefer, CWI & University of Amsterdam
Martin Skutella, TU Berlin
Andreas Wiese, University of Chile

**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************