SCEAS

The SCEAS System

Title:
Author:

H. D. Macpherson: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

H. D. Macpherson
Universal Closed Permutation Groups. [Citation Graph (0, 0)][DBLP]
Easter Conference on Model Theory, 1989, pp:173-176 [Conf]
B. Herwig, H. D. Macpherson, G. Martin, A. Nurtazin, J. K. Truss
On N₀-Categorical Weakly o-Minimal Structures. [Citation Graph (0, 0)][DBLP]
Ann. Pure Appl. Logic, 1999, v:101, n:1, pp:65-93 [Journal]
H. D. Macpherson
Infinite distance transitive graphs of finite valency. [Citation Graph (0, 0)][DBLP]
Combinatorica, 1982, v:2, n:1, pp:63-69 [Journal]
Peter J. Cameron, H. D. Macpherson
Rank three permutation groups with rank three subconstituents. [Citation Graph (0, 0)][DBLP]
J. Comb. Theory, Ser. B, 1985, v:39, n:1, pp:1-16 [Journal]
H. D. Macpherson
Graphs determined by their finite induced subgraphs. [Citation Graph (0, 0)][DBLP]
J. Comb. Theory, Ser. B, 1986, v:41, n:2, pp:230-234 [Journal]
Ian M. Hodkinson, H. D. Macpherson
Relational Structures Determined by Their Finite Induced Substructures. [Citation Graph (0, 0)][DBLP]
J. Symb. Log., 1988, v:53, n:1, pp:222-230 [Journal]
H. D. Macpherson, Maurice Pouzet, Robert E. Woodrow
Countable Structures of Given Age. [Citation Graph (0, 0)][DBLP]
J. Symb. Log., 1992, v:57, n:3, pp:992-1010 [Journal]

Search in 0.015secs, Finished in 0.015secs

NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades

NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP