Mathematical Foundations of Computer Science 2004

DOI10.1007/b99679zbMath1097.68037OpenAlexW2488008928MaRDI QIDQ5311147

Benjamin Doerr, Sören Werth, Nils Hebbinghaus

Publication date: 22 August 2005

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

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Information storage and retrieval of data (68P20)

Related Items (2)

Latin squares and low discrepancy allocation of two-dimensional data ⋮ Improved bounds and schemes for the declustering problem

This page was built for publication: Mathematical Foundations of Computer Science 2004