Necklaces, Convolutions, and X+Y
Open Access
- 28 December 2012
- journal article
- research article
- Published by Springer Nature in Algorithmica
- Vol. 69 (2) , 294-314
Abstract
No abstract availableKeywords
All Related Versions
This publication has 20 references indexed in Scilit:
- More Algorithms for All-Pairs Shortest Paths in Weighted GraphsSIAM Journal on Computing, 2010
- NECKLACE SWAP PROBLEM FOR RHYTHMIC SIMILARITY MEASURESInternational Journal of Computational Methods, 2008
- All-Pairs Shortest Paths with Real Weights in O(n 3/log n) TimeAlgorithmica, 2007
- Subquadratic Algorithms for 3SUMAlgorithmica, 2007
- Self-normalised Distance with Don’t Cares2007
- Algorithms for Computing Geometric Measures of Melodic SimilarityComputer Music Journal, 2006
- Juggling with Pattern MatchingTheory of Computing Systems, 2006
- Fast algorithms for the maximum convolution problemOperations Research Letters, 1994
- Time bounds for selectionJournal of Computer and System Sciences, 1973
- Mathematical Programming and the Maximum TransformJournal of the Society for Industrial and Applied Mathematics, 1962