| |
 |      |
                                |
Note: Links lead to the DBLP on the Web. James F. Lynch 9 James F. Lynch: Analysis and Application of Adaptive Sampling. PODS 2000 : 260-267 8 James F. Lynch: Pebble Games in Model Theory. Structures in Logic and Computer Science 1997 : 66-83 7 James F. Lynch: Infinitary Logics and Very Sparse Random Graphs. The Journal of Symbolic Logic 62 (2): 609-623 (1997) 6 James F. Lynch, Jerzy Tyszkiewicz : The Infinitary Logic of Sparse Random Graphs. LICS 1995 : 46-53 5 James F. Lynch: Infinitary Logics and Very Sparse Random Graphs. LICS 1993 : 191-198 4 James F. Lynch: The Quantifier Structure of Sentences That Characterize Nondeterministic Time Complexity. Computational Complexity 2 : 40-66 (1992) 3 James F. Lynch: Probabilities of Sentences about Very Sparse Random Graphs. FOCS 1990 : 689-696 2 James F. Lynch: The Quantifier Structure of Sentences that Characterize Nondeterministic Time Complexity. Structure in Complexity Theory Conference 1990 : 210-222 1 James F. Lynch: Complexity Classes and Theories of Finite Models. Mathematical Systems Theory 15 (2): 127-144 (1982) DiSC'01 Copyright ©2002 ACM Inc. |
