SODA: Symposium on Discrete Algorithms

FacebookTwitterLinkedInGoogle

 

Past:   Proceedings on DBLP

Future:  Post a CFP for 2023 or later   |   Invite the Organizers Email

 
 

All CFPs on WikiCFP

Event When Where Deadline
SODA 2022 Symposium on Discrete Algorithms
Jan 9, 2022 - Jan 12, 2022 Alexandria, WV, USA Jul 12, 2021 (Jul 5, 2021)
SODA 2021 Symposium on Discrete Algorithms
Jan 10, 2021 - Jan 13, 2021 Alexandria, VA, USA Jul 15, 2020 (Jul 13, 2020)
SODA 2020 Symposium on Discrete Algorithms
Jan 5, 2020 - Jan 8, 2020 Salt Lake City, UT, USA Jul 5, 2019
SODA 2018 ACM-SIAM Symposium on Discrete Algorithms
Jan 7, 2018 - Jan 8, 2018 New Orleans, Louisiana, USA TBD
SODA 2017 Symposium on Discrete Algorithms
Jan 16, 2017 - Jan 19, 2017 Barcelona, Spain Jul 13, 2016 (Jul 6, 2016)
SODA 2014 ACM-SIAM Symposium on Discrete Algorithms
Jan 5, 2014 - Jan 7, 2014 Portland, OR, USA TBD
SODA 2013 ACM-SIAM Symposium on Discrete Algorithms
Jan 6, 2013 - Jan 8, 2013 New Orleans, LA, USA Jul 3, 2012 (Jun 26, 2012)
SODA 2012 ACM-SIAM Symposium on Discrete Algorithms
Jan 17, 2012 - Jan 19, 2012 Kyoto, Japan Jul 12, 2011 (Jul 5, 2011)
SODA 2011 SODA 2011, ACM-SIAM Symposium on Discrete Algorithms (Ranked as A, CORE 2008)
Jan 23, 2011 - Jan 25, 2011 San Francisco, California (USA) Jul 7, 2010 (Jul 2, 2010)
SODA 2010 ACM-SIAM Symposium on Discrete Algorithms
Jan 17, 2010 - Jan 19, 2010 Austin, Texas Jul 6, 2009 (Jun 29, 2009)
SODA 2008 19th ACM-SIAM Symposium on Discrete Algorithms
Jan 20, 2008 - Jan 22, 2008 San Fracisco, CA, USA Jul 6, 2007
 
 

Present CFP : 2022

SODA is sponsored by the SIAM Activity Group on Discrete Mathematics and the ACM Special Interest Group on Algorithms and Computation Theory.

This symposium focuses on research topics related to efficient algorithms and data structures for discrete problems.

In addition to the design of such methods and structures, the scope also includes their use, performance analysis, and the mathematical problems related to their development or limitations. Performance analyses may be analytical or experimental and may address worst-case or expected-case performance. Studies can be theoretical or based on data sets that have arisen in practice and may address methodological issues involved in performance analysis.

The following meetings will be held jointly:
ACM-SIAM Symposium on Discrete Algorithms (SODA22)
Algorithm Engineering and Experiments (ALENEX22)
SIAM Symposium on Algorithmic Principles of Computer Systems (APOCS22)
SIAM Symposium on Simplicity in Algorithms (SOSA22)

Included Themes

Aspects of combinatorics and discrete mathematics, such as:

Combinatorial structures
Discrete optimization
Discrete probability
Finite metric spaces
Graph theory
Mathematical programming
Random structures
Topological problems

Core topics in discrete algorithms, such as:

Algorithm analysis
Data structures
Experimental algorithmics

Algorithmic aspects of other areas of computer science, such as:

Algorithmic fairness
Combinatorial scientific computing
Communication networks and the internet
Computational geometry and topology
Computer graphics and computer vision
Computer systems
Cryptography and security
Databases and information retrieval
Data compression
Data privacy
Distributed and parallel computing
Game theory and mechanism design
Machine learning
Quantum computing

Connect on Facebook
#SIAMDA22
See Related Presentations & Documents

Program Committee Chair

Seffi Naor
Technion Israel Institute of Technology, Israel
Program Committee Vice Chair

Niv Buchbinder
Tel Aviv University, Israel
Program Committee Chair

