Author:
Rao Kosaraju S.,Pop Mihai
Publisher
Springer Berlin Heidelberg
Reference32 articles.
1. M. Ajtai, M. Fredman, and J. Komlós. Hash functions for priority queues. Information and Control, 63:217–225, 1984.
2. H.G. Baker, jr. List processing in real time on a serial computer. Communications of the ACM, 21(4):280–294, April 1978.
3. J.L. Bentley. Decomposable searching problems. Information Processing Letters, 8:244–251, 1979.
4. A.L. Buchsbaum, R. Sundar, and R.E. Tarjan. Data structural bootstrapping, linear path compression, and catenable heap ordered double ended queues. In Proceedings of the 33rd Symposium on Theory of Computing, pages 40–49, 1992.
5. A.L. Buchsbaum and R. E. Tarjan. Confluently persistent deques via data structural bootstrapping. In Proceedings of the 4th ACM/SIGACT-SIAM Symposium on Discrete Algorithms, pages 155–164, 1993.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献