2003 |
16 | EE | David Aldous,
Allon G. Percus:
Scaling and Universality in Continuous Length Combinatorial Optimization
CoRR cond-mat/0301035: (2003) |
2001 |
15 | | David Aldous:
The zeta(2) limit in the random assignment problem.
Random Struct. Algorithms 18(4): 381-418 (2001) |
2000 |
14 | | David Aldous,
Boris Pittel:
On a random graph with immigrating vertices: Emergence of the giant component.
Random Struct. Algorithms 17(2): 79-102 (2000) |
1999 |
13 | | David Aldous,
Jim Pitman:
A family of random trees with random edge lengths.
Random Struct. Algorithms 15(2): 176-195 (1999) |
1998 |
12 | EE | David Aldous:
A. Metropolis-Type Optimization Algorithm on the Infinite Tree.
Algorithmica 22(4): 388-412 (1998) |
11 | | David Aldous:
On the Critical Value for 'Percolation' of Minimum-Weight Trees in the Mean-Field Distance Model.
Combinatorics, Probability & Computing 7(1): 1-10 (1998) |
10 | | David Aldous:
Emergence of the giant component in special Marcus-Lushnikov processes.
Random Struct. Algorithms 12(2): 179-196 (1998) |
1995 |
9 | | David Aldous,
Umesh V. Vazirani:
A Markovian Extension of Valiant's Learning Model
Inf. Comput. 117(2): 181-186 (1995) |
1994 |
8 | | David Aldous,
Umesh V. Vazirani:
``Go With the Winners'' Algorithms
FOCS 1994: 492-501 |
7 | | David Aldous,
Jim Pitman:
Brownian Bridge Asymptotics for Random Mappings.
Random Struct. Algorithms 5(4): 487-512 (1994) |
1992 |
6 | | David Aldous:
Greedy Search on the Binary Tree with random Edge-Weights.
Combinatorics, Probability & Computing 1: 281-293 (1992) |
5 | | David Aldous,
Micha Hofri,
Wojciech Szpankowski:
Maximum Size of a Dynamic Data Structure: Hashing with Lazy Deletion Revisited.
SIAM J. Comput. 21(4): 713-732 (1992) |
1990 |
4 | | David Aldous,
Umesh V. Vazirani:
A Markovian Extension of Valiant's Learning Model (Extended Abstract)
FOCS 1990: 392-396 |
3 | | David Aldous:
A Random Tree Model Associated with Random Graphs.
Random Struct. Algorithms 1(4): 383-402 (1990) |
2 | | David Aldous:
The Random Walk Construction of Uniform Spanning Trees and Uniform Labelled Trees.
SIAM J. Discrete Math. 3(4): 450-465 (1990) |
1989 |
1 | EE | David Aldous:
The harmonic mean formula for probabilities of unions: applications to sparse random graphs.
Discrete Mathematics 76(3): 167-176 (1989) |