posted by user: timwylie || 5381 views || tracked by 6 users: [display]

SOSA 2019 : Symposium on Simplicity in Algorithms

FacebookTwitterLinkedInGoogle

Link: https://simplicityinalgorithms.com/
 
When Jan 6, 2019 - Jan 9, 2019
Where San Diego, CA, USA
Submission Deadline Aug 16, 2018
Notification Due Oct 15, 2018
Final Version Due Nov 15, 2018
Categories    theory   algorithms   complexity
 

Call For Papers

The Second Symposium on Simplicity in Algorithms will be co-located with the 30th ACM-SIAM Symposium on Discrete Algorithms (SODA 2019) in San Diego, USA, January 6–9, 2019.

Symposium on Simplicity in Algorithms is a new 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 will be open in August, 2018.

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.

Important Dates:

Submission deadline: August 16, 2018.
Notification of acceptance/rejection: early October, 2018.
Camera-ready deadline: early November, 2018.
Conference: January 6–9, 2019, Westin San Diego, San Diego, CA.

Related Resources

IEEE-Ei/Scopus-ITCC 2025   2025 5th International Conference on Information Technology and Cloud Computing (ITCC 2025)-EI Compendex
SOSA 2025   SOSA 2025: Symposium on Simplicity in Algorithms
SPIE-Ei/Scopus-DMNLP 2025   2025 2nd International Conference on Data Mining and Natural Language Processing (DMNLP 2025)-EI Compendex&Scopus
SOSA 2024   Symposium on Simplicity in Algorithms
IEEE-Ei/Scopus-CNIOT 2025   2025 IEEE 6th International Conference on Computing, Networks and Internet of Things (CNIOT 2025) -EI Compendex
CSITEC 2025   11th International Conference on Computer Science, Information Technology
IEEE CACML 2025   2025 4th Asia Conference on Algorithms, Computing and Machine Learning (CACML 2025)
SEA 2025   Symposium on Experimental and Efficient Algorithms
SoCG 2025   Symposium on Computational Geometry
Foundation Models: Theory, Technology, a 2024   Intelligent Computing: Special Issue: Foundation Models: Theory, Technology, and Applications