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

TOTAL DOCUMENTS

147

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Society For Industrial And Applied Mathematics

9781611974331

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Efficient Low-Redundancy Codes for Correcting Multiple Deletions

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

10.1137/1.9781611974331.ch132 ◽

2015 ◽

Cited By ~ 20

Author(s):

Joshua Brakensiek ◽

Venkatesan Guruswami ◽

Samuel Zbarsky

Download Full-text

Approximation schemes for machine scheduling with resource (in-)dependent processing times

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

10.1137/1.9781611974331.ch104 ◽

2015 ◽

Cited By ~ 3

Author(s):

Klaus Jansen ◽

Marten Maack ◽

Malin Rau

Keyword(s):

Machine Scheduling ◽

Approximation Schemes ◽

Processing Times

Download Full-text

An Improved Distributed Algorithm for Maximal Independent Set

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

10.1137/1.9781611974331.ch20 ◽

2015 ◽

Cited By ~ 34

Author(s):

Mohsen Ghaffari

Keyword(s):

Distributed Algorithm ◽

Independent Set ◽

Maximal Independent Set

Download Full-text

The complexity of approximately counting in 2-spin systems on k-uniform bounded-degree hypergraphs

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

10.1137/1.9781611974331.ch34 ◽

2015 ◽

Author(s):

Andreas Galanis ◽

Leslie Ann Goldberg

Keyword(s):

Spin Systems ◽

Bounded Degree

Download Full-text

The matching problem has no small symmetric SDP

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

10.1137/1.9781611974331.ch75 ◽

2015 ◽

Cited By ~ 3

Author(s):

Gábor Braun ◽

Jonah Brown-Cohen ◽

Arefin Huq ◽

Sebastian Pokutta ◽

Prasad Raghavendra ◽

...

Keyword(s):

Matching Problem

Download Full-text

Weak duality for packing edge-disjoint odd (u, v)-trails

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

10.1137/1.9781611974331.ch145 ◽

2015 ◽

Cited By ~ 1

Author(s):

Ross Churchley ◽

Bojan Mohar ◽

Hehui Wu

Keyword(s):

Weak Duality ◽

Edge Disjoint

Download Full-text

Discrete Gaussian Sampling Reduces to CVP and SVP

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

10.1137/1.9781611974331.ch121 ◽

2015 ◽

Cited By ~ 7

Author(s):

Noah Stephens-Davidowitz

Keyword(s):

Gaussian Sampling

Download Full-text

Exact and Approximation Algorithms for Weighted Matroid Intersection

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

10.1137/1.9781611974331.ch32 ◽

2015 ◽

Cited By ~ 2

Author(s):

Chien-Chung Huang ◽

Naonori Kakimura ◽

Naoyuki Kamiyama

Keyword(s):

Approximation Algorithms ◽

Matroid Intersection

Download Full-text

Higher Lower Bounds from the 3SUM Conjecture

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

10.1137/1.9781611974331.ch89 ◽

2015 ◽

Cited By ~ 15

Author(s):

Tsvi Kopelowitz ◽

Seth Pettie ◽

Ely Porat

Keyword(s):

Lower Bounds

Download Full-text

Communication Complexity of Permutation-Invariant Functions

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

10.1137/1.9781611974331.ch134 ◽

2015 ◽

Cited By ~ 2

Author(s):

Badih Ghazi ◽

Pritish Kamath ◽

Madhu Sudan

Keyword(s):

Communication Complexity ◽

Invariant Functions

Download Full-text

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

TOTAL DOCUMENTS

H-INDEX

Published By Society For Industrial And Applied Mathematics

Efficient Low-Redundancy Codes for Correcting Multiple Deletions

Approximation schemes for machine scheduling with resource (in-)dependent processing times

An Improved Distributed Algorithm for Maximal Independent Set

The complexity of approximately counting in 2-spin systems on k-uniform bounded-degree hypergraphs

The matching problem has no small symmetric SDP

Weak duality for packing edge-disjoint odd (u, v)-trails

Discrete Gaussian Sampling Reduces to CVP and SVP

Exact and Approximation Algorithms for Weighted Matroid Intersection

Higher Lower Bounds from the 3SUM Conjecture

Communication Complexity of Permutation-Invariant Functions

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