default search action
Gregory L. McColm
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [j23]Gregory L. McColm:
Cut-and-project graphs and other complexes. Theor. Comput. Sci. 894: 172-189 (2021)
2010 – 2019
- 2016
- [j22]Natasa Jonoska, Mile Krajcevski, Gregory L. McColm:
Counter machines and crystallographic structures. Nat. Comput. 15(1): 97-113 (2016) - [c10]Natasa Jonoska, Milé Krajcevski, Gregory L. McColm:
Traversal Languages Capturing Isomorphism Classes of Sierpiński Gaskets. UCNC 2016: 155-167 - 2014
- [c9]Natasa Jonoska, Mile Krajcevski, Gregory L. McColm:
Languages Associated with Crystallographic Symmetry. UCNC 2014: 216-228 - 2012
- [j21]Gregory L. McColm:
Generating Geometric Graphs Using Automorphisms. J. Graph Algorithms Appl. 16(2): 507-541 (2012) - 2011
- [j20]Natasha Jonoska, Gregory L. McColm, Ana Staninska:
On stoichiometry for the assembly of flexible tile DNA complexes. Nat. Comput. 10(3): 1121-1141 (2011) - 2010
- [j19]Gregory L. McColm:
Is Logic Necessary? Logica Universalis 4(2): 241-254 (2010)
2000 – 2009
- 2009
- [j18]Natasa Jonoska, Gregory L. McColm:
Complexity classes for self-assembling flexible tiles. Theor. Comput. Sci. 410(4-5): 332-346 (2009) - 2008
- [c8]Natasa Jonoska, Gregory L. McColm:
Describing Self-assembly of Nanostructures. SOFSEM 2008: 66-73 - 2006
- [c7]Natasa Jonoska, Gregory L. McColm, Ana Staninska:
Spectrum of a Pot for DNA Complexes. DNA 2006: 83-94 - [c6]Natasa Jonoska, Gregory L. McColm:
Flexible Versus Rigid Tile Assembly. UC 2006: 139-151 - 2005
- [c5]Natasa Jonoska, Gregory L. McColm, Ana Staninska:
Expectation and Variance of Self-assembled Graph Structures. DNA 2005: 144-157 - [c4]Natasa Jonoska, Gregory L. McColm:
A Computational Model for Self-assembling Flexible Tiles. UC 2005: 142-156 - 2004
- [j17]Gregory L. McColm:
Threshold Functions for Random Graphs on a Line Segment. Comb. Probab. Comput. 13(3): 373-387 (2004) - [j16]Gregory L. McColm:
On the structure of random unlabelled acyclic graphs. Discret. Math. 277(1-3): 147-170 (2004) - [j15]Gregory L. McColm:
Guarded Quantification in Least Fixed Point Logic. J. Log. Lang. Inf. 13(1): 61-110 (2004) - 2002
- [j14]Gregory L. McColm:
MSO zero-one laws on random labelled acyclic graphs. Discret. Math. 254(1-3): 331-347 (2002)
1990 – 1999
- 1999
- [j13]Gregory L. McColm:
First order zero-one laws for random graphs on the circle. Random Struct. Algorithms 14(3): 239-266 (1999) - 1996
- [j12]Erich Grädel, Gregory L. McColm:
Hierarchies in Transitive Closure Logic, Stratified Datalog and Infinitary Logic. Ann. Pure Appl. Log. 77(2): 169-199 (1996) - [c3]Gregory L. McColm:
Zero-One Laws for Gilbert Random Graphs. LICS 1996: 360-369 - 1995
- [j11]Erich Grädel, Gregory L. McColm:
On the Power of Deterministic Transitive Closures. Inf. Comput. 119(1): 129-135 (1995) - [j10]Gregory L. McColm:
Pebble Games and Subroutines in Least Fixed Point Logic. Inf. Comput. 122(2): 201-220 (1995) - [j9]Gregory L. McColm:
The Dimension of the Negation of Transitive Closure. J. Symb. Log. 60(2): 392-414 (1995) - [j8]Gregory L. McColm:
Dimension Versus Number of Variables, and Connectivity, too. Math. Log. Q. 41: 111-134 (1995) - 1992
- [j7]William 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): 67-71 (1992) - [j6]Gregory L. McColm:
Some Ramsey Theory in Boolean Algebra for Complexity Classes. Math. Log. Q. 38(1): 293-298 (1992) - [j5]Gregory L. McColm:
Eventualy Periodicity and "One-Dimensional" Queries. Notre Dame J. Formal Log. 33(2): 273-290 (1992) - [c2]Erich Grädel, Gregory L. McColm:
Hierarchies in Transitive Closure Logic, Stratified Datalog and Infinitary Logic. FOCS 1992: 167-176 - [c1]Erich Grädel, Gregory L. McColm:
Deterministic vs. Nondeterministic Transitive Closure Logic. LICS 1992: 58-63 - 1991
- [j4]Gregory L. McColm:
A Ramseyian theorem on products of trees. J. Comb. Theory A 57(1): 68-75 (1991) - 1990
- [j3]Gregory L. McColm:
Parametrization over Inductive Relations of a Bounded Number of Variables. Ann. Pure Appl. Log. 48(2): 103-134 (1990) - [j2]Gregory L. McColm:
When Is Arithmetic Possible? Ann. Pure Appl. Log. 50(1): 29-51 (1990)
1980 – 1989
- 1989
- [j1]Gregory L. McColm:
Some Restrictions on Simple Fixed Points of the Integers. J. Symb. Log. 54(4): 1324-1345 (1989)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:26 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: