J. V. Tucker

John V. Tucker

	2011
71		Jens Blanck, Viggo Stoltenberg-Hansen, John V. Tucker: Stability of representations of effective partial algebras. Math. Log. Q. 57(2): 217-231 (2011)
70		John V. Tucker, Jeffery I. Zucker: Continuity of operators on continuous and discrete time streams. Theor. Comput. Sci. 412(28): 3378-3403 (2011)
	2010
69		Edwin J. Beggs, José Félix Costa, John V. Tucker: Limits to measurement in experiments governed by algorithms. Mathematical Structures in Computer Science 20(6): 1019-1050 (2010)
	2009
68		Edwin J. Beggs, J. V. Tucker: Computations via Newtonian and relativistic kinematic systems. Applied Mathematics and Computation 215(4): 1311-1322 (2009)
67		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)
66		Edwin J. Beggs, José Félix Costa, John V. Tucker: Physical Experiments as Oracles. Bulletin of the EATCS 97: 137-151 (2009)
65		Edwin J. Beggs, José Félix Costa, John V. Tucker: Limits to measurement in experiments governed by algorithms CoRR abs/0911.3836: (2009)
64		Jan A. Bergstra, Yoram Hirshfeld, J. V. Tucker: Meadows and the equational specification of division. Theor. Comput. Sci. 410(12-13): 1261-1271 (2009)
	2008
63		Edwin J. Beggs, J. V. Tucker: Programming Experimental Procedures for Newtonian Kinematic Machines. CiE 2008: 52-66
62		Edwin J. Beggs, José Félix Costa, Bruno Loff, John V. Tucker: Oracles and Advice as Measurements. UC 2008: 33-50
61		Jens Blanck, Viggo Stoltenberg-Hansen, John V. Tucker: Stability for Effective Algebras. Electr. Notes Theor. Comput. Sci. 221: 3-15 (2008)
60		Jan A. Bergstra, John V. Tucker: Division Safe Calculation in Totalised Fields. Theory Comput. Syst. 43(3-4): 410-424 (2008)
	2007
59		Jan A. Bergstra, J. V. Tucker: The rational numbers as an abstract data type. J. ACM 54(2): (2007)
58		John V. Tucker, Jeffery I. Zucker: Computability of analog networks. Theor. Comput. Sci. 371(1-2): 115-146 (2007)
57		Edwin J. Beggs, John V. Tucker: Can Newtonian systems, bounded in space, time, mass and energy compute all functions? Theor. Comput. Sci. 371(1-2): 4-19 (2007)
	2006
56		Arnold Beckmann, Ulrich Berger, Benedikt Löwe, John V. Tucker: Logical Approaches to Computational Barriers, Second Conference on Computability in Europe, CiE 2006, Swansea, UK, June 30-July 5, 2006, Proceedings Springer 2006
55		Jan A. Bergstra, John V. Tucker: Elementary Algebraic Specifications of the Rational Complex Numbers. Essays Dedicated to Joseph A. Goguen 2006: 459-475
54		Edwin J. Beggs, J. V. Tucker: Embedding infinitely parallel computation in Newtonian kinematics. Applied Mathematics and Computation 178(1): 25-43 (2006)
	2005
53		J. V. Tucker, Jeffery I. Zucker: A Network Model of Analogue Computation over Metric Algebras. CiE 2005: 515-529
52		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)
	2004
51		J. V. Tucker, Jeffery I. Zucker: Abstract versus concrete computation on metric partial algebras. ACM Trans. Comput. Log. 5(4): 611-668 (2004)
	2003
50		Min Chen, Richard H. Clayton, Arun V. Holden, J. V. Tucker: Visualising Cardiac Anatomy Using Constructive Volume Geometry. FIMH 2003: 30-38
49		Viggo Stoltenberg-Hansen, J. V. Tucker: Computable and continuous partial homomorphisms on metric partial algebras. Bulletin of Symbolic Logic 9(3): 299-334 (2003)
48		Min Chen, John V. Tucker, Richard H. Clayton, Arun V. Holden: Constructive Volume Geometry Applied to Visualization of Cardiac Anatomy and Electrophysiology. I. J. Bifurcation and Chaos 13(12): 3591-3604 (2003)
47		D. Ll. L. Rees, Karen Stephenson, J. V. Tucker: The algebraic structure of interfaces. Sci. Comput. Program. 49(1-3): 47-88 (2003)
	2002
46		J. V. Tucker, Jeffery I. Zucker: Abstract computability and algebraic specification. ACM Trans. Comput. Log. 3(2): 279-333 (2002)
45		Jens Blanck, Viggo Stoltenberg-Hansen, J. V. Tucker: Domain representations of partial functions, with applications to spatial objects and constructive volume geometry. Theor. Comput. Sci. 284(2): 207-240 (2002)
	2001
