Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Gregory L. McColm
2010 – today
- 2012
[j20]Gregory L. McColm: Generating Geometric Graphs Using Automorphisms. J. Graph Algorithms Appl. 16(2): 507-541 (2012)- 2011
- [j19]Natasha Jonoska, Gregory L. McColm, Ana Staninska: On stoichiometry for the assembly of flexible tile DNA complexes. Natural Computing 10(3): 1121-1141 (2011)
- 2010
- [j18]
2000 – 2009
- 2009
- [j17]Natasa Jonoska, Gregory L. McColm: Complexity classes for self-assembling flexible tiles. Theor. Comput. Sci. 410(4-5): 332-346 (2009)
- 2008
- [c8]
- 2006
- [c7]Natasa Jonoska, Gregory L. McColm, Ana Staninska: Spectrum of a Pot for DNA Complexes. DNA 2006: 83-94
- [c6]
- 2005
- [c5]Natasa Jonoska, Gregory L. McColm, Ana Staninska: Expectation and Variance of Self-assembled Graph Structures. DNA 2005: 144-157
- [c4]Natasa Jonoska, Gregory L. McColm: A Computational Model for Self-assembling Flexible Tiles. UC 2005: 142-156
- 2004
- [j16]Gregory L. McColm: Threshold Functions for Random Graphs on a Line Segment. Combinatorics, Probability & Computing 13(3): 373-387 (2004)
- [j15]Gregory L. McColm: On the structure of random unlabelled acyclic graphs. Discrete Mathematics 277(1-3): 147-170 (2004)
- [j14]Gregory L. McColm: Guarded Quantification in Least Fixed Point Logic. Journal of Logic, Language and Information 13(1): 61-110 (2004)
- 2002
- [j13]Gregory L. McColm: MSO zero-one laws on random labelled acyclic graphs. Discrete Mathematics 254(1-3): 331-347 (2002)
1990 – 1999
- 1999
- [j12]Gregory L. McColm: First order zero-one laws for random graphs on the circle. Random Struct. Algorithms 14(3): 239-266 (1999)
- 1996
- [j11]Erich Grädel, Gregory L. McColm: Hierarchies in Transitive Closure Logic, Stratified Datalog and Infinitary Logic. Ann. Pure Appl. Logic 77(2): 169-199 (1996)
- [c3]
- 1995
- [j10]Erich Grädel, Gregory L. McColm: On the Power of Deterministic Transitive Closures. Inf. Comput. 119(1): 129-135 (1995)
- [j9]Gregory L. McColm: Pebble Games and Subroutines in Least Fixed Point Logic. Inf. Comput. 122(2): 201-220 (1995)
- [j8]Gregory L. McColm: The Dimension of the Negation of Transitive Closure. J. Symb. Log. 60(2): 392-414 (1995)
- [j7]Gregory L. McColm: Dimension Versus Number of Variables, and Connectivity, too. Math. Log. Q. 41: 111-134 (1995)
- 1992
- [j6]W. Edwin Clark, Gregory L. McColm, W. Richard Stark: On the Complexity of Deadlock-Free Programs on a Ring of Processors. J. Parallel Distrib. Comput. 16(1): 67-71 (1992)
- [j5]Gregory L. McColm: Eventualy Periodicity and "One-Dimensional" Queries. Notre Dame Journal of Formal Logic 33(2): 273-290 (1992)
- [c2]Erich Grädel, Gregory L. McColm: Hierarchies in Transitive Closure Logic, Stratified Datalog and Infinitary Logic. FOCS 1992: 167-176
- [c1]Erich Grädel, Gregory L. McColm: Deterministic vs. Nondeterministic Transitive Closure Logic. LICS 1992: 58-63
- 1991
- [j4]Gregory L. McColm: A Ramseyian theorem on products of trees. J. Comb. Theory, Ser. A 57(1): 68-75 (1991)
- 1990
- [j3]Gregory L. McColm: Parametrization over Inductive Relations of a Bounded Number of Variables. Ann. Pure Appl. Logic 48(2): 103-134 (1990)
- [j2]
1980 – 1989
- 1989
- [j1]Gregory L. McColm: Some Restrictions on Simple Fixed Points of the Integers. J. Symb. Log. 54(4): 1324-1345 (1989)
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-04-10 22:31 CEST by the dblp team