Improved bounds and schemes for the declustering problem
Authors:
- Benjamin DoerrBDBenjamin Doerr
- Nils HebbinghausNHNils Hebbinghaus
- Sören WerthSWSören Werth
- 1 August 2006
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 359 (1-3) , 123-132
Abstract
No abstract availableKeywords
All Related Versions
This publication has 18 references indexed in Scilit:
- From discrepancy to declusteringJournal of the ACM, 2004
- Improved Bounds and Schemes for the Declustering ProblemLecture Notes in Computer Science, 2004
- Multicolour DiscrepanciesCombinatorics, Probability and Computing, 2003
- Titan: a high-performance remote-sensing database2002
- Balanced k-coloringsDiscrete Mathematics, 2002
- From discrepancy to declustering2002
- The Cost of the Missing Bit: Communication Complexity with HelpCombinatorica, 2001
- (Almost) optimal parallel block access to range queries2000
- On Irregularities of Distribution IIJournal of the London Mathematical Society, 1999
- Disk allocation for Cartesian product files on multiple-disk systemsACM Transactions on Database Systems, 1982