( en | de | ru )

 

Disambiguation of "Paige, Robert"

Author of the publication

copydeleteadd this publication to your clipboard
Expression Continuity and the Formal Differentiation of Algorithms.

. New York University, USA, (1979)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Perry Paige Griffin

Robert Klöfkorn

Numerics for evolution equations: a general interface based design concept. Uni Freiburg, (2009)

Robert Wille

Towards a design flow for reversible logic. Uni Bremen, (2009)

Robert Braun

Referenzmodellierung: Grundlegung und Evaluation der Technik des Modell-Konfigurationsmanagements. TU Dresden, (2010)

Robert Wagner

Inkrementelle Modellsynchronisation. Uni Paderborn, (2009)
 

Other publications of authors with the same name

Three Partition Refinement Algorithms., and . SIAM J. Comput., 16 (6): 973-989 (1987)Binding Performance at Language Design Time., and . POPL, page 85-97. ACM Press, (1987)High Level Reading and Data Structure Compilation., and . POPL, page 456-469. ACM Press, (1997)Symbolic Finite Differencing - Part I.. ESOP, volume 432 of Lecture Notes in Computer Science, page 36-56. Springer, (1990)On testing common indices for two multi-index models: A link-free approach., , , and . J. Multivar. Anal., (2015)A Transformational Framework for the Automatic Control of Derived Data, and . VLDB, page 306-318. IEEE Computer Society, (1981)The formal reconstruction and speedup of the linear time fragment of Willard's relational calculus subset., and . Algorithmic Languages and Calculi, volume 95 of IFIP Conference Proceedings, page 382-414. Chapman & Hall, (1997)Towards Increased Productivity of Algorithm Implementation., and . SIGSOFT FSE, page 71-78. ACM, (1993)Language Polynomial in the Input Plus Output., and . AMAST, page 287-300. Springer, (1991)On O(n log n) Cost Parallel Algorithm for the Single Function Coarsest Partition Problem., , and . Parallel Algorithms and Architectures, volume 269 of Lecture Notes in Computer Science, page 70-76. Springer, (1987)