David J. Aldous

32 papers A* 2Journal 28Unranked 1

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