Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

Faster Range LCP Queries

From MaRDI portal
Publication:2856589
Jump to:navigation, search

DOI10.1007/978-3-319-02432-5_29zbMath1442.68040OpenAlexW333656959MaRDI QIDQ2856589

Rahul Shah, Manish Patil, Sharma V. Thankachan

Publication date: 29 October 2013

Published in: String Processing and Information Retrieval (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-02432-5_29



Mathematics Subject Classification ID

Data structures (68P05)


Related Items (2)

Computing minimal and maximal suffixes of a substring ⋮ A linear-space data structure for range-LCP queries in poly-logarithmic time







This page was built for publication: Faster Range LCP Queries

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2856589&oldid=15792651"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
This page was last edited on 3 February 2024, at 19:23.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki