Computing and Combinatorics

DOI10.1007/11533719zbMath1128.68543OpenAlexW4376561447MaRDI QIDQ5716944

David Liben-Nowell, An Zhu, Erik Vee

Publication date: 11 January 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11533719

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Nonnumerical algorithms (68W05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (2)

Computing the longest common almost-increasing subsequence ⋮ On the monotonicity of a data stream

This page was built for publication: Computing and Combinatorics