Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms
Latest Publications

TOTAL DOCUMENTS

136

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Society For Industrial And Applied Mathematics

9781611973747, 9781611973730

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Detecting Weakly Simple Polygons

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms ◽

10.1137/1.9781611973730.110 ◽

2014 ◽

Cited By ~ 11

Author(s):

Hsien-Chih Chang ◽

Jeff Erickson ◽

Chao Xu

Keyword(s):

Simple Polygons

Download Full-text

Testing Identity of Structured Distributions

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms ◽

10.1137/1.9781611973730.123 ◽

2014 ◽

Cited By ~ 7

Author(s):

Ilias Diakonikolas ◽

Daniel M. Kane ◽

Vladimir Nikishkin

Download Full-text

Pricing Online Decisions: Beyond Auctions

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms ◽

10.1137/1.9781611973730.7 ◽

2014 ◽

Cited By ~ 3

Author(s):

Ilan Reuven Cohen ◽

Alon Eden ◽

Amos Fiat ◽

Łukasz Jeż

Download Full-text

Short Paths on the Voronoi Graph and Closest Vector Problem with Preprocessing

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms ◽

10.1137/1.9781611973730.22 ◽

2014 ◽

Cited By ~ 5

Author(s):

Daniel Dadush ◽

Nicolas Bonifas

Keyword(s):

Closest Vector Problem ◽

Vector Problem ◽

Voronoi Graph

Download Full-text

Beating Exhaustive Search for Quantified Boolean Formulas and Connections to Circuit Complexity

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms ◽

10.1137/1.9781611973730.18 ◽

2014 ◽

Cited By ~ 1

Author(s):

Rahul Santhanam ◽

Ryan Williams

Keyword(s):

Circuit Complexity ◽

Exhaustive Search ◽

Quantified Boolean Formulas ◽

Boolean Formulas

Download Full-text

The Simplex Algorithm is NP-mighty

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms ◽

10.1137/1.9781611973730.59 ◽

2014 ◽

Cited By ~ 5

Author(s):

Yann Disser ◽

Martin Skutella

Keyword(s):

Simplex Algorithm

Download Full-text

Efficient and Robust Persistent Homology for Measures

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms ◽

10.1137/1.9781611973730.13 ◽

2014 ◽

Cited By ~ 1

Author(s):

Mickaël Buchet ◽

Frédéric Chazal ◽

Steve Y. Oudot ◽

Donald R. Sheehy

Keyword(s):

Persistent Homology

Download Full-text

Speeding up the Four Russians Algorithm by About One More Logarithmic Factor

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms ◽

10.1137/1.9781611973730.16 ◽

2014 ◽

Cited By ~ 10

Author(s):

Timothy M. Chan

Keyword(s):

Logarithmic Factor

Download Full-text

Limitations on Testable Affine-Invariant Codes in the High-Rate Regime

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms ◽

10.1137/1.9781611973730.87 ◽

2014 ◽

Cited By ~ 1

Author(s):

Venkatesan Guruswami ◽

Madhu Sudan ◽

Ameya Velingker ◽

Carol Wang

Keyword(s):

High Rate ◽

Affine Invariant

Download Full-text

Parameterized Streaming: Maximal Matching and Vertex Cover

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms ◽

10.1137/1.9781611973730.82 ◽

2014 ◽

Cited By ~ 9

Author(s):

Rajesh Chitnis ◽

Graham Cormode ◽

Mohammad Taghi Hajiaghayi ◽

Morteza Monemizadeh

Keyword(s):

Vertex Cover ◽

Maximal Matching

Download Full-text

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete AlgorithmsLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Society For Industrial And Applied Mathematics

Detecting Weakly Simple Polygons

Testing Identity of Structured Distributions

Pricing Online Decisions: Beyond Auctions

Short Paths on the Voronoi Graph and Closest Vector Problem with Preprocessing

Beating Exhaustive Search for Quantified Boolean Formulas and Connections to Circuit Complexity

The Simplex Algorithm is NP-mighty

Efficient and Robust Persistent Homology for Measures

Speeding up the Four Russians Algorithm by About One More Logarithmic Factor

Limitations on Testable Affine-Invariant Codes in the High-Rate Regime

Parameterized Streaming: Maximal Matching and Vertex Cover

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms
Latest Publications