Larry Welch

According to our database, Larry Welch authored at least 9 papers between 1998 and 2013.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2013

When series of computable functions with varying domains are computable.

Iraj Kalantari, Larry Welch

Math. Log. Q., 2013

2010

Fairness in Agent Based Simulation Frameworks.

Larry Welch, Stephen Ekwaro-Osire

J. Comput. Inf. Sci. Eng., 2010

2008

On Turing degrees of points in computable topology.

Iraj Kalantari, Larry Welch

Math. Log. Q., 2008

On degree-preserving homeomorphisms between trees in computable topology.

Iraj Kalantari, Larry Welch

Arch. Math. Log., 2008

2004

Density and Baire category in recursive topology.

Iraj Kalantari, Larry Welch

Math. Log. Q., 2004

A blend of methods of recursion theory and topology: A Pi₁⁰ tree of shadow points.

Iraj Kalantari, Larry Welch

Arch. Math. Log., 2004

2003

A blend of methods of recursion theory and topology.

Iraj Kalantari, Larry Welch

Ann. Pure Appl. Log., 2003

2002

Recursive Quantum Functions, Avoidable Points, & Shadow Points in Recursive Analysis.

Iraj Kalantari, Larry Welch

Proceedings of the Computability and Complexity in Analysis, 2002

1998

Issues in the Design of Domino Logic Circuits.

Pranjal Srivastava, Andrew Pua, Larry Welch

Proceedings of the 8th Great Lakes Symposium on VLSI (GLS-VLSI '98), 1998