Search the dblp DataBase

Publications of Author

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