随机化与近似技术（会议录）

　　This book constitutes the refereed proceedings of the 6th International Workshop on Randomization and Approximation Techniques in Computer Science， RANDOM 2002， held in Cambridge， MA， USA in September 2002.The 21 revised full papers presented were carefully reviewed and selected from 48 submissions. Among the topics addressed are coding， geometric computations， graph colorings， random hypergraphs， graph computations， lattice computations， proof systems， probabilistic algorithms， derandomization， constraint satisfaction， and web graphs analysis.

暂缺《随机化与近似技术（会议录）》作者简介

Counting Distinct Elements in a Data Stream
On Testing Convexity and Submodularity
w-Regular Languages Are Testable with a Constant Number of Queries
Optimal Lower Bounds for 2-Query Locally Decodable Linear Codes
Counting and Sampling H-Colourings
Rapidly Mixing Markov Chains for Dismantleable Constraint Graphs
On the 2-Colorability of Random Hypergraphs
Percolation on Finite Cayley Graphs
Computing Graph Properties by Randomized Subcube Partitions
Bisection of Random Cubic Graphs
Small k-Dominating Sets of Regular Graphs
Finding Sparse Induced Subgraphs of Semirandom Graphs
Mixing in Time and Space for Lattice Spin Systems: A Combinatorial View
Quantum Walks on the Hypercube
Randomness-Optimal Characterization of Two NP Proof Systems
A Probabilistic-Time Hierarchy Theorem for "Slightly Non-uniform" Algorithms
Derandomization That Is Rarely Wrong from Short Advice That Is Typically Good
Is Constraint Satisfaction Over Two Variables Always Easy?
Dimensionality Reductions That Preserve Volumes and Distance to Affine Spaces, and Their Algorithmic Applications
On the Eigenvalue Power Law
Classifying Special Interest Groups in Web Graphs
Author Index