Journals in DBLP

Random Struct. Algorithms
1997, volume: 10, number: 1-2

1. Philippe Flajolet, Wojciech Szpankowski
   Analysis of algorithms. [Citation Graph (0, 0)][DBLP]
   Random Struct. Algorithms, 1997, v:10, n:1-2, pp:1-3 [Journal]
   
2. Alan M. Frieze, Colin McDiarmid
   Algorithmic theory of random graphs. [Citation Graph (0, 0)][DBLP]
   Random Struct. Algorithms, 1997, v:10, n:1-2, pp:5-42 [Journal]
   
3. Stéphane Boucheron, Danièle Gardy
   An urn model from learning theory. [Citation Graph (0, 0)][DBLP]
   Random Struct. Algorithms, 1997, v:10, n:1-2, pp:43-67 [Journal]
   
4. Edward G. Coffman Jr., David S. Johnson, Peter W. Shor, Richard R. Weber
   Bin packing with discrete item sizes, part II: Tight bounds on First Fit. [Citation Graph (0, 0)][DBLP]
   Random Struct. Algorithms, 1997, v:10, n:1-2, pp:69-101 [Journal]
   
5. Michael Drmota
   Systems of functional equations. [Citation Graph (0, 0)][DBLP]
   Random Struct. Algorithms, 1997, v:10, n:1-2, pp:103-124 [Journal]
   
6. Svante Janson, Donald E. Knuth
   Shellsort with three increments. [Citation Graph (0, 0)][DBLP]
   Random Struct. Algorithms, 1997, v:10, n:1-2, pp:125-142 [Journal]
   
7. Peter Kirschenhofer, Helmut Prodinger, Conrado Martinez
   Analysis of Hoare's FIND algorithm with Median-of-three partition. [Citation Graph (0, 0)][DBLP]
   Random Struct. Algorithms, 1997, v:10, n:1-2, pp:143-156 [Journal]
   
8. Guy Louchard
   Probabilistic analysis of adaptative sampling. [Citation Graph (0, 0)][DBLP]
   Random Struct. Algorithms, 1997, v:10, n:1-2, pp:157-168 [Journal]
   
9. Hosam M. Mahmoud, Robert T. Smythe, Mireille Régnier
   Analysis of Boyer-Moore-Horspool string-matching heuristic. [Citation Graph (0, 0)][DBLP]
   Random Struct. Algorithms, 1997, v:10, n:1-2, pp:169-186 [Journal]
   
10. Colin McDiarmid, Theodore Johnson, Harold S. Stone
    On finding a minimum spanning tree in a network with random weights. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1997, v:10, n:1-2, pp:187-204 [Journal]
    
11. Kurt Mehlhorn, Volker Priebe
    On the all-pairs shortest-path algorithm of Moffat and Takaoka. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1997, v:10, n:1-2, pp:205-220 [Journal]
    
12. Patricio V. Poblete, Alfredo Viola, J. Ian Munro
    The Diagonal Poisson Transform and its application to the analysis of a hashing scheme. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1997, v:10, n:1-2, pp:221-255 [Journal]
    
13. Ulrich Schmid
    Static priority scheduling of aperiodic real-time tasks. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1997, v:10, n:1-2, pp:257-303 [Journal]