Ultimate instability of exponential back-off protocol for acknowledgment-based transmission control of random access communication channels. - David J. Aldous (IEEE Trans. Inf. Theory, 1987)

The harmonic mean formula for probabilities of unions: applications to sparse random graphs. - David J. Aldous (Discret. Math., 1989)

A Markovian Extension of Valiant's Learning Model (Extended Abstract) - David J. Aldous; Umesh V. Vazirani (FOCS, 1990)

A Random Tree Model Associated with Random Graphs. - David J. Aldous (Random Struct. Algorithms, 1990)

The Random Walk Construction of Uniform Spanning Trees and Uniform Labelled Trees. - David J. Aldous (SIAM J. Discret. Math., 1990)

Greedy Search on the Binary Tree with random Edge-Weights. - David J. Aldous (Comb. Probab. Comput., 1992)

Maximum Size of a Dynamic Data Structure: Hashing with Lazy Deletion Revisited. - David J. Aldous; Micha Hofri; Wojciech Szpankowski (SIAM J. Comput., 1992)

"Go With the Winners" Algorithms - David J. Aldous; Umesh V. Vazirani (FOCS, 1994)

Brownian Bridge Asymptotics for Random Mappings. - David J. Aldous; Jim Pitman (Random Struct. Algorithms, 1994)

A Markovian Extension of Valiant's Learning Model - David J. Aldous; Umesh V. Vazirani (Inf. Comput., 1995)

Tree-valued Markov chains and Poisson-Galton-Watson distributions. - David J. Aldous (Microsurveys in Discrete Probability, 1997)

A. Metropolis-Type Optimization Algorithm on the Infinite Tree. - David J. Aldous (Algorithmica, 1998)

On the Critical Value for 'Percolation' of Minimum-Weight Trees in the Mean-Field Distance Model. - David J. Aldous (Comb. Probab. Comput., 1998)

Emergence of the giant component in special Marcus-Lushnikov processes. - David J. Aldous (Random Struct. Algorithms, 1998)

A family of random trees with random edge lengths. - David J. Aldous; Jim Pitman (Random Struct. Algorithms, 1999)

On a random graph with immigrating vertices: Emergence of the giant component. - David J. Aldous; Boris G. Pittel (Random Struct. Algorithms, 2000)

[untitled]. - David J. Aldous (Am. Math. Mon., 2000)

The zeta(2) limit in the random assignment problem. - David J. Aldous (Random Struct. Algorithms, 2001)

Reorganizing Large Web Sites. - David J. Aldous (Am. Math. Mon., 2001)

Scaling and Universality in Continuous Length Combinatorial Optimization - David J. Aldous; Allon G. Percus (CoRR, 2003)

Cost-Volume Relationship for Flows Through a Disordered Network. - David J. Aldous (Math. Oper. Res., 2008)

Which Connected Spatial Networks on Random Points have Linear Route-Lengths? - David J. Aldous (CoRR, 2009)

Uniform multicommodity flow through the complete graph with random edge-capacities. - David J. Aldous; Colin McDiarmid; Alex D. Scott (Oper. Res. Lett., 2009)

Dynamic Programming Optimization over Random Data: The Scaling Exponent for Near-Optimal Solutions. - David J. Aldous; Charles Bordenave; Marc Lelarge (SIAM J. Comput., 2009)

When Knowing Early Matters: Gossip, Percolation and Nash Equilibria - David J. Aldous (CoRR, 2010)

Edge flows in the complete random-lengths network. - David J. Aldous; Shankar Bhamidi (Random Struct. Algorithms, 2010)

Using Prediction Market Data to Illustrate Undergraduate Probability. - David J. Aldous (Am. Math. Mon., 2013)

The Stretch - Length Tradeoff in Geometric Networks: Average Case and Worst Case Study. - David J. Aldous; Tamar Lando (CoRR, 2014)

Routed planar networks. - David J. Aldous (Electron. J. Graph Theory Appl., 2016)

On the Largest Common Subtree of Random Leaf-Labeled Binary Trees. - David J. Aldous (SIAM J. Discret. Math., 2022)

Gambling Under Unknown Probabilities as Proxy for Real World Decisions Under Uncertainty. - David J. Aldous; F. Thomas Bruss (Am. Math. Mon., 2023)