Necklaces, Convolutions, and X + Y-Reference-Cited by-同舟云学术

Necklaces, Convolutions, and X + Y

Published:2006 Issue: Volume: Page:160-171
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Bremner David,Chan Timothy M.,Demaine Erik D.,Erickson Jeff,Hurtado Ferran,Iacono John,Langerman Stefan,Taslakian Perouz

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/11841036_17.pdf

Reference30 articles.

1. Lecture Notes in Computer Science;I. Baran,2005

2. Bellman, R., Karush, W.: Mathematical programming and the maximum transform. J. SIAM 10(3), 550–567 (1962)

3. Bernstein, D.J.: Fast multiplication and its applications. In: Buhler, J., Stevenhagen, P. (eds.) Algorithmic Number Theory. Cambridge University Press, Cambridge (to appear)

4. Bussieck, M., Hassler, H., Woeginger, G.J., Zimmermann, U.T.: Fast algorithms for the maximum convolution problem. Oper. Res. Lett. 15(3), 133–141 (1994)

5. Cardinal, J., Kremer, S., Langerman, S.: Juggling with pattern matching. Theory Comput. Syst. 39(3), 425–437 (2006)

Cited by 18 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Structured $$(\min ,+)$$-convolution and its applications for the shortest/closest vector and nonlinear knapsack problems;Optimization Letters;2023-05-27

2. Faster min-plus product for monotone instances;Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing;2022-06-09

3. Selection on X1 + X2 + ⋯ + Xm via Cartesian product trees;PeerJ Computer Science;2021-04-28

4. On Problems Equivalent to (min,+)-Convolution;ACM Transactions on Algorithms;2019-01-25

5. Linear Pseudo-Polynomial Factor Algorithm for Automaton Constrained Tree Knapsack Problem;WALCOM: Algorithms and Computation;2018-12-21