Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Fischer, Johannes - Wilhelm-Schickard-Institut für Informatik, Universität Tübingen
ARTICLE IN PRESS Theoretical Computer Science ( )
Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays
Data Structures for E#cient String Algorithms
New Common Ancestor Problems in Trees and Directed Acyclic Graphs
Towards Optimizing Conjunctive Inductive Johannes Fischer and Luc De Raedt
I N S T I T U T F R I N F O R M A T I K Fast Frequent String Mining Using Suffix Arrays
Optimal Succinctness for Range Minimum Queries Johannes Fischer
Optimal Succinctness for Range Minimum Queries
Advantages of Shared Data Structures for Sequences of Balanced Parentheses
Finding Range Minima in the Middle: Approximations and Applications
Range Median of Minima Queries, Super-Cartesian Trees, and Text Indexing
Data Structures for Efficient String Algorithms
Suffix Arrays on Words Paolo Ferragina1
Two-Dimensional Range Minimum Queries Amihood Amir1
Optimal String Mining under Frequency Constraints
Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE
A 2-Approximation Algorithm for Sorting by Prefix Reversals
Practical Entropy-Bounded Schemes for O(1)-Range Minimum Queries
An(other) Entropy-Bounded Compressed Suffix Tree
A New Succinct Representation of RMQ-Information and Improvements in the
Johannes Fischer Karlsruhe Institute of Technology, 76128 Karlsruhe, Germany
Space-Efficient String Mining under Frequency Constraints Johannes Fischer
Short Labels for Lowest Common Ancestors in Trees
