Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783642153686, 9783642153693

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

A Quadratic Lower Bound for Three-Query Linear Locally Decodable Codes over Any Field

Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - Lecture Notes in Computer Science ◽

10.1007/978-3-642-15369-3_57 ◽

2010 ◽

pp. 766-779 ◽

Cited By ~ 4

Author(s):

David P. Woodruff

Keyword(s):

Lower Bound ◽

Locally Decodable Codes ◽

Locally Decodable

Download Full-text

Improved Rounding for Parallel Repeated Unique Games

Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - Lecture Notes in Computer Science ◽

10.1007/978-3-642-15369-3_54 ◽

2010 ◽

pp. 724-737 ◽

Cited By ~ 1

Author(s):

David Steurer

Keyword(s):

Unique Games

Download Full-text

Locally Testable vs. Locally Decodable Codes

Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - Lecture Notes in Computer Science ◽

10.1007/978-3-642-15369-3_50 ◽

2010 ◽

pp. 670-682 ◽

Cited By ~ 7

Author(s):

Tali Kaufman ◽

Michael Viderman

Keyword(s):

Locally Decodable Codes ◽

Locally Decodable

Download Full-text

The Euclidean Distortion of Flat Tori

Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - Lecture Notes in Computer Science ◽

10.1007/978-3-642-15369-3_18 ◽

2010 ◽

pp. 232-245

Author(s):

Ishay Haviv ◽

Oded Regev

Keyword(s):

Flat Tori ◽

Euclidean Distortion

Download Full-text

Monotonicity Testing and Shortest-Path Routing on the Cube

Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - Lecture Notes in Computer Science ◽

10.1007/978-3-642-15369-3_35 ◽

2010 ◽

pp. 462-475 ◽

Cited By ~ 3

Author(s):

Jop Briët ◽

Sourav Chakraborty ◽

David García-Soriano ◽

Arie Matsliah

Keyword(s):

Shortest Path ◽

Shortest Path Routing

Download Full-text

The Structure of Winning Strategies in Parallel Repetition Games

Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - Lecture Notes in Computer Science ◽

10.1007/978-3-642-15369-3_39 ◽

2010 ◽

pp. 518-530 ◽

Cited By ~ 1

Author(s):

Irit Dinur ◽

Elazar Goldenberg

Keyword(s):

Parallel Repetition ◽

Winning Strategies

Download Full-text

Approximation Algorithms for Min-Max Generalization Problems

Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - Lecture Notes in Computer Science ◽

10.1007/978-3-642-15369-3_5 ◽

2010 ◽

pp. 53-66 ◽

Cited By ~ 1

Author(s):

Piotr Berman ◽

Sofya Raskhodnikova

Keyword(s):

Approximation Algorithms

Download Full-text

Periodicity in Streams

Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - Lecture Notes in Computer Science ◽

10.1007/978-3-642-15369-3_41 ◽

2010 ◽

pp. 545-559 ◽

Cited By ~ 11

Author(s):

Funda Ergun ◽

Hossein Jowhari ◽

Mert Sağlam

Download Full-text

Improved Pseudorandom Generators for Depth 2 Circuits

Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - Lecture Notes in Computer Science ◽

10.1007/978-3-642-15369-3_38 ◽

2010 ◽

pp. 504-517 ◽

Cited By ~ 19

Author(s):

Anindya De ◽

Omid Etesami ◽

Luca Trevisan ◽

Madhur Tulsiani

Keyword(s):

Pseudorandom Generators

Download Full-text

Low Rate Is Insufficient for Local Testability

Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - Lecture Notes in Computer Science ◽

10.1007/978-3-642-15369-3_32 ◽

2010 ◽

pp. 420-433 ◽

Cited By ~ 3

Author(s):

Eli Ben-Sasson ◽

Michael Viderman

Keyword(s):

Low Rate

Download Full-text

Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

A Quadratic Lower Bound for Three-Query Linear Locally Decodable Codes over Any Field

Improved Rounding for Parallel Repeated Unique Games

Locally Testable vs. Locally Decodable Codes

The Euclidean Distortion of Flat Tori

Monotonicity Testing and Shortest-Path Routing on the Cube

The Structure of Winning Strategies in Parallel Repetition Games

Approximation Algorithms for Min-Max Generalization Problems

Periodicity in Streams

Improved Pseudorandom Generators for Depth 2 Circuits

Low Rate Is Insufficient for Local Testability

Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - Lecture Notes in Computer Science
Latest Publications