Combined data structure for previous- and next-smaller-values
type: Item
instance of: scholarly article
title: Combined data structure for previous- and next-smaller-values
zbMATH Open document ID: 1215.68084
author: Johannes Fischer
published in: Theoretical Computer Science
publication date: 2011-05-10T00:00:00Z
Mathematics Subject Classification ID: 68P05
zbMATH DE Number: 5886226
zbMATH Keywords: succinct data structures
zbMATH Keywords: compressed text indexing
MaRDI profile type: Publication
full work available at URL: j.tcs.2011.01.036
OpenAlex ID: W2105634337
cites work: Representing trees of higher degree
cites work: Optimal Doubly Logarithmic Parallel Algorithms Based On Finding All Nearest Smaller Values
cites work: A Uniform Approach Towards Succinct Representation of Trees
cites work: Optimal Succinctness for Range Minimum Queries
cites work: Wee LCP
cites work: Faster entropy-bounded compressed suffix trees
cites work: Succinct ordinal trees with level-ancestor queries
cites work: Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
cites work: Succinct Ordinal Trees Based on Tree Covering
cites work: Waiting patterns for a printer
cites work: Succinct representation of balanced parentheses and static trees
cites work: Space efficient suffix trees
cites work: Compressed representations of sequences and full-text indexes
cites work: A Compressed Enhanced Suffix Array Supporting Fast String Matching
cites work: Succinct Indexable Dictionaries with Applications to Encoding $k$-ary Trees, Prefix Sums and Multisets
cites work: Fully-Compressed Suffix Trees
cites work: Compressed suffix trees with full functionality
cites work: Q5417613
cites work: Q4236280
DOI: 10.1016/J.TCS.2011.01.036
description: scientific article; zbMATH DE number 5886226