THE UNIVERSITY OF CHICAGO SPHERICAL DISCREPANCY A DISSERTATION SUBMITTED TO THE FACULTY OF THE DIVISION OF THE PHYSICAL SCIENCES IN CANDIDACY FOR THE DEGREE OF MASTER OF SCIENCE DEPARTMENT OF COMPUTER SCIENCE BY CHRIS JONES

No abstract is available for this paper.

• Publication year

  2019

• Venue

  Unknown venue

• Publication date

  Unknown publication date

• Fields of study

  Not labeled

• Identifiers

  No identifiers available.

• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Spherical Discrepancy Minimization and Algorithmic Lower Bounds for Covering the Sphere

  2019cited by this paper
• High-Dimensional Statistics

  2019cited by this paper
• On kissing numbers and spherical codes in high dimensions

  2018cited by this paper
• The Gram-Schmidt walk: a cure for the Banaszczyk blues

  2017cited by this paper
• Deterministic Discrepancy Minimization via the Multiplicative Weight Update Method

  2016cited by this paper
• An Algorithm for Komlós Conjecture Matching Banaszczyk's Bound

  2016cited by this paper
• Algorithmic discrepancy beyond partial coloring

  2016cited by this paper
• Weak Decoupling, Polynomial Folds and Approximate Optimization over the Sphere

  2016cited by this paper
• Towards a Constructive Version of Banaszczyk's Vector Balancing Theorem

  2016cited by this paper
• A survey on the kissing numbers

  2015cited by this paper
• Constructive Discrepancy Minimization for Convex Sets

  2014cited by this paper
• Efficient algorithms for discrepancy minimization in convex sets

  2014cited by this paper
• Wiley Series in Discrete Mathematics and Optimization

  2014cited by this paper
• The Komlos Conjecture Holds for Vector Colorings

  2013cited by this paper
• The Multiplicative Weights Update Method: a Meta-Algorithm and Applications

  2012cited by this paper
• Constructive Discrepancy Minimization by Walking on the Edges

  2012cited by this paper
• Semidefinite optimization in discrepancy theory

  2012cited by this paper
• Concise Formulas for the Area and Volume of a Hyperspherical Cap

  2011cited by this paper
• Spherical coverage verification

  2011cited by this paper
• Tight hardness results for minimizing discrepancy

  2011cited by this paper
• Constructive Algorithms for Discrepancy Minimization

  2010cited by this paper
• Explicit construction of a small epsilon-net for linear threshold functions

  2009cited by this paper
• Computing the arrangement of circles on a sphere, with applications in structural biology

  2009cited by this paper
• Max cut and the smallest eigenvalue

  2008cited by this paper
• Asymptotic Distribution of Coordinates on High Dimensional Spheres

  2007cited by this paper
• A dozen de Finetti-style results in search of a theory

  2005cited by this paper
• Finite Packing and Covering

  2004cited by this paper
• Local covering optimality of lattices: Leech lattice versus root lattice E8

  2004cited by this paper
• Clustering with qualitative information

  2003cited by this paper
• Covering the Sphere by Equal Spherical Balls

  2003cited by this paper
• Integer sequences and semidefinite programming

  2000cited by this paper
• The Discrepancy Method

  1998cited by this paper
• BALL PACKINGS IN SPACES OF CONSTANT CURVATURE AND THE SIMPLICIAL DENSITY FUNCTION

  1998cited by this paper
• Asymptotic Volume Formulae and Hyperbolic Ball Packing

  1997cited by this paper
• Gadgets, approximation, and linear programming

  1996cited by this paper
• Six standard deviations suffice

  1985cited by this paper
• Limit theorems for uniform distributions on spheres in high-dimensional euclidean spaces

  1982cited by this paper
• Packing of spheres in spaces of constant curvature

  1978cited by this paper
• Rational Chebyshev approximations for the inverse of the error function

  1976cited by this paper
• Covering space with equal spheres

  1959cited by this paper
• The Packing of Equal Spheres

  1958cited by this paper

• No citing papers are available for this paper.