Tables-Reference-Cited by-同舟云学术

Tables

Published:1996 Issue: Volume: Page:37-42
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Munro J. Ian

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-62034-6_35.pdf

Reference17 articles.

1. A. Brodnik and J. I. Munro, Membership in Constant Time and Minimum Space, Proc. Algorithms — ESA '94, LNCS 855 (1994) 72–81.

2. D. R. Clark, Compact Pat Trees, manuscript, University of Waterloo (1996).

3. D. R. Clark and J. I. Munro, Succinct Representation of Trees, in preparation, University of Waterloo (1996).

4. R. W. Floyd, Algorithm 245: Treesort 3, Communications of the ACM, 7 (1964) 701.

5. G. H. Gonnet, R. A. Baeza-Yates and T. Snider, Lexicographic Indices for Text: Inverted Files vs. Pat Trees, Tech. Rpt. OED-91-01, Centre for the New OED, University of Waterloo (1991).

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

1. Space‐efficient data structures for the inference of subsumption and disjointness relations;Software: Practice and Experience;2024-09-03

2. Space & Time Efficient Leapfrog Triejoin;Proceedings of the 7th Joint Workshop on Graph Data Management Experiences & Systems (GRADES) and Network Data Analytics (NDA);2024-06-09

3. The Ring: Worst-case Optimal Joins in Graph Databases using (Almost) No Extra Space;ACM Transactions on Database Systems;2024-03-23

4. Worst-Case-Optimal Similarity Joins on Graph Databases;Proceedings of the ACM on Management of Data;2024-03-12

5. Stronger compact representations of object trajectories;Geo-spatial Information Science;2024-02-13