Gregory L. McColm

According to our database1, Gregory L. McColm authored at least 32 papers between 1989 and 2016.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2016
Counter machines and crystallographic structures.
Natural Computing, 2016

Traversal Languages Capturing Isomorphism Classes of Sierpiński Gaskets.
Proceedings of the Unconventional Computation and Natural Computation, 2016

2014
Languages Associated with Crystallographic Symmetry.
Proceedings of the Unconventional Computation and Natural Computation, 2014

2012
Generating Geometric Graphs Using Automorphisms.
J. Graph Algorithms Appl., 2012

2011
On stoichiometry for the assembly of flexible tile DNA complexes.
Natural Computing, 2011

2010
Is Logic Necessary?
Logica Universalis, 2010

2009
Complexity classes for self-assembling flexible tiles.
Theor. Comput. Sci., 2009

2008
Describing Self-assembly of Nanostructures.
Proceedings of the SOFSEM 2008: Theory and Practice of Computer Science, 2008

2006
Flexible Versus Rigid Tile Assembly.
Proceedings of the Unconventional Computation, 5th International Conference, 2006

Spectrum of a Pot for DNA Complexes.
Proceedings of the DNA Computing, 12th International Meeting on DNA Computing, 2006

2005
A Computational Model for Self-assembling Flexible Tiles.
Proceedings of the Unconventional Computation, 4th International Conference, 2005

Expectation and Variance of Self-assembled Graph Structures.
Proceedings of the DNA Computing, 11th International Workshop on DNA Computing, 2005

2004
Guarded Quantification in Least Fixed Point Logic.
Journal of Logic, Language and Information, 2004

On the structure of random unlabelled acyclic graphs.
Discrete Mathematics, 2004

Threshold Functions for Random Graphs on a Line Segment.
Combinatorics, Probability & Computing, 2004

2002
MSO zero-one laws on random labelled acyclic graphs.
Discrete Mathematics, 2002

1999
First order zero-one laws for random graphs on the circle.
Random Struct. Algorithms, 1999

1996
Hierarchies in Transitive Closure Logic, Stratified Datalog and Infinitary Logic.
Ann. Pure Appl. Logic, 1996

Zero-One Laws for Gilbert Random Graphs.
Proceedings of the Proceedings, 1996

1995
On the Power of Deterministic Transitive Closures
Inf. Comput., May, 1995

Dimension Versus Number of Variables, and Connectivity, too.
Math. Log. Q., 1995

The Dimension of the Negation of Transitive Closure.
J. Symb. Log., 1995

Pebble Games and Subroutines in Least Fixed Point Logic.
Inf. Comput., 1995

1992
Eventualy Periodicity and "One-Dimensional" Queries.
Notre Dame Journal of Formal Logic, 1992

Some Ramsey Theory in Boolean Algebra for Complexity Classes.
Math. Log. Q., 1992

On the Complexity of Deadlock-Free Programs on a Ring of Processors.
J. Parallel Distrib. Comput., 1992

Deterministic vs. Nondeterministic Transitive Closure Logic
Proceedings of the Seventh Annual Symposium on Logic in Computer Science (LICS '92), 1992

Hierarchies in Transitive Closure Logic, Stratified Datalog and Infinitary Logic
Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992

1991
A Ramseyian theorem on products of trees.
J. Comb. Theory, Ser. A, 1991

1990
When Is Arithmetic Possible?
Ann. Pure Appl. Logic, 1990

Parametrization over Inductive Relations of a Bounded Number of Variables.
Ann. Pure Appl. Logic, 1990

1989
Some Restrictions on Simple Fixed Points of the Integers.
J. Symb. Log., 1989


  Loading...