Implicit B-trees: a new data structure for the dictionary problem-Reference-Cited by-同舟云学术

Implicit B-trees: a new data structure for the dictionary problem

Published:2004-06 Issue:4 Volume:68 Page:788-807
ISSN:0022-0000
Container-title:Journal of Computer and System Sciences
language:en
Short-container-title:Journal of Computer and System Sciences

Author:

Franceschini Gianni,Grossi Roberto,Munro J.Ian,Pagli Linda

Publisher

Elsevier BV

Subject

Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science

Reference29 articles.

1. An algorithm for the organization of information;Adel'son-Vel'skii;Soviet Math. Dokl.,1962

2. A. Bello, F. Fantoni, Studio sperimentale di una nuova struttura dei dati implicita per B-alberi, Master Thesis, Universita di Pisa, March 2003 (in Italian).

3. M.A. Bender, E.D. Demaine, M. Farach-Colton, Cache-oblivious b-trees, in: IEEE (Ed.), 41st Annual Symposium on Foundations of Computer Science: Proceedings: 12–14 November, 2000, Redondo Beach, California, IEEE Computer Society Press, Silver Spring, MD, pp. 399–409.

4. A tradeoff between search and update time for the implicit dictionary problem;Borodin;Theoret. Comp. Sci.,1988

5. Membership in constant time and almost-minimum space;Brodnik;SIAM J. Comput.,1999

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

1. Computing (and Life) Is All about Tradeoffs;Lecture Notes in Computer Science;2013

2. A Survey on Priority Queues;Lecture Notes in Computer Science;2013

3. Optimal in-place and cache-oblivious algorithms for 3-d convex hulls and 2-d segment intersection;Computational Geometry;2010-10