Gregory L. McColm

发表

A Ramseyian theorem on products of trees

Gregory L. McColm, 1991, J. Comb. Theory, Ser. A.

On the Complexity of Deadlock-Free Programs on a Ring of Processors

W. Edwin Clark, Gregory L. McColm, W. Richard Stark, 1992, J. Parallel Distributed Comput..

Describing Self-assembly of Nanostructures

Natasa Jonoska, Gregory L. McColm, 2008, SOFSEM.

Hierarchies in transitive closure logic, stratified Datalog and infinitary logic

Erich Grädel, Gregory L. McColm, E. Grädel, 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

First order zero-one laws for random graphs on the circle

Gregory L. McColm, G. McColm, 1999, Random Struct. Algorithms.

Threshold Functions for Random Graphs on a Line Segment

Gregory L. McColm, G. McColm, 2004, Combinatorics, Probability and Computing.

Counter machines and crystallographic structures

Natasa Jonoska, Gregory L. McColm, Mile Krajcevski, 2016, Natural Computing.

Complexity classes for self-assembling flexible tiles

Natasa Jonoska, Gregory L. McColm, 2009, Theor. Comput. Sci..

Traversal Languages Capturing Isomorphism Classes of Sierpiński Gaskets

Natasa Jonoska, Gregory L. McColm, Milé Krajcevski, 2016, UCNC.

Zero-one laws for Gilbert random graphs

Gregory L. McColm, 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.

When Is Arithmetic Possible?

Gregory L. McColm, 1990, Ann. Pure Appl. Log..

Deterministic vs. nondeterministic transitive closure logic

Erich Grädel, Gregory L. McColm, 1992, [1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science.

Eventualy Periodicity and "One-Dimensional" Queries

Gregory L. McColm, 1992, Notre Dame J. Formal Log..

Is Logic Necessary?

Gregory L. McColm, G. McColm, 2010, Logica Universalis.

Expectation and Variance of Self-assembled Graph Structures

Natasa Jonoska, Gregory L. McColm, Ana Staninska, 2005, DNA.

A Computational Model for Self-assembling Flexible Tiles

Natasa Jonoska, Gregory L. McColm, N. Jonoska, 2005, UC.

Guarded Quantification in Least Fixed Point Logic

Gregory L. McColm, G. McColm, 2004, J. Log. Lang. Inf..

Pebble Games and Subroutines in Least Fixed Point Logic

Gregory L. McColm, G. McColm, 1995, Inf. Comput..

Parametrization over Inductive Relations of a Bounded Number of Variables

Gregory L. McColm, G. McColm, 1990, Ann. Pure Appl. Log..

The Dimension of the Negation of Transitive Closure

Gregory L. McColm, 1995, J. Symb. Log..

Flexible Versus Rigid Tile Assembly

Natasa Jonoska, Gregory L. McColm, 2006, UC.

Languages Associated with Crystallographic Symmetry

Natasa Jonoska, Gregory L. McColm, Mile Krajcevski, 2014, UCNC.

Spectrum of a Pot for DNA Complexes

Natasa Jonoska, Gregory L. McColm, Ana Staninska, 2006, DNA.

Some Restrictions on Simple Fixed Points of the Integers

Gregory L. McColm, 1989, J. Symb. Log..

MSO zero-one laws on random labelled acyclic graphs

Gregory L. McColm, G. McColm, 2002, Discret. Math..

Dimension Versus Number of Variables, and Connectivity, too

Gregory L. McColm, 1995, Math. Log. Q..

On stoichiometry for the assembly of flexible tile DNA complexes

Natasa Jonoska, Gregory L. McColm, Ana Staninska, 2011, Natural Computing.

Some Ramsey Theory in Boolean Algebra for Complexity Classes

Gregory L. McColm, 1992, Math. Log. Q..

On the structure of random unlabelled acyclic graphs

Gregory L. McColm, 2004, Discret. Math..

Journal of Graph Algorithms and Applications Generating Geometric Graphs Using Automorphisms

Gregory L. McColm, G. McColm, Gregory Mccolm, 2012 .

On the Power of Deterministic Transitive Closures

Erich Grädel, Gregory L. McColm, 1995, Inf. Comput..

Cut-and-project graphs and other complexes

Gregory L. McColm, G. McColm, 2021, Theor. Comput. Sci..

Simple and simultaneous recursive fixed points

Gregory L. McColm, 1986 .

An Application of Spanning Trees to k-Point Separating Families of Functions

W. Edwin Clark, Gregory L. McColm, Boris Shekhtman, 1998 .