(page i) Jeffrey Scott Vitter Philippe Flajolet  @ NUS Home/Search
Context Related
| algo.inria.fr/flajolet/P...ViFl90.ps.gz Cached: PS.gz PS PDF Image Update Help From: algo.inria.fr/flajolet/Publica... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . This report is a contributed chapter to the Handbook of Theoretical Computer Science (North-Holland, 1990). Its aim is to describe the main mathematical methods and applications in the average-case analysis of algorithms and data structures. It comprises two parts: First, we present basic combinatorial enumerations based on symbolic methods and asymptotic methods with emphasis on complex analysis techniques (such as singularity analysis, saddle point, Mellin transforms). Next, we show how to... (Update)
Cited by: More
Statistical Models for Term Compression - James Cheney Cornell (2000) (Correct)
Fast Exponentiation with Precomputation: Algorithms.. - Brickell, Gordon.. (1995) (Correct)
Lower Bounds for Shellsort - Greg Plaxton Torsten (1997) (Correct)
Active bibliography (related documents): More All
0.1: Asymptotics of divide-and-conquer recurrences.. - Hsien-Kuei Hwang.. (Correct)
0.1: On Probabilistic Networks for Selection, Merging, and Sorting - Leighton, Ma, Suel (1995) (Correct)
0.1: Asymptotic Enumeration Methods - Odlyzko (1996) (Correct)
Similar documents based on text: More All
0.4: Design and Analysis of Dynamic Huffman Codes - Vitter (1987) (Correct)
0.1: Publication List - Flajolet (1997) (Correct)
0.1: A Calculus for the Random Generation of Combinatorial.. - Flajolet, Zimmermann.. (1993) (Correct)
Related documents from co-citation: More All
17: Singularity Analysis of Generating Functions (context) - Flajolet, Odlyzko - 1990
17: The art of computer programming (context) - Knuth - 1973
11: the altitude of nodes in random trees (context) - Meir, Moon - 1978
BibTeX entry: (Update)
J. S. Vitter and Ph. Flajolet. Average-case analysis of algorithms and data structures. In Jan van Leeuwen, editor, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity, chapter 9, pages 431--524. North-Holland, 1990. http://citeseer.comp.nus.edu.sg/448345.html More
@misc{ vitter90averagecase,
author = "J. Vitter and P. Flajolet",
title = "Average-case analysis of algorithms and data structures",
text = "J. S. Vitter and Ph. Flajolet. Average-case analysis of algorithms and
data structures. In Jan van Leeuwen, editor, Handbook of Theoretical Computer
Science, Volume A: Algorithms and Complexity, chapter 9, pages 431--524.
North-Holland, 1990.",
year = "1990",
url = "citeseer.comp.nus.edu.sg/448345.html" }
Citations (may not include all citations):9 Data Movement in Odd-Even Merging (context) - Sedgewick - 1978
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://algo.inria.fr/flajolet/Publications/): More
Analytic Combinatorics of Non-crossing Configurations - Flajolet, Noy (1997) (Correct)
Random Triangulations (Extended Abstract) - Devroye, Flajolet, Hurtado.. (1996) (Correct)
The Formal Theory of Birth-and-Death Processes, Lattice.. - Flajolet, Guillemin (1999) (Correct)
Online articles have much greater impact More about CiteSeer.IST at NUS Add search form to your site Submit documents Feedback
CiteSeer.IST at NUS - Copyright Penn State and NEC. Hosted by the School of Computing, National University of Singapore.