Author:
Bender Michael A.,Cole Richard,Raman Rajeev
Publisher
Springer Berlin Heidelberg
Reference24 articles.
1. A. Aggarwal and J. S. Vitter. The I/O complexity of sorting and related problems. Communications of the ACM 31, 1116–1127, 1988.
2. A. Ailamaki, D. J. DeWitt, M. D. Hill, and D. A. Wood. DBMSs on a Modern Processor: Where Does Time Go? In Proc. 25th VLDB Conference (1999), pp 266–277.
3. A. Andersson. Faster Deterministic Sorting and Searching in Linear Space. In Proc. 37th IEEE FOCS (1996), pp. 135–141.
4. A. Andersson and M. Thorup. Tight(er) worst-case bounds on dynamic searching and priority queues. In Proc. 31st ACM STOC (2000), pp. 335–342.
5. L. Arge. External memory data structures. In J. Abello, P. M. Pardalos, and M. G. C. Resende, eds, Handbook of Massive Data Sets. Kluwer Academic, 2002.
Cited by
22 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献