SOSA 2018 - 2018 Symposium on Simplicity in Algorithms

The First Symposium on Simplicity in Algorithms will be co-located with The 29th ACM-SIAM Symposium on Discrete Algorithms (SODA 2018) in New Orleans, LA, USA, January 7–10, 2018.
​
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: simple 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; 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, or
presenting a simpler analysis of an existing algorithm, or
offering insights that generally simplify our understanding of important computational problems.
​
An ideal submission will contain novel ideas or attractive insights but is not expected to prove novel theorems, i.e., the results themselves can be known, but their presentation must be new.