A linear-space data structure for range-LCP queries in poly-logarithmic time
From MaRDI portal
Publication:5916260
DOI10.1007/978-3-319-94776-1_51zbMath1441.68021OpenAlexW2810397010MaRDI QIDQ5916260
Sharma V. Thankachan, Paniz Abedin, Yakov Nekrich, Wing-Kai Hon, Kunihiko Sadakane, Arnab Ganguly, Rahul Shah
Publication date: 4 October 2018
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-94776-1_51
Analysis of algorithms and problem complexity (68Q25) Data structures (68P05) Algorithms on strings (68W32)
Related Items (1)
This page was built for publication: A linear-space data structure for range-LCP queries in poly-logarithmic time
