Necklaces, convolutions, and X + Y

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

Volumn 4168 LNCS, Issue , 2006, Pages 160-171

  Bremner, David ^a   Chan, Timothy M ^b   Demaine, Erik D ^c   Erickson, Jeff ^d   Hurtado, Ferran ^e   Iacono, John ^f   Langerman, Stefan ^g   Taslakian, Perouz ^h  

^a UNIVERSITY OF NEW BRUNSWICK   (Canada)

^b UNIVERSITY OF WATERLOO   (Canada)

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^d University of Illinois at Urbana Champaign   (United States)

^e UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^f POLYTECHNIC UNIVERSITY   (United States)

^g UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

^h MCGILL UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; MATRIX ALGEBRA; PROBLEM SOLVING; VECTORS;

ANTIDIAGONALS; OPTIMAL ROTATIONS; STANDARD CONVOLUTION; SUBQUADRATIC ALGORITHMS;

ALGORITHMS;

EID: 33750724735     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11841036_17     Document Type: Conference Paper

References (30)

1. I. Baran, E. D. Demaine, and M. Pǎtraşcu. Subquadratic algorithms for 3SUM. In Proc. 9th Worksh. Algorithms & Data Structures, LNCS 3608, pp. 409-421, 2005.
2. R. Bellman and W. Karush. Mathematical programming and the maximum transform. J. SIAM, 10(3):550-567, 1962.
3. D. J. Bernstein. Fast multiplication and its applications. In J. Buhler and P. Stevenhagen, eds., Algorithmic Number Theory. Cambridge University Press. To appear.
4. M. Bussieck, H. Hassler, G. J. Woeginger, and U. T. Zimmermann. Fast algorithms for the maximum convolution problem. Oper. Res. Lett., 15(3):133-141, 1994.
5. J. Cardinal, S. Kremer, and S. Langerman. Juggling with pattern matching. Theory Comput. Syst., 39(3):425-437, 2006.
6. 3/logn) time. In Proc. 9th Worksh. Algorithms & Data Structures, LNCS 3608, pp. 318-324, 2005.
7. H. Cohn, R. Kleinberg, B. Szegedy, and C. Umans. Group-theoretic algorithms for matrix multiplication. In Proc. 46th IEEE Symp. Found. Computer Science, pp. 379-388, 2005.
8. J. Colannino, M. Damian, F. Hurtado, J. lacono, H. Meijer, S. Ramaswami, and G. Toussaint. An O(n log n)-time algorithm for the restriction scaffold assignment. J. Comput. Biol., 13(4):979-989, 2006.
9. R. Cole and R. Hariharan. Verifying candidate matches in sparse and wildcard matching. In Proc. 34th ACM Symp. Theory of Computing, pp. 592-601, 2002.
10. J. W. Cooley and J. W. Tukey. An algorithm for the machine calculation of complex Fourier series. Math. Comp., 19:297-301, 1965.
11. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms. MIT Press, second edition, 2001.
12. E. D. Demaine, J. S. B. Mitchell, and J. O'Rourke. Problem 41: Sorting X + Y (pairwise sums). In The Open Problems Project. http://cs.smith.edu/~orourke/ TOPP/P41.html.
13. E. D. Demaine and J. O'Rourke. Open problems from CCCG 2005. In Proc. 18th Canadian Conference on Computational Geometry, 2006.
14. J. M. Díaz-Báñez, G. Farigu, F. Gómez, D. Rappaport, and G. T. Toussaint. El compas flamenco: A phylogenetic analysis. In Proc. BRIDGES: Mathematical Connections in Art, Music, and Science, pp. 61-70, 2004.
15. J. Erickson. Lower bounds for linear satisfiability problems. Chic. J. Theoret. Comput. Sci., 1999.
16. P. F. Felzenszwalb and D. P. Huttenlocher. Distance transforms of sampled functions. TR2004-1963, Faculty of Computing and Information Science, Cornell Univ.
17. M. J. Fischer and M. S. Paterson. String-matching and other products. In Complexity of computation, Proc. SIAM-AMS Applied Math. Symp., 1973, pp. 113-125.
18. G. N. Frederickson and D. B. Johnson. The complexity of selection and ranking in X + Y and matrices with sorted columns. J. Comput. System Sci., 24(2):197-208, 1982.
19. M. L. Fredman. How good is the information theory bound in sorting? Theoret. Comput. Sci., 1(4):355-361, 1976.
20. M. L. Fredman. New bounds on the complexity of the shortest path problem. SIAM J. Comput., 5(1):83-89, 1976.
21. C. F. Gauss. Werke, vol. 3. Königlichen Gesellschaft der Wissenschaften, 1866.
22. M. T. Heideman, D. H. Johnson, and C. S. Burrus. Gauss and the history of the fast Fourier transform. Arch. Hist. Exact Sci., 34(3):265-277, 1985.
23. P. Indyk. Faster algorithms for string matching problems: Matching the convolution bound. In Proc. 39th Symp. Found. Computer Science, pp. 166-173, 1998.
24. P. Maragos. Differential morphology. In S. Mitra and G. Sicuranza, eds., Nonlinear Image Processing, ch. 10, pp. 289-329. Academic Press, 2000.
25. J.-J. Moreau. Inf-convolution, sous-additivité, convexité des fonctions numériques. J. Math. Pures Appl. (9), 49:109-154, 1970.
26. R. T. Rockafellar. Convex Analysis. Princeton Univ. Press, 1970.
27. W. L. Steiger and I. Streinu. A pseudo-algorithmic separation of lines from pseudolines. Infor. Process. Lett., 53(5):295-299, 1995.
28. T. Strömberg. The operation of infimal convolution. Dissertationes Math. (Rozprawy Mat.), 352:58, 1996.
29. G. Toussaint. The geometry of musical rhythm. In Proc. Japan Conference on Discrete and Computational Geometry, LNCS 3742, pp. 198-212, 2004.
30. G. T. Toussaint. A comparison of rhythmic similarity measures. In Proc. 5th International Conference on Music Information Retrieval, pp. 242-245, 2004.