James F. Lynch

30 papers A* 6Journal 18Unranked 5

Year	Rank	Type	Title / Venue / Authors
2013	J	`jnl`	Stochastic flux analysis of chemical reaction networks. BMC Syst. Biol. Ozan Kahramanogullari, James F. Lynch
2012	—	`conf`	Algorithmic Systems Ecology: Experiments on Multiple Interaction Types and Patches. SEFM Satellite Events Ozan Kahramanogullari, James F. Lynch, Corrado Priami
2011	J	`jnl`	CoSBiLab LIME: A language interface for stochastic dynamical modelling in ecology. Environ. Model. Softw. Ozan Kahramanogullari, Ferenc Jordán, James F. Lynch
2008	A*	`conf`	A Logical Characterization of Individual-Based Models. LICS James F. Lynch
2005	J	`jnl`	Convergence law for random graphs with specified degree sequence. ACM Trans. Comput. Log. James F. Lynch
2003	J	`jnl`	Analysis and application of adaptive sampling. J. Comput. Syst. Sci. James F. Lynch
2003	A*	`conf`	Convergence Law for Random Graphs with Specified Degree Sequence. LICS James F. Lynch
2000	A*	`conf`	Analysis and Application of Adaptive Sampling. PODS James F. Lynch
1997	J	`jnl`	Infinitary Logics and Very Sparse Random Graphs. J. Symb. Log. James F. Lynch
1997	—	`ed.`	Logic and Random Structures, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, November 5-7, 1995 Logic and Random Structures Ravi Bopu Boppana, James F. Lynch
1997	—	`conf`	Pebble Games in Model Theory. Structures in Logic and Computer Science James F. Lynch
1995	—	`conf`	Convergence Laws for Random Graphs. Logic Colloquium James F. Lynch
1995	J	`jnl`	On the Threshold of Chaos in Random Boolean Cellular Automata. Random Struct. Algorithms James F. Lynch
1995	A*	`conf`	The Infinitary Logic of Sparse Random Graphs LICS James F. Lynch, Jerzy Tyszkiewicz
1994	J	`jnl`	An Extension of 0-1 Laws. Random Struct. Algorithms James F. Lynch
1994	J	`jnl`	Random Resource Allocation Graphs and the Probability of Deadlock. SIAM J. Discret. Math. James F. Lynch
1993	J	`jnl`	Convergence laws for random words. Australas. J Comb. James F. Lynch
1993	A*	`conf`	Infinitary Logics and Very Sparse Random Graphs LICS James F. Lynch
1993	J	`jnl`	The Logic of Ordered Random Structures. Random Struct. Algorithms Peter Dolan, James F. Lynch
1993	J	`jnl`	Threshold Functions for Markov Chains: a Graph Theoretic Approach. Comb. Probab. Comput. James F. Lynch
1992	J	`jnl`	Probabilities of Sentences about Very Sparse Random Graphs. Random Struct. Algorithms James F. Lynch
1992	J	`jnl`	The Quantifier Structure of Sentences That Characterize Nondeterministic Time Complexity. Comput. Complex. James F. Lynch
1990	A*	`conf`	Probabilities of Sentences about Very Sparse Random Graphs FOCS James F. Lynch
1990	J	`jnl`	Taxonomic classes of sets. J. Comb. Theory A James F. Lynch
1990	—	`conf`	The Quantifier Structure of Sentences that Characterize Nondeterministic Time Complexity. SCT James F. Lynch
1986	—	`conf`	A Depth- Size Tradeoff for Boolean Circuits with Unbounded Fan- In. SCT James F. Lynch
1982	J	`jnl`	Complexity Classes and Theories of Finite Models. Math. Syst. Theory James F. Lynch
1982	J	`jnl`	On Sets of Relations Definable by Addition. J. Symb. Log. James F. Lynch
1981	J	`jnl`	The visually distinct configurations of k sets. Discret. Math. James F. Lynch
1975	J	`jnl`	An Asymptotic Formula for the Number of Classes of Sets of n Indistinguishable Elements. J. Comb. Theory A James F. Lynch