scientific article; zbMATH DE number 6850407
From MaRDI portal
Publication:4607987
zbMath1403.68376arXiv1608.05100MaRDI QIDQ4607987
Publication date: 15 March 2018
Full work available at URL: https://arxiv.org/abs/1608.05100
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms (68W40) Searching and sorting (68P10) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Data structures (68P05) Randomized algorithms (68W20) Algorithms on strings (68W32)
Related Items (4)
Extracting the sparse longest common prefix array from the suffix binary search tree ⋮ Internal shortest absent word queries in constant time and linear space ⋮ Practical Performance of Space Efficient Data Structures for Longest Common Extensions. ⋮ Sampling Lower Bounds: Boolean Average-Case and Permutations
This page was built for publication:
