Tiered vectors: Efficient dynamic arrays for rank-based sequences

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1663, Issue , 1999, Pages 205-216

  Goodrich, Michael T ^a   Kloss, John G ^a  

^a JOHNS HOPKINS UNIVERSITY   (United States)

Author keywords

Abstract data type; Dynamic array; Java; JDSL; Vector

Indexed keywords

VECTORS;

AMORTIZED TIME; DYNAMIC ARRAYS; JAVA; JDSL;

ABSTRACT DATA TYPES;

EID: 84948987520     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48447-7_21     Document Type: Conference Paper

References (10)

1. P. Ake Larson. Dynamic hash tables. Communications of the ACM, 31(4), April 1988.
2. R. Bayer and K. Unterauer. Prefix B-Trees. ACM Transactions on Database Systems, 2(1):11-26, March 1977.
3. J. Boyer. Algorithm allery: Resizable data structures. Dr. Dobb's Journal, 23(1):115-116, 118, 129, January 1998.
4. A. Fraenkel, E. Reingold, and P. Saxena. Efficient management of dynamic tables. Information Processing Letters, 50:25-30, 1994.
5. M. L. Fredman and M. E. Saks. The cell probe complexity of dynamic data structures. In Proceedings of the Twenty First Annual ACM Symposium on Theory of Computing, pages 345-354, Seattle, Washington, 15-17May 1989.
6. M. Goodrich and R. Tamassia. Data Structures and Algorithms in Java. John Wiley &; Sons, 1998.
7. D. E. Knuth. The Art of Computer Programming: Fundamental Algorithms, volume 1. Addison-Wesley, 3 edition, 1997.
8. D. E. Knuth. The Art of Computer Programming: Sorting and Searching. volume 3. Addison-Wesley, 3 edition, 1998.
9. E. Sitarski. Algorithm alley: HATs: Hashed array trees. Dr. Dobb's Journal, 21(11), September 1996.
10. H. Wedekind. On the selection of access paths in a database system. In Proceedings of the IFIP Working Conference on Data Base Management. North-Holland Publishing Company, 1974.