LATIN 2004: Theoretical Informatics

DOI10.1007/b95852zbMath1196.68179arXivmath/0308234OpenAlexW2475444492MaRDI QIDQ5901650

Martin Loebl, Ji{ří} Matoušek, Marcos A. Kiwi

Publication date: 7 May 2009

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

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

Mathematics Subject Classification ID

Combinatorics on words (68R15) Combinatorial probability (60C05)

Related Items (2)

Memory-hard puzzles in the standard model with applications to memory-hard functions and resource-bounded locally decodable codes ⋮ Large deviations-based upper bounds on the expected relative length of longest common subsequences

This page was built for publication: LATIN 2004: Theoretical Informatics