| 2005 | ||
|---|---|---|
| 37 | EE | Robert Paige: An NSF Proposal. Higher-Order and Symbolic Computation 18(1-2): 211-235 (2005) |
| 1998 | ||
| 36 | EE | Deepak Goyal, Robert Paige: A New Solution to the Hidden Copy Problem. SAS 1998: 327-348 |
| 1997 | ||
| 35 | Deepak Goyal, Robert Paige: The formal reconstruction and speedup of the linear time fragment of Willard's relational calculus subset. Algorithmic Languages and Calculi 1997: 382-414 | |
| 34 | EE | Robert Paige, Zhe Yang: High Level Reading and Data Structure Compilation. POPL 1997: 456-469 |
| 33 | Robert Paige: Future Directions In Program Transformations. SIGPLAN Notices 32(1): 94-97 (1997) | |
| 32 | EE | Chia-Hsiang Chang, Robert Paige: From Regular Expressions to DFA's Using Compressed NFA's. Theor. Comput. Sci. 178(1-2): 1-36 (1997) |
| 1996 | ||
| 31 | Robert Paige: Future Directions in Program Transformations. ACM Comput. Surv. 28(4es): 170 (1996) | |
| 1995 | ||
| 30 | Jesper G. Henriksen, Jakob L. Jensen, Michael E. Jørgensen, Nils Klarlund, Robert Paige, Theis Rauhe, Anders Sandholm: Mona: Monadic Second-Order Logic in Practice. TACAS 1995: 89-110 | |
| 29 | EE | William Bouma, Ioannis Fudos, Christoph M. Hoffmann, Jiazhen Cai, Robert Paige: Geometric constraint solver. Computer-Aided Design 27(6): 487-501 (1995) |
| 28 | Bard Bloom, Robert Paige: Transformational Design and Implementation of a New Efficient Solution to the Ready Simulation Problem. Sci. Comput. Program. 24(3): 189-220 (1995) | |
| 27 | EE | Jiazhen Cai, Robert Paige: Using Multiset Discrimination to Solve Language Processing Problems Without Hashing. Theor. Comput. Sci. 145(1&2): 189-228 (1995) |
| 1994 | ||
| 26 | Robert Paige: Viewing A program Transformation System At Work. ALP 1994: 5 | |
| 25 | Robert Paige: Efficient Translation of External Input in a Dynamically Typed Language. IFIP Congress (1) 1994: 603-608 | |
| 24 | Robert Paige: Viewing A Program Transformation System At Work. PLILP 1994: 5-24 | |
| 1993 | ||
| 23 | EE | Jiazhen Cai, Robert Paige: Towards Increased Productivity of Algorithm Implementation. SIGSOFT FSE 1993: 71-78 |
| 1992 | ||
| 22 | Chia-Hsiang Chang, Robert Paige: From Regular Expressions to DFA's Using Compressed NFA's. CPM 1992: 90-110 | |
| 21 | Bard Bloom, Robert Paige: Computing Ready Simulations Efficiently. NAPAW 1992: 119-134 | |
| 20 | Jiazhen Cai, Robert Paige, Robert Endre Tarjan: More Efficient Bottom-Up Multi-Pattern Matching in Trees. Theor. Comput. Sci. 106(1): 21-60 (1992) | |
| 1991 | ||
| 19 | Jiazhen Cai, Robert Paige: Language Polynomial in the Input Plus Output. AMAST 1991: 287-300 | |
| 18 | Jiazhen Cai, Robert Paige: ``Look Ma, No Hashing, And No Arrays Neither''. POPL 1991: 143-154 | |
| 1990 | ||
| 17 | Jiazhen Cai, Robert Paige, Robert Endre Tarjan: More Efficient Bottom-Up Tree Pattern Matching. CAAP 1990: 72-86 | |
| 16 | Robert Paige: Symbolic Finite Differencing - Part I. ESOP 1990: 36-56 | |
| 1989 | ||
| 15 | Jiazhen Cai, Robert Paige: Program Derivation by Fixed Point Computation. Sci. Comput. Program. 11(3): 197-261 (1989) | |
| 1987 | ||
| 14 | Jiazhen Cai, Robert Paige: Binding Performance at Language Design Time. POPL 1987: 85-97 | |
| 13 | Alberto Apostolico, Costas S. Iliopoulos, Robert Paige: On O(n log n) Cost Parallel Algorithm for the Single Function Coarsest Partition Problem. Parallel Algorithms and Architectures 1987: 70-76 | |
| 12 | Robert Paige, Fritz Henglein: Mechanical Translation of Set Theoretic Problem Specifications into Efficient RAM Code-A Case Study. J. Symb. Comput. 4(2): 207-232 (1987) | |
| 11 | Robert Paige, Robert Endre Tarjan: Three Partition Refinement Algorithms. SIAM J. Comput. 16(6): 973-989 (1987) | |
| 1986 | ||
| 10 | Robert Paige: Programming with Invariants. IEEE Software 3(1): 56-69 (1986) | |
| 1985 | ||
| 9 | Robert Paige, Fritz Henglein: Mechanical Translation of Set Theoretic Problem Specifications into Efficient RAM Code - A Case Study. European Conference on Computer Algebra (2) 1985: 554-567 | |
| 8 | Robert Paige, Robert Endre Tarjan, Robert Bonic: A Linear Time Solution to the Single Function Coarsest Partition Problem. Theor. Comput. Sci. 40: 67-84 (1985) | |
| 1984 | ||
| 7 | Robert Paige, Robert Endre Tarjan: A Linear Time Algorithm to Solve the Single Function Coarsest Partition Problem. ICALP 1984: 371-379 | |
| 6 | Allen Goldberg, Robert Paige: Stream Processing. LISP and Functional Programming 1984: 53-62 | |
| 1983 | ||
| 5 | Robert Paige: Transformational Programming - Applications to Algorithms and Systems. POPL 1983: 73-87 | |
| 1982 | ||
| 4 | Robert Paige: Applications of Finite Differencing to Database Integrity Control and Query/Transaction Optimization. Advances in Data Base Theory 1982: 171-209 | |
| 3 | EE | Robert Paige, Shaye Koenig: Finite Differencing of Computable Expressions. ACM Trans. Program. Lang. Syst. 4(3): 402-454 (1982) |
| 1981 | ||
| 2 | EE | Shaye Koenig, Robert Paige: A Transformational Framework for the Automatic Control of Derived Data VLDB 1981: 306-318 |
| 1977 | ||
| 1 | Robert Paige, Jacob T. Schwartz: Reduction in Strength of High Level Operations. POPL 1977: 58-71 | |
| 1 | Alberto Apostolico | [13] |
| 2 | Bard Bloom | [21] [28] |
| 3 | Robert Bonic | [8] |
| 4 | William Bouma | [29] |
| 5 | Jiazhen Cai | [14] [15] [17] [18] [19] [20] [23] [27] [29] |
| 6 | Chia-Hsiang Chang | [22] [32] |
| 7 | Ioannis Fudos | [29] |
| 8 | Allen Goldberg | [6] |
| 9 | Deepak Goyal | [35] [36] |
| 10 | Fritz Henglein | [9] [12] |
| 11 | Jesper G. Henriksen | [30] |
| 12 | Christoph M. Hoffmann | [29] |
| 13 | Costas S. Iliopoulos | [13] |
| 14 | Jakob L. Jensen | [30] |
| 15 | Michael E. Jørgensen | [30] |
| 16 | Nils Klarlund | [30] |
| 17 | Shaye Koenig | [2] [3] |
| 18 | Theis Rauhe | [30] |
| 19 | Anders Sandholm | [30] |
| 20 | Jacob T. Schwartz | [1] |
| 21 | Robert Endre Tarjan | [7] [8] [11] [17] [20] |
| 22 | Zhe Yang | [34] |
Colors in the list of coauthors