Some Restrictions on Simple Fixed Points of the Integers. - Gregory L. McColm (J. Symb. Log., 1989)

Parametrization over Inductive Relations of a Bounded Number of Variables. - Gregory L. McColm (Ann. Pure Appl. Log., 1990)

When Is Arithmetic Possible? - Gregory L. McColm (Ann. Pure Appl. Log., 1990)

A Ramseyian theorem on products of trees. - Gregory L. McColm (J. Comb. Theory A, 1991)

Deterministic vs. Nondeterministic Transitive Closure Logic - Erich Grädel; Gregory L. McColm (LICS, 1992)

On the Complexity of Deadlock-Free Programs on a Ring of Processors. - William Edwin Clark; Gregory L. McColm; W. Richard Stark (J. Parallel Distributed Comput., 1992)

Some Ramsey Theory in Boolean Algebra for Complexity Classes. - Gregory L. McColm (Math. Log. Q., 1992)

Eventualy Periodicity and "One-Dimensional" Queries. - Gregory L. McColm (Notre Dame J. Formal Log., 1992)

Pebble Games and Subroutines in Least Fixed Point Logic. - Gregory L. McColm (Inf. Comput., 1995)

The Dimension of the Negation of Transitive Closure. - Gregory L. McColm (J. Symb. Log., 1995)

Dimension Versus Number of Variables, and Connectivity, too. - Gregory L. McColm (Math. Log. Q., 1995)

On the Power of Deterministic Transitive Closures - Erich Grädel; Gregory L. McColm (Inf. Comput., 1995)

Zero-One Laws for Gilbert Random Graphs. - Gregory L. McColm (LICS, 1996)

Hierarchies in Transitive Closure Logic, Stratified Datalog and Infinitary Logic. - Erich Grädel; Gregory L. McColm (Ann. Pure Appl. Log., 1996)

First order zero-one laws for random graphs on the circle. - Gregory L. McColm (Random Struct. Algorithms, 1999)

MSO zero-one laws on random labelled acyclic graphs. - Gregory L. McColm (Discret. Math., 2002)

Threshold Functions for Random Graphs on a Line Segment. - Gregory L. McColm (Comb. Probab. Comput., 2004)

On the structure of random unlabelled acyclic graphs. - Gregory L. McColm (Discret. Math., 2004)

Guarded Quantification in Least Fixed Point Logic. - Gregory L. McColm (J. Log. Lang. Inf., 2004)

Expectation and Variance of Self-assembled Graph Structures. - Natasa Jonoska; Gregory L. McColm; Ana Staninska (DNA, 2005)

A Computational Model for Self-assembling Flexible Tiles. - Natasa Jonoska; Gregory L. McColm (UC, 2005)

Spectrum of a Pot for DNA Complexes. - Natasa Jonoska; Gregory L. McColm; Ana Staninska (DNA, 2006)

Flexible Versus Rigid Tile Assembly. - Natasa Jonoska; Gregory L. McColm (UC, 2006)

Describing Self-assembly of Nanostructures. - Natasa Jonoska; Gregory L. McColm (SOFSEM, 2008)

Complexity classes for self-assembling flexible tiles. - Natasa Jonoska; Gregory L. McColm (Theor. Comput. Sci., 2009)

Is Logic Necessary? - Gregory L. McColm (Logica Universalis, 2010)

On stoichiometry for the assembly of flexible tile DNA complexes. - Natasha Jonoska; Gregory L. McColm; Ana Staninska (Nat. Comput., 2011)

Generating Geometric Graphs Using Automorphisms. - Gregory L. McColm (J. Graph Algorithms Appl., 2012)

Languages Associated with Crystallographic Symmetry. - Natasa Jonoska; Mile Krajcevski; Gregory L. McColm (UCNC, 2014)

Traversal Languages Capturing Isomorphism Classes of Sierpiński Gaskets. - Natasa Jonoska; Milé Krajcevski; Gregory L. McColm (UCNC, 2016)

Counter machines and crystallographic structures. - Natasa Jonoska; Mile Krajcevski; Gregory L. McColm (Nat. Comput., 2016)

Cut-and-project graphs and other complexes. - Gregory L. McColm (Theor. Comput. Sci., 2021)