About the Conference
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.
The following meetings will be held jointly:
ACM-SIAM Symposium on Discrete Algorithms (SODA22)
Algorithm Engineering and Experiments (ALENEX22)
SIAM Symposium on Algorithmic Principles of Computer Systems (APOCS22)
SIAM Symposium on Simplicity in Algorithms (SOSA22)
Program Committee Co-Chairs
Karl Bringmann, Saarland University, Germany
Timothy Chan, University of Illinois at Urbana-Champaign, U.S
Program Committee
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
Steering Committee
Michael A. Bender, Stony Brook University, U.S.
David Karger, Massachusetts Institute of Technology, U.S.
Tsvi Kopelowitz, Bar-Ilan University, Israel
Seth Pettie, University of Michigan, U.S.
Robert Tarjan, Princeton University, U.S.
Mikkel Thorup, University of Copenhagen, Denmark