In this paper we present an approach to multi-objective exploration of the mapping space of
a mesh-based network-on-chip architecture. Based on evolutionary computing techniques …

We consider the problem of finding a low discrepancy coloring for sparse set systems where
each element lies in at most t sets. We give an efficient algorithm that finds a coloring with …

Motivated by problems in controlled experiments, we study the discrepancy of random
matrices with continuous entries where the number of columns $ n $ is much larger than the …

A recent approach to the Beck–Fiala conjecture, a fundamental problem in combinatorics,
has been to understand when random integer matrices have constant discrepancy. We give …

We study the critical window of the symmetric binary perceptron, or equivalently, random
combinatorial discrepancy. Consider the problem of finding a±1-valued vector σ satisfying …

A well-known result of Banaszczyk in discrepancy theory concerns the prefix discrepancy
problem (also known as the signed series problem): given a sequence of $ T $ unit vectors …

We study hypergraph discrepancy in two closely related random models of hypergraphs on
$ n $ vertices and $ m $ hyperedges. The first model, $\mathcal {H} _1 $, is when every …

One of the prominent open problems in combinatorics is the discrepancy of set systems
where each element lies in at most t sets. The Beck-Fiala conjecture suggests that the right …

Motivated by the celebrated Beck‐Fiala conjecture, we consider the random setting where
there are n elements and m sets and each element lies in t randomly chosen sets. In this …

Motivated by the Komlós conjecture in combinatorial discrepancy, we study the discrepancy
of random matrices with m rows and n independent columns drawn from a bounded lattice …