Compact representations of ordered sets

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 15, Issue , 2004, Pages 11-19

  Blandford, Daniel K ^a   Blelloch, Guy E ^a  

^a Carnegie Mellon University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FILE INDEX; SERIAL MERGE ALGORITHMS; SET STRUCTURES;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; DATA STRUCTURES; MATHEMATICAL MODELS; MATRIX ALGEBRA; PROBLEM SOLVING; RANDOM ACCESS STORAGE; SET THEORY;

COMPUTER SCIENCE;

EID: 1842525880     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. The C++ standard template library, http://www.sgi.com/tech/stl/index. html.
2. C. R. Aragon and R. G. Seidel. Randomized search trees. In Proc. 30th Annual Symposium on Foundations of Computer Science, pages 540-545, 1989.
3. D. Blandford and G. Blelloch. Index compression through document reordering. In Data Compression Conference (DCC), pages 342-351, 2002.
4. D. Blandford, G. Blelloch, D. Cardoze, and C. Kadow. Compact representations of simplicial meshes in two and three dimensions. In Proc. 12th International Meshing Roundtable, 2003.
5. A. Brodnik and J. Munro. Membership in constant time and almost-minimum space. SIAM Journal on Computing, 28(5):1627-1640, 1999.
6. A. L. Buchsbaum, R. Sundar, and R. E. Tarjan. Data structural bootstrapping, linear path compression, and catenable heap ordered double ended queues. In Proc. 33rd IEEE Symp. on Foundations of Computer Science, pages 40-49, 1992.
7. S. Carlsson, C. Levcopoulos, and O. Petersson. Sublinear merging and natural merge sort. In Proc. International Symposium on Algorithms SIGAL'90, pages 251-260, Tokyo, Japan, Aug. 1990.
8. P. Elias. Universal codeword sets and representations of the integers. IEEE Transactions on Information Theory, IT-21(2):194-203, March 1975.
9. L. J. Guibas and R. Sedgewick. A dichromatic framework for balanced trees. In Proc. 19th IEEE Symposium on Foundations of Computer Science, pages 8-21, 1978.
10. H. Kaplan and R. Tarjan. Purely functional representations of catenable sorted lists. In Proc. of the 28th Annual ACM Symposium on the Theory of Computing, pages 202-211, May 1996.
11. A. Moffat, O. Petersson, and N. C. Wormald. A tree-based mergesort. Acta Informatica, 35(9):775-793, 1998.
12. A. Moffat and L. Stuiver. Binary interpolative coding for effective index compression. Information Retrieval, 3(1):25-47, July 2000.
13. L. Page, S. Brin, R. Motwani, and T. Winograd. The pagerank citation ranking: Bringing order to the web. Technical report, Stanford Digital Library Technologies Project, 1998.
14. R. Pagh. Low redundancy in static dictionaries with O(1) worst case lookup time. Lecture Notes in Computer Science, 1644:595-??, 1999.
15. W. Pugh. Skip lists: A probabilistic alternative to balanced trees. In Workshop on Algorithms and Data Structures, pages 437-449, 1989.
16. R. Seidel and C. R. Aragon. Randomized search trees. Algorithmica, 16(4/5):464-497, 1996.
17. I. H. Witten, A. Moffat, and T. C. Bell. Managing Gigabytes. Morgan Kaufman, 1999.