Necklaces, Convolutions, and X + Y
Open Access
- 1 January 2006
- book chapter
- Published by Springer Nature
- p. 160-171
Abstract
No abstract availableKeywords
All Related Versions
This publication has 16 references indexed in Scilit:
- An O ( n log n )-Time Algorithm for the Restriction Scaffold Assignment ProblemJournal of Computational Biology, 2006
- Juggling with Pattern MatchingTheory of Computing Systems, 2006
- The Geometry of Musical RhythmLecture Notes in Computer Science, 2005
- A pseudo-algorithmic separation of lines from pseudo-linesInformation Processing Letters, 1995
- Fast algorithms for the maximum convolution problemOperations Research Letters, 1994
- Gauss and the history of the fast Fourier transformArchive for History of Exact Sciences, 1985
- The complexity of selection and ranking in X + Y and matrices with sorted columnsJournal of Computer and System Sciences, 1982
- How good is the information theory bound in sorting?Theoretical Computer Science, 1976
- New Bounds on the Complexity of the Shortest Path ProblemSIAM Journal on Computing, 1976
- An algorithm for the machine calculation of complex Fourier seriesMathematics of Computation, 1965