Works matching IS 10429832 AND DT 2008 AND VI 32 AND IP 3
Results: 7
Analyzing linear mergers.
- Published in:
- Random Structures & Algorithms, 2008, v. 32, n. 3, p. 334, doi. 10.1002/rsa.20193
- By:
- Publication type:
- Article
Path coupling using stopping times and counting independent sets and colorings in hypergraphs.
- Published in:
- Random Structures & Algorithms, 2008, v. 32, n. 3, p. 375, doi. 10.1002/rsa.20204
- By:
- Publication type:
- Article
On a universal best choice algorithm for partially ordered sets.
- Published in:
- Random Structures & Algorithms, 2008, v. 32, n. 3, p. 263, doi. 10.1002/rsa.20192
- By:
- Publication type:
- Article
Sampling subproblems of heterogeneous Max-Cut problems and approximation algorithms.
- Published in:
- Random Structures & Algorithms, 2008, v. 32, n. 3, p. 307, doi. 10.1002/rsa.20196
- By:
- Publication type:
- Article
How many random edges make a dense hypergraph non-2-colorable?
- Published in:
- Random Structures & Algorithms, 2008, v. 32, n. 3, p. 290, doi. 10.1002/rsa.25155
- By:
- Publication type:
- Article
The cutoff phenomenon for randomized riffle shuffles.
- Published in:
- Random Structures & Algorithms, 2008, v. 32, n. 3, p. 346, doi. 10.1002/rsa.20195
- By:
- Publication type:
- Article
Simple permutations mix even better.
- Published in:
- Random Structures & Algorithms, 2008, v. 32, n. 3, p. 274, doi. 10.1002/rsa.20194
- By:
- Publication type:
- Article