Self-improving algorithms

SIAM Journal on Computing

Volumn 40, Issue 2, 2011, Pages 350-375

  Ailon, Nir ^a   Chazelle, Bernard ^b   Clarkson, Kenneth L ^c   Liu, Ding ^b   Mulzer, Wolfgang ^b   Seshadhri, C ^c  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b Princeton University   (United States)

^c IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

Average case analysis; Delaunay triangulation; Low entropy; Sorting

Indexed keywords

AVERAGE-CASE ANALYSIS; DELAUNAY TRIANGULATION; LOW ENTROPY; PLANAR POINT SETS; PRODUCT TYPES; RUNNING TIME; STATIONARY REGIME; TRAINING PHASE; UNKNOWN INPUTS;

OPTIMIZATION; TRIANGULATION;

ALGORITHMS;

EID: 79957513990     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/090766437     Document Type: Article

References (46)

1. P. Afshani, J. Barbay, and T. M. Chan, Instance-optimal geometric algorithms, in Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 2009, pp. 129-138.
2. P. Agarwal and J. Erickson, Geometric range searching and its relatives, in Advances in Discrete and Computational Geometry, Contemp. Math. 223, AMS, Providence, RI, 1998, pp. 1-56.
3. A. Aggarwal, L. J. Guibas, J. Saxe, and P. W. Shor, A linear-time algorithm for computing the Voronoi diagram of a convex polygon, Discrete Comput. Geom., 4 (1989), pp. 591-604.
4. S. Albers and M. Mitzenmacher, Average case analyses of list update algorithms, with applications to data compression, Algorithmica, 21 (1998), pp. 312-329. (Pubitemid 128664026)
5. S. Albers and J. Westbrook, Self-organizing data structures, in Online Algorithms (Schloss Dagstuhl, 1996), Lecture Notes in Comput. Sci. 1442, Springer-Verlag, Berlin, 1998, pp. 13- 51. (Pubitemid 128123711)
6. B. Allen and I. Munro, Self-organizing binary search trees, J. ACM, 25 (1978), pp. 526-535.
7. N. Alon and J. H. Spencer, The Probabilistic Method, 2nd ed., Wiley-Interscience Series in Discrete Mathematics and Optimization, Wiley-Interscience, New York, 2000.
8. S. Ar, B. Chazelle, and A. Tal, Self-customized BSP trees for collision detection, Comput. Geom. Theory Appl., 15 (2000), pp. 91-102.
9. S. Arora and B. Barak, Computational Complexity: A Modern Approach, Cambridge University Press, Cambridge, UK, 2009.
10. S. Arya, T. Malamatos, D. M. Mount, and K. C. Wong, Optimal expected-case planar point location, SIAM J. Comput., 37 (2007), pp. 584-610. (Pubitemid 351584858)
11. J. L. Bentley and C. C. McGeoch, Amortized analyses of self-organizing sequential search heuristics, Comm. ACM, 28 (1985), pp. 404-411.
12. M. de Berg, O. Cheong, M. van Kreveld, and M. Overmars, Computational Geometry: Algorithms and Applications, 3rd ed., Springer-Verlag, Berlin, 2008.
13. J. R. Bitner, Heuristics that dynamically organize data structures, SIAM J. Comput., 8 (1979), pp. 82-110.
14. J.-D. Boissonnat and M. Yvinec, Algorithmic Geometry, Cambridge University Press, Cambridge, UK, 1998.
15. A. Borodin and R. El-Yaniv, Online Computation and Competitive Analysis, Cambridge University Press, Cambridge, UK, 1998.
16. K. Buchin and W. Mulzer, Delaunay triangulations in O(sort(n)) time and more, in Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 2009, pp. 139-148.
17. 2O(vlg lg n) time, in Proceedings of the 39th Annual ACM Symposium on Theory of Computing (STOC), 2007, pp. 31-39.
18. T. M. Chan and M. Pǎtraşcu, Transdichotomous results in computational geometry, I: Point location in sublogarithmic time, SIAM J. Comput., 39 (2009), pp. 703-729.
19. B. Chazelle, An optimal algorithm for intersecting three-dimensional convex polyhedra, SIAM J. Comput., 21 (1992), pp. 671-696.
20. B. Chazelle, The Discrepancy Method, Cambridge University Press, Cambridge, UK, 2000.
21. B. Chazelle, O. Devillers, F. Hurtado, M. Mora, V. Sacristán, and M. Teillaud, Splitting a Delaunay triangulation in linear time, Algorithmica, 34 (2002), pp. 39-46.
22. B. Chazelle and W. Mulzer, Computing hereditary convex structures, in Proceedings of the 25th Annual ACM Symposium on Computational Geometry (SoCG), 2009, pp. 61-70.
23. B. Chazelle and W. Mulzer, Markov incremental constructions, Discrete Comput. Geom., 42 (2009), pp. 399-420.
24. K. L. Clarkson, A randomized algorithm for closest-point queries, SIAM J. Comput., 17 (1988), pp. 830-847.
25. K. L. Clarkson and P. W. Shor, Applications of random sampling in computational geometry, II, Discrete Comput. Geom., 4 (1989), pp. 387-421.
26. K. L. Clarkson and K. Varadarajan, Improved approximation algorithms for geometric set cover, Discrete Comput. Geom., 37 (2007), pp. 43-58.
27. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms, 3rd ed., MIT Press, Cambridge, MA, 2009.
28. T. M. Cover and J. A. Thomas, Elements of Information Theory, 2nd ed., Wiley-Interscience, New York, 2006.
29. H. Edelsbrunner and E. P. Mücke, Simulation of simplicity: A technique to cope with degenerate cases in geometric algorithms, ACM Trans. Graph., 9 (1990), pp. 66-104. (Pubitemid 20686102)
30. V. Estivill-Castro and D. Wood, A survey of adaptive sorting algorithms, ACM Comput. Surv., 24 (1992), pp. 441-476.
31. M. L. Fredman, How good is the information theory bound in sorting?, Theoret. Comput. Sci., 1 (1975/76), pp. 355-361.
32. G. H. Gonnet, J. I. Munro, and H. Suwanda, Exegesis of self-organizing linear search, SIAM J. Comput., 10 (1981), pp. 613-637.
33. Y. Han, Deterministic sorting in O(n log log n) time and linear space, J. Algorithms, 50 (2004), pp. 96-105.
34. Y. Han and M. Thorup, Integer sorting in O(nvlog log n) expected time and linear space, in Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science (FOCS), 2002, pp. 135-144.
35. J. H. Hester and D. S. Hirschberg, Self-organizing linear search, ACM Comput. Surv., 17 (1985), pp. 295-311.
36. D. G. Kirkpatrick, Efficient computation of continuous skeletons, in Proceedings of the 20th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 1979, pp. 18-27.
37. D. T. Lee, On κ-nearest neighbor Voronoi diagrams in the plane, IEEE Trans. Comput., 31 (1982), pp. 478-487.
38. J. Matoušek, Reporting points in halfspaces, Comput. Geom. Theory Appl., 2 (1992), pp. 169- 186.
39. J. Matoušek, R. Seidel, and E. Welzl, How to net a lot with little: Small ε-nets for disks and halfspaces, in Proceedings of the 6th Annual ACM Symposium on Computational Geometry (SoCG), 1990, pp. 16-22. (Pubitemid 20728474)
40. J. McCabe, On serial files with relocatable records, Operations Res., 13 (1965), pp. 609-618.
41. K. Mehlhorn, Data Structures and Algorithms 1: Sorting and Searching, EATCS Monographs on Theoretical Computer Science, Springer-Verlag, Berlin, 1984.
42. R. Motwani and P. Raghavan, Randomized Algorithms, Cambridge University Press, Cambridge, UK, 1995.
43. E. Pyrga and S. Ray, New existence proofs for ε-nets, in Proceedings of the 24th Annual ACM Symposium on Computational Geometry (SoCG), 2008, pp. 199-207.
44. R. Rivest, On self-organizing sequential search heuristics, Comm. ACM, 19 (1976), pp. 63-67.
45. D. D. Sleator and R. E. Tarjan, Amortized efficiency of list update and paging rules, Comm. ACM, 28 (1985), pp. 202-208.
46. D. D. Sleator and R. E. Tarjan, Self-adjusting binary search trees, J. ACM, 32 (1985), pp. 652-686.