- CSB - MetaPress - Google - Bing - Yahoo
 | 2005 | |
|---|---|---|
| j14 |      | |
| 1998 | ||
| c23 | | |
| 1997 | ||
| j13 | | |
| j12 | | Chia-Hsiang Chang, Robert Paige: From Regular Expressions to DFA's Using Compressed NFA's. Theor. Comput. Sci. 178(1-2): 1-36 (1997) |
| c22 |  | 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 |
| c21 | | |
| 1996 | ||
| j11 | | |
| 1995 | ||
| j10 | | William Bouma, Ioannis Fudos, Christoph M. Hoffmann, Jiazhen Cai, Robert Paige: Geometric constraint solver. Computer-Aided Design 27(6): 487-501 (1995) |
| j9 | | 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) |
| j8 | | Jiazhen Cai, Robert Paige: Using Multiset Discrimination to Solve Language Processing Problems Without Hashing. Theor. Comput. Sci. 145(1&2): 189-228 (1995) |
| c20 | | 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 |
| 1994 | ||
| c19 | | |
| c18 | | Robert Paige: Efficient Translation of External Input in a Dynamically Typed Language. IFIP Congress (1) 1994: 603-608 |
| c17 | | |
| 1993 | ||
| c16 | | Jiazhen Cai, Robert Paige: Towards Increased Productivity of Algorithm Implementation. SIGSOFT FSE 1993: 71-78 |
| 1992 | ||
| j7 | | Jiazhen Cai, Robert Paige, Robert Endre Tarjan: More Efficient Bottom-Up Multi-Pattern Matching in Trees. Theor. Comput. Sci. 106(1): 21-60 (1992) |
| c15 | | Chia-Hsiang Chang, Robert Paige: From Regular Expressions to DFA's Using Compressed NFA's. CPM 1992: 90-110 |
| c14 | | |
| 1991 | ||
| c13 | | |
| c12 | | |
| 1990 | ||
| c11 | | Jiazhen Cai, Robert Paige, Robert Endre Tarjan: More Efficient Bottom-Up Tree Pattern Matching. CAAP 1990: 72-86 |
| c10 | | |
| 1989 | ||
| j6 | | Jiazhen Cai, Robert Paige: Program Derivation by Fixed Point Computation. Sci. Comput. Program. 11(3): 197-261 (1989) |
| 1987 | ||
| j5 | | 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) |
| j4 | | Robert Paige, Robert Endre Tarjan: Three Partition Refinement Algorithms. SIAM J. Comput. 16(6): 973-989 (1987) |
| c9 | | 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 |
| c8 | | |
| 1986 | ||
| j3 | | |
| 1985 | ||
| j2 | | 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) |
| c7 | | 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 |
| 1984 | ||
| c6 | | Robert Paige, Robert Endre Tarjan: A Linear Time Algorithm to Solve the Single Function Coarsest Partition Problem. ICALP 1984: 371-379 |
| c5 | | |
| 1983 | ||
| c4 | | Robert Paige: Transformational Programming - Applications to Algorithms and Systems. POPL 1983: 73-87 |
| 1982 | ||
| j1 | | Robert Paige, Shaye Koenig: Finite Differencing of Computable Expressions. ACM Trans. Program. Lang. Syst. 4(3): 402-454 (1982) |
| c3 | | Robert Paige: Applications of Finite Differencing to Database Integrity Control and Query/Transaction Optimization. Advances in Data Base Theory 1982: 171-209 |
| 1981 | ||
| c2 | | Shaye Koenig, Robert Paige: A Transformational Framework for the Automatic Control of Derived Data. VLDB 1981: 306-318 |
| 1977 | ||
| c1 | | |
Colors in the list of coauthors
Last update Wed May 22 15:22:23 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page