Gregory L. McColm

Publication Activity (10 Years)

Years Active: 1989-2021
Publications (10 Years): 3

Top Topics

Topological Information

Expressive Power

Symmetry Detection

Graph Theoretical

Top Venues

J. Graph Algorithms Appl.

Theor. Comput. Sci.

Publications

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