The following pages link to Multicolour Discrepancies (Q4462636):
Displaying 17 items.
- Typical rounding problems (Q1884960) (← links)
- Almost envy-freeness for groups: improved bounds via discrepancy theory (Q2166776) (← links)
- Highly nonlinear functions over finite fields (Q2302588) (← links)
- Balanced partitions of vector sequences (Q2369044) (← links)
- On balanced colorings of sparse hypergraphs (Q2439128) (← links)
- Latin squares and low discrepancy allocation of two-dimensional data (Q2461769) (← links)
- Non-independent randomized rounding and coloring (Q2489958) (← links)
- Improved bounds and schemes for the declustering problem (Q2503292) (← links)
- Discrepancy of (centered) arithmetic progressions in \({\mathbb{Z}_p}\) (Q2509760) (← links)
- Discrepancies of spanning trees and Hamilton cycles (Q2668020) (← links)
- Balancing connected colourings of graphs (Q2699645) (← links)
- Maximizing coverage while ensuring fairness: a tale of conflicting objectives (Q2701386) (← links)
- (Q2857386) (← links)
- An Improved Discrepancy Approach to Declustering (Q3439141) (← links)
- Balancing sums of random vectors (Q4645029) (← links)
- Set-Codes with Small Intersections and Small Discrepancies (Q5112823) (← links)
- (Q5743405) (← links)
