6. RANDOM 2002:
Cambridge, MA, USA
José D. P. Rolim, Salil P. Vadhan (Eds.):
Randomization and Approximation Techniques, 6th International Workshop, RANDOM 2002, Cambridge, MA, USA, September 13-15, 2002, Proceedings.
Lecture Notes in Computer Science 2483 Springer 2002, ISBN 3-540-44147-6 
- Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar, D. Sivakumar, Luca Trevisan:
Counting Distinct Elements in a Data Stream.
1-10
- Michal Parnas, Dana Ron, Ronitt Rubinfeld:
On Testing Convexity and Submodularity.
11-25
- Hana Chockler, Orna Kupferman:
omega-Regular Languages Are Testable with a Constant Number of Queries.
26-28
- Kenji Obata:
Optimal Lower Bounds for 2-Query Locally Decodable Linear Codes.
39-50
- Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum:
Counting and Sampling H-Colourings.
51-67
- Martin E. Dyer, Mark Jerrum, Eric Vigoda:
Rapidly Mixing Markov Chains for Dismantleable Constraint Graphs.
68-77
- Dimitris Achlioptas, Cristopher Moore:
On the 2-Colorability of Random Hypergraphs.
78-90
- Christopher Malon, Igor Pak:
Percolation on Finite Cayley Graphs.
91-104
- Ehud Friedgut, Jeff Kahn, Avi Wigderson:
Computing Graph Properties by Randomized Subcube Partitions.
105-113
- Josep Díaz, Norman Do, Maria J. Serna, Nicholas C. Wormald:
Bisection of Random Cubic Graphs.
114-125
- William Duckworth, Bernard Mans:
Small k-Dominating Sets of Regular Graphs.
126-138
- Amin Coja-Oghlan:
Finding Sparse Induced Subgraphs of Semirandom Graphs.
139-148
- Martin E. Dyer, Alistair Sinclair, Eric Vigoda, Dror Weitz:
Mixing in Time and Space for Lattice Spin Systems: A Combinatorial View.
149-163
- Cristopher Moore, Alexander Russell:
Quantum Walks on the Hypercube.
164-178
- Alfredo De Santis, Giovanni Di Crescenzo, Giuseppe Persiano:
Randomness-Optimal Characterization of Two NP Proof Systems.
179-193
- Boaz Barak:
A Probabilistic-Time Hierarchy Theorem for "Slightly Non-uniform" Algorithms.
194-208
- Oded Goldreich, Avi Wigderson:
Derandomization That Is Rarely Wrong from Short Advice That Is Typically Good.
209-223
- Lars Engebretsen, Venkatesan Guruswami:
Is Constraint Satisfaction Over Two Variables Always Easy?
224-238
- Avner Magen:
Dimensionality Reductions That Preserve Volumes and Distance to Affine Spaces, and Their Algorithmic Applications.
239-253
- Milena Mihail, Christos H. Papadimitriou:
On the Eigenvalue Power Law.
254-262
- Colin Cooper:
Classifying Special Interest Groups in Web Graphs.
263-276
Last update Thu May 23 17:51:56 2013
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
