A trivial algorithm whose analysis is not: A continuation-Reference-Cited by-同舟云学术

A trivial algorithm whose analysis is not: A continuation

Published:1989-09 Issue:3 Volume:29 Page:378-394
ISSN:0006-3835
Container-title:BIT
language:en
Short-container-title:BIT

Author:

Baeza-Yates Ricardo A.

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computational Mathematics,Computer Networks and Communications,Software

Link

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

Reference11 articles.

1. Jonassen, A. T. and Knuth, D. E.A trivial algorithm whose analysis isn't, Journal of Computer and System Science (1978), Vol. 16, pp. 301–322.

2. Eppinger, J. L.An empirical study of insertion and deletion in binary trees, Communications of the ACM (1983), Vol. 26, pp. 663–669.

3. Culberson, J. C.Updating Binary Trees, M.Sc. Thesis, Report CS-84-08, Department of Computer Science, University of Waterloo, Waterloo, Canada, 1984.

4. Baeza-Yates, R. A.Análisis de algoritmos en Arboles de Búsqueda (Analysis of Algorithms in Search Trees, in Spanish), M.Sc. Thesis, Department of Computer Science, University of Chile, Santiago, Chile, January 1985.

5. Hibbard, T. N.Some combinatorial properties of certain trees with applications to searching and sorting, Journal of ACM (1962), Vol. 9, pp. 13–28.

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

1. Bibliography;Average Case Analysis of Algorithms on Sequences;2011-10-14

2. Deletions in random binary search trees: A story of errors;Journal of Statistical Planning and Inference;2010-08

3. Emerging behavior as binary search trees are symmetrically updated;Theoretical Computer Science;2003-03

4. Emerging Behavior as Binary Search Trees Are Symmetrically Updated;Lecture Notes in Computer Science;2000