- CSB - MetaPress - Google - Bing - Yahoo
 | 2008 | |
|---|---|---|
| 24 |      | James F. Lynch: A Logical Characterization of Individual-Based Models. LICS 2008: 379-390 |
| 2005 | ||
| 23 | | James F. Lynch: Convergence law for random graphs with specified degree sequence. ACM Trans. Comput. Log. 6(4): 727-748 (2005) |
| 2003 | ||
| 22 | | James F. Lynch: Convergence Law for Random Graphs with Specified Degree Sequence. LICS 2003: 301- |
| 21 | | James F. Lynch: Analysis and application of adaptive sampling. J. Comput. Syst. Sci. 66(1): 2-19 (2003) |
| 2000 | ||
| 20 | | James F. Lynch: Analysis and Application of Adaptive Sampling. PODS 2000: 260-267 |
| 1997 | ||
| 19 |  | James F. Lynch: Pebble Games in Model Theory. Structures in Logic and Computer Science 1997: 66-83 |
| 18 | | James F. Lynch: Infinitary Logics and Very Sparse Random Graphs. J. Symb. Log. 62(2): 609-623 (1997) |
| 1995 | ||
| 17 | | James F. Lynch, Jerzy Tyszkiewicz: The Infinitary Logic of Sparse Random Graphs LICS 1995: 46-53 |
| 16 | | James F. Lynch: On the Threshold of Chaos in Random Boolean Cellular Automata. Random Struct. Algorithms 6(2/3): 239-260 (1995) |
| 1994 | ||
| 15 | | James F. Lynch: An Extension of 0-1 Laws. Random Struct. Algorithms 5(1): 155-172 (1994) |
| 14 | | James F. Lynch: Random Resource Allocation Graphs and the Probability of Deadlock. SIAM J. Discrete Math. 7(3): 458-473 (1994) |
| 1993 | ||
| 13 | | James F. Lynch: Infinitary Logics and Very Sparse Random Graphs LICS 1993: 191-198 |
| 12 | | James F. Lynch: Threshold Functions for Markov Chains: a Graph Theoretic Approach. Combinatorics, Probability & Computing 2: 351-362 (1993) |
| 11 | | Peter Dolan, James F. Lynch: The Logic of Ordered Random Structures. Random Struct. Algorithms 4(4): 429-447 (1993) |
| 1992 | ||
| 10 | | James F. Lynch: The Quantifier Structure of Sentences That Characterize Nondeterministic Time Complexity. Computational Complexity 2: 40-66 (1992) |
| 9 | | James F. Lynch: Probabilities of Sentences about Very Sparse Random Graphs. Random Struct. Algorithms 3(1): 33-54 (1992) |
| 1990 | ||
| 8 | | James F. Lynch: Probabilities of Sentences about Very Sparse Random Graphs FOCS 1990: 689-696 |
| 7 | | James F. Lynch: The Quantifier Structure of Sentences that Characterize Nondeterministic Time Complexity. Structure in Complexity Theory Conference 1990: 210-222 |
| 6 | | James F. Lynch: Taxonomic classes of sets. J. Comb. Theory, Ser. A 55(1): 143-152 (1990) |
| 1986 | ||
| 5 | | James F. Lynch: A Depth- Size Tradeoff for Boolean Circuits with Unbounded Fan- In. Structure in Complexity Theory Conference 1986: 234-248 |
| 1982 | ||
| 4 | | James F. Lynch: On Sets of Relations Definable by Addition. J. Symb. Log. 47(3): 659-668 (1982) |
| 3 | | James F. Lynch: Complexity Classes and Theories of Finite Models. Mathematical Systems Theory 15(2): 127-144 (1982) |
| 1981 | ||
| 2 | | James F. Lynch: The visually distinct configurations of k sets. Discrete Mathematics 33(3): 281-287 (1981) |
| 1975 | ||
| 1 | | James F. Lynch: An Asymptotic Formula for the Number of Classes of Sets of n Indistinguishable Elements. J. Comb. Theory, Ser. A 19(1): 109-112 (1975) |
| 1 | Peter Dolan | [11] |
| 2 | Jerzy Tyszkiewicz | [17] |