Techniques of the Average Case Analysis of Algorithms
@inproceedings{Szpankowski1996TechniquesOT, title={Techniques of the Average Case Analysis of Algorithms}, author={W. Szpankowski}, year={1996} }
This is an extended version of a book chapter that I wrote for the Handbook on Algorithms and Theon) of Computation (Ed. M. Atallah) in which some probabilistic and analytical techniques of the average case analysis of algorithms are reviewed. By analytical techniques we mean those in which complex analysis plays a primary role. We choose one facet of the theory of algorithms, namely that of algorithms and data structures on words (strings) and present a brief exposition on certain analytical… CONTINUE READING
3 Citations
Entropy Computations via Analytic Depoissonization
- Mathematics, Computer Science
- IEEE Trans. Inf. Theory
- 1999
- 79
- PDF
On asymptotics of Certain Recurrences Arising in Multi-Alphabet Universal Coding
- Computer Science
- 1996
- 1
References
SHOWING 1-10 OF 126 REFERENCES
Analysis of a splitting process arising in probabilistic counting and other related algorithms
- Mathematics
- 1996
- 22
Analysis of a splitting process arising in probabilistic counting and other related algorithms
- Computer Science
- Random Struct. Algorithms
- 1996
- 15
Average-Case Analysis of Algorithms and Data Structures
- Computer Science, Mathematics
- Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity
- 1990
- 200
- PDF
Asymptotic Behavior of the Lempel-Ziv Parsing Scheme and Digital Search Trees
- Mathematics, Computer Science
- Theor. Comput. Sci.
- 1995
- 125
- PDF
Probabilistic Analysis of Some Distributed Algorithms
- Mathematics, Computer Science
- Random Struct. Algorithms
- 1991
- 17
- PDF
A probabilistic Analysis of a String Editing Problem and its Variations
- Mathematics, Computer Science
- Comb. Probab. Comput.
- 1995
- 5
- PDF
On asymptotics of certain sums arising in coding theory
- Mathematics, Computer Science
- IEEE Trans. Inf. Theory
- 1995
- 21
- PDF