SPAA Archives

ACM SPAA Participants List


Options: Use Forum View

Use Monospaced Font
Show Text Part by Default
Condense Mail Headers

Message: [<< First] [< Prev] [Next >] [Last >>]
Topic: [<< First] [< Prev] [Next >] [Last >>]
Author: [<< First] [< Prev] [Next >] [Last >>]

Print Reply
1.0 (Mac OS X Mail 16.0 \(3696.100.31\))
text/plain; charset=utf-8
Fri, 8 Jul 2022 15:57:36 -0400
Michael Bender <[log in to unmask]>
ACM SPAA Participants List <[log in to unmask]>
Michael Bender <[log in to unmask]>
text/plain (90 lines)

6th SIAM Symposium on Simplicity in Algorithms (SOSA23)
Florence, Italy, January 23-24, 2023

Conference website:
Submission website:

Abstract submission deadline: August 11, 2022 (Anywhere on earth)
Paper submission deadline: August 18, 2022 (Anywhere on earth)
Notification to authors by mid-October 2022
Final paper submission deadline: November 9, 2022

SOSA23 will be held jointly with ACM-SIAM Symposium on Discrete Algorithms (SODA23) at the Grand Hotel Mediterraneo in Florence, Italy.

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.
How to Participate
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.

Program Committee

Siddharth Barman, Indian Institute of Science, Bangalore, India
Sayan Bhattacharyai, University of Warwick, UK
Deeparnab Chakrabarty, Dartmouth College, USA
Parinya Chalermsook, Aalto University, Finland
Ran Duan, Tsinghua University, China
Khaled Elbassioni, Khalifa University, UAE
David Eppstein, University of California, Irvine, USA
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 (co-chair)
Ruta Mehta, University of Illinois at Urbana-Champaign, USA
Julian Mestre, University of Sydney, Australia
Nabil Mustafa, Université Paris 13, France
Ryan O’Donnell, Carnegie Mellon University, USA
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, UK
Piyush Srivastava, Tata Institute of Fundamental Research, Mumbai, India
Clifford Stein, Columbia University, USA
Kavitha Telikepalli, Tata Institute of Fundamental Research, Mumbai, India (co-chair)
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


You can unsubscribe at any time through this link: