Improved bounds and schemes for the declustering problem
From MaRDI portal
Publication:2503292
DOI10.1016/j.tcs.2006.02.016zbMath1097.68104OpenAlexW2024850988MaRDI QIDQ2503292
Nils Hebbinghaus, Sören Werth, Benjamin Doerr
Publication date: 14 September 2006
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2006.02.016
Related Items
Cites Work
- Point sets and sequences with small discrepancy
- The cost of the missing bit: Communication complexity with help
- Asymptotically optimal declustering schemes for 2-dim range queries.
- Disk allocation for Cartesian product files on multiple-disk systems
- On Irregularities of Distribution II
- Multicolour Discrepancies
- Mathematical Foundations of Computer Science 2004
- From discrepancy to declustering
- Irregularities of distribution, VII
- On irregularities of distribution
- Geometric discrepancy. An illustrated guide
- Unnamed Item
- Unnamed Item
- Unnamed Item