Sciweavers

EATCS
2000
67views more  EATCS 2000»
13 years 7 months ago
Low-Discrepancy Sets For High-Dimensional Rectangles: A Survey
A sub-area of discrepancy theory that has received much attention in computer science recently, is that of explicit constructions of low-discrepancy point sets for various types o...
A. Srinivasan
CORR
2006
Springer
120views Education» more  CORR 2006»
13 years 7 months ago
Improved Bounds and Schemes for the Declustering Problem
Abstract. The declustering problem is to allocate given data on parallel working storage devices in such a manner that typical requests find their data evenly distributed among the...
Benjamin Doerr, Nils Hebbinghaus, Sören Werth
DM
2010
118views more  DM 2010»
13 years 7 months ago
Discrepancy and signed domination in graphs and hypergraphs
For a graph G, a signed domination function of G is a two-colouring of the vertices of G with colours +1 and
Anush Poghosyan, Vadim E. Zverovich
RANDOM
1999
Springer
13 years 11 months ago
Approximation of Multi-color Discrepancy
Abstract. In this article we introduce (combinatorial) multi{color discrepancy and generalize some classical results from 2{color discrepancy theory to ccolors. We give a recursive...
Benjamin Doerr, Anand Srivastav