Automata, Languages and Programming
From MaRDI portal
Publication:5716834
DOI10.1007/11523468zbMath1084.68026OpenAlexW2940595899WikidataQ56656999 ScholiaQ56656999MaRDI QIDQ5716834
Uri Zwick, Inge Li Gørtz, Theis Rauhe, Mikkel Thorup, Stephen Alstrup
Publication date: 10 January 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11523468
Related Items (3)
A simple and efficient union-find-delete algorithm ⋮ The longest common substring problem ⋮ \textit{MinMax}-profiles: a unifying view of common intervals, nested common intervals and conserved intervals of \(K\) permutations
This page was built for publication: Automata, Languages and Programming
