Hybrid
SIAM Conferences

SIAM Symposium on Simplicity in Algorithms (SOSA23)

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 (SODA23)
Algorithm Engineering and Experiments (ALENEX23)
SIAM Symposium on Algorithmic Principles of Computer Systems (APOCS23)
SIAM Symposium on Simplicity in Algorithms (SOSA23)

Program Committee Co-Chairs

Kurt Mehlhorn, Max-Planck-Institut für Informatik, Germany
Kavitha Telikepalli, Tata Institute of Fundamental Research, India

Program Committee

Siddharth Barman, Indian Institute of Science, Bangalore, India
Sayan Bhattacharya, University of Warwick, United Kingdom
Deeparnab Chakrabarty, Dartmouth College, U.S.
Parinya Chalermsook, Aalto University, Finland
Ran Duan, Tsinghua University, China
Khaled Elbassioni, Khalifa University, United Arab Emirates
David Eppstein, University of California, Irvine, U.S.
Danny Hermelin, Ben-Gurion University, Israel
Giuseppe F. Italiano, LUISS University, Rome, Italy
Michael Kapralov, EPFL, Lausanne, Switzerland
László Kozma, Freie Universität Berlin, Germany
Amit Kumar, IIT Delhi, India
Troy Lee, University of Technology Sydney, Australia
Stefano Leonardi, Sapienza University of Rome, Italy
Kazuhisa Makino, RIMS, Kyoto University, Japan
Kurt Mehlhorn, Max Planck Institute for Informatics, Germany
Ruta Mehta, University of Illinois at Urbana-Champaign, U.S.
Julian Mestre, University of Sydney, Australia
Nabil Mustafa, Université Paris 13, France
Ryan O’Donnell, Carnegie Mellon University, U.S.
Eunjin Oh, Pohang University of Science and Technology, Korea
Merav Parter, Weizmann Institute of Science, Israel
Laura Sanitá, Eindhoven University of Technology, Netherlands
Ildikó Schlotter, Centre for Economic and Regional Studies, Budapest, Hungary
Ramanujan Sridharan, University of Warwick, United Kingdom
Piyush Srivastava, Tata Institute of Fundamental Research, Mumbai, India
Clifford Stein, Columbia University, U.S.
Kavitha Telikepalli, Tata Institute of Fundamental Research, Mumbai, India
Karol Węgrzycki, Saarland University and Max Planck Institute for Informatics, Germany
Hang Zhou, École Polytechnique, France

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