Wojciech Szpankowski  Home/Search
Context
Related
| purdue.edu/homes/spa/papers/aofa1.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: purdue.edu/homes/s...publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This is the rst installment of the Algorithmics Column dedicated to Analysis of Algorithms (AofA) that sometimes goes under the name Average-Case Analysis of Algorithms or Mathematical Analysis of Algorithms. The area of analysis of algorithms (at least, the way we understand it here) was born on July 27, 1963, when D. E. Knuth wrote his \Notes on Open Addressing". Since 1963 the eld has been undergoing substantial changes. We report here how it evolved since then. For a long time this area... (Update)
Active bibliography (related documents): More All
0.8: Dynamical Sources in Information Theory: A General Analysis of .. - Clement, al. (1999) (Correct)
0.7: Analytic Variations on Redundancy Rates of Renewal Processes - Flajolet, Szpankowski (2002) (Correct)
0.5: Asymptotic Behavior Of The Height In A Digital Search Tree.. - Knessl, Szpankowski (2000) (Correct)
Similar documents based on text: More All
0.5: Analysis of Algorithms (AofA): Part II: 1998 - 2000.. - Drmota, Szpankowski (2003) (Correct)
0.2: Pattern Matching Image Compression: Algorithmic and.. - Atallah.. (1996) (Correct)
0.2: Stability Conditions for Some Distributed Systems: Buffered.. - Szpankowski (1993) (Correct)
BibTeX entry: (Update)
@misc{ szpankowski-analysis,
author = "Wojciech Szpankowski",
title = "Analysis of Algorithms (AofA): Part I: 1993 - 1998 ("Dagstuhl Period")",
url = "citeseer.ist.psu.edu/620133.html" }
Citations (may not include all citations):2003 The Art of Computer Programming (context) - Knuth - 1998
2003 The Art of Computer Programming (context) - Knuth - 1998
2003 The Art of Computer Programming (context) - Knuth - 1997
957 The Probabilistic Method (context) - Alon, Spencer - 1992
411 Random Graphs (context) - Bollob - 1985
291 Theoretical Computer Science (context) - Drmota, of et al. - 2002
151 Singularity Analysis of Generating Functions (context) - Flajolet, Odlyzko - 1990
130 Evolution of Random Search Trees (context) - Mahmoud - 1992
108 An Introduction to the Analysis of Algorithms (context) - Sedgewick, Flajolet - 1995
89 Mellin Transforms and Asymptotics: Harmonic sums - Flajolet, Gourdon et al. - 1995
67 Average Case Analysis of Algorithms on Sequences (context) - Szpankowski - 2001
54 Optimal Prefetching via Data Compression - Vitter, Krishnan - 1996
43 Asymptotic Behavior of the Lempel-Ziv Parsing Scheme and Dig.. - Jacquet, Szpankowski - 1995
42 A Note on the height of Binary Search Trees (context) - Devroye - 1986
41 the Analysis of Linear Probing Hashing - Flajolet, Poblete et al. - 1998
30 On Pattern Frequency Occurrences in a Markovian Sequence (context) - egnier, Szpankowski - 1998
28 The Birth of the Giant Component (context) - Janson, Knuth et al. - 1993
27 The Number of Connected Sparsely Edged Graphs (context) - Wright - 1977
22 the Average Redundancy Rate of the Lempel-Ziv Code - Louchard, Szpankowski - 1997
21 Marking in Combinatorial Constructions: Generating Functions.. (context) - Drmota, Soria - 1995
20 Linear Probing and Graphs - Knuth - 1998
20 A Recurrence Related to Trees (context) - Knuth, Pittel - 1989
19 Theoretical Computer Science (context) - Jacquet, Szpankowski et al. - 1998
19 The Average Height of Planted Plane Trees (context) - De Bruijn, Knuth et al. - 1972
17 An Analytic Approach to the Height of Binary Search Trees - Drmota - 2001
16 Asymptotic Enumeration (context) - Odlyzko - 1995
15 the Variance of the Height of Random Binary Search Trees (context) - Devroye, Reed - 1995
14 Analysis of Hoare's Find Algorithm with Median-of-Three Part.. - Kirschenhofer, Prodinger et al. - 1997
14 Large Deviations for Combinatorial Distributions II: Local L.. - Hwang - 1998
13 The First Cycles in an Evolving Graph (context) - Flajolet, Knuth et al. - 1989
13 Dynamics of the Binary Euclidean Algorithm: Functional Analy.. (context) - Vall - 1998
13 Digital Search Trees Again Revisited: The Internal Path Leng.. (context) - Kirschenhofer, Prodinger et al. - 1994
12 Average Case Analysis of Algorithms - Flajolet, Kemp et al. - 1993
12 Systems of Functional Equations - Drmota - 1997
12 Average Case Analysis of Algorithms - Flajolet, Kemp et al. - 1997
12 Average Case Analysis of Algorithms - Flajolet, Kemp et al. - 1995
11 A Distribution Theory (context) - Mahmoud - 2000
11 Analytic Combinatorics (context) - Flajolet, Sedgewick - 1993
11 On Asymptotics of Certain Recurrences Arising in Universal C.. - Szpankowski - 1997
10 Analysis of the Binary Euclidean Algorithm (context) - Brent - 1976
10 Universal Coding with Minimum Probability of Codeword Length.. (context) - Merhav - 1991
9 Large Deviations for Combinatorial Distributions I: Central .. - Hwang - 1996
7 Brownian Motion and Algorithm Complexity (context) - Louchard - 1986
7 Dynamical Sources in Information Theory : Fundamental interv.. - Vall - 2001
7 Oxford University Press (context) - Hofri, Algorithms - 1995
6 Theoretical Informatics and Applications (context) - osler, Theorem et al. - 1991
6 Shellsort with Three Increments - Janson, Knuth - 1997
5 The Diagonal Poisson Transform and its Application to the An.. (context) - Poblete, Viola et al. - 1997
5 Computational Mathematics (context) - Corless, Gonnet et al. - 1996
4 Analysis of Boyer-Moore-Horspool String-Matching Heuristic - Mahmoud, Smythe et al. - 1997
4 How Tall Is a Tree (context) - Reed - 2000
3 On Asymptotics of Certain Sums Arising in Coding Theory - Szpankowski - 1995
3 Average Pro le of the Lempel-Ziv Parsing Scheme for a Markov.. (context) - Jacquet, Szpankowski et al. - 2001
3 Analytic Variations on Redundancy Rates of Renewal Processes - Flajolet, Szpankowski - 2000
3 The analysis of Heapsort (context) - Scha, Sedgewick - 1993
3 usion Limit for a Class of Random-Growing Binary Trees (context) - Aldous, Shields et al. - 1988
2 Asymptotic Properties of Data Compression and Sux Trees (context) - Szpankowski - 1993
2 Bin Packing with Discrete Item Size (context) - Co, Johnson et al. - 1997
2 On Some Applications of Formul of Ramanujan in the Analysis.. (context) - Kirschenhofer, Prodinger - 1991
1 Theoretical Computer Science (context) - Prodinger, of et al. - 1997
1 Packing Random Intervals on-Line (context) - Co, Flatto et al. - 1998
1 Static Priority Scheduling of Aperiodic Real-Time Tasks (context) - Schmid - 1997
1 Philippe Flajolet's Research in Analysis of Algorithms and C.. - Prodinger, Szpankowski - 1998
1 Expected Deadlock Time in a Multiprocessing System (context) - Compton, Ravishankar - 1995
1 The Height of a Binary Search Tree: The Limiting Distributio.. - Knessl, Szpankowski - 2002
1 On Finding a Minimum Spanning Tree in a Network with random .. (context) - McDiarmid, Johnson et al. - 1997
Documents on the same site (http://www.cs.purdue.edu/homes/spa/publications.html): More
Stability of Token Passing Rings - Georgiadis, Szpankowski (1992) (Correct)
Greedy approximation Algorithm For constructing Shortest Common.. - Ukkonen (1988) (Correct)
A Pattern Matching Approach to Image Compression - Atallah, Szpankowski.. (1996) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC