Symposium on Discrete Algorithms

Symposium on Discrete Algorithms
Name	Symposium on Discrete Algorithms
Acronym	SODA
Discipline	Computer science, Discrete mathematics, Algorithms
Abbreviation	SODA
Frequency	Annual
Location	Various, including United States, Canada, Japan
Organizer	Society for Industrial and Applied Mathematics, Association for Computing Machinery

Contents

Symposium on Discrete Algorithms. The Symposium on Discrete Algorithms, also known as SODA, is an annual academic conference held by the Society for Industrial and Applied Mathematics and the Association for Computing Machinery, focusing on Discrete mathematics, Theoretical computer science, and Algorithms, with notable attendees including Donald Knuth, Richard Karp, and Michael Mitzenmacher. The conference features presentations on various topics, such as Graph theory, Combinatorics, and Computational complexity theory, with contributions from researchers at institutions like Massachusetts Institute of Technology, Stanford University, and University of California, Berkeley. The symposium has been sponsored by organizations including National Science Foundation, Google, and Microsoft Research.

Introduction

The Symposium on Discrete Algorithms is a premier conference that brings together researchers from around the world, including Europe, Asia, and the Americas, to present and discuss their latest findings in the field of discrete algorithms, with a focus on Computer science, Mathematics, and Engineering, and featuring speakers like Christos Papadimitriou, Avi Wigderson, and Daniel Spielman. The conference has a long history of showcasing innovative research, with past presentations on topics such as Cryptography, Data structures, and Algorithm design, and has been attended by researchers from institutions like Carnegie Mellon University, University of Oxford, and École Polytechnique Fédérale de Lausanne. The symposium has also been associated with other notable conferences, including STOC, FOCS, and ICALP, and has been sponsored by organizations like IBM Research, Intel Labs, and Facebook AI Research.

The first Symposium on Discrete Algorithms was held in 1990, with subsequent conferences taking place annually, featuring keynote speakers like Andrew Yao, Leslie Valiant, and Shafi Goldwasser, and with presentations on topics such as Computational geometry, Number theory, and Optimization problems, and has been organized by committees including David Johnson, Michael Luby, and Rakesh Vohra. The conference has been hosted in various locations, including San Francisco, New York City, and Vancouver, and has been attended by researchers from institutions like University of Cambridge, University of Tokyo, and Australian National University. The symposium has also been associated with other notable events, including ACM Symposium on Theory of Computing, IEEE Symposium on Foundations of Computer Science, and International Colloquium on Automata, Languages, and Programming, and has been sponsored by organizations like Amazon Research, Apple Inc., and NVIDIA Research.

The Symposium on Discrete Algorithms is organized by a committee of researchers, including Piotr Indyk, Rafael Pass, and Tim Roughgarden, and is sponsored by various organizations, including Society for Industrial and Applied Mathematics, Association for Computing Machinery, and National Science Foundation, with support from institutions like Harvard University, University of Chicago, and California Institute of Technology. The conference features a program committee, which includes researchers like Sanjeev Arora, Luca Trevisan, and Madhu Sudan, and is responsible for selecting presentations and organizing the conference program, with topics including Machine learning, Artificial intelligence, and Data science, and has been attended by researchers from institutions like University of Michigan, University of Illinois at Urbana-Champaign, and Georgia Institute of Technology. The symposium also features a steering committee, which includes researchers like Daniel Spielman, Shang-Hua Teng, and Rakesh Vohra, and is responsible for overseeing the conference organization, with support from organizations like Google Research, Microsoft Research, and Facebook AI Research.

The Symposium on Discrete Algorithms covers a wide range of topics, including Graph algorithms, Combinatorial optimization, and Computational complexity theory, with presentations on topics like Cryptography, Data structures, and Algorithm design, and featuring researchers like Oded Goldreich, Johan Håstad, and Russell Impagliazzo. The conference also features presentations on topics like Machine learning, Artificial intelligence, and Data science, with contributions from researchers at institutions like Massachusetts Institute of Technology, Stanford University, and University of California, Berkeley, and has been sponsored by organizations like National Science Foundation, Google, and Microsoft Research. The symposium has a strong focus on Theoretical computer science, with presentations on topics like Automata theory, Formal language theory, and Category theory, and has been attended by researchers from institutions like Carnegie Mellon University, University of Oxford, and École Polytechnique Fédérale de Lausanne.

The Symposium on Discrete Algorithms has featured many notable results and awards, including the Gödel Prize, which is awarded annually to recognize outstanding papers in Theoretical computer science, and has been awarded to researchers like Sanjeev Arora, Tim Roughgarden, and Shang-Hua Teng. The conference has also featured presentations on topics like Cryptography, Data structures, and Algorithm design, with contributions from researchers at institutions like Massachusetts Institute of Technology, Stanford University, and University of California, Berkeley, and has been sponsored by organizations like National Science Foundation, Google, and Microsoft Research. The symposium has also recognized outstanding researchers with awards like the Knuth Prize, which is awarded to recognize outstanding contributions to Theoretical computer science, and has been awarded to researchers like Andrew Yao, Leslie Valiant, and Shafi Goldwasser.

The proceedings of the Symposium on Discrete Algorithms are published annually, featuring papers on topics like Graph algorithms, Combinatorial optimization, and Computational complexity theory, and are available through ACM Digital Library, IEEE Xplore, and SIAM Online, with contributions from researchers at institutions like Massachusetts Institute of Technology, Stanford University, and University of California, Berkeley. The conference also features a best paper award, which is awarded annually to recognize outstanding papers presented at the conference, and has been awarded to researchers like Piotr Indyk, Rafael Pass, and Tim Roughgarden. The symposium has been sponsored by organizations like Google Research, Microsoft Research, and Facebook AI Research, and has been attended by researchers from institutions like Harvard University, University of Chicago, and California Institute of Technology.

Category:Computer science conferences