John Tucker - Publications#

JV Tucker's Scholar indices: 132 references, 1885 citations, h-index = 24, g-index = 38 . These numbers are high for theoretical computer science.

These 14 entries are only a subset of Tucker's extensive fully refereed journal and book publications. The list omits some of Tucker's most cited publications (books, journals, etc.).

Major publications#

DATA TYPES

1. J A Bergstra and J V Tucker, The completeness of the algebraic specification methods for data types, Information and Control, 54 (1982) 186-200.

2. J A Bergstra and J V Tucker, Equational specifications, complete term rewriting systems, and computable and semicomputable algebras, Journal of ACM, 42 (1995) 1194-1230.

3. J A Bergstra and J V Tucker, The rational numbers as an abstract data type, Journal ACM, 54, 2, Article 7 (April 2007) 25 pages.

4. J A Bergstra, Y Hirshfeld and J V Tucker, Meadows and the equational specification of division, Theoretical Computer Science 410 (2009) 1261-1271.

APPLICATIONS

5. M Chen and J V Tucker, Constructive volume geometry, Computer Graphics Forum, 19 (2000) 281-293.

6. A V Holden, J V Tucker and M Poole, An algorithmic model of the mammalian heart: propogation, vulnerability, re-entry and fibrillation, International J of Bifurcation and Chaos, 6 (1996) 1623-1635.

GENERAL COMPUTABILITY THEORY 7. V Stoltenberg-Hansen and J V Tucker, Complete local rings as domains, Journal of Symbolic Logic, 53 (1988) 603-624.

8. J V Tucker and J I Zucker, Abstract computability and algebraic specification, ACM Transactions on Computational Logic, 3 (2002) 279-333.

9. J V Tucker and J I Zucker, Abstract versus concrete models of computation on partial metric algebras, ACM Transactions on Computational Logic, 5 (4) (2004) 611-668.

PHYSICS AND COMPUTATION

10. E J Beggs and J V Tucker, Experimental computation of real numbers by Newtonian machines, Proceedings of the Royal Society Series A, 463 (2007) 1541-1561.

11. E J Beggs, J F Costa, B Loff, and J V Tucker, Computational complexity with experiments as oracles, Proceedings of the Royal Society Series A, 464 (2008) 2777-2801.

12. E J Beggs, J F Costa, B Loff, and J V Tucker, Computational complexity with experiments as oracles. II. Upper bounds, Proceedings of the Royal Society Series A, 465 (2009), 1453-1465.

13. B C Thompson, J V Tucker and J I Zucker, Unifying computers and dynamical systems using the theory of synchronous concurrent algorithms, Applied Mathematics and Computation, 215 (2009) 1386-1403.

14. E J Beggs, J F Costa and J V Tucker, Limits to measurement in experiments governed by algorithms, Mathematical Structures in Computer Science, 20 (2010) 1019-1050.