The following pages link to Six Standard Deviations Suffice (Q3698810):
Displayed 43 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)
- 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)
- 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)
- Deterministic discrepancy minimization (Q2017871) (← links)
- Highly nonlinear functions (Q2260795) (← links)
- The remote set problem on lattices (Q2353188) (← links)
- On the \(L_{2}\)-discrepancy (Q2381825) (← links)
- Probabilistic existence of regular combinatorial structures (Q2400828) (← links)
- (Q2741471) (← links)
- Better Bin Packing Approximations via Discrepancy Theory (Q2816297) (← links)
- On series of signed vectors and their rearrangements (Q2884006) (← links)
- Constructive Discrepancy Minimization for Convex Sets (Q2968153) (← links)
- Approximation-Friendly Discrepancy Rounding (Q3186517) (← links)
- Constructive Discrepancy Minimization by Walking on the Edges (Q3449569) (← links)
- Quasi‐random 2‐ colorings of point sets (Q3977082) (← links)
- On Polynomials with Low Peak Signal to Power (<i>L</i> <sub>∞</sub> to <i>L</i> <sub>2</sub> Norm) Ratios and Theorems of Kashin and Spencer (Q4012599) (← links)
- On Nonnegative Cosine Polynomials with Nonnegative Integral Coefficients (Q4281751) (← links)
- Discrepancy in arithmetic progressions (Q4874236) (← links)
- Algorithmic Aspects of Combinatorial Discrepancy (Q5264196) (← links)
- An Improvement of the Beck–Fiala Theorem (Q5366896) (← links)
- A Size-Sensitive Discrepancy Bound for Set Systems of Bounded Primal Shatter Dimension (Q5743609) (← links)