Works matching IS 10429832 AND DT 2003 AND VI 22 AND IP 1
Results: 7
How many random edges make a dense graph hamiltonian?
- Published in:
- Random Structures & Algorithms, 2003, v. 22, n. 1, p. 33, doi. 10.1002/rsa.10070
- By:
- Publication type:
- Article
On the probability of independent sets in random graphs.
- Published in:
- Random Structures & Algorithms, 2003, v. 22, n. 1, p. 1, doi. 10.1002/rsa.10063
- By:
- Publication type:
- Article
On the swapping algorithm.
- Published in:
- Random Structures & Algorithms, 2003, v. 22, n. 1, p. 66, doi. 10.1002/rsa.10066
- By:
- Publication type:
- Article
Renewal processes on partially ordered sets.
- Published in:
- Random Structures & Algorithms, 2003, v. 22, n. 1, p. 15, doi. 10.1002/rsa.10064
- By:
- Publication type:
- Article
An elementary proof of a theorem of Johnson and Lindenstrauss.
- Published in:
- Random Structures & Algorithms, 2003, v. 22, n. 1, p. 60, doi. 10.1002/rsa.10073
- By:
- Publication type:
- Article
Testing membership in parenthesis languages.
- Published in:
- Random Structures & Algorithms, 2003, v. 22, n. 1, p. 98, doi. 10.1002/rsa.10067
- By:
- Publication type:
- Article
A bounding chain for Swendsen-Wang.
- Published in:
- Random Structures & Algorithms, 2003, v. 22, n. 1, p. 43, doi. 10.1002/rsa.10071
- By:
- Publication type:
- Article