Make it Practical: A Generic Linear-Time Algorithm for Solving Maximum-Weightsum Problems (2000)

Cached

Download Links

by Isao Sasano , Zhenjiang Hu , Masato Takeichi , Mizuhito Ogawa
Venue:In Proceedings of the 5th ACM SIGPLAN International Conference on Functional Programming (ICFP'00
Citations:12 - 8 self

Active Bibliography

1 Calculating linear time algorithms for solving maximum weightsum problems – Isao Sasano, Zhenjiang Hu, Masato Takeichi, Mizuhito Ogawa - 2001
1 Generation of Efficient Algorithms for Maximum Marking Problems – Isao Sasano
41 Algorithms For Vertex Partitioning Problems On Partial k-Trees – Jan Arne Telle, andrzej Proskurowski - 1997
2474 Compositional Model Checking – E. M. Clarke, D. E. Long, K. L. Mcmillan - 1999
Catamorphic Approach to Program Analysis – Mizuhito Ogawa, Zhenjiang Hu, Isao Sasano, Masato Takeichi - 2003
1 Generation of Efficient Programs for Solving Maximum Multi-Marking Problems – Isao Sasano, Zhenjiang Hu, Masato Takeichi - 2001
19 Combinatorial Optimization on Graphs of Bounded Treewidth – Hans L. Bodlaender, Arie M. C. A. Koster - 2007
459 Comprehending Monads – Philip Wadler - 1992
454 Rewriting – Nachum Dershowitz, David A. Plaisted - 2001