Amir Abboud, Weizmann Institute of Science, Israel
Sepehr Assadi, Rutgers University, U.S.
Aaron Bernstein, Rutgers University, U.S.
Therese Biedl, University of Waterloo, Canada
Deeparnab Chakrabarty, Dartmouth College, U.S.
Moses Charikar, Stanford University, U.S.
Keren Censor-Hillel, Technion, Israel
Xi Chen, Columbia University, U.S.
Christian Coester, Centrum Wiskunde & Informatica (CWI), Netherlands
Jose Correa, Universidad de Chile, Chile
Daniel Dadush, Centrum Wiskunde & Informatica (CWI), Netherlands
Nikhil Devanur, Amazon, U.S.
Zdenek Dvorak, Charles University, Czech Republic
Friedrich Eisenbrand, École Polytechnique Fédérale de Lausanne, Switzerland
Jeff Erickson, University of Illinois, Urbana-Champaign, U.S.
Guy Even, Tel Aviv University, Israel
Moran Feldman, University of Haifa, Israel
Pierre Fraigniaud, Université de Paris and CNRS, France
Badih Ghazi, Google, U.S.
Vasilis Gkatzelis, Drexel University, U.S.
Zhiyi Huang, University of Hong Kong, Hong Kong
Giuseppe Italiano, LUISS University, Italy
Tomas Kaiser, University of West Bohemia, Czech Republic
Gautam Kamath, University of Waterloo, Canada
Daniel Kane, University of California, San Diego, U.S.
Ken-ichi Kawarabayashi, National Institute of Informatics, Japan
Michael P. Kim, University of California, Berkeley, U.S.
Tsvi Kopelowitz, Bar Ilan University, Israel
Ravi Kumar, Google, U.S.
Andrey Kupavskii, CNRS, France and Moscow
Institute of Physics and Technology, Russia
Kasper Green-Larsen, Aarhus University, Denmark
Jerry Li, Microsoft Research, U.S.
Daniel Lokshtanov, University of California, Santa Barbara, U.S.
Anna Lubiw, University of Waterloo, Canada
Brendan Lucier, Microsoft Research, U.S.
Thodoris Lykouris, Massachusetts Institute of Technology, U.S.
Martin Milanič, University of Primorska, Slovenia
Joe Mitchell, Stony Brook University, U.S.
Benjamin Moseley, Carnegie Mellon University, U.S.
Viswanath Nagarajan, University of Michigan, U.S.
Peter Nelson, University of Waterloo, Canada
Danupon Nanongkai, University of Copenhagen, Denmark
Jonathan Noel, University of Victoria, Canada
Neil Olver, London School of Economics and Political Science, United Kingdom
Christophe Paul, University of Montpellier and CNRS, France
Marcin Pilipczuk, University of Warsaw, Poland
Dror Rawitz, Bar Ilan University, Israel
Andrea Richa, Arizona State University, U.S.
Thomas Rothvoss, University of Washington, U.S.
Aviad Rubinstein, Stanford University, U.S.
Barna Saha, University of California, Berkeley, U.S.
Baruch Schieber, New Jersey Institute of Technology, U.S.
Bruce Shepherd, University of British Columbia, Canada
Mohit Singh, Georgia Institute of Technology, U.S.
Aravind Srinivasan, University of Maryland, U.S.
Ola Svensson, École Polytechnique Fédérale de Lausanne, Switzerland
Tami Tamir, IDC Herzliya, Israel, Israel
Seeun William Umboh, The University of Sydney, Australia
Sergei Vassilvitskii, Google, U.S.
David Wajc, Stanford University, U.S.
Matt Weinberg, Princeton University, U.S.
Udi Wieder, VMware Research, U.S.
Andreas Wiese, Universidad de Chile, Chile
Steven Wu, Carnegie Mellon University, U.S.
 

Related Resources

COCOON 2021   Computing and Combinatorics Conference
TJCDCGGG 2021   The 23rd Thailand-Japan Conference on Discrete and Computational Geometry, Graphs, and Games
IJCGA 2021   International Journal of Computer Graphics & Animation
CALDAM 2022   The 8th Annual International Conference on Algorithms and Discrete Applied Mathematics
ISAAC 2021   International Symposium on Algorithms and Computation
IJCAX 2021   International Journal of Computer-Aided technologies
EI Compendex, Scopus-AI2A 2021   2021 International Conference on Artificial Intelligence, Automation and Algorithms (AI2A 2021)
SODA 2021   Symposium on Discrete Algorithms
ICMLA 2021   20th IEEE International Conference on Machine Learning and Applications
ICONIP 2021   The 28th International Conference on Neural Information Processing (ICONIP2021)