The SCEAS System
| |||||||

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

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |