SIAM Symposium on Simplicity in Algorithms (SOSA21)

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
SIAM Symposium on Algorithm Engineering and Experiments
SIAM Symposium on Simplicity in Algorithms
SIAM Symposium on Algorithmic Principles of Computer Systems

Program Committee Co-Chairs

Valerie King, University of Victoria, Canada
Hung Le, University of Victoria, Canada and University of Massachusetts at Amherst, U.S.

Program Committee

Aaron Bernstein, Rutgers University, U.S. 
Allan Borodin, University of Toronto, Canada 
Timothy M. Chan, University of Illinois at Urbana-Champaign, U.S. 
Edith Cohen, Google Research, U.S. and Tel Aviv University, Israel 
Vincent Cohen-Addad, Google Research, Zürich, Switzerland 
Sanjoy Dasgupta, University of California, San Diego, U.S. 
Michael Elkin, Ben-Gurion University of the Negev, Israel 
Funda Ergun, National Science Foundation and University of Indiana, Bloomington, U.S. 
Mike Fellows, University of Bergen, Norway 
Arnold Filtser, Columbia University, U.S. 
Andrew Goldberg, Amazon, U.S. 
Kasper Green Larsen, Aarhus University, Denmark 
John Iacono, Université libre de Bruxelles, Belgium 
Russell Impagliazzo, University of California, San Diego, U.S.
Giuseppe Italiano, LUISS Guido Carli, Rome, Italy 
Michael Kapralov, École Polytechnique Fédérale de Lausanne (EPFL), Switzerland 
Anna Karlin, University of Washington, U.S. 
Daniel Lokshtanov, University of California, Santa Barbara, U.S. 
S. Cenk Sahinalp, NIH and University of Indiana, Bloomington, U.S. 
Jared Saia, University of New Mexico, U.S. 
Shay Solomon, Tel Aviv University, Israel 
Mario Szegedy, Alibaba and Rutgers University, U.S. 
Robert Tarjan, Princeton University, U.S. 
Seeun William Umboh, University of Sydney, Australia 
Qin Zhang, University of Indiana, Bloomington, U.S. 
Uri Zwick, Tel Aviv University, Israel

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