Publisher
Springer Berlin Heidelberg
Reference14 articles.
1. Baeza-Yates, R.A.: A Trivial Algorithm Whose Analysis Is Not: A Continuation. BIT 29(3), 278–394 (1989)
2. Brinck, K.: On deletion in threaded binary trees. Journal of Algorithms 7(3), 395–411 (1986)
3. Culberson, J., Ian Munro, J.: Explaining the behavior of binary trees under prolonged updates: A model and simulations. The Computer Journal 32(1) (1989)
4. Culberson, J., Ian Munro, J.: Analysis of the standard deletion algorithms in exact fit domain binary search trees. Algorithmica 5(3), 295–311 (1990)
5. Evans, P.A., Culberson, J.: Asymmetry in binary search tree update algorithms. Technical Report TR 94-09, University of Alberta Department of Computer Science, Edmonton, Alberta, Canada (May 1994)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献