SIAM Symposium on Simplicity in Algorithms (SOSA27)

About the Conference

Symposium on Simplicity in Algorithms (SOSA) 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 required 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 (SODA)
• SIAM Symposium on Algorithm Engineering and Experiments (ALENEX)
• SIAM Symposium on Simplicity in Algorithms (SOSA)

Connect with other attendees on LinkedIn.