Dynamical sources in information theory: A general analysis of trie structures-Reference-Cited by-同舟云学术

Dynamical sources in information theory: A general analysis of trie structures

Published:2001-02 Issue:1-2 Volume:29 Page:307-369
ISSN:0178-4617
Container-title:Algorithmica
language:en
Short-container-title:Algorithmica

Author:

Clément J.,Flajolet P.,Vallée B.

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computer Science Applications,General Computer Science

Link

http://link.springer.com/content/pdf/10.1007/BF02679623.pdf

Reference65 articles.

1. Allen, B., and Munro, I. Self-organizing binary search trees.Journal of the ACM 25(4) (Oct. 1978), 526–535.

2. Bedford, T., Keane, M., and Series, C.Ergodic Theory, Symbolic Dynamics and Hyperbolic Spaces. Oxford University Press, Oxford, 1991.

3. Bentley, J., and Sedgewick, R. Fast algorithms for sorting and searching strings. InProceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (New Orleans, January 1997), pp. 360–369. SIAM Press, Philadelphia, PA, 1997.

4. Bogomolny, E.B., and Carioli, M. Quantum maps from transfer operators.Physica D 67 (1993), 88–112.

5. Burge, W. H. An analysis of binary search trees formed from sequences of nondistinct keys.Journal of the ACM 23(3) (July 1976), 451–454.

Cited by 46 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Design of Real-Time Multiplayer Word Game for the Android Platform Using Firebase and Fuzzy Logic;2023 14th International Conference on Information, Intelligence, Systems & Applications (IISA);2023-07-10

2. Lochs-type theorems beyond positive entropy;Monatshefte für Mathematik;2023-01-06

3. Upper tail analysis of bucket sort and random tries;Theoretical Computer Science;2021-12

4. Upper Tail Analysis of Bucket Sort and Random Tries;Lecture Notes in Computer Science;2021

5. Process convergence for the complexity of Radix Selection on Markov sources;Stochastic Processes and their Applications;2019-02