Six Standard Deviations Suffice
From MaRDI portal
Recommendations
Cites work
Cited in
(only showing first 100 items - show all)- Balancing vectors in the max norm
- Discrepancy of set-systems and matrices
- Probabilistic methods
- The smallest n-uniform hypergraph with positive discrepancy
- On a conjecture of Kömlos about signed sums of vectors inside the sphere
- Probabilistic construction of deterministic algorithms: approximating packing integer programs
- Uniform dilations
- Integer programming in VLSI design
- Signed domination in regular graphs and set-systems
- Randomization, derandomization and antirandomization: Three games
- The probabilistic method yields deterministic parallel algorithms
- From Erdős to algorithms
- Lattice coverings and Gaussian measures of n-dimensional convex bodies
- Improved upper bounds for approximation by zonotopes
- Lacunary sets and function spaces with finite cotype
- Sidonicity and variants of Kaczmarz's problem
- Asymptotically optimal Boolean functions
- Selectively balancing unit vectors
- The convexification effect of Minkowski summation
- A Beck-Fiala-type theorem for Euclidean norms
- Typical rounding problems
- Tight upper bounds for the discrepancy of half-spaces
- Growing balanced covering sets
- Deterministic discrepancy minimization
- Gaussian discrepancy: a probabilistic relaxation of vector balancing
- Upper and lower bounds for matrix discrepancy
- Do flat skew-reciprocal Littlewood polynomials exist?
- Almost envy-freeness for groups: improved bounds via discrepancy theory
- Quantum discrepancy: a non-commutative version of combinatorial discrepancy
- Four deviations suffice for rank 1 matrices
- Flat Littlewood polynomials exist
- Highly nonlinear functions
- Highly nonlinear functions over finite fields
- The remote set problem on lattices
- On the \(L_{2}\)-discrepancy
- Probabilistic existence of regular combinatorial structures
- Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs
- A note on norms of signed sums of vectors
- Algorithmic pure states for the negative spherical perceptron
- Luzin's problem on Fourier convergence and homeomorphisms
- A remark on Kashin's discrepancy argument and partial coloring in the Komlós conjecture
- Small subset sums
- Maximizing coverage while ensuring fairness: a tale of conflicting objectives
- Multi-color discrepancies
- Better bin packing approximations via discrepancy theory
- On series of signed vectors and their rearrangements
- Constructive Discrepancy Minimization for Convex Sets
- On-line balancing of random inputs
- Constructive discrepancy minimization by walking on the edges
- scientific article; zbMATH DE number 4152425 (Why is no real title available?)
- scientific article; zbMATH DE number 15503 (Why is no real title available?)
- Quasi‐random 2‐ colorings of point sets
- On Polynomials with Low Peak Signal to Power (L ∞ to L 2 Norm) Ratios and Theorems of Kashin and Spencer
- scientific article; zbMATH DE number 1354122 (Why is no real title available?)
- On Nonnegative Cosine Polynomials with Nonnegative Integral Coefficients
- Siegel's lemma is sharp
- An algorithm for Komlós conjecture matching Banaszczyk's bound
- Discrepancy in arithmetic progressions
- A note on the discrepancy of matrices with bounded row and column sums
- The complexity of differential privacy
- Constructive discrepancy minimization with hereditary L2 guarantees
- Norms of weighted sums of log-concave random vectors
- A greedy algorithm for quantizing neural networks
- The set splittability problem
- Algorithmic aspects of combinatorial discrepancy
- Discrepancy, chaining and subgaussian processes
- An improvement of the Beck-Fiala theorem
- The entropy rounding method in approximation algorithms
- A size-sensitive discrepancy bound for set systems of bounded primal shatter dimension
- Sparse recovery properties of discrete random matrices
- The discrepancy of random rectangular matrices
- Vector balancing in Lebesgue spaces
- Chowla's cosine problem
- Algorithmic obstructions in the random number partitioning problem
- Critical window of the symmetric perceptron
- Homeomorphisms and Fourier expansion
- Discrepancy theory and related algorithms
- On -modular integer linear problems in the canonical form and equivalent problems
- Faster algorithms for sparse ILP and hypergraph multi-packing/multi-cover problems
- The cycle discrepancy of three-regular graphs
- Discrepancy and sparsity
- Balancing Covariates in Randomized Experiments with the Gram–Schmidt Walk Design
- On the concentration of Gaussian Cayley matrices
- A spectral bound on hypergraph discrepancy
- A new lower bound for multicolor discrepancy with applications to fair division
- Revisit the partial coloring method: prefix spencer and sampling
- An optimal sparsification lemma for low-crossing matchings and its applications to discrepancy and approximations
- Average-case matrix discrepancy: satisfiability bounds
- Space complexity of Euclidean clustering
- On list extensions of the majority edge colourings
- Optimal approximation of zonoids and uniform approximation by shallow neural networks
- Weaver's discrepancy for Gaussian random vectors
- Random partitions and edge-disjoint Hamiltonian cycles
- Smoothed analysis of the Komlós conjecture: Rademacher noise
- Semidefinite optimization in discrepancy theory
- From tcs to learning theory (invited paper)
- Overlap gap and computational thresholds in the square wave perceptron
- Online makespan scheduling under scenarios
- Discrepancy minimization via a self-balancing walk
- On the discrepancy of coloring finite sets
This page was built for publication: Six Standard Deviations Suffice
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3698810)
