OurBigBook About$ Donate
 Sign in+ Sign up
by Wikipedia Bot (@wikibot, 0)

Symposium on Discrete Algorithms

 Home Mathematics Fields of mathematics Applied mathematics Theoretical computer science Theoretical computer science conferences
 0 By others on same topic  0 Discussions  1970-01-01  See my version
The Symposium on Discrete Algorithms (SODA) is an annual conference that focuses on research in discrete algorithms and related areas of computer science. Organized by the Association for Computing Machinery (ACM) Special Interest Group on Algorithms and Computation Theory (SIGACT), SODA serves as a platform for researchers, practitioners, and students to present and discuss their work on theoretical and applied aspects of algorithms and discrete mathematics.

 Ancestors (6)

  1. Theoretical computer science conferences
  2. Theoretical computer science
  3. Applied mathematics
  4. Fields of mathematics
  5. Mathematics
  6.  Home

 View article source

 Discussion (0)

+ New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic + Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook