Adaptive Searching in Succinctly Encoded Binary Relations and Tree-Structured Documents-Reference-Cited by-同舟云学术

Adaptive Searching in Succinctly Encoded Binary Relations and Tree-Structured Documents

Published:2006 Issue: Volume: Page:24-35
ISSN:0302-9743
Container-title:Combinatorial Pattern Matching
language:
Short-container-title:

Author:

Barbay Jérémy,Golynski Alexander,Munro J. Ian,Rao S. Srinivasa

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/11780441_4.pdf

Reference14 articles.

1. Lecture Notes in Computer Science;R. Baeza-Yates,2004

2. Lecture Notes in Computer Science;J. Barbay,2003

3. Barbay, J., Kenyon, C.: Adaptive intersection and t-threshold problems. In: Proceedings of the 13th ACM-SIAM Symposium On Discrete Algorithms (SODA), pp. 390–399 (2002)

4. Clark, D.R., Munro, J.I.: Efficient suffix trees on secondary storage. In: Proceedings of the 7th annual ACM-SIAM Symposium on Discrete Algorithms (SODA), Philadelphia, PA, USA, pp. 383–391 (1996)

5. Demaine, E.D., López-Ortiz, A., Munro, J.I.: Adaptive set intersections, unions, and differences. In: Proceedings of the 11th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 743–752 (2000)

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

1. Succinct Data Structures for Path Queries;Algorithms – ESA 2012;2012

2. Extended Compact Web Graph Representations;Algorithms and Applications;2010

3. Rank/select on dynamic compressed sequences and applications;Theoretical Computer Science;2009-10

4. Self-indexed Text Compression Using Straight-Line Programs;Mathematical Foundations of Computer Science 2009;2009

5. Succinct Representations of Trees;Lecture Notes in Computer Science;2009