44		J. V. Tucker, Jeffery I. Zucker: Abstract versus Concrete Computation on Metric Partial Algebras CoRR cs.LO/0108007: (2001)
43		J. V. Tucker, Jeffery I. Zucker: Abstract Computability, Algebraic Specification and Initiality CoRR cs.LO/0109001: (2001)
	2000
42		Min Chen, J. V. Tucker: Constructive Volume Geometry. Comput. Graph. Forum 19(4): 281-293 (2000)
	1999
41		Viggo Stoltenberg-Hansen, J. V. Tucker: Concrete Models of Computation for Topological Algebras. Theor. Comput. Sci. 219(1-2): 347-378 (1999)
40		J. V. Tucker, Jeffery I. Zucker: Computation by `While' Programs on Topological Partial Algebras. Theor. Comput. Sci. 219(1-2): 379-420 (1999)
	1998
39		Bernhard Möller, J. V. Tucker: Prospects for Hardware Foundations, ESPRIT Working Group 8533, NADA - New Hardware Design Methods, Survey Chapters Springer 1998
38		M. J. Poole, Arun V. Holden, J. V. Tucker: Hierarchies of Spatially Extended Systems and Synchronous Concurrent Algorithms. Prospects for Hardware Foundations 1998: 184-235
37		Jens Blanck, Viggo Stoltenberg-Hansen, J. V. Tucker: Streams, Stream Transformers and Domain Representations. Prospects for Hardware Foundations 1998: 27-68
	1996
36		Neal A. Harman, J. V. Tucker: Algebraic Models of Microprocessors: Architecture and Organisation. Acta Inf. 33(5): 421-456 (1996)
	1995
35		Jan A. Bergstra, J. V. Tucker: A Data Type Variety of Stack Algebras. Ann. Pure Appl. Logic 73(1): 11-36 (1995)
34		Jan A. Bergstra, J. V. Tucker: Equational Specifications, Complete Term Rewriting Systems, and Computable and Semicomputable Algebras. J. ACM 42(6): 1194-1230 (1995)
	1993
33		Neal A. Harman, J. V. Tucker: Algebraic Models and the Correctness of Microprocessors. CHARME 1993: 92-108
	1992
32		J. V. Tucker, Jeffery I. Zucker: Theory of Computation over Stream Algebras, and its Applications. MFCS 1992: 62-80
31		Viggo Stoltenberg-Hansen, J. V. Tucker: Infinite Systems of Equations over Inverse Limits and Infinite Synchronous Concurrent Algorithms. REX Workshop 1992: 531-562
30		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)
	1991
29		J. V. Tucker, Jeffery I. Zucker: Examples of Semicomputable Sets of Real and Complex Numbers. Constructivity in Computer Science 1991: 179-198
28		J. V. Tucker, Jeffery I. Zucker: Projections of Semicomputable Relations on Abstract Data Tzpes. Int. J. Found. Comput. Sci. 2(3): 267-296 (1991)
27		Viggo Stoltenberg-Hansen, J. V. Tucker: Algebraic and Fixed Point Equations over Inverse Limits of Algebras. Theor. Comput. Sci. 87(1): 1-24 (1991)
	1990
26		J. V. Tucker, S. S. Wainer, Jeffery I. Zucker: Provable Computable Functions on Abstract Data Types. ICALP 1990: 660-673
25		J. V. Tucker, Jeffery I. Zucker: Toward a General Theory of Computation and Specification over Abstract Data Types. ICCI 1990: 129-133
	1989
24		J. V. Tucker, Jeffery I. Zucker: Horn Programs and Semicomputable Relations on Abstract Structures. ICALP 1989: 745-760
23		A. R. Martin, J. V. Tucker: The concurrent assignment representation of synchronous systems. Parallel Computing 9(2): 227-256 (1989)
	1988
22		Karl Meinke, J. V. Tucker: The Scope and Limits of Synchronous Concurrent Computation. Concurrency 1988: 163-180
21		Viggo Stoltenberg-Hansen, J. V. Tucker: Complete Local Rings as Domains. J. Symb. Log. 53(2): 603-624 (1988)
	1987
20		A. R. Martin, J. V. Tucker: The Concurrent Assignment Representation of Synchronous Systems. PARLE (2) 1987: 369-386
19		Jan A. Bergstra, J. V. Tucker: Algebraic Specifications of Computable and Semicomputable Data Types. Theor. Comput. Sci. 50: 137-181 (1987)
	1985
18		Jan A. Bergstra, J. V. Tucker: Top-Down Design and the Algebra of Communicating Processes. Sci. Comput. Program. 5(2): 171-199 (1985)
	1984
17		Jan A. Bergstra, Jan Willem Klop, J. V. Tucker: Process Algebra with Asynchronous Communication Mechanisms. Seminar on Concurrency 1984: 76-95
16		Jan A. Bergstra, J. V. Tucker: The Axiomatic Semantics of Programs Based on Hoare's Logic. Acta Inf. 21: 293-320 (1984)
15		Jan A. Bergstra, J. V. Tucker: Hoare's Logic for Programming Languages with two Data Types. Theor. Comput. Sci. 28: 215-221 (1984)
	1983
14		Jan A. Bergstra, Jan Willem Klop, J. V. Tucker: Algebraic Tools for System Construction. Logic of Programs 1983: 34-44
13		Jan A. Bergstra, J. V. Tucker: Initial and Final Algebra Semantics for Data Type Specifications: Two Characterization Theorems. SIAM J. Comput. 12(2): 366-387 (1983)
12		Jan A. Bergstra, J. V. Tucker: Hoare's Logic and Peano's Arithmetic. Theor. Comput. Sci. 22: 265-284 (1983)
	1982
11		Peter R. J. Asveld, J. V. Tucker: Complexity Theory and the Operational Structure of Algebraic Programming Systems. Acta Inf. 17: 451-476 (1982)
10		Jan A. Bergstra, J. V. Tucker: Two Theorems About the Completeness of Hoare's Logic. Inf. Process. Lett. 15(4): 143-149 (1982)
9		Jan A. Bergstra, J. V. Tucker: The Completeness of the Algebraic Specification Methods for Computable Data Types Information and Control 54(3): 186-200 (1982)
8		Jan A. Bergstra, J. V. Tucker: Expressiveness and the Completeness of Hoare's Logic. J. Comput. Syst. Sci. 25(3): 267-284 (1982)
7		Jan A. Bergstra, Jerzy Tiuryn, J. V. Tucker: Floyds Principle, Correctness Theories and Program Equivalence. Theor. Comput. Sci. 17: 113-149 (1982)
6		Jan A. Bergstra, J. V. Tucker: Some Natural Structures which Fail to Possess a Sound and Decidable Hoare-Like Logic for their While-Programs. Theor. Comput. Sci. 17: 303-315 (1982)
	1981
5		Jan A. Bergstra, J. V. Tucker: Algebraically Specified Programming Systems and Hoare's Logic. ICALP 1981: 348-362
4		Jan A. Bergstra, J. V. Tucker: The Refinement of Specifications and the Stabiliy of Hoare's Logic. Logic of Programs 1981: 24-36
3		Jan A. Bergstra, Manfred Broy, J. V. Tucker, Martin Wirsing: On the Power of Algebraic Specifications. MFCS 1981: 193-204
	1980
2		Jan A. Bergstra, J. V. Tucker: A Characterisation of Computable Data Types by Means of a Finite Equational Specification Method. ICALP 1980: 76-90
1		J. V. Tucker: Computability and the Algebra of Fields: Some Affine Constructions. J. Symb. Log. 45(1): 103-120 (1980)

Coauthor Index

1	Peter R. J. Asveld	[11]
2	Arnold Beckmann	[56]
3	Edwin J. Beggs	[54] [57] [62] [63] [65] [66] [68] [69]
4	Ulrich Berger	[56]
5	Jan A. Bergstra	[2] [3] [4] [5] [6] [7] [8] [9] [10] [12] [13] [14] [15] [16] [17] [18] [19] [34] [35] [55] [59] [60] [64]
6	Jens Blanck	[37] [45] [61] [71]
7	Manfred Broy	[3]
8	Min Chen	[42] [48] [50]
9	Richard H. Clayton	[48] [50]
10	José Félix Costa	[62] [65] [66] [69]
11	Neal A. Harman	[33] [36]
12	Yoram Hirshfeld	[64]
13	Arun V. Holden	[38] [48] [50]
14	Jan Willem Klop	[14] [17]
15	Bruno Loff	[62]
16	Benedikt Löwe	[56]
17	A. R. Martin	[20] [23]
18	Karl Meinke	[22]
19	Bernhard Möller	[39]
20	M. J. Poole	[38]
21	D. Ll. L. Rees	[47]
22	Karen Stephenson	[47]
23	Viggo Stoltenberg-Hansen	[21] [27] [31] [37] [41] [45] [49] [61] [71]
24	B. C. Thompson	[67]
25	Jerzy Tiuryn	[7]
26	S. S. Wainer	[26]
27	Martin Wirsing	[3]
28	Jeffery I. Zucker	[24] [25] [26] [28] [29] [30] [32] [40] [43] [44] [46] [51] [52] [53] [58] [67] [70]

Colors in the list of coauthors

Last update Fri May 25 01:42:58 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page