scientific article; zbMATH DE number 7651096

DOI10.4230/LIPICS.CPM.2020.5MaRDI QIDQ5874430FDOQ5874430

Authors: Stav Ben-Nun, Shay Golan, Tomasz Kociumaka, Matan Kraus 

Publication date: 7 February 2023

Full work available at URL: https://arxiv.org/abs/2003.02016

Title of this publication is not available (Why is that?)

zbMATH Keywords

periodicitylongest common substringlocal consistencytime-space tradeoff

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Cited In (5)

• Complexity of substring search in a set of strings
• Algorithms – ESA 2005
• Longest property-preserved common factor: a new string-processing framework
• Near-optimal quantum algorithms for string problems
• Sparse suffix and LCP array: simple, direct, small, and fast

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5874430)