James F. Lynch

According to our database, James F. Lynch authored at least 24 papers between 1975 and 2013.

Collaborative distances:

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

2013

Stochastic flux analysis of chemical reaction networks.

Ozan Kahramanogullari, James F. Lynch

BMC Syst. Biol., 2013

2012

Algorithmic Systems Ecology: Experiments on Multiple Interaction Types and Patches.

Ozan Kahramanogullari, James F. Lynch, Corrado Priami

Proceedings of the Information Technology and Open Source: Applications for Education, Innovation, and Sustainability, 2012

2011

CoSBiLab LIME: A language interface for stochastic dynamical modelling in ecology.

Ozan Kahramanogullari, Ferenc Jordán, James F. Lynch

Environ. Model. Softw., 2011

2008

A Logical Characterization of Individual-Based Models.

James F. Lynch

Proceedings of the Twenty-Third Annual IEEE Symposium on Logic in Computer Science, 2008

2003

Convergence Law for Random Graphs with Specified Degree Sequence.

James F. Lynch

Proceedings of the 18th IEEE Symposium on Logic in Computer Science (LICS 2003), 2003

2000

Analysis and Application of Adaptive Sampling.

James F. Lynch

Proceedings of the Nineteenth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2000

1997

Pebble Games in Model Theory.

James F. Lynch

Proceedings of the Structures in Logic and Computer Science, 1997

1995

On the Threshold of Chaos in Random Boolean Cellular Automata.

James F. Lynch

Random Struct. Algorithms, 1995

Convergence Laws for Random Graphs.

James F. Lynch

Proceedings of the Annual European Summer Meeting of the Association of Symbolic Logic, 1995

The Infinitary Logic of Sparse Random Graphs

James F. Lynch, Jerzy Tyszkiewicz

Proceedings of the Proceedings, 1995

1994

Random Resource Allocation Graphs and the Probability of Deadlock.

James F. Lynch

SIAM J. Discret. Math., 1994

An Extension of 0-1 Laws.

James F. Lynch

Random Struct. Algorithms, 1994

1993

The Logic of Ordered Random Structures.

Peter Dolan, James F. Lynch

Random Struct. Algorithms, 1993

Threshold Functions for Markov Chains: a Graph Theoretic Approach.

James F. Lynch

Comb. Probab. Comput., 1993

Convergence laws for random words.

James F. Lynch

Australas. J Comb., 1993

Infinitary Logics and Very Sparse Random Graphs

James F. Lynch

Proceedings of the Eighth Annual Symposium on Logic in Computer Science (LICS '93), 1993

1990

Taxonomic classes of sets.

James F. Lynch

J. Comb. Theory A, 1990

Probabilities of Sentences about Very Sparse Random Graphs

James F. Lynch

Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990

The Quantifier Structure of Sentences that Characterize Nondeterministic Time Complexity.

James F. Lynch

Proceedings of the Proceedings: Fifth Annual Structure in Complexity Theory Conference, 1990

1986

A Depth- Size Tradeoff for Boolean Circuits with Unbounded Fan- In.

James F. Lynch

Proceedings of the Structure in Complexity Theory, 1986

1982

Complexity Classes and Theories of Finite Models.

James F. Lynch

Math. Syst. Theory, 1982

On Sets of Relations Definable by Addition.

James F. Lynch

J. Symb. Log., 1982

1981

The visually distinct configurations of k sets.

James F. Lynch

Discret. Math., 1981

1975

An Asymptotic Formula for the Number of Classes of Sets of n Indistinguishable Elements.

James F. Lynch

J. Comb. Theory A, 1975