Jeffery I. Zucker

According to our database1, Jeffery I. Zucker authored at least 42 papers between 1978 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
Notions of semicomputability in topological algebras over the reals.
Computability, 2019

2018
Analog networks on function data streams.
Computability, 2018

2015
Characterizations of semicomputable sets of real numbers.
J. Log. Algebr. Meth. Program., 2015

Models of computation for partial functions on the reals.
J. Log. Algebr. Meth. Program., 2015

2014
Computability of Operators on Continuous and Discrete Time Streams.
Computability, 2014

2013
A Class of Contracting Stream Operators.
Comput. J., 2013

Assignment Calculus: A Pure Imperative Language.
Proceedings of the Logical Foundations of Computer Science, International Symposium, 2013

2011
Continuity of operators on continuous and discrete time streams.
Theor. Comput. Sci., 2011

2009
Unifying computers and dynamical systems using the theory of synchronous concurrent algorithms.
Applied Mathematics and Computation, 2009

2008
Primitive recursive selection functions for existential assertions over abstract algebras.
J. Log. Algebr. Program., 2008

2007
Computability of analog networks.
Theor. Comput. Sci., 2007

Universality and semicomputability for nondeterministic programming languages over abstract algebras.
J. Log. Algebr. Program., 2007

2006
Primitive Recursive Selection Functions over Abstract Algebras.
Proceedings of the Logical Approaches to Computational Barriers, 2006

2005
Computable total functions on metric algebras, universal algebraic specifications and dynamical systems.
J. Log. Algebr. Program., 2005

First and Second Order Recursion on Abstract Data Types.
Fundam. Inform., 2005

A Network Model of Analogue Computation over Metric Algebras.
Proceedings of the New Computational Paradigms, 2005

2004
Abstract versus concrete computation on metric partial algebras.
ACM Trans. Comput. Log., 2004

2002
Abstract computability and algebraic specification.
ACM Trans. Comput. Log., 2002

1999
Computation by 'While' Programs on Topological Partial Algebras.
Theor. Comput. Sci., 1999

1996
Transformations of Normal and Inverted Function Tables.
Formal Asp. Comput., 1996

1993
The Propositional mu-Calculus and Its Use in Model Checking.
Proceedings of the Functional Programming, 1993

Propositional Temporal Logics and Their Use in Model Checking.
Proceedings of the Functional Programming, 1993

1992
Deterministic and Nondeterministic Computation and Horn Programs, on Abstract Data Types.
J. Log. Program., 1992

A semantic approach to fairness.
Fundam. Inform., 1992

Theory of Computation over Stream Algebras, and its Applications.
Proceedings of the Mathematical Foundations of Computer Science 1992, 1992

1991
Projections of Semicomputable Relations on Abstract Data Tzpes.
Int. J. Found. Comput. Sci., 1991

Semantics of Pointers, Referencing and Dereferencing with Intensional Logic
Proceedings of the Sixth Annual Symposium on Logic in Computer Science (LICS '91), 1991

Examples of Semicomputable Sets of Real and Complex Numbers.
Proceedings of the Constructivity in Computer Science, 1991

1990
Toward a General Theory of Computation and Specification over Abstract Data Types.
Proceedings of the Advances in Computing and Information, 1990

Provable Computable Functions on Abstract Data Types.
Proceedings of the Automata, Languages and Programming, 17th International Colloquium, 1990

1989
Horn Programs and Semicomputable Relations on Abstract Structures.
Proceedings of the Automata, Languages and Programming, 16th International Colloquium, 1989

1988
Transition Systems, Metric Spaces and Ready Sets in the Semantics of Uniform Concurrency.
J. Comput. Syst. Sci., 1988

1986
Contrasting Themes in the Semantics of Imperative Concurrency.
Proceedings of the Current Trends in Concurrency, Overviews and Tutorials, 1986

1985
Transition Systems, Infinitary Languages and the Semantics of Uniform Concurrency
Proceedings of the 17th Annual ACM Symposium on Theory of Computing, 1985

1984
On Infinite Computations in Denotational Semantics.
Theor. Comput. Sci., 1984

1983
On Infinite Computations in Denotational Semantics.
Theor. Comput. Sci., 1983

Compactness in Semantics for Merge and Fair Merge.
Proceedings of the Logics of Programs, 1983

Processes and a Fair Semantics for the Ada Rendez-Vous.
Proceedings of the Automata, 1983

1982
Processes and the Denotational Semantics of Concurrency
Information and Control, 1982

Denotational Semantics of Concurrency
Proceedings of the 14th Annual ACM Symposium on Theory of Computing, 1982

1978
The adequacy problem for inferential logic.
J. Philosophical Logic, 1978

The adequacy problem for classical logic.
J. Philosophical Logic, 1978


  Loading...