Deriving Effcient Graph Algorithms
暂无分享,去创建一个
[1] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .
[2] Raymond Reiter. On Closed World Data Bases , 1977, Logic and Data Bases.
[3] Keith L. Clark,et al. Algorithm Classification Through Synthesis , 1980, Comput. J..
[4] David R. Barstow,et al. On Program Synthesis Knowledge , 1978, Artif. Intell..
[5] John H. Reif,et al. Synthesis of Parallel Algorithms , 1993 .
[6] Paul Hudak,et al. Shifting Expression Procedures into Reverse , 1999, PEPM.
[7] R. Tarjan. Complexity of combinatorial algorithms , 1977 .
[8] Robert S. Boyer,et al. Proving Theorems about LISP Functions , 1973, JACM.
[9] Robert Paige,et al. Finite Differencing of Computable Expressions , 1982, TOPL.
[10] Friedrich L. Bauer,et al. Programming in a Wide Spectrum Language: A Collection of Examples , 1981, Sci. Comput. Program..
[11] Robert E. Tarjan,et al. Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..
[12] Mitchell Wand,et al. Continuation-Based Program Transformation Strategies , 1980, JACM.
[13] William L. Scherlis,et al. Program improvement by internal specialization , 1981, POPL '81.
[14] Zohar Manna,et al. Synthesis: Dreams - Programs , 1979, IEEE Trans. Software Eng..
[15] Keith L. Clark,et al. Negation as Failure , 1987, Logic and Data Bases.
[16] William L. Scherlis,et al. Expression procedures and program derivation , 1980 .
[17] David Sands,et al. Higher-order expression procedures , 1995, PEPM '95.
[18] John Darlington,et al. A Transformation System for Developing Recursive Programs , 1977, J. ACM.
[19] Robert E. Tarjan. Testing flow graph reducibility , 1973, STOC '73.
[20] Richard S. Bird,et al. Tabulation Techniques for Recursive Programs , 1980, CSUR.
[21] Alfred V. Aho,et al. Data Structures and Algorithms , 1983 .
[22] Zohar Manna,et al. Deductive Synthesis of the Unification Algorithm , 1981, Sci. Comput. Program..