Symposium on Simplicity in Algorithms is a conference in theoretical computer science dedicated to advancing algorithms research by promoting .. Read more 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. 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. 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. SIAM invites you to show support of this meeting through sponsorship opportunities ranging from support of receptions, audio-video needs, to awards for student travel, and more.
- Share your Experience
More Events From The Organizer
- SIAM Symposium on Algorithm En..10 - 11 Jan 2021Alexandria