2022) will be held online from September 19-21, 2022, jointly with the 25th
International Workshop on Approximation Algorithms for Combinatorial
Optimization Problems (APPROX 2022). RANDOM 2022 focuses on applications of
randomness to computational and combinatorial problems.
https://randomconference.com/random-2022-home/
TOPICS
Papers are solicited in all research areas related to randomization and
approximation, including but not limited to:
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
IMPORTANT DATES
Submissions: May 4, 2022
Notifications: June 24, 2022
Camera ready: July 15, 2022
SUBMISSIONS
Abstract Format: Electronic submissions are solicited. The submission link
is https://easychair.org/my/conference?conf=random2022. 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 server (you may also
have an old account from a previous conference submission).
The submission must be received by 18:00 (EST) of May 4, 2022 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 1-2
paragraph abstract summarizing the paper's contributions. This should be
followed by a technical exposition on single-spaced, single-column pages,
letter-size paper, using page numbers, at least 1-inch margins all around,
and at least 11-point font. The first 10 pages should contain a clear
presentation of the main technical and conceptual ideas underlying the
results, including the motivation behind the paper and a clear comparison
with related work (not including the references). The submission should be
accessible to a wide variety of researchers in theoretical computer science
and discrete mathematics. 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.
COMMITTEES
Program Committee
Sepehr Assadi, Rutgers University
Arnab Bhattacharyya, National University of Singapore
Andrej Bogdanov, The Chinese University of Hong Kong
Amit Chakrabarti (PC Chair), Dartmouth College
Zongchen Chen, MIT
Talya Eden, Boston University and MIT
Thomas Hayes, The University of New Mexico
William Hoza, University of California, Berkeley
Fotis Iliopoulos, Google Research
Haim Kaplan, Tel Aviv University
Pravesh Kothari, Carnegie Mellon University
Reut Levi, Reichman University
Or Meir, University of Haifa
Dor Minzer, MIT
Debmalya Panigrahi, Duke University
Eric Price, The University of Texas at Austin
Cynthia Rush, Columbia University
Rahul Santhanam, Oxford University
Srikanth Srinivasan, Aarhus University
Justin Thaler, Georgetown University
Samson Zhou, Carnegie Mellon University
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 and U Patras
* * *
Amit Chakrabarti
==
Professor of Computer Science (on sabbatical in Fall 2020)
Dartmouth College, Hanover NH 03755 USA
**********************************************************
*
* 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/
*
**********************************************************
Posts
