Discrepancy theory and related algorithms

DOI10.4171/icm2022/169OpenAlexW4389775789MaRDI QIDQ6200209

Nikhil Bansal

Publication date: 22 March 2024

Published in: International Congress of Mathematicians (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4171/icm2022/169

zbMATH Keywords

combinatoricsalgorithmsrandom walksdiscrepancy

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Irregularities of distribution, discrepancy (11K38) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40) Discrete mathematics in relation to computer science (68Rxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sums of random Hermitian matrices and an inequality by Rudelson
• Sequences, discrepancies and applications
• Balancing vectors in the max norm
• Discrepancy of set-systems and matrices
• ``Integer-making theorems
• Balanced two-colorings of finite sets in the square. I
• Balancing games
• On a class of balancing games
• The Kadison-Singer problem in discrepancy theory.
• Interlacing families. II: Mixed characteristic polynomials and the Kadison-Singer problem
• Deterministic discrepancy minimization via the multiplicative weight update method
• A panorama of discrepancy theory
• Better Bin Packing Approximations via Discrepancy Theory
• The Erdős discrepancy problem
• On series of signed vectors and their rearrangements
• Bin Packing via Discrepancy of Permutations
• Discrepancy Without Partial Colorings
• Iterative Methods in Combinatorial Optimization
• Extensions of Pure States
• On‐line balancing of random inputs
• Constructive Discrepancy Minimization by Walking on the Edges
• On the Power of Linear Dependencies
• Six Standard Deviations Suffice
• EXTREMAL PROPERTIES OF ORTHOGONAL PARALLELEPIPEDS AND THEIR APPLICATIONS TO THE GEOMETRY OF BANACH SPACES
• On some vector balancing problems
• TIGHTER BOUNDS FOR THE DISCREPANCY OF BOXES AND POLYTOPES
• Towards a Constructive Version of Banaszczyk's Vector Balancing Theorem
• The Generic Chaining
• Efficient algorithms for discrepancy minimization in convex sets
• Discrepancy in arithmetic progressions
• The determinant bound for discrepancy is almost tight
• Algorithmic discrepancy beyond partial coloring
• On the discrepancy of random matrices with many columns
• Online vector balancing and geometric discrepancy
• On a generalization of iterated and randomized rounding
• Factorization Norms and Hereditary Discrepancy
• On the Beck‐Fiala conjecture for random set systems
• A Fourier-Analytic Approach for the Discrepancy of Random Set Systems
• On the discrepancy of random low degree set systems
• Remark concerning integer sequences
• Combinatorial Discrepancy for Boxes via the gamma_2 Norm.
• Irregularities of distribution, VII
• Discrepancy minimization via a self-balancing walk

This page was built for publication: Discrepancy theory and related algorithms