Showing 21–40 of 45 results
/ Date/ Name
Apr 1, 2014Constructive discrepancy minimization for convex setsSep 22, 2014A direct proof for Lovett's bound on the communication complexity of low rank matricesNov 11, 2013The matching polytope has exponential extension complexityMar 30, 2015A Logarithmic Additive Integrality Gap for Bin PackingSep 25, 2015A (1+epsilon)-Approximation for Makespan Scheduling with Precedence Constraints using LP HierarchiesOct 5, 2021Approximate $\mathrm{CVP}$ in time $2^{0.802 \, n}$ -- now in any norm!Sep 30, 2010Cover-Decomposition and Polychromatic NumbersNov 13, 2023Forall-exist statements in pseudopolynomial timeOct 23, 2025Excluding a Line Minor via Design Matrices and Column Number Bounds for the Circuit Imbalance MeasureJul 3, 2019Linear Size Sparsifier and the Geometry of the Operator Norm BallJul 19, 2018A Tale of Santa Claus, Hypergraphs and MatroidsAug 2, 2023Optimal Online Discrepancy MinimizationMay 5, 2026Nearly-Tight Bounds for Zonotope Containment and BeyondOct 12, 2023Stronger Coreset Bounds for Kernel Density Estimators via ChainingSep 22, 2020An Elementary Exposition of Pisier's InequalityJul 10, 2020Vector Balancing in Lebesgue SpacesJul 13, 2021Tight bounds on the Fourier growth of bounded functions on the hypercubeDec 14, 2016An Improved Deterministic Rescaling for Linear Programming AlgorithmsJan 11, 2025DiscQuant: A Quantization Method for Neural Networks Inspired by Discrepancy TheoryJul 30, 2023Polytopes with Bounded Integral Slack Matrices Have Sub-Exponential Extension Complexity