List of accepted papers for RANDOM 2007:


On the Randomness Complexity of Property Testing
Oded Goldreich and Or Sheffet

The cover time of random digraphs
Colin Cooper and Alan Frieze

Properly 2-Colouring Linear Hypergraphs
Arkadev Chattopadhyay and Bruce Reed.

On Estimating Frequency Moments of Data Streams
Graham Cormode and Sumit Ganguly

On the Benefits of Adaptivity in Property Testing of Dense Graphs
Mira Gonen and Dana Ron

On approximating the average distance between points
Kfir Barhum, Oded Goldreich and Adi Shraibman

Implementing Huge Sparse Random Graphs
Moni Naor and Asaf Nussboim

Lower bounds for testing forbidden induced subgraphs in bipartite-graph-like combinatorial objects
Eyal Rozenberg and Eldar Fischer

Local Limit Theorems for the Giant Component of Random Hypergraphs
Michael Behrisch, Mihyun Kang and Amin Coja-Oghlan

Distribution-Free Testing Lower Bounds for Basic Boolean Functions
Rocco Servedio and Dana Glasner

High Entropy Random Selection Protocols
Harry Buhrman, Matthias Christandl, Michal Koucky, Zvi Lotker, Boaz Patt-Shamir and Nikolai Vereshchagin.

Eigenvectors of random graphs: Nodal domains
Yael Dekel, James Lee and Nati Linial

Worst-case to average-case reductions revisited
Dan Gutfreund and Amnon Ta-Shma

Lower Bounds for Swapping Arthur and Merlin
Scott Diehl

Derandomization of Euclidean Random Walks
Ilia Binder and Mark Braverman

Random Subsets of the Interval and P2P protocols
Jacek Cichon, Marek Klonowski, Lukasz Krzywiecki, Pawel Zielinski, Przemyslaw Kobylanski and Bartlomiej Rozanski

Better binary list-decodable codes via multilevel concatenation
Venkatesan Guruswami and Atri Rudra

Testing $st$-Connectivity
Arie Matsliah, Eldar Fischer, Sourav Chakraborty, ilan newman and Oded Lachish

On finding frequent elements in a data stream
rina panigrahy and Ravi Kumar

Sublinear Algorithms for Approximating String Compressibility
Sofya Raskhodnikova, Dana Ron, Ronitt Rubinfeld, Amir Shpilka and Adam Smith

Slow mixing of Markov chains using fault lines and fat contours
Sam Greenberg and Dana Randall

On Locally Decodable Codes, Self-Correctable Codes, and $t$-private PIR
Omer Barkol, Yuval Ishai and Enav Weinreb

A Sequential Algorithm for Generating Random Graphs
Mohsen Bayati, Jeong Han Kim and Amin Saberi