Smoothed Motion Complexity

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2832, Issue , 2003, Pages 161-171

  Damerow, Valentina ^a   Auf Der Heide, Friedhelm Meyer ^a   Räcke, Harald ^a   Scheideier, Christian ^b   Sohler, Christian ^a  

^a UNIVERSITY OF PADERBORN   (Germany)

^b Johns Hopkins University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES;

COMPLEXITY MEASURES; EXPECTED COMPLEXITY; KINETIC DATA STRUCTURE; NOISE DISTRIBUTION; RANDOM PERTURBATIONS; RANDOMIZATION; SMOOTHED ANALYSIS; WORST-CASE ANALYSIS;

RANDOM PROCESSES;

EID: 0142152744     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-39658-1_17     Document Type: Article

References (15)

1. AGARWAL, P., AND HAR-PELED, S. Maintaining approximate extent measures of moving points. In Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms (SODA) (2001), pp. 148-157.
2. BANDERIER, C., MEHLHORN, K., AND BEIER, R. Smoothed analysis of three combinatorial problems. manuscript, 2002.
3. BAREQUET, G., AND HAR-PELED, S. Efficiently approximating the minimum-volume bounding box of a point set in three dimensions. In Proceedings of the 10th ACM-SIAM Symposium on Discrete Algorithms (SODA) (1999), pp. 82-91.
4. BASCH, J., GUIBAS, L. J., AND HERSHBERGER, J. Data structures for mobile data. Journal of Algorithms 31, 1 (1999), 1-28.
5. BASCH, J., GUIBAS, L. J., AND ZHANG, L. Proximity problems on moving points. In Proceedings of the 13th Annual ACM Symposium on Computational Geometry (1997), pp. 344-351.
6. BLUM, A., AND DUNAGAN, J. Smoothed analysis of the perceptron algorithm. In Proceedings of the 13th ACM-SIAM Symposium on Discrete Algorithms (SODA) (2002), pp. 905-914.
7. GUIBAS, L. J., HERSHBERGER, J., SURI, S., AND ZHANG, L. Kinetic connectivity for unit disks. Discrete & Computational Geometry 25, 4 (2001), 591-610.
8. HAR-PELED, S. Clustering motion. In Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science (FOCS) (2001), pp. 84-93.
9. HERSHBERGER, J., AND SURI, S. Simplified kinetic connectivity for rectangles and hypercubes. In Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms (SODA) (2001), pp. 158-167.
10. KIRKPATRICK, D., SNOEYINK, J., AND SPECKMANN, B. Kinetic collision detection for simple polygons. International Journal of Computational Geometry and Applications 12, 1-2 (2002), 3-27.
11. RÉNYI, A., AND SULANKE, R. Über die konvexe Hülle von n zufâllig gewâhlten Punkten. Zentralblatt für Wahrscheinlichkeitstheorie und venvandte Gebiete 2 (1963), 75-84.
12. SANKAR, A., SPIELMAN, D., AND S. TENG. Smoothed analysis of the condition numbers and growth factors of matrices, manuscript, 2002.
13. SPIELMAN, D., AND TENG, S. Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time. In Proceedings of the 33rd ACM Symposium on Theory of Computing (STOC) (2001), pp. 296-305.
14. SPIELMAN, D., AND TENG, S. Smoothed analysis of property testing, manuscript, 2002.
15. ZHANG, L., DEVARAJAN, H., BASCH, J., AND INDYK, P. Probabilistic analysis for combinatorial functions of moving points. In Proceedings of the 13th Annual ACM Symposium on Computational Geometry (1997), pp. 442-444.