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)

Related topics

Related topics

6 relations
ACM Transactions on AlgorithmsClaire MathieuList of books in computational geometryList of computer science conferences

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Quantum simulation of partially distinguishable boson sampling
Boson Sampling is the problem of sampling from the same output probability distribution as a collection of indistinguishable… 
2016
2016
Cuckoo Filter: Simplification and Analysis
The cuckoo filter data structure of Fan, Andersen, Kaminsky, and Mitzenmacher (CoNEXT 2014) performs the same approximate set… 
2014
2014
Representative families: A unified tradeoff-based approach
2009
2009
Skip-Splay: Toward Achieving the Unified Bound in the BST Model
We present skip-splay, the first binary search tree algorithm known to have a running time that nearly achieves the unified bound… 
Highly Cited
2009
Highly Cited
2009
Practical Private DNA String Searching and Matching through Efficient Oblivious Automata Evaluation
In [18] it was shown that the ability to perform oblivious automata evaluation was useful for performing DNA searching and… 
2008
2008
Approximating k-cuts using network strength as a Lagrangean relaxation
2005
2005
Speeding-Up Hierarchical Agglomerative Clustering in Presence of Expensive Metrics
In several contexts and domains, hierarchical agglomerative clustering (HAC) offers best-quality results, but at the price of a… 
Highly Cited
2005
Highly Cited
2005
On the Wake-Up Problem in Radio Networks
Radio networks model wireless communication when processing units communicate using one wave frequency. This is captured by the… 
Highly Cited
2003
Highly Cited
2003
Characterizing achievable rates in multi-hop wireless networks: the joint routing and scheduling problem
This paper considers the problem of determining the achievable rates in multi-hop wireless networks. We consider the problem of… 
Highly Cited
1994
Highly Cited
1994
Content-Based Image Indexing
We formulate the content-based image indexing problem as a multi-dimensional nearest-neighbor search problem, and develop… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)