Found: 5
Select item for more details and to access through your institution.
On the advantage over a random assignment.
- Published in:
- Random Structures & Algorithms, 2004, v. 25, n. 2, p. 117, doi. 10.1002/rsa.20031
- By:
- Publication type:
- Article
Is constraint satisfaction over two variables always easy?
- Published in:
- Random Structures & Algorithms, 2004, v. 25, n. 2, p. 150, doi. 10.1002/rsa.20026
- By:
- Publication type:
- Article
The distribution of the size of the ancestor-tree and of the induced spanning subtree for random trees.
- Published in:
- Random Structures & Algorithms, 2004, v. 25, n. 2, p. 179, doi. 10.1002/rsa.20027
- By:
- Publication type:
- Article
Some bounds on the coupon collector problem.
- Published in:
- Random Structures & Algorithms, 2004, v. 25, n. 2, p. 208, doi. 10.1002/rsa.20019
- By:
- Publication type:
- Article
Reversible coagulation-fragmentation processes and random combinatorial structures: Asymptotics for the number of groups.
- Published in:
- Random Structures & Algorithms, 2004, v. 25, n. 2, p. 227, doi. 10.1002/rsa.20020
- By:
- Publication type:
- Article