default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRandom Structures and Algorithms, Volume 10
Volume 10, Number 1-2, January 1997
- Philippe Flajolet, Wojciech Szpankowski:
Analysis of algorithms. 1-3 - Alan M. Frieze, Colin McDiarmid:
Algorithmic theory of random graphs. 5-42 - Stéphane Boucheron, Danièle Gardy:
An urn model from learning theory. 43-67 - 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. 69-101 - Michael Drmota:
Systems of functional equations. 103-124 - Svante Janson, Donald E. Knuth:
Shellsort with three increments. 125-142 - Peter Kirschenhofer, Helmut Prodinger, Conrado Martinez:
Analysis of Hoare's FIND algorithm with Median-of-three partition. 143-156 - Guy Louchard:
Probabilistic analysis of adaptative sampling. 157-168 - Hosam M. Mahmoud, Robert T. Smythe, Mireille Régnier:
Analysis of Boyer-Moore-Horspool string-matching heuristic. 169-186 - Colin McDiarmid, Theodore Johnson, Harold S. Stone:
On finding a minimum spanning tree in a network with random weights. 187-204 - Kurt Mehlhorn, Volker Priebe:
On the all-pairs shortest-path algorithm of Moffat and Takaoka. 205-220 - Patricio V. Poblete, Alfredo Viola, J. Ian Munro:
The Diagonal Poisson Transform and its application to the analysis of a hashing scheme. 221-255 - Ulrich Schmid:
Static priority scheduling of aperiodic real-time tasks. 257-303
Volume 10, Number 3, May 1997
- Michael Molloy, Hanna D. Robalewska, Robert W. Robinson, Nicholas C. Wormald:
1-Factorizations of random regular graphs. 305-321 - Chern-Ching Chao:
A note on applications of the martingale central limit theorem to random permutations. 323-332 - Hsien-Kuei Hwang:
A constant arising from the analysis of algorithms for determining the maximum of a random walk. 333-335 - Hanno Lefmann, Petr Savický:
Some typical properties of large AND/OR Boolean formulas. 337-351 - Zevi Miller, Dan Pritikin:
On randomized greedy matchings. 353-383 - David A. Grable, Alessandro Panconesi:
Nearly optimal distributed edge coloring in O(log log n) rounds. 385-405
Volume 10, Number 4, July 1997
- Johannes Blömer, Richard M. Karp, Emo Welzl:
The rank of sparse random matrices over finite fields. 407-419 - Michael Drmota, Bernhard Gittenberger:
On the profile of random trees. 421-451 - Alan R. Woods:
Coloring rules for finite trees, and probabilities of monadic second order sentences. 453-485 - Martin E. Dyer, Ravi Kannan, John Mount:
Sampling contingency tables. 487-506
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.
last updated on 2024-11-08 20:37 CET 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:
