Publisher
Springer Berlin Heidelberg
Reference12 articles.
1. Ahlswede, R., Wegener, I.: Search Problems. Wiley, Chichester (1987)
2. Evans, W.S., Kirkpatrick, D.G.: Restructuring ordered binary trees. In: Proceedings of the 11th Annual Symposium on Discrete Algorithms, pp. 477–486 (2000)
3. Fredman, M.: Two applications of a probabilistic search technique: sorting x + y and building balanced search trees. In: Proceeding of the 7th Annual Symposium on Theory of Computing, pp. 240–244 (1975)
4. Gagie, T.: Dynamic length-restricted coding. Master’s thesis, University of Toronto (2003)
5. Garey, M.R.: Optimal binary search trees with restricted maximal depth. SIAM Journal on Computing 3, 101–110 (1974)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献