An Improved Discrepancy Approach to Declustering

DOI10.1016/J.ENDM.2004.03.026zbMath1152.68318OpenAlexW2071827320MaRDI QIDQ3439141

Benjamin Doerr, Sören Werth, Nils Hebbinghaus

Publication date: 29 May 2007

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2004.03.026

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Mathematical problems of computer architecture (68M07)

Cites Work

• Unnamed Item
• Unnamed Item
• Point sets and sequences with small discrepancy
• Asymptotically optimal declustering schemes for 2-dim range queries.
• Multicolour Discrepancies
• Remark concerning integer sequences
• From discrepancy to declustering
• Irregularities of distribution, VII

This page was built for publication: An Improved Discrepancy Approach to Declustering