scientific article
From MaRDI portal
Publication:2762514
zbMath0976.68594MaRDI QIDQ2762514
Torben Hagerup, Torsten Tholey
Publication date: 9 January 2002
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2010/20100317
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
space complexityalgorithms and data structurescomputational and structural complexityperfect hashingsparse tables
Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Nonnumerical algorithms (68W05)
Related Items (15)
Compressed string dictionary search with edit distance one ⋮ Nearly Optimal Static Las Vegas Succinct Dictionary ⋮ Minimal and Monotone Minimal Perfect Hash Functions ⋮ Succinct encoding of arbitrary graphs ⋮ Flash memory efficient LTL model checking ⋮ Worst-case efficient single and multiple string matching on packed texts in the word-RAM model ⋮ Succinct Representations of Arbitrary Graphs ⋮ Worst Case Efficient Single and Multiple String Matching in the RAM Model ⋮ Dynamic dictionaries for multisets and counting filters with constant time operations ⋮ Distribution-aware compressed full-text indexes ⋮ Unnamed Item ⋮ Faster and Space-Optimal Edit Distance “1” Dictionary ⋮ Fast scalable construction of ([compressed static | minimal perfect hash) functions] ⋮ Space-efficient substring occurrence estimation ⋮ Linear-space data structures for range frequency queries on arrays and trees
This page was built for publication:
