The following pages link to Six Standard Deviations Suffice (Q3698810):
Displaying 50 items.
- Small subset sums (Q269528) (← links)
- A note on the discrepancy of matrices with bounded row and column sums (Q488272) (← links)
- Discrepancy, chaining and subgaussian processes (Q533745) (← links)
- Chowla's cosine problem (Q607844) (← links)
- The cycle discrepancy of three-regular graphs (Q659662) (← links)
- Semidefinite optimization in discrepancy theory (Q715251) (← links)
- Coloring the projective plane (Q922552) (← links)
- Discrepancy and signed domination in graphs and hypergraphs (Q982615) (← links)
- Balancing vectors in the max norm (Q1076635) (← links)
- Discrepancy of set-systems and matrices (Q1084393) (← links)
- Probabilistic methods (Q1091406) (← links)
- The smallest n-uniform hypergraph with positive discrepancy (Q1093653) (← links)
- On a conjecture of Kömlos about signed sums of vectors inside the sphere (Q1103624) (← links)
- Probabilistic construction of deterministic algorithms: approximating packing integer programs (Q1112724) (← links)
- Uniform dilations (Q1190124) (← links)
- Integer programming in VLSI design (Q1201818) (← links)
- Signed domination in regular graphs and set-systems (Q1306310) (← links)
- Randomization, derandomization and antirandomization: Three games (Q1331937) (← links)
- The probabilistic method yields deterministic parallel algorithms (Q1342858) (← links)
- From Erdős to algorithms (Q1344623) (← links)
- Lattice coverings and Gaussian measures of \(n\)-dimensional convex bodies (Q1355192) (← links)
- Improved upper bounds for approximation by zonotopes (Q1373005) (← links)
- Lacunary sets and function spaces with finite cotype (Q1604550) (← links)
- Sidonicity and variants of Kaczmarz's problem (Q1687896) (← links)
- Asymptotically optimal Boolean functions (Q1734702) (← links)
- Selectively balancing unit vectors (Q1747993) (← links)
- The convexification effect of Minkowski summation (Q1755914) (← links)
- A Beck-Fiala-type theorem for Euclidean norms (Q1814084) (← links)
- Typical rounding problems (Q1884960) (← links)
- Tight upper bounds for the discrepancy of half-spaces (Q1892434) (← links)
- Growing balanced covering sets (Q1981677) (← links)
- Deterministic discrepancy minimization (Q2017871) (← links)
- Gaussian discrepancy: a probabilistic relaxation of vector balancing (Q2081474) (← links)
- Upper and lower bounds for matrix discrepancy (Q2090579) (← links)
- Do flat skew-reciprocal Littlewood polynomials exist? (Q2108087) (← links)
- Almost envy-freeness for groups: improved bounds via discrepancy theory (Q2166776) (← links)
- Quantum discrepancy: a non-commutative version of combinatorial discrepancy (Q2185209) (← links)
- Four deviations suffice for rank 1 matrices (Q2213767) (← links)
- Flat Littlewood polynomials exist (Q2215807) (← links)
- Highly nonlinear functions (Q2260795) (← links)
- Highly nonlinear functions over finite fields (Q2302588) (← links)
- The remote set problem on lattices (Q2353188) (← links)
- On the \(L_{2}\)-discrepancy (Q2381825) (← links)
- Probabilistic existence of regular combinatorial structures (Q2400828) (← links)
- Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs (Q2422241) (← links)
- A note on norms of signed sums of vectors (Q2664119) (← links)
- Algorithmic pure states for the negative spherical perceptron (Q2675362) (← links)
- Luzin's problem on Fourier convergence and homeomorphisms (Q2685180) (← links)
- A remark on Kashin's discrepancy argument and partial coloring in the Komlós conjecture (Q2694631) (← links)
- Maximizing coverage while ensuring fairness: a tale of conflicting objectives (Q2701386) (← links)
