James F. Lynch

List of publications from the DBLP Bibliography Server - FAQ
Other views: by type - by year (modern) - classic-C

Ask others: ACM DL/Guide -

- CSB - MetaPress - Google - Bing - Yahoo

	2008
c9		James F. Lynch: A Logical Characterization of Individual-Based Models. LICS 2008: 379-390
	2005
j15		James F. Lynch: Convergence law for random graphs with specified degree sequence. ACM Trans. Comput. Log. 6(4): 727-748 (2005)
	2003
j14		James F. Lynch: Analysis and application of adaptive sampling. J. Comput. Syst. Sci. 66(1): 2-19 (2003)
c8		James F. Lynch: Convergence Law for Random Graphs with Specified Degree Sequence. LICS 2003: 301-
	2000
c7		James F. Lynch: Analysis and Application of Adaptive Sampling. PODS 2000: 260-267
	1997
j13		James F. Lynch: Infinitary Logics and Very Sparse Random Graphs. J. Symb. Log. 62(2): 609-623 (1997)
c6		James F. Lynch: Pebble Games in Model Theory. Structures in Logic and Computer Science 1997: 66-83
	1995
j12		James F. Lynch: On the Threshold of Chaos in Random Boolean Cellular Automata. Random Struct. Algorithms 6(2/3): 239-260 (1995)
c5		James F. Lynch, Jerzy Tyszkiewicz: The Infinitary Logic of Sparse Random Graphs. LICS 1995: 46-53
	1994
j11		James F. Lynch: An Extension of 0-1 Laws. Random Struct. Algorithms 5(1): 155-172 (1994)
j10		James F. Lynch: Random Resource Allocation Graphs and the Probability of Deadlock. SIAM J. Discrete Math. 7(3): 458-473 (1994)
	1993
j9		James F. Lynch: Threshold Functions for Markov Chains: a Graph Theoretic Approach. Combinatorics, Probability & Computing 2: 351-362 (1993)
j8		Peter Dolan, James F. Lynch: The Logic of Ordered Random Structures. Random Struct. Algorithms 4(4): 429-447 (1993)
c4		James F. Lynch: Infinitary Logics and Very Sparse Random Graphs. LICS 1993: 191-198
	1992
j7		James F. Lynch: The Quantifier Structure of Sentences That Characterize Nondeterministic Time Complexity. Computational Complexity 2: 40-66 (1992)
j6		James F. Lynch: Probabilities of Sentences about Very Sparse Random Graphs. Random Struct. Algorithms 3(1): 33-54 (1992)
	1990
j5		James F. Lynch: Taxonomic classes of sets. J. Comb. Theory, Ser. A 55(1): 143-152 (1990)
c3		James F. Lynch: The Quantifier Structure of Sentences that Characterize Nondeterministic Time Complexity. Structure in Complexity Theory Conference 1990: 210-222
c2		James F. Lynch: Probabilities of Sentences about Very Sparse Random Graphs. FOCS 1990: 689-696
	1986
c1		James F. Lynch: A Depth- Size Tradeoff for Boolean Circuits with Unbounded Fan- In. Structure in Complexity Theory Conference 1986: 234-248
	1982
j4		James F. Lynch: On Sets of Relations Definable by Addition. J. Symb. Log. 47(3): 659-668 (1982)
j3		James F. Lynch: Complexity Classes and Theories of Finite Models. Mathematical Systems Theory 15(2): 127-144 (1982)
	1981
j2		James F. Lynch: The visually distinct configurations of k sets. Discrete Mathematics 33(3): 281-287 (1981)
	1975
j1		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)

Coauthor Index

1	Peter Dolan	[j8]
2	Jerzy Tyszkiewicz	[c5]

Last update Thu May 23 15:37:41 2013 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page