CALL FOR PAPERS
5th SIAM Symposium on Simplicity in Algorithms (SOSA 2022)
January 10-11, 2022
Alexandria, Virginia, U.S.
(Co-located with SODA 2022)
- Website: https://www.siam.org/conferences/cm/conference/sosa22
- Short Abstract Submission/Paper Registration Deadline: August 9, 2021
(4:59pm Eastern Time)
- Full Paper Submission Deadline: August 16, 2021 (4:59pm Eastern Time)
=============================================================================================
Symposium on Simplicity in Algorithms is a conference in theoretical
computer science dedicated to advancing algorithms research by promoting
simplicity and elegance in the design and analysis of algorithms. The
benefits of simplicity are manifold: simpler algorithms manifest a
better understanding of the problem at hand; they are more likely to be
implemented and trusted by practitioners; they can serve as benchmarks,
as an initialization step, or as the basis for a "state of the art"
algorithm; they are more easily taught and are more likely to be
included in algorithms textbooks; and they attract a broader set of
researchers to difficult algorithmic problems.
Papers in all areas of algorithms research are sought. An ideal
submission will advance our understanding of an algorithmic problem by,
for example, introducing a simpler algorithm, presenting a simpler
analysis of an existing algorithm, or offering insights that generally
simplify our understanding of important algorithms or computational
problems.
We are especially interested in papers that make material more
accessible to a wider audience, such as undergraduates, or for more
specialized topics, general algorithms researchers.
Submissions should contain novel ideas or attractive insights, but they
are not expected to prove novel theorems. That is, the results
themselves can be known, but their presentation must be new.
PAPER SUBMISSION
Authors must submit their papers electronically, in PDF format.
Submissions should begin with a title page containing the paper title,
each author's name, affiliation, and email address, and an abstract
summarizing the contributions of the paper. There is no page limit. The
paper should begin with a clear description of the algorithmic problem
to be solved, a survey of prior work on the problem -- including a
candid assessment of prior work in terms of simplicity and elegance --
and a discussion of the contributions of the paper. The body of the
paper should be written for a general theoretical computer science
audience and substantiate the main claims of the paper with full proofs.
The submission should be typeset using 11-point font, in a single-column
format with ample spacing throughout and ample margins all around. The
submissions ought to be visually easy to read.
Brevity is a hallmark of simplicity. Authors are specifically encouraged
to submit short and simple papers.
The program committee may designate one or more papers as SOSA Best
Papers. All submissions will be considered.
The submission site is available at
https://easychair.org/conferences/?conf=sosa2022
PROGRAM COMMITTEE
Karl Bringmann, Saarland University, Germany (co-chair)
Timothy Chan, University of Illinois at Urbana-Champaign, U.S. (co-chair)
Amir Abboud, Weizmann Institute of Science, Israel
Josh Alman, Harvard University, U.S.
Alex Andoni, Columbia University, U.S.
Sepehr Assadi, Rutgers University, U.S.
Petra Berenbrink, University of Hamburg, Germany
Karthekeyan Chandrasekaran, University of Illinois at Urbana-Champaign,
U.S.
Shiri Chechik, Tel-Aviv University, Israel
Anne Driemel, University of Bonn, Germany
Leah Epstein, University of Haifa, Israel
Fedor Fomin, University of Bergen, Norway
Sebastian Forster, University of Salzburg, Austria
Petteri Kaski, Aalto University, Finland
Tomasz Kociumaka, University of California, Berkeley, U.S.
Rasmus Kyng, ETH Zürich, Switzerland
Pasin Manurangsi, Google Research, U.S.
Nicole Megow, University of Bremen, Germany
Jesper Nederlof, Utrecht University, Netherlands
Krzysztof Onak, Boston University, U.S.
Debmalya Panigrahi, Duke University, U.S.
Richard Peng, Georgia Tech, U.S., and University of Waterloo, Canada
Kirk Pruhs, University of Pittsburgh, U.S.
Eva Rotenberg, Technical University of Denmark, Denmark
Aviad Rubinstein, Stanford University, U.S.
Piotr Sankowski, IDEAS NCBR and University of Warsaw, Poland
Thatchaphol Saranurak, University of Michigan, U.S.
Christian Wulff-Nilsen, University of Copenhagen, Denmark
**********************************************************
*
* 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
