Managing unbounded-length keys in comparison-driven data structures with applications to online indexing
type: Item
instance of: scholarly article
zbMATH Open document ID: 1305.68066
DOI: 10.1137/110836377
author: Amihood Amir
author: Gianni Franceschini
author: Roberto Grossi
author: Tsvi Kopelowitz
author: Noa Lewenstein
author: Moshe Lewenstein
published in: SIAM Journal on Computing
publication date: 2014-11-14T00:00:00Z
full work available at URL: https://arxiv.org/abs/1306.0406
Mathematics Subject Classification ID: 68P05
Mathematics Subject Classification ID: 68P10
zbMATH DE Number: 6369511
zbMATH Keywords: strings
zbMATH Keywords: search trees
zbMATH Keywords: text indexing
zbMATH Keywords: suffix tree
zbMATH Keywords: suffix sorting
MaRDI profile type: Publication
OpenAlex ID: W2039208882
arXiv ID: 1306.0406
title: Managing unbounded-length keys in comparison-driven data structures with applications to online indexing
description: scientific article; zbMATH DE number 6369511