James F. Lynch

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

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2013
Stochastic flux analysis of chemical reaction networks.
BMC Syst. Biol., 2013

2012
Algorithmic Systems Ecology: Experiments on Multiple Interaction Types and Patches.
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.
Environ. Model. Softw., 2011

2008
A Logical Characterization of Individual-Based Models.
Proceedings of the Twenty-Third Annual IEEE Symposium on Logic in Computer Science, 2008

2005
Convergence law for random graphs with specified degree sequence.
ACM Trans. Comput. Log., 2005

2003
Analysis and application of adaptive sampling.
J. Comput. Syst. Sci., 2003

1997
Infinitary Logics and Very Sparse Random Graphs.
J. Symb. Log., 1997

Pebble Games in Model Theory.
Proceedings of the Structures in Logic and Computer Science, 1997

1995
On the Threshold of Chaos in Random Boolean Cellular Automata.
Random Struct. Algorithms, 1995

Convergence Laws for Random Graphs.
Proceedings of the Annual European Summer Meeting of the Association of Symbolic Logic, 1995

The Infinitary Logic of Sparse Random Graphs
Proceedings of the Proceedings, 1995

1994
Random Resource Allocation Graphs and the Probability of Deadlock.
SIAM J. Discret. Math., 1994

An Extension of 0-1 Laws.
Random Struct. Algorithms, 1994

1993
The Logic of Ordered Random Structures.
Random Struct. Algorithms, 1993

Threshold Functions for Markov Chains: a Graph Theoretic Approach.
Comb. Probab. Comput., 1993

Convergence laws for random words.
Australas. J Comb., 1993

1992
Probabilities of Sentences about Very Sparse Random Graphs.
Random Struct. Algorithms, 1992

The Quantifier Structure of Sentences That Characterize Nondeterministic Time Complexity.
Comput. Complex., 1992

1990
Taxonomic classes of sets.
J. Comb. Theory A, 1990

1986
A Depth- Size Tradeoff for Boolean Circuits with Unbounded Fan- In.
Proceedings of the Structure in Complexity Theory, 1986

1982
Complexity Classes and Theories of Finite Models.
Math. Syst. Theory, 1982

On Sets of Relations Definable by Addition.
J. Symb. Log., 1982

1981
The visually distinct configurations of k sets.
Discret. Math., 1981

1975
An Asymptotic Formula for the Number of Classes of Sets of n Indistinguishable Elements.
J. Comb. Theory A, 1975


  Loading...