Found: 6
Select item for more details and to access through your institution.
Properly colored subgraphs and rainbow subgraphs in edge-colorings with local constraints.
- Published in:
- Random Structures & Algorithms, 2003, v. 23, n. 4, p. 409, doi. 10.1002/rsa.10102
- By:
- Publication type:
- Article
On restricted min-wise independence of permutations.
- Published in:
- Random Structures & Algorithms, 2003, v. 23, n. 4, p. 397
- By:
- Publication type:
- Article
One line and n points(A preliminary version of this paper has appeared in Proc 33rd Annu ACM Symp Theory of Computing (STOC), 2001, pp. 306315.).
- Published in:
- Random Structures & Algorithms, 2003, v. 23, n. 4, p. 453, doi. 10.1002/rsa.10099
- By:
- Publication type:
- Article
Random suffix search trees.
- Published in:
- Random Structures & Algorithms, 2003, v. 23, n. 4, p. 357, doi. 10.1002/rsa.10103
- By:
- Publication type:
- Article
On large intersecting subfamilies of uniform setfamilies.
- Published in:
- Random Structures & Algorithms, 2003, v. 23, n. 4, p. 351, doi. 10.1002/rsa.10098
- By:
- Publication type:
- Article
Speeding up the FMMR perfect sampling algorithm: A case study revisited.
- Published in:
- Random Structures & Algorithms, 2003, v. 23, n. 4, p. 434, doi. 10.1002/rsa.10096
- By:
- Publication type:
- Article