The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

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

Publications of Author

  1. H. D. Macpherson
    Universal Closed Permutation Groups. [Citation Graph (0, 0)][DBLP]
    Easter Conference on Model Theory, 1989, pp:173-176 [Conf]
  2. B. Herwig, H. D. Macpherson, G. Martin, A. Nurtazin, J. K. Truss
    On N0-Categorical Weakly o-Minimal Structures. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1999, v:101, n:1, pp:65-93 [Journal]
  3. 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]
  4. 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]
  5. 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]
  6. 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]
  7. 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.004secs, Finished in 0.005secs
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
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002