default search action
James F. Lynch
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2013
- [j18]Ozan Kahramanogullari, James F. Lynch:
Stochastic flux analysis of chemical reaction networks. BMC Syst. Biol. 7: 133 (2013) - 2012
- [c11]Ozan Kahramanogullari, James F. Lynch, Corrado Priami:
Algorithmic Systems Ecology: Experiments on Multiple Interaction Types and Patches. SEFM Satellite Events 2012: 154-171 - 2011
- [j17]Ozan Kahramanogullari, Ferenc Jordán, James F. Lynch:
CoSBiLab LIME: A language interface for stochastic dynamical modelling in ecology. Environ. Model. Softw. 26(5): 685-687 (2011)
2000 – 2009
- 2008
- [c10]James F. Lynch:
A Logical Characterization of Individual-Based Models. LICS 2008: 379-390 - 2005
- [j16]James F. Lynch:
Convergence law for random graphs with specified degree sequence. ACM Trans. Comput. Log. 6(4): 727-748 (2005) - 2003
- [j15]James F. Lynch:
Analysis and application of adaptive sampling. J. Comput. Syst. Sci. 66(1): 2-19 (2003) - [c9]James F. Lynch:
Convergence Law for Random Graphs with Specified Degree Sequence. LICS 2003: 301- - 2000
- [c8]James F. Lynch:
Analysis and Application of Adaptive Sampling. PODS 2000: 260-267
1990 – 1999
- 1997
- [j14]James F. Lynch:
Infinitary Logics and Very Sparse Random Graphs. J. Symb. Log. 62(2): 609-623 (1997) - [c7]James F. Lynch:
Pebble Games in Model Theory. Structures in Logic and Computer Science 1997: 66-83 - [e1]Ravi Bopu Boppana, James F. Lynch:
Logic and Random Structures, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, November 5-7, 1995. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 33, DIMACS/AMS 1997, ISBN 978-0-8218-0578-7 [contents] - 1995
- [j13]James F. Lynch:
On the Threshold of Chaos in Random Boolean Cellular Automata. Random Struct. Algorithms 6(2/3): 239-260 (1995) - [c6]James F. Lynch, Jerzy Tyszkiewicz:
The Infinitary Logic of Sparse Random Graphs. LICS 1995: 46-53 - [c5]James F. Lynch:
Convergence Laws for Random Graphs. Logic Colloquium 1995: 115-133 - 1994
- [j12]James F. Lynch:
An Extension of 0-1 Laws. Random Struct. Algorithms 5(1): 155-172 (1994) - [j11]James F. Lynch:
Random Resource Allocation Graphs and the Probability of Deadlock. SIAM J. Discret. Math. 7(3): 458-473 (1994) - 1993
- [j10]James F. Lynch:
Convergence laws for random words. Australas. J Comb. 7: 145-156 (1993) - [j9]James F. Lynch:
Threshold Functions for Markov Chains: a Graph Theoretic Approach. Comb. Probab. Comput. 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. Comput. Complex. 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 A 55(1): 143-152 (1990) - [c3]James F. Lynch:
The Quantifier Structure of Sentences that Characterize Nondeterministic Time Complexity. SCT 1990: 210-222 - [c2]James F. Lynch:
Probabilities of Sentences about Very Sparse Random Graphs. FOCS 1990: 689-696
1980 – 1989
- 1986
- [c1]James F. Lynch:
A Depth- Size Tradeoff for Boolean Circuits with Unbounded Fan- In. SCT 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. Math. Syst. Theory 15(2): 127-144 (1982) - 1981
- [j2]James F. Lynch:
The visually distinct configurations of k sets. Discret. Math. 33(3): 281-287 (1981)
1970 – 1979
- 1975
- [j1]James F. Lynch:
An Asymptotic Formula for the Number of Classes of Sets of n Indistinguishable Elements. J. Comb. Theory A 19(1): 109-112 (1975)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:27 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint