Finding range minima in the middle: approximations and applications
type: Item
instance of: scholarly article
title: Finding range minima in the middle: approximations and applications
zbMATH Open document ID: 1205.68493
author: Johannes Fischer
author: Volker Heun
published in: Mathematics in Computer Science
publication date: 2011-02-19T00:00:00Z
Mathematics Subject Classification ID: 68W05
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 68R05
zbMATH DE Number: 5853511
zbMATH Keywords: range minimum query
zbMATH Keywords: succinct data structure
zbMATH Keywords: Cartesian tree
zbMATH Keywords: ballot number
zbMATH Keywords: text indexing
zbMATH Keywords: suffix tree
zbMATH Keywords: suffix array
MaRDI profile type: Publication
full work available at URL: s11786-009-0007-8
OpenAlex ID: W2088521838
cites work: Replacing suffix trees with enhanced suffix arrays
cites work: Nearest common ancestors: a survey and a new algorithm for a distributed environment
cites work: Lowest common ancestors in trees and directed acyclic graphs
cites work: Recursive Star-Tree Parallel Data Structure
cites work: Suffix Arrays on Words
cites work: Compressed representations of sequences and full-text indexes
cites work: Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE
cites work: A New Succinct Representation of RMQ-Information and Improvements in the Enhanced Suffix Array
cites work: An(other) Entropy-Bounded Compressed Suffix Tree
cites work: Super ballot numbers
cites work: Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
cites work: String Processing and Information Retrieval
cites work: Combinatorial Pattern Matching
cites work: Constructing suffix arrays in linear time
cites work: An analysis of the Burrows—Wheeler transform
cites work: Waiting patterns for a printer
cites work: Succinct Indexable Dictionaries with Applications to Encoding $k$-ary Trees, Prefix Sums and Multisets
cites work: Compressed suffix trees with full functionality
cites work: Succinct data structures for flexible text retrieval systems
cites work: Q5417613
cites work: A unifying look at data structures
DOI: 10.1007/S11786-009-0007-8
description: scientific article; zbMATH DE number 5853511