Остановите войну!
for scientists:
default search action
Robert Paige
Person information
- affiliation: New York University, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 1979
- [b1]Robert Paige:
Expression Continuity and the Formal Differentiation of Algorithms. New York University, USA, 1979
Journal Articles
- 2017
- [j16]Xuejing Liu, Lei Huo, Xuerong Meggie Wen, Robert Paige:
A link-free approach for testing common indices for three or more multi-index models. J. Multivar. Anal. 153: 236-245 (2017) - 2015
- [j15]Xuejing Liu, Zhou Yu, Xuerong Meggie Wen, Robert Paige:
On testing common indices for two multi-index models: A link-free approach. J. Multivar. Anal. 136: 75-85 (2015) - 2005
- [j14]Robert Paige:
An NSF Proposal. High. Order Symb. Comput. 18(1-2): 211-235 (2005) - 1997
- [j13]Robert Paige:
Future Directions In Program Transformations. ACM SIGPLAN Notices 32(1): 94-97 (1997) - [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) - 1996
- [j11]Robert Paige:
Future Directions in Program Transformations. ACM Comput. Surv. 28(4es): 170 (1996) - 1995
- [j10]William Bouma, Ioannis Fudos, Christoph M. Hoffmann, Jiazhen Cai, Robert Paige:
Geometric constraint solver. Comput. Aided Des. 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) - 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) - 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) - 1986
- [j3]Robert Paige:
Programming with Invariants. IEEE Softw. 3(1): 56-69 (1986) - 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) - 1982
- [j1]Robert Paige, Shaye Koenig:
Finite Differencing of Computable Expressions. ACM Trans. Program. Lang. Syst. 4(3): 402-454 (1982)
Conference and Workshop Papers
- 1998
- [c23]Deepak Goyal, Robert Paige:
A New Solution to the Hidden Copy Problem. SAS 1998: 327-348 - 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]Robert Paige, Zhe Yang:
High Level Reading and Data Structure Compilation. POPL 1997: 456-469 - 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]Robert Paige:
Viewing A program Transformation System At Work. ALP 1994: 5 - [c18]Robert Paige:
Efficient Translation of External Input in a Dynamically Typed Language. IFIP Congress (1) 1994: 603-608 - [c17]Robert Paige:
Viewing A Program Transformation System At Work. PLILP 1994: 5-24 - 1993
- [c16]Jiazhen Cai, Robert Paige:
Towards Increased Productivity of Algorithm Implementation. SIGSOFT FSE 1993: 71-78 - 1992
- [c15]Chia-Hsiang Chang, Robert Paige:
From Regular Expressions to DFA's Using Compressed NFA's. CPM 1992: 90-110 - [c14]Bard Bloom, Robert Paige:
Computing Ready Simulations Efficiently. NAPAW 1992: 119-134 - 1991
- [c13]Jiazhen Cai, Robert Paige:
Language Polynomial in the Input Plus Output. AMAST 1991: 287-300 - [c12]Jiazhen Cai, Robert Paige:
"Look Ma, No Hashing, And No Arrays Neither". POPL 1991: 143-154 - 1990
- [c11]Jiazhen Cai, Robert Paige, Robert Endre Tarjan:
More Efficient Bottom-Up Tree Pattern Matching. CAAP 1990: 72-86 - [c10]Robert Paige:
Symbolic Finite Differencing - Part I. ESOP 1990: 36-56 - 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]Jiazhen Cai, Robert Paige:
Binding Performance at Language Design Time. POPL 1987: 85-97 - 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]Allen Goldberg, Robert Paige:
Stream Processing. LISP and Functional Programming 1984: 53-62 - 1983
- [c4]Robert Paige:
Transformational Programming - Applications to Algorithms and Systems. POPL 1983: 73-87 - 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]Robert Paige, Jacob T. Schwartz:
Reduction in Strength of High Level Operations. POPL 1977: 58-71
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint