Some further results on digital search trees

  • Peter Kirschenhofer
  • Helmut Prodinger
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 226)


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    P.Flajolet, R.Sedgewick, Digital Search Trees Revisited, SIAM Journal on Computing, to appear 1986.Google Scholar
  2. [2]
    D.E. Knuth, The Art of Computer Programming, Vol.3: Sorting and Searching, Addison-Wesley, Reading Mass. 1973.Google Scholar
  3. [3]
    N.E.Nörlund, Vorlesungen über Differenzenrechnung, Chelsea, New York 1954.Google Scholar
  4. [4]
    W.Szpankowski, Analysis of a recurrence equation arising in stacktype algorithms for collision-detecting channels, Proc.of Intern.Symp.on Computer Networking & Performance Evaluation, Sept. 1985, Tokyo.Google Scholar
  5. [5]
    W.Szpankowski, Solution of linear recurrence equations arising in analysis of some algorithms, preprint.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • Peter Kirschenhofer
    • 1
  • Helmut Prodinger
    • 1
  1. 1.Institut für Algebra und Diskrete Mathematik TU ViennaViennaAustria

Personalised recommendations