Adaptive searching in succinctly encoded binary relations and tree-structured documents
Authors:
- 22 November 2007
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 387 (3) , 284-297
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Alternation and redundancy analysis of the intersection problemACM Transactions on Algorithms, 2008
- Rank/select operations on large alphabets2006
- Representing Trees of Higher DegreeAlgorithmica, 2005
- Structuring labeled trees for optimal succinctness, and beyond2005
- Succinct Representation of Balanced Parentheses and Static TreesSIAM Journal on Computing, 2001
- A survey of adaptive sorting algorithmsACM Computing Surveys, 1992
- Space-efficient static trees and graphs1989
- The Ultimate Planar Convex Hull Algorithm?SIAM Journal on Computing, 1986
- Log-logarithmic worst-case range queries are possible in space Θ(N)Information Processing Letters, 1983
- On general minimax theoremsPacific Journal of Mathematics, 1958