Thomas Walker Lynch's Publications
Site Navigation Panel
Scroll down to see the yellow line under the content.
Bold blue text signifies a link even in headings. Panels flow
through columns and resize depending on the width of the window.
Publication Index
A complete, citation-sorted list of Thomas’s scholarly work — journal
articles, conference papers, preprints, and selected technical reports —
is maintained on Google Scholar.
View full list on Google Scholar
View full list on Google Scholar
Theses
Binary Adders (M.S. Thesis, 1996)
Type: Master’s thesis
Author: Thomas Walker Lynch
Venue: University of Texas at Austin, Electrical and Computer Engineering
Link: UT Austin thesis repository
Summary: A detailed study of two-operand addition and its implementation in silicon, covering a range of adder architectures and their timing, area, and design trade-offs. This work underpins Thomas’s later high-performance arithmetic patents and publications.
Author: Thomas Walker Lynch
Venue: University of Texas at Austin, Electrical and Computer Engineering
Link: UT Austin thesis repository
Summary: A detailed study of two-operand addition and its implementation in silicon, covering a range of adder architectures and their timing, area, and design trade-offs. This work underpins Thomas’s later high-performance arithmetic patents and publications.
Peer-reviewed publications
Processing SPARQL Queries on Deep Web Sources (2018)
Type: Conference paper
Authors: Andrea Calì, Tommaso Di Noia, Thomas W. Lynch, Azzurra Ragone
Venue: 26th Italian Symposium on Advanced Database Systems (SEBD 2018)
Link: CEUR-WS SEBD 2018 proceedings
Summary: Extends the Deep Web work to SPARQL, showing how to answer RDF queries when data is only reachable through constrained web interfaces.
Authors: Andrea Calì, Tommaso Di Noia, Thomas W. Lynch, Azzurra Ragone
Venue: 26th Italian Symposium on Advanced Database Systems (SEBD 2018)
Link: CEUR-WS SEBD 2018 proceedings
Summary: Extends the Deep Web work to SPARQL, showing how to answer RDF queries when data is only reachable through constrained web interfaces.
Processing Keyword Queries Under Access Limitations (2015)
Type: Conference / book chapter
Authors: Andrea Calì, Thomas W. Lynch, Davide Martinenghi, Riccardo Torlone
Venue: In Open Access Semantic Keyword-Based Search on Structured Data Sources, LNCS 9398, Springer (2015)
DOI: 10.1007/978-3-319-27932-9_3
Summary: Develops a framework for answering keyword queries over “Deep Web” data sources that can only be accessed through restricted interfaces.
Authors: Andrea Calì, Thomas W. Lynch, Davide Martinenghi, Riccardo Torlone
Venue: In Open Access Semantic Keyword-Based Search on Structured Data Sources, LNCS 9398, Springer (2015)
DOI: 10.1007/978-3-319-27932-9_3
Summary: Develops a framework for answering keyword queries over “Deep Web” data sources that can only be accessed through restricted interfaces.
A Mechanically Checked Proof of the AMD5K86 Floating-Point Division Program (1998)
Type: Journal article
Authors: J Strother Moore, Thomas W. Lynch, Matt Kaufmann
Venue: IEEE Transactions on Computers 47(9), 913–926 (1998)
DOI: 10.1109/12.713311
Summary: One of the early industrial-scale uses of a theorem prover to verify hardware: a mechanically checked proof of the AMD5K86 floating-point division microcode.
Authors: J Strother Moore, Thomas W. Lynch, Matt Kaufmann
Venue: IEEE Transactions on Computers 47(9), 913–926 (1998)
DOI: 10.1109/12.713311
Summary: One of the early industrial-scale uses of a theorem prover to verify hardware: a mechanically checked proof of the AMD5K86 floating-point division microcode.
Software for High Radix On-Line Arithmetic (1996)
Type: Journal article (software / compiler)
Authors: Thomas W. Lynch, Michael J. Schulte
Venue: Reliable Computing 2(2), 133–138 (1996)
DOI: 10.1007/BF02425915
Summary: Describes the first software and compiler support for the high radix on-line arithmetic method, providing emulation modules and tool support so the technique can run efficiently on conventional processors.
Authors: Thomas W. Lynch, Michael J. Schulte
Venue: Reliable Computing 2(2), 133–138 (1996)
DOI: 10.1007/BF02425915
Summary: Describes the first software and compiler support for the high radix on-line arithmetic method, providing emulation modules and tool support so the technique can run efficiently on conventional processors.
A High Radix On-Line Arithmetic for Credible and Accurate Computing (1995)
Type: Journal article
Authors: Thomas Lynch, Michael J. Schulte
Venue: Journal of Universal Computer Science 1(7) (1995)
DOI: 10.3217/jucs-001-07-0439
Summary: Proposes instruction-level support for variable-precision on-line arithmetic so numerical results can be guaranteed to meet a requested accuracy.
Authors: Thomas Lynch, Michael J. Schulte
Venue: Journal of Universal Computer Science 1(7) (1995)
DOI: 10.3217/jucs-001-07-0439
Summary: Proposes instruction-level support for variable-precision on-line arithmetic so numerical results can be guaranteed to meet a requested accuracy.
High Radix On-Line Arithmetic for Credible and Accurate Computing (1995)
Type: Conference paper (method origin)
Author: Thomas W. Lynch
Venue: Real Numbers and Computers (Les Nombres Réels et l’Ordinateur), École des Mines de Saint-Étienne, France, 1995, pp. 78–89.
Notes: This paper introduces the high radix on-line arithmetic method used to provide credible, variable-precision numerical results. A revised version of this work later appeared in the Journal of Universal Computer Science, special issue on Real Numbers and Computers (J.UCS 1(7), 439–453, 1995, DOI: 10.3217/jucs-001-07-0439 ).
Author: Thomas W. Lynch
Venue: Real Numbers and Computers (Les Nombres Réels et l’Ordinateur), École des Mines de Saint-Étienne, France, 1995, pp. 78–89.
Notes: This paper introduces the high radix on-line arithmetic method used to provide credible, variable-precision numerical results. A revised version of this work later appeared in the Journal of Universal Computer Science, special issue on Real Numbers and Computers (J.UCS 1(7), 439–453, 1995, DOI: 10.3217/jucs-001-07-0439 ).
The K5 Transcendental Functions (1995)
Type: Conference paper
Authors: Thomas Lynch, A. Ahmed, M. Schulte, T. Callaway, R. Tisdale
Venue: Proc. 12th IEEE Symposium on Computer Arithmetic (ARITH-12)
DOI: 10.1109/ARITH.1995.465368
Summary: Describes the design and development flow of the AMD K5 transcendental function unit (log, exp, trig, etc.), showing how numerical methods and microcode were combined under tight timing and area constraints.
Authors: Thomas Lynch, A. Ahmed, M. Schulte, T. Callaway, R. Tisdale
Venue: Proc. 12th IEEE Symposium on Computer Arithmetic (ARITH-12)
DOI: 10.1109/ARITH.1995.465368
Summary: Describes the design and development flow of the AMD K5 transcendental function unit (log, exp, trig, etc.), showing how numerical methods and microcode were combined under tight timing and area constraints.
A Spanning Tree Carry Lookahead Adder (1992)
Type: Journal article
Authors: Thomas Lynch, Earl E. Swartzlander Jr.
Venue: IEEE Transactions on Computers 41(8), 931–939 (1992)
DOI: 10.1109/12.156535
Summary: Introduces a carry-lookahead adder organized as a spanning tree, providing very fast addition suitable for high-performance floating-point hardware.
Authors: Thomas Lynch, Earl E. Swartzlander Jr.
Venue: IEEE Transactions on Computers 41(8), 931–939 (1992)
DOI: 10.1109/12.156535
Summary: Introduces a carry-lookahead adder organized as a spanning tree, providing very fast addition suitable for high-performance floating-point hardware.
A Formalization of Computer Arithmetic (1992)
Type: Conference paper
Author: Thomas W. Lynch
Venue: 3rd IMACS–GAMM Symposium on Computer Arithmetic and Scientific Computation (SCAN-91), Elsevier, 1992
Link: Conference volume information
Summary: Gives a formal logic description of numeric computing and analyzes how hardware and software handle exceptional conditions in arithmetic.
Author: Thomas W. Lynch
Venue: 3rd IMACS–GAMM Symposium on Computer Arithmetic and Scientific Computation (SCAN-91), Elsevier, 1992
Link: Conference volume information
Summary: Gives a formal logic description of numeric computing and analyzes how hardware and software handle exceptional conditions in arithmetic.
The Energy Content of Knowledge (1992)
Type: Conference paper
Author: Thomas W. Lynch
Venue: IEEE Workshop on Physics and Computation (PhysComp), 1992
DOI: 10.1109/PHYCMP.1992.615499
Summary: Explores how information and physical systems are linked by energy costs, relating computation and thermodynamics.
Author: Thomas W. Lynch
Venue: IEEE Workshop on Physics and Computation (PhysComp), 1992
DOI: 10.1109/PHYCMP.1992.615499
Summary: Explores how information and physical systems are linked by energy costs, relating computation and thermodynamics.
The Redundant Cell Adder (1991)
Type: Conference paper
Authors: Thomas Lynch, Earl E. Swartzlander Jr.
Venue: 10th IEEE Symposium on Computer Arithmetic (ARITH-10), 1991
DOI: 10.1109/ARITH.1991.145553
Summary: Presents an adder structure that reduces carry delay using “redundant cells,” contributing to faster integer arithmetic implementations.
Authors: Thomas Lynch, Earl E. Swartzlander Jr.
Venue: 10th IEEE Symposium on Computer Arithmetic (ARITH-10), 1991
DOI: 10.1109/ARITH.1991.145553
Summary: Presents an adder structure that reduces carry delay using “redundant cells,” contributing to faster integer arithmetic implementations.
Technical reports & preprints
Critique of Cantor’s Method and Presentation of an Enumeration of Functions over ℕ (2025)
Type: Preprint
Author: Thomas Walker Lynch
Venue: Zenodo / PhilPapers
DOI: 10.5281/zenodo.15090739
Summary: Presents a structural enumeration of all total functions from the natural numbers to the natural numbers. The paper formalizes how representations work, gives an explicit algorithmic version of Cantor’s diagonal argument, and applies it to standard examples. In those cases it argues that the usual diagonal construction does not actually produce exceptions once representation details are handled carefully.
Author: Thomas Walker Lynch
Venue: Zenodo / PhilPapers
DOI: 10.5281/zenodo.15090739
Summary: Presents a structural enumeration of all total functions from the natural numbers to the natural numbers. The paper formalizes how representations work, gives an explicit algorithmic version of Cantor’s diagonal argument, and applies it to standard examples. In those cases it argues that the usual diagonal construction does not actually produce exceptions once representation details are handled carefully.
Some Computer Programming Terms Related to Functions (2019)
Type: Technical report
Author: Thomas Walker Lynch
Link: ResearchGate
DOI: 10.13140/RG.2.2.17056.33281
Summary: Reviews the many terms programmers use for callable units (functions, procedures, lambdas, etc.) and relates them to one another.
Author: Thomas Walker Lynch
Link: ResearchGate
DOI: 10.13140/RG.2.2.17056.33281
Summary: Reviews the many terms programmers use for callable units (functions, procedures, lambdas, etc.) and relates them to one another.
Adventures in JavaScriptLand (2019)
Type: Preprint
Author: Thomas Walker Lynch
Link: ResearchGate
Summary: A technical exploration of JavaScript concepts such as scoping, closures, and object models, written as a guided tour for working programmers.
Author: Thomas Walker Lynch
Link: ResearchGate
Summary: A technical exploration of JavaScript concepts such as scoping, closures, and object models, written as a guided tour for working programmers.
Numerical Analysis of Computer Approximations (2018)
Type: Technical report
Author: Thomas Walker Lynch
Link: ResearchGate
DOI: 10.13140/RG.2.2.10906.49601
Summary: Summarizes the hybrid error-analysis method Thomas used at AMD to bound floating-point errors in numeric algorithms.
Author: Thomas Walker Lynch
Link: ResearchGate
DOI: 10.13140/RG.2.2.10906.49601
Summary: Summarizes the hybrid error-analysis method Thomas used at AMD to bound floating-point errors in numeric algorithms.
Dataplex Database Morphology Allocation (2015)
Type: Technical report
Author: Thomas Walker Lynch
Link: ResearchGate
Summary: Explores how a database’s internal memory manager and the database schema interact. Proposes “morphology allocation” strategies for keeping data layouts coherent and efficient as applications evolve.
Author: Thomas Walker Lynch
Link: ResearchGate
Summary: Explores how a database’s internal memory manager and the database schema interact. Proposes “morphology allocation” strategies for keeping data layouts coherent and efficient as applications evolve.
Towards a Better Understanding of CAR, CDR, CADR and the Others (2015)
Type: Preprint / article
Author: Thomas Walker Lynch
Link: arXiv:1507.05956
DOI: 10.48550/arXiv.1507.05956
Summary: Clarifies the origins and meaning of the Lisp function names
Author: Thomas Walker Lynch
Link: arXiv:1507.05956
DOI: 10.48550/arXiv.1507.05956
Summary: Clarifies the origins and meaning of the Lisp function names
car and cdr, treating them as an
access language for tree-structured data and giving rules that help
students read compound accessors.
Coincidence and Premonition (2012)
Type: Technical report
Author: Thomas Walker Lynch
Link: ResearchGate
DOI: 10.13140/RG.2.2.24316.54407
Summary: Explains why humans over-interpret coincidences, combining probability calculations with speculative discussion of how we perceive unlikely events.
Author: Thomas Walker Lynch
Link: ResearchGate
DOI: 10.13140/RG.2.2.24316.54407
Summary: Explains why humans over-interpret coincidences, combining probability calculations with speculative discussion of how we perceive unlikely events.
More Jabber about the Collatz Conjecture and a Closed Form for Detecting Cycles
on Special Subsequences (2011)
Type: Preprint
Author: Thomas Walker Lynch
Link: arXiv:1108.4056
DOI: 10.48550/arXiv.1108.4056
Summary: Studies special Collatz subsequences and gives mixed-integer equations that would characterize potential cycles on those subsequences.
Author: Thomas Walker Lynch
Link: arXiv:1108.4056
DOI: 10.48550/arXiv.1108.4056
Summary: Studies special Collatz subsequences and gives mixed-integer equations that would characterize potential cycles on those subsequences.
Low Power Receiver Circuit (2010)
Type: Technical report
Author: Thomas Walker Lynch
Link: Technical disclosure (Google Patents)
Summary: Describes a receiver design aimed at reducing power consumption while maintaining reliable signal detection, work that also led to a corresponding patent filing.
Author: Thomas Walker Lynch
Link: Technical disclosure (Google Patents)
Summary: Describes a receiver design aimed at reducing power consumption while maintaining reliable signal detection, work that also led to a corresponding patent filing.
Architecturally Opaque Instruction Set to Computer Science Object Binding (2006)
Type: Technical report
Author: Thomas Walker Lynch
Link: 🚧 missing link, try requesting it
Summary: Discusses how instruction sets and higher-level programming objects can be bound in ways that preserve abstraction while still enabling efficient hardware execution.
Author: Thomas Walker Lynch
Link: 🚧 missing link, try requesting it
Summary: Discusses how instruction sets and higher-level programming objects can be bound in ways that preserve abstraction while still enabling efficient hardware execution.
Macro Sharing in Genetics Causing Evolution (1998)
Type: Technical report / essay
Author: Thomas Walker Lynch
Link: thomaswlynch.com
Summary: Discusses evolution in terms of “macro sharing” of genetic structures, treating genes and gene clusters as reusable building blocks that can be recombined across lineages.
Author: Thomas Walker Lynch
Link: thomaswlynch.com
Summary: Discusses evolution in terms of “macro sharing” of genetic structures, treating genes and gene clusters as reusable building blocks that can be recombined across lineages.
Ubiquitous Expansion of Particles Would Be Observed as an Attractive Force (1997)
Type: Technical report
Author: Thomas Walker Lynch
Link: ResearchGate
DOI: 10.13140/RG.2.2.21799.96166
Summary: Proposes that if all particles expand uniformly, the resulting observations would mimic gravitational attraction, offering an alternative viewpoint on gravity.
Author: Thomas Walker Lynch
Link: ResearchGate
DOI: 10.13140/RG.2.2.21799.96166
Summary: Proposes that if all particles expand uniformly, the resulting observations would mimic gravitational attraction, offering an alternative viewpoint on gravity.