The discrepancy method: randomness and complexity

Authors:
Bernard Chazelle
Affiliations:
Princeton Univ., Princeton, NJ
Venue:
The discrepancy method: randomness and complexity
Year:
2000

Citing 0
Cited 95

Lattice approximation and linear discrepency of totally unimodular matrices

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
The power of nonmonotonicity in geometric searching

Proceedings of the eighteenth annual symposium on Computational geometry
Optimal bounds for the predecessor problem and related problems

Journal of Computer and System Sciences - STOC 1999
Approximating the Minimum Spanning Tree Weight in Sublinear Time

ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Recursive Randomized Coloring Beats Fair Dice Random Colorings

STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Balanced Coloring: Equally Easy for All Numbers of Colors?

STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Irregularities of Distribution, Derandomization, and Complexity Theory

FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
Incremental Codes

APPROX '01/RANDOM '01 Proceedings of the 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 5th International Workshop on Randomization and Approximation Techniques in Computer Science: Approximation, Randomization and Combinatorial Optimization
Geometric Searching over the Rationals

ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
Structured Randomized Rounding and Coloring

FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Shape fitting with outliers

Proceedings of the nineteenth annual symposium on Computational geometry
On conflict-free coloring of points and simple regions in the plane

Proceedings of the nineteenth annual symposium on Computational geometry
Sublinear geometric algorithms

Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Cell-probe lower bounds for the partial match problem

Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
An efficient k nearest neighbors searching algorithm for a query line

Theoretical Computer Science
Cubature formulas, discrepancy, and nonlinear approximation

Journal of Complexity
Efficient data reduction with EASE

Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
On simplifying dot maps

Computational Geometry: Theory and Applications - Special issue on computational geometry - EWCG'02
Multicolour Discrepancies

Combinatorics, Probability and Computing
Typical rounding problems

Theoretical Computer Science
Lower bounds for intersection searching and fractional cascading in higher dimension

Journal of Computer and System Sciences - STOC 2001
Algorithms for center and Tverberg points

SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Range counting over multidimensional data streams

SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
On the least median square problem

SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
The Priority R-tree: a practically efficient and worst-case optimal R-tree

SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
A strong lower bound for approximate nearest neighbor searching

Information Processing Letters
Cell-probe lower bounds for the partial match problem

Journal of Computer and System Sciences - Special issue: STOC 2003
The structure and number of global roundings of a graph

Theoretical Computer Science - Special papers from: COCOON 2003
Geometry prediction for high degree polygons

Proceedings of the 21st spring conference on Computer graphics
Improved approximation algorithms for broadcast scheduling

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Randomized incremental constructions of three-dimensional convex hulls and planar voronoi diagrams, and approximate range counting

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Finding small balanced separators

Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Locally consistent constraint satisfaction problems

Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
Online geometric reconstruction

Proceedings of the twenty-second annual symposium on Computational geometry
Non-independent randomized rounding and coloring

Discrete Applied Mathematics - Special issue: Efficient algorithms
On approximate halfspace range counting and relative epsilon-approximations

SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
A transport layer approach for improving end-to-end performance and robustness using redundant paths

ATEC '04 Proceedings of the annual conference on USENIX Annual Technical Conference
Approximate range searching in higher dimension

Computational Geometry: Theory and Applications
The priority R-tree: A practically efficient and worst-case optimal R-tree

ACM Transactions on Algorithms (TALG)
Delaunay graphs of point sets in the plane with respect to axis-parallel rectangles

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Algorithms for center and Tverberg points

ACM Transactions on Algorithms (TALG)
Online uniformity of integer points on a line

Information Processing Letters
A simpler implementation and analysis of Chazelle's soft heaps

SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Small weak epsilon-nets

Computational Geometry: Theory and Applications
Learning complexity vs communication complexity

Combinatorics, Probability and Computing
Tight Bounds for Permutation Flow Shop Scheduling

Mathematics of Operations Research
Computing hereditary convex structures

Proceedings of the twenty-fifth annual symposium on Computational geometry
On burstiness-aware search for document sequences

Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
Approximate range searching: The absolute model

Computational Geometry: Theory and Applications
The structure and number of global roundings of a graph

COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
Combinatorial and geometric problems related to digital halftoning

Proceedings of the 11th international conference on Theoretical foundations of computer vision
Tight bounds for permutation flow shop scheduling

IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
Optimal sampling from distributed streams

Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Outlier detection in transactional data

Intelligent Data Analysis
Universal ε-approximators for integrals

SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Online uniformly inserting points on grid

AAIM'10 Proceedings of the 6th international conference on Algorithmic aspects in information and management
Dominating Subsets under Projections

SIAM Journal on Discrete Mathematics
Beating the spread: time-optimal point meshing

Proceedings of the twenty-seventh annual symposium on Computational geometry
Tight lower bounds for the size of epsilon-nets

Proceedings of the twenty-seventh annual symposium on Computational geometry
Uniformly inserting points on square grid

Information Processing Letters
Approximately uniform online checkpointing

COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
The VC-dimension of SQL queries and selectivity estimation through sampling

ECML PKDD'11 Proceedings of the 2011 European conference on Machine learning and knowledge discovery in databases - Volume Part II
Deterministic discrepancy minimization

ESA'11 Proceedings of the 19th European conference on Algorithms
Ray-shooting depth: computing statistical data depth of point sets in the plane

ESA'11 Proceedings of the 19th European conference on Algorithms
On a non-monotonicity effect of similarity measures

SIMBAD'11 Proceedings of the First international conference on Similarity-based pattern recognition
Fibonacci sets and symmetrization in discrepancy theory

Journal of Complexity
Self-Improving Algorithms

SIAM Journal on Computing
On the ultimate convergence rates for isotropic algorithms and the best choices among various forms of isotropy

PPSN'06 Proceedings of the 9th international conference on Parallel Problem Solving from Nature
Computing a center-transversal line

FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
From balls and bins to points and vertices

ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
An asymptotically optimal linear-time algorithm for locally consistent constraint satisfaction problems

MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
A generalization of magic squares with applications to digital halftoning

ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Continuous sampling from distributed streams

Journal of the ACM (JACM)
Hardness of discrepancy computation and ε-net verification in high dimension

Journal of Complexity
Covering many or few points with unit disks

WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
Transaction databases, frequent itemsets, and their condensed representations

KDID'05 Proceedings of the 4th international conference on Knowledge Discovery in Inductive Databases
On generalizations of network design problems with degree bounds

IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
Computing generalized ham-sandwich cuts

Information Processing Letters
Mergeable summaries

PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
Optimal private halfspace counting via discrepancy

STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Approximating Tverberg points in linear time for any fixed dimension

Proceedings of the twenty-eighth annual symposium on Computational geometry
A New Randomized Algorithm to Approximate the Star Discrepancy Based on Threshold Accepting

SIAM Journal on Numerical Analysis
Explicit Dimension Reduction and Its Applications

SIAM Journal on Computing
A simple framework for the generalized nearest neighbor problem

SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
Cuttings for disks and axis-aligned rectangles

WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Data structures on event graphs

ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Efficient discovery of association rules and frequent itemsets through sampling with tight performance guarantees

ECML PKDD'12 Proceedings of the 2012 European conference on Machine Learning and Knowledge Discovery in Databases - Volume Part I
Efficient protocols for distributed classification and optimization

ALT'12 Proceedings of the 23rd international conference on Algorithmic Learning Theory
Sampling scattered data with Bernstein polynomials: stochastic and deterministic error estimates

Advances in Computational Mathematics
Range counting coresets for uncertain data

Proceedings of the twenty-ninth annual symposium on Computational geometry
Quality and efficiency for kernel density estimates in large data

Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
The geometry of differential privacy: the sparse and approximate cases

Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Mergeable summaries

ACM Transactions on Database Systems (TODS) - Invited papers issue
Toric algebra of hypergraphs

Journal of Algebraic Combinatorics: An International Journal
Maximum entropy summary trees

EuroVis '13 Proceedings of the 15th Eurographics Conference on Visualization

Quantified Score

Hi-index	0.00

Visualization

Abstract

This book tells the story of the discrepancy method in a few short independent vignettes. It is a varied tale which includes such topics as communication complexity, pseudo-randomness, rapidly mixing Markov chains, points on the sphere and modular forms, derandomization, convex hulls, Voronoi diagrams, linear programming and extensions, geometric sampling, VC-dimension theory minimum spanning trees, linear circuit complexity, and multidimensonal searching.