| 2009 |
|---|
| 25 | EE | Natasa Jonoska,
Gregory L. McColm:
Complexity classes for self-assembling flexible tiles.
Theor. Comput. Sci. 410(4-5): 332-346 (2009) |
| 2008 |
|---|
| 24 | EE | Natasa Jonoska,
Gregory L. McColm:
Describing Self-assembly of Nanostructures.
SOFSEM 2008: 66-73 |
| 2006 |
|---|
| 23 | EE | Natasa Jonoska,
Gregory L. McColm,
Ana Staninska:
Spectrum of a Pot for DNA Complexes.
DNA 2006: 83-94 |
| 22 | EE | Natasa Jonoska,
Gregory L. McColm:
Flexible Versus Rigid Tile Assembly.
UC 2006: 139-151 |
| 2005 |
|---|
| 21 | EE | Natasa Jonoska,
Gregory L. McColm,
Ana Staninska:
Expectation and Variance of Self-assembled Graph Structures.
DNA 2005: 144-157 |
| 20 | EE | Natasa Jonoska,
Gregory L. McColm:
A Computational Model for Self-assembling Flexible Tiles.
UC 2005: 142-156 |
| 2004 |
|---|
| 19 | | Gregory L. McColm:
Threshold Functions for Random Graphs on a Line Segment.
Combinatorics, Probability & Computing 13(3): 373-387 (2004) |
| 18 | EE | Gregory L. McColm:
On the structure of random unlabelled acyclic graphs.
Discrete Mathematics 277(1-3): 147-170 (2004) |
| 17 | EE | Gregory L. McColm:
Guarded Quantification in Least Fixed Point Logic.
Journal of Logic, Language and Information 13(1): 61-110 (2004) |
| 2002 |
|---|
| 16 | EE | Gregory L. McColm:
MSO zero-one laws on random labelled acyclic graphs.
Discrete Mathematics 254(1-3): 331-347 (2002) |
| 1999 |
|---|
| 15 | | Gregory L. McColm:
First order zero-one laws for random graphs on the circle.
Random Struct. Algorithms 14(3): 239-266 (1999) |
| 1996 |
|---|
| 14 | | Gregory L. McColm:
Zero-One Laws for Gilbert Random Graphs.
LICS 1996: 360-369 |
| 13 | | Erich Grädel,
Gregory L. McColm:
Hierarchies in Transitive Closure Logic, Stratified Datalog and Infinitary Logic.
Ann. Pure Appl. Logic 77(2): 169-199 (1996) |
| 1995 |
|---|
| 12 | | Erich Grädel,
Gregory L. McColm:
On the Power of Deterministic Transitive Closures
Inf. Comput. 119(1): 129-135 (1995) |
| 11 | | Gregory L. McColm:
Pebble Games and Subroutines in Least Fixed Point Logic.
Inf. Comput. 122(2): 201-220 (1995) |
| 10 | | Gregory L. McColm:
The Dimension of the Negation of Transitive Closure.
J. Symb. Log. 60(2): 392-414 (1995) |
| 9 | | Gregory L. McColm:
Dimension Versus Number of Variables, and Connectivity, too.
Math. Log. Q. 41: 111-134 (1995) |
| 1992 |
|---|
| 8 | | Erich Grädel,
Gregory L. McColm:
Hierarchies in Transitive Closure Logic, Stratified Datalog and Infinitary Logic
FOCS 1992: 167-176 |
| 7 | | Erich Grädel,
Gregory L. McColm:
Deterministic vs. Nondeterministic Transitive Closure Logic
LICS 1992: 58-63 |
| 6 | | W. Edwin Clark,
Gregory L. McColm,
W. Richard Stark:
On the Complexity of Deadlock-Free Programs on a Ring of Processors.
J. Parallel Distrib. Comput. 16(1): 67-71 (1992) |
| 5 | | Gregory L. McColm:
Eventualy Periodicity and "One-Dimensional" Queries.
Notre Dame Journal of Formal Logic 33(2): 273-290 (1992) |
| 1991 |
|---|
| 4 | EE | Gregory L. McColm:
A Ramseyian theorem on products of trees.
J. Comb. Theory, Ser. A 57(1): 68-75 (1991) |
| 1990 |
|---|
| 3 | | Gregory L. McColm:
Parametrization over Inductive Relations of a Bounded Number of Variables.
Ann. Pure Appl. Logic 48(2): 103-134 (1990) |
| 2 | | Gregory L. McColm:
When Is Arithmetic Possible?
Ann. Pure Appl. Logic 50(1): 29-51 (1990) |
| 1989 |
|---|
| 1 | | Gregory L. McColm:
Some Restrictions on Simple Fixed Points of the Integers.
J. Symb. Log. 54(4): 1324-1345 (1989) |
