David J. Aldous

Publication Activity (10 Years)

Years Active: 1987-2023
Publications (10 Years): 3

Top Topics

Top Venues

Electron. J. Graph Theory Appl.

SIAM J. Discret. Math.

Publications

David J. Aldous, F. Thomas Bruss
Gambling Under Unknown Probabilities as Proxy for Real World Decisions Under Uncertainty. Am. Math. Mon. 130 (4) (2023)
David J. Aldous
On the Largest Common Subtree of Random Leaf-Labeled Binary Trees. SIAM J. Discret. Math. 36 (1) (2022)
David J. Aldous
Routed planar networks. Electron. J. Graph Theory Appl. 4 (1) (2016)
David J. Aldous, Tamar Lando
The Stretch - Length Tradeoff in Geometric Networks: Average Case and Worst Case Study. CoRR (2014)
David J. Aldous
Using Prediction Market Data to Illustrate Undergraduate Probability. Am. Math. Mon. 120 (7) (2013)
David J. Aldous
When Knowing Early Matters: Gossip, Percolation and Nash Equilibria CoRR (2010)
David J. Aldous, Shankar Bhamidi
Edge flows in the complete random-lengths network. Random Struct. Algorithms 37 (3) (2010)
David J. Aldous
Which Connected Spatial Networks on Random Points have Linear Route-Lengths? CoRR (2009)
David J. Aldous, Charles Bordenave, Marc Lelarge
Dynamic Programming Optimization over Random Data: The Scaling Exponent for Near-Optimal Solutions. SIAM J. Comput. 38 (6) (2009)
David J. Aldous, Colin McDiarmid, Alex D. Scott
Uniform multicommodity flow through the complete graph with random edge-capacities. Oper. Res. Lett. 37 (5) (2009)
David J. Aldous
Cost-Volume Relationship for Flows Through a Disordered Network. Math. Oper. Res. 33 (4) (2008)
David J. Aldous, Allon G. Percus
Scaling and Universality in Continuous Length Combinatorial Optimization CoRR (2003)
David J. Aldous
The zeta(2) limit in the random assignment problem. Random Struct. Algorithms 18 (4) (2001)
David J. Aldous
Reorganizing Large Web Sites. Am. Math. Mon. 108 (1) (2001)
David J. Aldous
[untitled]. Am. Math. Mon. 107 (6) (2000)
David J. Aldous, Boris G. Pittel
On a random graph with immigrating vertices: Emergence of the giant component. Random Struct. Algorithms 17 (2) (2000)
David J. Aldous, Jim Pitman
A family of random trees with random edge lengths. Random Struct. Algorithms 15 (2) (1999)
David J. Aldous
On the Critical Value for 'Percolation' of Minimum-Weight Trees in the Mean-Field Distance Model. Comb. Probab. Comput. 7 (1) (1998)
David J. Aldous
Emergence of the giant component in special Marcus-Lushnikov processes. Random Struct. Algorithms 12 (2) (1998)
David J. Aldous
A. Metropolis-Type Optimization Algorithm on the Infinite Tree. Algorithmica 22 (4) (1998)
David J. Aldous
Tree-valued Markov chains and Poisson-Galton-Watson distributions. Microsurveys in Discrete Probability (1997)
David J. Aldous, Umesh V. Vazirani
A Markovian Extension of Valiant's Learning Model Inf. Comput. 117 (2) (1995)
David J. Aldous, Umesh V. Vazirani
"Go With the Winners" Algorithms FOCS (1994)
David J. Aldous, Jim Pitman
Brownian Bridge Asymptotics for Random Mappings. Random Struct. Algorithms 5 (4) (1994)
David J. Aldous, Micha Hofri, Wojciech Szpankowski
Maximum Size of a Dynamic Data Structure: Hashing with Lazy Deletion Revisited. SIAM J. Comput. 21 (4) (1992)
David J. Aldous
Greedy Search on the Binary Tree with random Edge-Weights. Comb. Probab. Comput. 1 (1992)
David J. Aldous, Umesh V. Vazirani
A Markovian Extension of Valiant's Learning Model (Extended Abstract) FOCS (1990)
David J. Aldous
A Random Tree Model Associated with Random Graphs. Random Struct. Algorithms 1 (4) (1990)
David J. Aldous
The Random Walk Construction of Uniform Spanning Trees and Uniform Labelled Trees. SIAM J. Discret. Math. 3 (4) (1990)
David J. Aldous
The harmonic mean formula for probabilities of unions: applications to sparse random graphs. Discret. Math. 76 (3) (1989)
David J. Aldous
Ultimate instability of exponential back-off protocol for acknowledgment-based transmission control of random access communication channels. IEEE Trans. Inf. Theory 33 (2) (1987)