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].
Chapter PDF
Similar content being viewed by others
Keywords
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
Aho, A., Hopcroft, J. and Ullman, J., Data structures and algorithms, Addison-Wesley, 1983.
Frdelyi, A., Higher transcendental functions, McGraw-Hill Book, 1953.
Fagin R., Nievergelt, J., Pippenger, N. and Strong H., Extendible hashing: A fast access method for dynamic files, ACM TODS 4, 1979, 315–344.
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.
Flajolet, Ph., On the performance evaluation of extendible hashing and trie searching, Acta Informatica 20, 1983, 345–369.
Flajolet, Ph. and Sedgewick R., Digital search trees revisited, SIAM J. Compt., 15, 1986, pp. 748–767.
Flajolet, Ph., Mathematical methods in the analysis of algorithms and data structures, INRIA Technical Report, 400, 1985.
Gonnet G., Handbook of algorithms and data structures, Addison-Wesley, 1984.
Henrici, P., Applied and computational complex analysis, John Wiley & Sons, New York 1977.
Jacquet, Ph. and Regnier, M., Limiting distributions for trie parameters, Proc. of CAAP'86, 1985.
Kirschenhofer, P. and Prodinger, H., Some further results on digital trees, ICALP 86, to appear.
Knuth, D., The art of computer programming, Addison-Wesley, 1973.
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.
Szpankowski, W., Some results on the V-ary asymmetric tries, Purdue University, CDS-TR-582, 1985.
Riordan, J., Combinatorial identities, John Wiley & Sons, 1968.
Whittaker, E. and Watson, G., A course of modern analysis, Cambridge Press, 1935.
Paige, R., Tarjan, R., Three efficient algorithms based on partition refinement, preprint.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1987 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Szpankowski, W. (1987). Average complexity of additive properties for multiway tries: A unified approach. In: Ehrig, H., Kowalski, R., Levi, G., Montanari, U. (eds) TAPSOFT '87. CAAP 1987. Lecture Notes in Computer Science, vol 249. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-17660-8_44
Download citation
DOI: https://doi.org/10.1007/3-540-17660-8_44
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-17660-2
Online ISBN: 978-3-540-47746-4
eBook Packages: Springer Book Archive