Corpus ID: 4600751

Techniques of the Average Case Analysis of Algorithms

@inproceedings{Szpankowski1996TechniquesOT,
  title={Techniques of the Average Case Analysis of Algorithms},
  author={W. Szpankowski},
  year={1996}
}
  • W. Szpankowski
  • Published 1996
  • Computer Science
  • 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
    • 79
    • PDF

    References

    SHOWING 1-10 OF 126 REFERENCES
    Average-Case Analysis of Algorithms and Data Structures
    • J. Vitter, P. Flajolet
    • 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
    • 125
    • PDF
    Probabilistic Analysis of Some Distributed Algorithms
    • 17
    • PDF
    A probabilistic Analysis of a String Editing Problem and its Variations
    • 5
    • PDF
    The Probabilistic Method
    • 5,838
    • PDF
    On asymptotics of certain sums arising in coding theory
    • W. Szpankowski
    • Mathematics, Computer Science
    • IEEE Trans. Inf. Theory
    • 1995
    • 21
    • PDF