Gregory L. McColm - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 33 from 33

2021

Cut-and-project graphs and other complexesGregory L. McColm. TCS, 894:172-189, 2021. [doi]

2016

Counter machines and crystallographic structuresNatasa Jonoska, Mile Krajcevski, Gregory L. McColm. nc, 15(1):97-113, 2016. [doi]

Traversal Languages Capturing Isomorphism Classes of Sierpiński GasketsNatasa Jonoska, Milé Krajcevski, Gregory L. McColm. uc 2016: 155-167 [doi]

2014

Languages Associated with Crystallographic SymmetryNatasa Jonoska, Mile Krajcevski, Gregory L. McColm. uc 2014: 216-228 [doi]

2012

Generating Geometric Graphs Using AutomorphismsGregory L. McColm. jgaa, 16(2):507-541, 2012. [doi]

2011

On stoichiometry for the assembly of flexible tile DNA complexesNatasha Jonoska, Gregory L. McColm, Ana Staninska. nc, 10(3):1121-1141, 2011. [doi]

2010

Is Logic Necessary?Gregory L. McColm. lu, 4(2):241-254, 2010. [doi]

2009

Complexity classes for self-assembling flexible tilesNatasa Jonoska, Gregory L. McColm. TCS, 410(4-5):332-346, 2009. [doi]

2008

Describing Self-assembly of NanostructuresNatasa Jonoska, Gregory L. McColm. sofsem 2008: 66-73 [doi]

2006

Spectrum of a Pot for DNA ComplexesNatasa Jonoska, Gregory L. McColm, Ana Staninska. dna 2006: 83-94 [doi]

Flexible Versus Rigid Tile AssemblyNatasa Jonoska, Gregory L. McColm. uc 2006: 139-151 [doi]

2005

Expectation and Variance of Self-assembled Graph StructuresNatasa Jonoska, Gregory L. McColm, Ana Staninska. dna 2006: 144-157 [doi]

A Computational Model for Self-assembling Flexible TilesNatasa Jonoska, Gregory L. McColm. uc 2005: 142-156 [doi]

2004

Guarded Quantification in Least Fixed Point LogicGregory L. McColm. jolli, 13(1):61-110, 2004. [doi]

Threshold Functions for Random Graphs on a Line SegmentGregory L. McColm. cpc, 13(3):373-387, 2004.

On the structure of random unlabelled acyclic graphsGregory L. McColm. DM, 277(1-3):147-170, 2004. [doi]

2002

MSO zero-one laws on random labelled acyclic graphsGregory L. McColm. DM, 254(1-3):331-347, 2002. [doi]

1999

First order zero-one laws for random graphs on the circleGregory L. McColm. rsa, 14(3):239-266, 1999.

1996

Hierarchies in Transitive Closure Logic, Stratified Datalog and Infinitary LogicErich Grädel, Gregory L. McColm. APAL, 77(2):169-199, 1996.

Zero-One Laws for Gilbert Random GraphsGregory L. McColm. lics 1996: 360-369

1995

On the Power of Deterministic Transitive ClosuresErich Grädel, Gregory L. McColm. iandc, 119(1):129-135, May 1995.

Pebble Games and Subroutines in Least Fixed Point LogicGregory L. McColm. iandc, 122(2):201-220, 1995.

The Dimension of the Negation of Transitive ClosureGregory L. McColm. JSYML, 60(2):392-414, 1995.

Dimension Versus Number of Variables, and Connectivity, tooGregory L. McColm. mlq, 41:111-134, 1995.

1992

1991

A Ramseyian theorem on products of treesGregory L. McColm. JCT, 57(1):68-75, 1991. [doi]

1990

When Is Arithmetic Possible?Gregory L. McColm. APAL, 50(1):29-51, 1990.

Parametrization over Inductive Relations of a Bounded Number of VariablesGregory L. McColm. APAL, 48(2):103-134, 1990.

1989

Some Restrictions on Simple Fixed Points of the IntegersGregory L. McColm. JSYML, 54(4):1324-1345, 1989.

Sign in or sign up to see more results.

runs on WebDSL