TOPICS
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 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. The submission server is available at: https://easychair.org/conferences/?conf=sosa20.
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.
BEST PAPER AWARD
The program committee may designate one or more papers as SOSA Best Papers. All submissions will be considered.
IMPORTANT DATES
-- Short Abstract Submission Deadline: August 9, 2019.
-- Full Paper Submission deadline: August 16, 2019.
-- Notification of acceptance/rejection: early October, 2019.
-- Camera-ready deadline: late October, 2019.
-- Conference: January 6–7, 2020, Hilton Salt Lake City Center, Salt Lake City, Utah, USA.
PROGRAM COMMITTEE
Kunal Agrawal (Washington University in St. Louis, U.S.)
Guy Blelloch (Carnegie Mellon University, U.S.)
Vladimir Braverman (Johns Hopkins University, U.S.)
Karl Bringmann (Max Planck Institute for Informatics, Germany)
Deeparnab Chakrabarty (Dartmouth College, U.S.)
Moses Charikar (Stanford University, U.S.)
Artur Czumaj (University of Warwick, United Kingdom)
David Eppstein (University of California, Irvine, U.S.)
Martin Farach-Colton (Rutgers University, U.S.) [Chair]
Naveen Garg (Indian Institute of Technology Delhi, India)
Paweł Gawrychowski (University of Wrocław, Poland)
Anupam Gupta (Carnegie Mellon University, U.S.)
Inge Li Gørtz (Technical University of Denmark, Denmark) [Chair]
Rob Johnson (VMware, U.S.)
Michal Koucky (Charles University, Czech Republic)
Miguel A. Mosteiro (Pace University, U.S.)
Danupon Nanongkai (KTH Royal Institute of Technology, Sweden)
Vijaya Ramachandran (The University of Texas at Austin, U.S.)
R. Ravi (Carnegie Mellon University, U.S.)
Andrea Richa (Arizona State University, U.S.)
Shikha Singh (Williams College, U.S.)
Bettina Speckmann (TU Eindhoven, The Netherlands)
Tatiana Starikovskaya (École Normale Supérieure, France)
Kunal Talwar (Google, U.S.)
Przemek Uznański (University of Wrocław, Poland)
Oren Weimann (University of Haifa, 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)
**********************************************************
*
* 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
