Isao Sasano, Zhenjiang Hu, Masato Takeichi, Mizuhito Ogawa  @ NUS Home/Search
Context Related
| jaist.ac.jp/~sasano/pu...icfp00SHTO.ps Cached: PS.gz PS PDF Image Update Help From: jaist.ac.jp/~sasano/index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In this paper we propose a new method for deriving a practical linear-time algorithm from the speci cation of a maximum-weightsum problem: From the elements of a data structure x, nd a subset which satis es a certain property p and whose weightsum is maximum. Previously proposed methods for automatically generating linear-time algorithms are theoretically appealing, but the algorithms generated are hardly useful in practice due to a huge constant factor for space and time. The key points of... (Update)
Context of citations to this paper: More
...# # # # # # # # # # # # # # # # # # # # # # # # # Figure 5.12: An example of the maximum subtree problem. programming. In [76], Sasano and Hu calculated a linear time algorithm for a family of such optimal marking problems given the name because nodes in the tree are marked...
Cited by: More
List Homomorphism with Accumulation - Kakehi, Hu, Takeichi (Correct)
An Optimal Staging Algorithm - Murakami, Hu, Takeichi (Correct)
An Efficient Staging Algorithm for Binding-Time Analysis - Murakami, Hu, Kakehi.. (Correct)
Similar documents (at the sentence level):
52.7%: Generation of Efficient Algorithms for Maximum Marking Problems - Sasano (Correct)
11.8%: Calculating Linear Time Algorithms for Solving Maximum.. - Sasano, Hu, Takeichi.. (2000) (Correct)
Active bibliography (related documents): More All
1.4: Make it Practical: A Generic Linear-Time Algorithm for.. - Sasano, Hu, Takeichi.. (2000) (Correct)
0.3: Catamorphic Approach to Program Analysis - Ogawa, Hu, Sasano, Takeichi (2003) (Correct)
0.2: Branch-Width and Rota's Conjecture - Geelen, Whittle (Correct)
Similar documents based on text: More All
0.6: Generation of Efficient Programs for Solving Maximum.. - Sasano, Hu, Takeichi (2001) (Correct)
0.4: A Programmable Editor for Developing Structured Documents.. - Hu, Mu, Takeichi (2004) (Correct)
0.3: Program Transformation in Calculational Form - Takano, Hu, Takeichi (1998) (Correct)
Related documents from co-citation: More All
6: Algebras of Programming (context) - Bird, de Moor - 1996
5: Introduction to Functional Programming using Haskell 2nd ed (context) - Bird - 1998
4: An introduction to the theory of lists (context) - Bird - 1987
BibTeX entry: (Update)
Isao Sasano, Zhenjiang Hu, Masato Takeichi, and Mizuhito Ogawa. Make it practical: A generic linear-time algorithm for solving maximum-weightsum problems. In Proceedings of the 5th ACM SIGPLAN International Conference on Functional Programming (ICFP'00), pages 137-149, Montreal, Canada, September 2000. ACM Press. http://citeseer.comp.nus.edu.sg/683015.html More
@misc{ sasano00make,
author = "I. Sasano and Z. Hu and M. Takeichi and M. Ogawa",
title = "Make it practical: A generic linear-time algorithm for solving maximum-weightsum
problems",
text = "Isao Sasano, Zhenjiang Hu, Masato Takeichi, and Mizuhito Ogawa. Make it
practical: A generic linear-time algorithm for solving maximum-weightsum
problems. In Proceedings of the 5th ACM SIGPLAN International Conference
on Functional Programming (ICFP'00), pages 137-149, Montreal, Canada, September
2000. ACM Press.",
year = "2000",
url = "citeseer.comp.nus.edu.sg/683015.html" }
Citations (may not include all citations):210 Functional programming with bananas (context) - Meijer, Fokkinga et al. - 1991
172 An introduction to the theory of lists (context) - Bird - 1987
143 Algorithmic aspects of tree-width (context) - Robertson, Seymour - 1986
131 A fold for all seasons - Sheard, Fegaras - 1993
104 Algebra of Programming (context) - Bird, de Moor - 1996
104 Graph rewriting: An algebraic and logic approach (context) - Courcelle - 1990
97 A tourist guide through treewidth - Bodlaender - 1993
84 Law and Order in Algorithmics (context) - Fokkinga - 1992
71 The monadic second-order logic of graphs (context) - Courcelle - 1990
51 Algebraic identities for program calculation (context) - Bird - 1989
50 The MIT Electrical Engineering and Computer Science Series (context) - Cormen, Leiserson et al. - 1990
47 An algebraic theory of graph reduction (context) - Arnborg, Courcelle et al. - 1993
45 Linear-time computation of optimal subgraphs of decomposable.. (context) - Bern, Lawler et al. - 1987
42 Automatic generation of linear-time algorithms from predicat.. (context) - Borie, Parker et al. - 1992
41 Theories for Algorithm Calculation (context) - Jeuring - 1993
36 Tupling calculation eliminates multiple data traversals - Hu, Iwasaki et al. - 1997
34 Automata on in nite objects (context) - Thomas - 1990
28 Linear-time computability of combinatorial problems on serie.. (context) - Takamizawa, Nishizeki et al. - 1982
27 Complexity of nding embeddings in a k-tree (context) - Arnborg - 1987
24 Linear time algorithms for NP-hard problems on graphs embedd.. (context) - Arnborg, Proskurowski - 1984
19 Linear Algorithms on k-terminal Graphs (context) - Wimer - 1987
17 Memory requirements for table computations in partial k-tree.. - Aspvall, Proskurowski et al. - 2000
11 Tupling and mutumorphisms (context) - Fokkinga - 1989
10 All structured programs have small tree width and good regis.. - Thorup - 1998
4 A Menger-like property of tree-width: The nite case (context) - Thomas - 1990
4 Decomposable structures (context) - Arnborg - 1995
4 tree-decompositions and compactness (context) - Thomas - 1990
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.jaist.ac.jp/~sasano/index.html):
Generation of Efficient Programs for Solving Maximum.. - Sasano, Hu, Takeichi (2001) (Correct)
Online articles have much greater impact More about CiteSeer.IST at NUS Add search form to your site Submit documents Feedback
CiteSeer.IST at NUS - Copyright Penn State and NEC. Hosted by the School of Computing, National University of Singapore.