Advertisement

Average complexity of additive properties for multiway tries: A unified approach

  • Wojciech Szpankowski
Session CAAP 1 Algorithms
Part of the Lecture Notes in Computer Science book series (LNCS, volume 249)

Abstract

We study multiway asymmetric tries. Our main interest is to investigate the depth of a leaf and the external path length, however we also formulate and solve a more general problem. We consider a class of properties called additive properties. This class is specified by a common recurrence relation. We give an exact solution of the recurrence, and present an asymptotic approximation. In particular, we derive all (factorial) moments of the depth of a leaf and the external path length. In addition, we solve an open problem of Paige and Tarjan about the average case complexity of the improved lexicographical sorting. These results extend previous analyses by Knuth [12], Flajolet and Sedgewick [6], Jacquet and Regnier [10], and Kirschenhofer and Prodinger [11].

Keywords

Additive Property Internal Node Asymptotic Approximation Recurrence Equation Sorting Algorithm 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. [1]
    Aho, A., Hopcroft, J. and Ullman, J., Data structures and algorithms, Addison-Wesley, 1983.Google Scholar
  2. [2]
    Frdelyi, A., Higher transcendental functions, McGraw-Hill Book, 1953.Google Scholar
  3. [3]
    Fagin R., Nievergelt, J., Pippenger, N. and Strong H., Extendible hashing: A fast access method for dynamic files, ACM TODS 4, 1979, 315–344.CrossRefGoogle Scholar
  4. [4]
    Fayolle, Ph., Flajolet, Ph, Hofri, M. and Jacquet, Ph., Analysis of a stack algorithm for random multiple-access communication, IEEE Trans. on Information Theory, IT-31, 2, 1985, 244–254.CrossRefGoogle Scholar
  5. [5]
    Flajolet, Ph., On the performance evaluation of extendible hashing and trie searching, Acta Informatica 20, 1983, 345–369.CrossRefGoogle Scholar
  6. [6]
    Flajolet, Ph. and Sedgewick R., Digital search trees revisited, SIAM J. Compt., 15, 1986, pp. 748–767.CrossRefGoogle Scholar
  7. [7]
    Flajolet, Ph., Mathematical methods in the analysis of algorithms and data structures, INRIA Technical Report, 400, 1985.Google Scholar
  8. [8]
    Gonnet G., Handbook of algorithms and data structures, Addison-Wesley, 1984.Google Scholar
  9. [9]
    Henrici, P., Applied and computational complex analysis, John Wiley & Sons, New York 1977.Google Scholar
  10. [10]
    Jacquet, Ph. and Regnier, M., Limiting distributions for trie parameters, Proc. of CAAP'86, 1985.Google Scholar
  11. [11]
    Kirschenhofer, P. and Prodinger, H., Some further results on digital trees, ICALP 86, to appear.Google Scholar
  12. [12]
    Knuth, D., The art of computer programming, Addison-Wesley, 1973.Google Scholar
  13. [13]
    Szpankowski, W., Analysis of a recurrence equation arising in stack-type algorithms for collision-detecting channels, Proc. Intern. seminar on Computer Networking and Performance Evaluation, Tokyo 1985, 9-3-1–9-3-12.Google Scholar
  14. [14]
    Szpankowski, W., Some results on the V-ary asymmetric tries, Purdue University, CDS-TR-582, 1985.Google Scholar
  15. [15]
    Riordan, J., Combinatorial identities, John Wiley & Sons, 1968.Google Scholar
  16. [16]
    Whittaker, E. and Watson, G., A course of modern analysis, Cambridge Press, 1935.Google Scholar
  17. [17]
    Paige, R., Tarjan, R., Three efficient algorithms based on partition refinement, preprint.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • Wojciech Szpankowski
    • 1
    • 2
  1. 1.Department of Computer SciencesPurdue UniversityWest LafayetteU.S.A.
  2. 2.Technical University of GdanskPoland

Personalised recommendations