Sparse pseudorandom distributions
- Oded Goldreich
- Hugo Krawczyk
- 2007
- Random Structures and Algorithms
Publications
This is our catalog of publications authored by IBM researchers, in collaboration with the global research community. It’s an ever-growing body of work that shows why IBM is one of the most important contributors to modern computing.
Date
Featured collections
Popular topics
22 results at Random Structures and Algorithms
The strong chromatic number of a graph
- Noga Alon
- 2006
- Random Structures and Algorithms
Simple Constructions of Almost k‐wise Independent Random Variables
- Noga Alon
- Oded Goldreich
- et al.
- 2006
- Random Structures and Algorithms
Embracing the giant component
- Abraham D. Flaxman
- David Gamarnik
- et al.
- 2005
- Random Structures and Algorithms
Maximum weight independent sets and matchings in sparse random graphs. Exact results using the local weak convergence method
- David Gamarnik
- Tomasz Nowicki
- et al.
- 2005
- Random Structures and Algorithms
Random MAX SAT, random MAX CUT, and their phase transitions
- Don Coppersmith
- David Gamarnik
- et al.
- 2004
- Random Structures and Algorithms
The Diameter of a Long-Range Percolation Graph
- Don Coppersmith
- David Gamarnik
- et al.
- 2002
- Random Structures and Algorithms
Constructive bounds and exact expectations for the random assignment problem
- Don Coppersmith
- Gregory B. Sorkin
- 1999
- Random Structures and Algorithms
Static and dynamic path selection on expander graphs: A random walk approach
- Andrei Z. Broder
- Alan M. Frieze
- et al.
- 1999
- Random Structures and Algorithms
2 + p-SAT: Relation of typical-case complexity to the nature of the phase transition
- Rémi Monasson
- Riccardo Zecchina
- et al.
- 1999
- Random Structures and Algorithms