Randomization and Approximation Techniques in Computer Science - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540441472, 9783540457268

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Small k-Dominating Sets of Regular Graphs

Randomization and Approximation Techniques in Computer Science - Lecture Notes in Computer Science ◽

10.1007/3-540-45726-7_11 ◽

2002 ◽

pp. 126-138

Author(s):

William Duckworth ◽

Bernard Mans

Keyword(s):

Regular Graphs ◽

Dominating Sets

Download Full-text

Dimensionality Reductions That Preserve Volumes and Distance to Affine Spaces, and Their Algorithmic Applications

Randomization and Approximation Techniques in Computer Science - Lecture Notes in Computer Science ◽

10.1007/3-540-45726-7_19 ◽

2002 ◽

pp. 239-253 ◽

Cited By ~ 21

Author(s):

Avner Magen

Keyword(s):

Affine Spaces

Download Full-text

Is Constraint Satisfaction Over Two Variables Always Easy?

Randomization and Approximation Techniques in Computer Science - Lecture Notes in Computer Science ◽

10.1007/3-540-45726-7_18 ◽

2002 ◽

pp. 224-238 ◽

Cited By ~ 4

Author(s):

Lars Engebretsen ◽

Venkatesan Guruswami

Keyword(s):

Constraint Satisfaction

Download Full-text

A Probabilistic-Time Hierarchy Theorem for “Slightly Non-uniform” Algorithms

Randomization and Approximation Techniques in Computer Science - Lecture Notes in Computer Science ◽

10.1007/3-540-45726-7_16 ◽

2002 ◽

pp. 194-208 ◽

Cited By ~ 15

Author(s):

Boaz Barak

Download Full-text

Percolation on Finite Cayley Graphs

Randomization and Approximation Techniques in Computer Science - Lecture Notes in Computer Science ◽

10.1007/3-540-45726-7_8 ◽

2002 ◽

pp. 91-104 ◽

Cited By ~ 3

Author(s):

Christopher Malon ◽

Igor Pak

Keyword(s):

Cayley Graphs

Download Full-text

On Testing Convexity and Submodularity

Randomization and Approximation Techniques in Computer Science - Lecture Notes in Computer Science ◽

10.1007/3-540-45726-7_2 ◽

2002 ◽

pp. 11-25 ◽

Cited By ~ 1

Author(s):

Michal Parnas ◽

Dana Ron ◽

Ronitt Rubinfeld

Download Full-text

Derandomization That Is Rarely Wrong from Short Advice That Is Typically Good

Randomization and Approximation Techniques in Computer Science - Lecture Notes in Computer Science ◽

10.1007/3-540-45726-7_17 ◽

2002 ◽

pp. 209-223 ◽

Cited By ~ 13

Author(s):

Oded Goldreich ◽

Avi Wigderson

Download Full-text

Randomness-Optimal Characterization of Two NP Proof Systems

Randomization and Approximation Techniques in Computer Science - Lecture Notes in Computer Science ◽

10.1007/3-540-45726-7_15 ◽

2002 ◽

pp. 179-193 ◽

Cited By ~ 10

Author(s):

Alfredo De Santis ◽

Giovanni Di Crescenzo ◽

Giuseppe Persiano

Keyword(s):

Proof Systems

Download Full-text

Finding Sparse Induced Subgraphs of Semirandom Graphs

Randomization and Approximation Techniques in Computer Science - Lecture Notes in Computer Science ◽

10.1007/3-540-45726-7_12 ◽

2002 ◽

pp. 139-148 ◽

Cited By ~ 4

Author(s):

Amin Coja-Oghlan

Keyword(s):

Induced Subgraphs

Download Full-text

Optimal Lower Bounds for 2-Query Locally Decodable Linear Codes

Randomization and Approximation Techniques in Computer Science - Lecture Notes in Computer Science ◽

10.1007/3-540-45726-7_4 ◽

2002 ◽

pp. 39-50 ◽

Cited By ~ 12

Author(s):

Kenji Obata

Keyword(s):

Lower Bounds ◽

Linear Codes ◽

Locally Decodable

Download Full-text

Randomization and Approximation Techniques in Computer Science - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Small k-Dominating Sets of Regular Graphs

Dimensionality Reductions That Preserve Volumes and Distance to Affine Spaces, and Their Algorithmic Applications

Is Constraint Satisfaction Over Two Variables Always Easy?

A Probabilistic-Time Hierarchy Theorem for “Slightly Non-uniform” Algorithms

Percolation on Finite Cayley Graphs

On Testing Convexity and Submodularity

Derandomization That Is Rarely Wrong from Short Advice That Is Typically Good

Randomness-Optimal Characterization of Two NP Proof Systems

Finding Sparse Induced Subgraphs of Semirandom Graphs

Optimal Lower Bounds for 2-Query Locally Decodable Linear Codes

Randomization and Approximation Techniques in Computer Science - Lecture Notes in Computer Science
Latest Publications