Works matching IS 10429832 AND DT 2004 AND VI 24 AND IP 2
Results: 7
Divide and conquer martingales and the number of triangles in a random graph.
- Published in:
- Random Structures & Algorithms, 2004, v. 24, n. 2, p. 166, doi. 10.1002/rsa.10113
- By:
- Publication type:
- Article
Adding random edges to dense graphs.
- Published in:
- Random Structures & Algorithms, 2004, v. 24, n. 2, p. 105, doi. 10.1002/rsa.10112
- By:
- Publication type:
- Article
The rotation correspondence is asymptotically a dilatation.
- Published in:
- Random Structures & Algorithms, 2004, v. 24, n. 2, p. 118, doi. 10.1002/rsa.10111
- By:
- Publication type:
- Article
m-ary Search trees when m ≥ 27: A strong asymptotics for the space requirements.
- Published in:
- Random Structures & Algorithms, 2004, v. 24, n. 2, p. 133, doi. 10.1002/rsa.10108
- By:
- Publication type:
- Article
Functions that have read-twice constant width branching programs are not necessarily testable.
- Published in:
- Random Structures & Algorithms, 2004, v. 24, n. 2, p. 175, doi. 10.1002/rsa.10110
- By:
- Publication type:
- Article
Counting the onion.
- Published in:
- Random Structures & Algorithms, 2004, v. 24, n. 2, p. 155, doi. 10.1002/rsa.10114
- By:
- Publication type:
- Article
K<sub>5</sub>-free subgraphs of random graphs.
- Published in:
- Random Structures & Algorithms, 2004, v. 24, n. 2, p. 194, doi. 10.1002/rsa.20000
- By:
- Publication type:
- Article