Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Jeffery I. Zucker
2010 – today
- 2013
[j19]Nick D. James, Jeffery I. Zucker: A Class of Contracting Stream Operators. Comput. J. 56(1): 15-33 (2013)
[c15]- 2011
[j18]John V. Tucker, Jeffery I. Zucker: Continuity of operators on continuous and discrete time streams. Theor. Comput. Sci. 412(28): 3378-3403 (2011)
2000 – 2009
- 2009
[j17]B. C. Thompson, J. V. Tucker, Jeffery I. Zucker: Unifying computers and dynamical systems using the theory of synchronous concurrent algorithms. Applied Mathematics and Computation 215(4): 1386-1403 (2009)- 2008
[j16]Thomas Strahm, Jeffery I. Zucker: Primitive recursive selection functions for existential assertions over abstract algebras. J. Log. Algebr. Program. 76(2): 175-197 (2008)- 2007
[j15]Wei Jiang, Yuan Wang, Jeffery I. Zucker: Universality and semicomputability for nondeterministic programming languages over abstract algebras. J. Log. Algebr. Program. 71(1): 44-78 (2007)
[j14]John V. Tucker, Jeffery I. Zucker: Computability of analog networks. Theor. Comput. Sci. 371(1-2): 115-146 (2007)- 2006
[c14]Jeffery I. Zucker: Primitive Recursive Selection Functions over Abstract Algebras. CiE 2006: 595-606- 2005
[j13]Jian Xu, Jeffery I. Zucker: First and Second Order Recursion on Abstract Data Types. Fundam. Inform. 67(4): 377-419 (2005)
[j12]J. V. Tucker, Jeffery I. Zucker: Computable total functions on metric algebras, universal algebraic specifications and dynamical systems. J. Log. Algebr. Program. 62(1): 71-108 (2005)
[c13]J. V. Tucker, Jeffery I. Zucker: A Network Model of Analogue Computation over Metric Algebras. CiE 2005: 515-529- 2004
[j11]J. V. Tucker, Jeffery I. Zucker: Abstract versus concrete computation on metric partial algebras. ACM Trans. Comput. Log. 5(4): 611-668 (2004)- 2002
[j10]J. V. Tucker, Jeffery I. Zucker: Abstract computability and algebraic specification. ACM Trans. Comput. Log. 3(2): 279-333 (2002)- 2001
[i2]J. V. Tucker, Jeffery I. Zucker: Abstract versus Concrete Computation on Metric Partial Algebras. CoRR cs.LO/0108007 (2001)
[i1]J. V. Tucker, Jeffery I. Zucker: Abstract Computability, Algebraic Specification and Initiality. CoRR cs.LO/0109001 (2001)
1990 – 1999
- 1999
[j9]J. V. Tucker, Jeffery I. Zucker: Computation by `While' Programs on Topological Partial Algebras. Theor. Comput. Sci. 219(1-2): 379-420 (1999)- 1996
[j8]Jeffery I. Zucker: Transformations of Normal and Inverted Function Tables. Formal Asp. Comput. 8(6): 679-705 (1996)- 1993
[c12]Jeffery I. Zucker: Propositional Temporal Logics and Their Use in Model Checking. Functional Programming, Concurrency, Simulation and Automated Reasoning 1993: 108-116
[c11]Jeffery I. Zucker: The Propositional mu-Calculus and Its Use in Model Checking. Functional Programming, Concurrency, Simulation and Automated Reasoning 1993: 117-128- 1992
[j7]Jan J. M. M. Rutten, Jeffery I. Zucker: A semantic approach to fairness. Fundam. Inform. 16(1): 1-38 (1992)
[j6]J. V. Tucker, Jeffery I. Zucker: Deterministic and Nondeterministic Computation and Horn Programs, on Abstract Data Types. J. Log. Program. 13(1): 23-55 (1992)
[c10]J. V. Tucker, Jeffery I. Zucker: Theory of Computation over Stream Algebras, and its Applications. MFCS 1992: 62-80- 1991
[j5]J. V. Tucker, Jeffery I. Zucker: Projections of Semicomputable Relations on Abstract Data Tzpes. Int. J. Found. Comput. Sci. 2(3): 267-296 (1991)
[c9]J. V. Tucker, Jeffery I. Zucker: Examples of Semicomputable Sets of Real and Complex Numbers. Constructivity in Computer Science 1991: 179-198
[c8]Hing-Kai Hung, Jeffery I. Zucker: Semantics of Pointers, Referencing and Dereferencing with Intensional Logic. LICS 1991: 127-136- 1990
[c7]J. V. Tucker, S. S. Wainer, Jeffery I. Zucker: Provable Computable Functions on Abstract Data Types. ICALP 1990: 660-673
[c6]J. V. Tucker, Jeffery I. Zucker: Toward a General Theory of Computation and Specification over Abstract Data Types. ICCI 1990: 129-133
1980 – 1989
- 1989
[c5]J. V. Tucker, Jeffery I. Zucker: Horn Programs and Semicomputable Relations on Abstract Structures. ICALP 1989: 745-760- 1988
[j4]J. W. de Bakker, John-Jules Ch. Meyer, Ernst-Rüdiger Olderog, Jeffery I. Zucker: Transition Systems, Metric Spaces and Ready Sets in the Semantics of Uniform Concurrency. J. Comput. Syst. Sci. 36(2): 158-224 (1988)- 1986
[p1]J. W. de Bakker, Joost N. Kok, John-Jules Ch. Meyer, Ernst-Rüdiger Olderog, Jeffery I. Zucker: Contrasting Themes in the Semantics of Imperative Concurrency. Current Trends in Concurrency 1986: 51-122- 1985
[c4]J. W. de Bakker, John-Jules Ch. Meyer, Ernst-Rüdiger Olderog, Jeffery I. Zucker: Transition Systems, Infinitary Languages and the Semantics of Uniform Concurrency. STOC 1985: 252-262- 1984
[j3]J. W. de Bakker, John-Jules Ch. Meyer, Jeffery I. Zucker: On Infinite Computations in Denotational Semantics. Theor. Comput. Sci. 29: 229-230 (1984)- 1983
[j2]J. W. de Bakker, John-Jules Ch. Meyer, Jeffery I. Zucker: On Infinite Computations in Denotational Semantics. Theor. Comput. Sci. 26: 53-82 (1983)
[c3]J. W. de Bakker, Jeffery I. Zucker: Processes and a Fair Semantics for the Ada Rendez-Vous. ICALP 1983: 52-66
[c2]J. W. de Bakker, Jeffery I. Zucker: Compactness in Semantics for Merge and Fair Merge. Logic of Programs 1983: 18-33- 1982
[j1]J. W. de Bakker, Jeffery I. Zucker: Processes and the Denotational Semantics of Concurrency. Information and Control 54(1/2): 70-120 (1982)
[c1]
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-01-26 20:06 CET by the dblp team



