Author:
Broutin N.,Devroye L.,McLeish E.
Publisher
Springer Science and Business Media LLC
Subject
Computer Networks and Communications,Information Systems,Software
Reference66 articles.
1. Archibald, M., Clément, J.: Average depth in binary search tree with repeated keys. In: Fourth Colloquium on Mathematics and Computer Science, volume AG of DMTCS Proceedings, pp. 309–320. Discrete Mathematics and Theoretical Computer Science (2006)
2. Athreya, K.B., Ney, P.E.: Branching Processes. Springer, Berlin (1972)
3. Barabási, A.L., Albert, R.: Emergence of scaling in random network. Science 286, 509–512 (1999)
4. Bentley, J.L.: Multidimensional binary search trees used for associative searching. Commun. ACM 18, 509–517 (1975)
5. Bentley, J.L., Sedgewick, R.: Fast algorithm for sorting and searching strings. In: Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 360–369. SIAM, 1997
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献