Algorithms - ESA 2003

Denied preprocessing and limited to a tiny fraction of the input, what can a computer hope to do? Surprisingly much, it turns out. A blizzard of recent results in property testing, streaming, and sublinear approximation algorithms have shown that, for a large class of problems, all but a vanishing fraction of the input data is essentially unnecessary. While grounding the discussion on a few specific examples, I will review some of the basic principles at play behind this “sublinearity” phenomenon. G. Di Battista and U. Zwick (Eds.): ESA 2003, LNCS 2832, p. 1, 2003. c © Springer-Verlag Berlin Heidelberg 2003 Authenticated Data Structures

[1]  Sivan Toledo,et al.  Applications of parametric searching in geometric optimization , 1992, SODA '92.

[2]  Pankaj K. Agarwal,et al.  Approximating extent measures of points , 2004, JACM.

[3]  Sariel Har-Peled,et al.  Approximate shape fitting via linearization , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[4]  Walter Knödel,et al.  New gossips and telephones , 1975, Discret. Math..

[5]  Dan E. Willard,et al.  Applications of the fusion tree method to computational geometry and searching , 1992, SODA '92.

[6]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

[7]  Timothy M. Chan Low-Dimensional Linear Programming with Violations , 2005, SIAM J. Comput..

[8]  J. Matoušek,et al.  On geometric optimization with few violated constraints , 1994, SCG '94.

[9]  Hadas Shachnai,et al.  On Two Class-Constrained Versions of the Multiple Knapsack Problem , 2001, Algorithmica.

[10]  Micha Sharir,et al.  Computing the Smallest K-enclosing Circle and Related Problems , 1994, Comput. Geom..

[11]  Gerard J. Chang,et al.  Set to Set Broadcasting in Communication Networks , 1992, Discret. Appl. Math..

[12]  David Liben-Nowell Gossip is synteny: incomplete gossip and an exact algorithm for syntenic distance , 2001, SODA '01.

[13]  D. Eppstein,et al.  Approximation algorithms for geometric problems , 1996 .

[14]  Dan E. Willard Searching Unindexed and Nonuniformly Generated Files in log log N Time , 1985, SIAM J. Comput..

[15]  Christos H. Papadimitriou,et al.  Computational complexity , 1993 .

[16]  Bernard Chazelle,et al.  The Discrepancy Method , 1998, ISAAC.

[17]  Raimund Seidel,et al.  Erratum to Better Lower Bounds on Detecting Affine and Spherical Degeneracies , 1993, Discret. Comput. Geom..

[18]  David Eppstein,et al.  Iterated nearest neighbors and finding minimal polytopes , 1993, SODA '93.

[19]  Jeff Erickson New Lower Bounds for Convex Hull Problems in Odd Dimensions , 1999, SIAM J. Comput..

[20]  Nicholas C. Wormald,et al.  Generating Random Regular Graphs Quickly , 1999, Combinatorics, Probability and Computing.

[21]  Sariel Har-Peled,et al.  Shape fitting with outliers , 2003, SCG '03.

[22]  Farhad Shahrokhi,et al.  The maximum concurrent flow problem , 1990, JACM.

[23]  Jirí Matousek,et al.  On Enclosing k Points by a Circle , 1995, Inf. Process. Lett..

[24]  Dana S. Richards,et al.  Generalizations of broadcasting and gossiping , 1988, Networks.

[25]  Michael Stonebraker,et al.  The Case for Shared Nothing , 1985, IEEE Database Eng. Bull..