default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDavid J. Aldous
Person information
- affiliation: University of California, Department of Statistics, Berkeley, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j24]David J. Aldous, F. Thomas Bruss:
Gambling Under Unknown Probabilities as Proxy for Real World Decisions Under Uncertainty. Am. Math. Mon. 130(4): 303-320 (2023)- 2022
- [j23]David J. Aldous
:
On the Largest Common Subtree of Random Leaf-Labeled Binary Trees. SIAM J. Discret. Math. 36(1): 299-314 (2022)
2010 – 2019
- 2016
- [j22]David J. Aldous:
Routed planar networks. Electron. J. Graph Theory Appl. 4(1): 42-59 (2016) - 2014
- [i4]David J. Aldous, Tamar Lando:
The Stretch - Length Tradeoff in Geometric Networks: Average Case and Worst Case Study. CoRR abs/1404.2653 (2014) - 2013
- [j21]David J. Aldous:
Using Prediction Market Data to Illustrate Undergraduate Probability. Am. Math. Mon. 120(7): 583-593 (2013) - 2010
- [j20]David J. Aldous, Shankar Bhamidi:
Edge flows in the complete random-lengths network. Random Struct. Algorithms 37(3): 271-311 (2010) - [i3]David J. Aldous:
When Knowing Early Matters: Gossip, Percolation and Nash Equilibria. CoRR abs/1005.4846 (2010)
2000 – 2009
- 2009
- [j19]David J. Aldous, Colin McDiarmid, Alex D. Scott:
Uniform multicommodity flow through the complete graph with random edge-capacities. Oper. Res. Lett. 37(5): 299-302 (2009) - [j18]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): 2382-2410 (2009) - [i2]David J. Aldous:
Which Connected Spatial Networks on Random Points have Linear Route-Lengths? CoRR abs/0911.5296 (2009) - 2008
- [j17]David J. Aldous:
Cost-Volume Relationship for Flows Through a Disordered Network. Math. Oper. Res. 33(4): 769-786 (2008) - 2003
- [i1]David J. Aldous, Allon G. Percus:
Scaling and Universality in Continuous Length Combinatorial Optimization. CoRR cond-mat/0301035 (2003) - 2001
- [j16]David J. Aldous:
The zeta(2) limit in the random assignment problem. Random Struct. Algorithms 18(4): 381-418 (2001) - [j15]David J. Aldous:
Reorganizing Large Web Sites. Am. Math. Mon. 108(1): 16-27 (2001) - 2000
- [j14]David J. Aldous, Boris G. Pittel:
On a random graph with immigrating vertices: Emergence of the giant component. Random Struct. Algorithms 17(2): 79-102 (2000) - [j13]David J. Aldous:
[untitled]. Am. Math. Mon. 107(6): 574-576 (2000)
1990 – 1999
- 1999
- [j12]David J. Aldous, Jim Pitman:
A family of random trees with random edge lengths. Random Struct. Algorithms 15(2): 176-195 (1999) - 1998
- [j11]David J. Aldous:
A. Metropolis-Type Optimization Algorithm on the Infinite Tree. Algorithmica 22(4): 388-412 (1998) - [j10]David J. Aldous:
On the Critical Value for 'Percolation' of Minimum-Weight Trees in the Mean-Field Distance Model. Comb. Probab. Comput. 7(1): 1-10 (1998) - [j9]David J. Aldous:
Emergence of the giant component in special Marcus-Lushnikov processes. Random Struct. Algorithms 12(2): 179-196 (1998) - [e1]David J. Aldous, James Propp:
Microsurveys in Discrete Probability, Proceedings of a DIMACS Workshop, Princeton, New Jersey, USA, 1997. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 41, DIMACS/AMS 1998, ISBN 978-0-8218-0827-6 [contents] - 1997
- [c3]David J. Aldous:
Tree-valued Markov chains and Poisson-Galton-Watson distributions. Microsurveys in Discrete Probability 1997: 1-20 - 1995
- [j8]David J. Aldous, Umesh V. Vazirani:
A Markovian Extension of Valiant's Learning Model. Inf. Comput. 117(2): 181-186 (1995) - 1994
- [j7]David J. Aldous, Jim Pitman:
Brownian Bridge Asymptotics for Random Mappings. Random Struct. Algorithms 5(4): 487-512 (1994) - [c2]David J. Aldous, Umesh V. Vazirani:
"Go With the Winners" Algorithms. FOCS 1994: 492-501 - 1992
- [j6]David J. Aldous:
Greedy Search on the Binary Tree with random Edge-Weights. Comb. Probab. Comput. 1: 281-293 (1992) - [j5]David J. 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
- [j4]David J. Aldous:
A Random Tree Model Associated with Random Graphs. Random Struct. Algorithms 1(4): 383-402 (1990) - [j3]David J. Aldous:
The Random Walk Construction of Uniform Spanning Trees and Uniform Labelled Trees. SIAM J. Discret. Math. 3(4): 450-465 (1990) - [c1]David J. Aldous, Umesh V. Vazirani:
A Markovian Extension of Valiant's Learning Model (Extended Abstract). FOCS 1990: 392-396
1980 – 1989
- 1989
- [j2]David J. Aldous:
The harmonic mean formula for probabilities of unions: applications to sparse random graphs. Discret. Math. 76(3): 167-176 (1989) - 1987
- [j1]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): 219-223 (1987)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:46 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
