The following pages link to Gregory Loren McColm (Q587174):
Displaying 50 items.
- On reversible Turing machines and their function universality (Q303695) (← links)
- Limits on alternation trading proofs for time-space lower bounds (Q496301) (← links)
- Small ball estimates for quasi-norms (Q501833) (← links)
- Determining full conditional independence by low-order conditioning (Q605892) (← links)
- Regular families of forests, antichains and duality pairs of relational structures (Q681598) (← links)
- The sequential generation of random \(f\)-graphs. Distributions and predominant types of edge maximal \(f\)-graphs with \(f>4\) (Q685646) (← links)
- Another generalization of Lindström's theorem on subcubes of a cube (Q696911) (← links)
- Dominating set games. (Q703283) (← links)
- Asymptotic probabilities of extension properties and random \(l\)-colourable structures (Q764265) (← links)
- Hereditary properties of partitions, ordered graphs and ordered hypergraphs (Q850077) (← links)
- (Q917544) (redirect page) (← links)
- Parametrization over inductive relations of a bounded number of variables (Q917545) (← links)
- When is arithmetic possible? (Q922533) (← links)
- Unit and proper tube orders (Q953272) (← links)
- Complexity classes for self-assembling flexible tiles (Q1004079) (← links)
- When is betweenness preserved? (Q1010988) (← links)
- Time required to unify all particles in the scheme of equiprobable allocation into a sequence of cell layers (Q1033936) (← links)
- (Q1176378) (redirect page) (← links)
- A Ramseyian theorem on products of trees (Q1176379) (← links)
- On the complexity of deadlock-free programs on a ring of processors (Q1200165) (← links)
- Eventual periodicity and ``one-dimensional'' queries (Q1203791) (← links)
- (Q1260769) (redirect page) (← links)
- Ramsey problems involving degrees in edge-colored complete graphs of vertices belonging to monochromatic subgraphs (Q1260770) (← links)
- A splitting inequality (Q1279862) (← links)
- Approximating probability distributions using small sample spaces (Q1288906) (← links)
- On graphs \(G\) for which all large trees are \(G\)-good (Q1313348) (← links)
- Canonical partition relations for \((m,p,c)\)-systems (Q1356665) (← links)
- The cyclicity of a hypergraph (Q1379823) (← links)
- Scattered subsets (Q1394824) (← links)
- Guarded quantification in least fixed point logic (Q1424969) (← links)
- Bipartite rainbow Ramsey numbers. (Q1426110) (← links)
- On the structure of random unlabelled acyclic graphs. (Q1426116) (← links)
- Normal convergence problem? Two moments and a recurrence may be the clues (Q1578596) (← links)
- (Q1586332) (redirect page) (← links)
- Erdős-Ko-Rado and Hilton-Milner type theorems for intersecting chains in posets (Q1586333) (← links)
- MSO zero-one laws on random labelled acyclic graphs (Q1613549) (← links)
- Linearly-growing reductions of Karp's 21 NP-complete problems (Q1713202) (← links)
- A remark on the paper ``Properties of intersecting families of ordered sets'' by O. Einstein (Q1715084) (← links)
- Towards a unified complexity theory of total functions (Q1745728) (← links)
- On stoichiometry for the assembly of flexible tile DNA complexes (Q1761688) (← links)
- An introduction to random trees (Q1768796) (← links)
- Extremal problems for sets forming Boolean algebras and complete partite hypergraphs (Q1818218) (← links)
- Anti-Ramsey numbers of subdivided graphs (Q1850619) (← links)
- On the power of deterministic transitive closures (Q1893732) (← links)
- Hierarchies in transitive closure logic, stratified Datalog and infinitary logic (Q1919531) (← links)
- Sudden emergence of a giant \(k\)-core in a random graph (Q1924140) (← links)
- Is logic necessary? (Q1931352) (← links)
- Evolutionary families of sets (Q1967111) (← links)
- Counter machines and crystallographic structures (Q2003451) (← links)
- Exact values of multicolor Ramsey numbers \(R_l(C_{\le l+1})\) (Q2175811) (← links)
