Gregory L. McColm

34 papers A* 3B 3C 2Journal 23Unranked 3
YearRankTypeTitle / Venue / Authors
2025 — conf
Determining Isomorphic Crystal Structures.
UCNC
Natasa Jonoska, Milé Krajcevski, Gregory L. McColm
2021 J jnl
Cut-and-project graphs and other complexes.
Theor. Comput. Sci.
Gregory L. McColm
2016 J jnl
Counter machines and crystallographic structures.
Nat. Comput.
Natasa Jonoska, Mile Krajcevski, Gregory L. McColm
2016 — conf
Traversal Languages Capturing Isomorphism Classes of Sierpiński Gaskets.
UCNC
Natasa Jonoska, Milé Krajcevski, Gregory L. McColm
2014 — conf
Languages Associated with Crystallographic Symmetry.
UCNC
Natasa Jonoska, Mile Krajcevski, Gregory L. McColm
2012 J jnl
Generating Geometric Graphs Using Automorphisms.
J. Graph Algorithms Appl.
Gregory L. McColm
2011 J jnl
On stoichiometry for the assembly of flexible tile DNA complexes.
Nat. Comput.
Natasha Jonoska, Gregory L. McColm, Ana Staninska
2010 J jnl
Is Logic Necessary?
Logica Universalis
Gregory L. McColm
2009 J jnl
Complexity classes for self-assembling flexible tiles.
Theor. Comput. Sci.
Natasa Jonoska, Gregory L. McColm
2008 B conf
Describing Self-assembly of Nanostructures.
SOFSEM
Natasa Jonoska, Gregory L. McColm
2006 C conf
Flexible Versus Rigid Tile Assembly.
UC
Natasa Jonoska, Gregory L. McColm
2006 B conf
Spectrum of a Pot for DNA Complexes.
DNA
Natasa Jonoska, Gregory L. McColm, Ana Staninska
2005 C conf
A Computational Model for Self-assembling Flexible Tiles.
UC
Natasa Jonoska, Gregory L. McColm
2005 B conf
Expectation and Variance of Self-assembled Graph Structures.
DNA
Natasa Jonoska, Gregory L. McColm, Ana Staninska
2004 J jnl
Guarded Quantification in Least Fixed Point Logic.
J. Log. Lang. Inf.
Gregory L. McColm
2004 J jnl
On the structure of random unlabelled acyclic graphs.
Discret. Math.
Gregory L. McColm
2004 J jnl
Threshold Functions for Random Graphs on a Line Segment.
Comb. Probab. Comput.
Gregory L. McColm
2002 J jnl
MSO zero-one laws on random labelled acyclic graphs.
Discret. Math.
Gregory L. McColm
1999 J jnl
First order zero-one laws for random graphs on the circle.
Random Struct. Algorithms
Gregory L. McColm
1996 J jnl
Hierarchies in Transitive Closure Logic, Stratified Datalog and Infinitary Logic.
Ann. Pure Appl. Log.
Erich Grädel, Gregory L. McColm
1996 A* conf
Zero-One Laws for Gilbert Random Graphs.
LICS
Gregory L. McColm
1995 J jnl
Dimension Versus Number of Variables, and Connectivity, too.
Math. Log. Q.
Gregory L. McColm
1995 J jnl
On the Power of Deterministic Transitive Closures
Inf. Comput.
Erich Grädel, Gregory L. McColm
1995 J jnl
Pebble Games and Subroutines in Least Fixed Point Logic.
Inf. Comput.
Gregory L. McColm
1995 J jnl
The Dimension of the Negation of Transitive Closure.
J. Symb. Log.
Gregory L. McColm
1992 A* conf
Deterministic vs. Nondeterministic Transitive Closure Logic
LICS
Erich Grädel, Gregory L. McColm
1992 J jnl
Eventualy Periodicity and "One-Dimensional" Queries.
Notre Dame J. Formal Log.
Gregory L. McColm
1992 A* conf
Hierarchies in Transitive Closure Logic, Stratified Datalog and Infinitary Logic
FOCS
Erich Grädel, Gregory L. McColm
1992 J jnl
On the Complexity of Deadlock-Free Programs on a Ring of Processors.
J. Parallel Distributed Comput.
William Edwin Clark, Gregory L. McColm, W. Richard Stark
1992 J jnl
Some Ramsey Theory in Boolean Algebra for Complexity Classes.
Math. Log. Q.
Gregory L. McColm
1991 J jnl
A Ramseyian theorem on products of trees.
J. Comb. Theory A
Gregory L. McColm
1990 J jnl
Parametrization over Inductive Relations of a Bounded Number of Variables.
Ann. Pure Appl. Log.
Gregory L. McColm
1990 J jnl
When Is Arithmetic Possible?
Ann. Pure Appl. Log.
Gregory L. McColm
1989 J jnl
Some Restrictions on Simple Fixed Points of the Integers.
J. Symb. Log.
Gregory L. McColm