Skip to search formSkip to main contentSkip to account menu

Symposium on Discrete Algorithms

Known as: Soda 
SODA, the Annual ACM-SIAM Symposium on Discrete Algorithms is an academic conference in the field of theoretical computer science. It is considered… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
The task of computing an optimal solution to a given problem instance is ubiquitous in computer science and is usually referred… 
2015
2015
This thesis addresses mainly two issues that have not been addressed in Statistical Machine Translation. One issue is that even… 
2013
2013
In recent years, points have seen increased use as a rendering primitive. This Bachelor Thesis presents and compares a number of… 
2007
2007
We have an Electronic Field Guide which contains an image database with thousands of leaf images. We have a system which can take… 
2001
2001
Local search heuristics are algorithms for combinatorial optimization that operate by executing walks over search graphs… 
1996
1996
of the Dissertation E cient Graph-Based Algorithms for Model Checking in the Modal Mu-Calculus by Oleg Sokolsky Doctor of… 
1996
1996
Abstract : As multiprocessing becomes increasingly successful in scientific and commercial computing, parallel systems will be… 
1995
1995
The construction of the convex hull of a nite point set in a low-dimensional Euclidean space is a fundamental problem in… 
1994
1994
We describe a procedure which may be helpful to any disorganized carpenter who has a mixed pile of bolts and nuts and wants to nd… 
1993
1993
This thesis describes a system for interactive walkthroughs of large, fully furnished architectural models. Realistic-looking…