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

TOTAL DOCUMENTS

137

(FIVE YEARS 0)

H-INDEX

21

(FIVE YEARS 0)

Published By Society For Industrial And Applied Mathematics

9780898717013, 9781611973075

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

A Space–Time Tradeoff for Permutation Problems

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

10.1137/1.9781611973075.41 ◽

2010 ◽

Author(s):

Mikko Koivisto ◽

Pekka Parviainen

Keyword(s):

Time Tradeoff ◽

Permutation Problems

Download Full-text

How good is the Chord algorithm?

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

10.1137/1.9781611973075.79 ◽

2010 ◽

Author(s):

Constantinos Daskalakis ◽

Ilias Diakonikolas ◽

Mihalis Yannakakis

Download Full-text

An Online Scalable Algorithm for Average Flow Time in Broadcast Scheduling

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

10.1137/1.9781611973075.107 ◽

2010 ◽

Author(s):

Sungjin Im ◽

Benjamin Moseley

Keyword(s):

Flow Time ◽

Broadcast Scheduling ◽

Scalable Algorithm ◽

Download Full-text

Differential Privacy in New Settings

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

10.1137/1.9781611973075.16 ◽

2010 ◽

Author(s):

Cynthia Dwork

Keyword(s):

Differential Privacy

Download Full-text

Distributed Agreement with Optimal Communication Complexity

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

10.1137/1.9781611973075.78 ◽

2010 ◽

Author(s):

Seth Gilbert ◽

Dariusz R. Kowalski

Keyword(s):

Communication Complexity ◽

Distributed Agreement

Download Full-text

A Nearly Optimal Algorithm for Approximating Replacement Paths and k Shortest Simple Paths in General Graphs

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

10.1137/1.9781611973075.61 ◽

2010 ◽

Author(s):

Aaron Bernstein

Keyword(s):

Optimal Algorithm ◽

Simple Paths ◽

Download Full-text

Bounding Variance and Expectation of Longest Path Lengths in DAGs

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

10.1137/1.9781611973075.63 ◽

2010 ◽

Author(s):

Jeff Edmonds ◽

Supratik Chakraborty

Keyword(s):

Longest Path ◽

Download Full-text

Testing additive integrality gaps

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

10.1137/1.9781611973075.98 ◽

2010 ◽

Author(s):

Friedrich Eisenbrand ◽

Nicolai Hähnle ◽

Dömötör Pálvölgyi ◽

Gennady Shmonin

Keyword(s):

Integrality Gaps

Download Full-text

Terrain Guarding is NP-Hard

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

10.1137/1.9781611973075.128 ◽

2010 ◽

Author(s):

James King ◽

Erik Krohn ‡

Keyword(s):

Np Hard ◽

Terrain Guarding

Download Full-text

Front Matter

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

10.1137/1.9781611973075.fm ◽

2010 ◽

Download Full-text