6. RANDOM 2002: Cambridge, MA, USA

@proceedings{DBLP:conf/random/2002,
  editor    = {Jos{\'e} D. P. Rolim and
               Salil P. Vadhan},
  title     = {Randomization and Approximation Techniques, 6th International
               Workshop, RANDOM 2002, Cambridge, MA, USA, September 13-15, 2002,
               Proceedings},
  booktitle = {RANDOM},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {2483},
  year      = {2002},
  isbn      = {3-540-44147-6},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

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