On the Comparison Complexity of the String Prefix-Matching Problem

DOI10.1006/jagm.1998.0948zbMath0912.68021OpenAlexW2088323993MaRDI QIDQ4217300

Dany Breslauer, Livio Colussi, Laura Toniolo

Publication date: 18 May 1999

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/3b60002e9dfaa8a3cad73d1dcf27820c46e47201

zbMATH Keywords

on-line prefix-matching algorithms

Mathematics Subject Classification ID

Searching and sorting (68P10) Parallel algorithms in computer science (68W10)

Related Items (2)

Validating the Knuth-Morris-Pratt failure function, fast and online ⋮ Fast prefix matching of bounded strings

This page was built for publication: On the Comparison Complexity of the String Prefix-Matching Problem