The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Michael Machtey: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Michael Machtey
    A Notion of Helping and Pseudo-Complementation in Lattices of Honest Subrecursive Classes [Citation Graph (0, 0)][DBLP]
    FOCS, 1973, pp:181-189 [Conf]
  2. Michael Machtey
    Classification of Computable Functions by Primitive Recursive Classes [Citation Graph (0, 0)][DBLP]
    STOC, 1971, pp:251-257 [Conf]
  3. Michael Machtey, Paul Young
    Simple Gödel Numberings, Translations, and the P-Hierarchy [Citation Graph (0, 0)][DBLP]
    STOC, 1976, pp:236-243 [Conf]
  4. Michael Machtey
    The Honest Subrecursive Classes Are a Lattice [Citation Graph (0, 0)][DBLP]
    Information and Control, 1974, v:24, n:3, pp:247-263 [Journal]
  5. Michael Machtey
    Helping and the Meet of Pairs of Honest Subrecursive Classes [Citation Graph (0, 0)][DBLP]
    Information and Control, 1975, v:28, n:1, pp:76-89 [Journal]
  6. Paul Chew, Michael Machtey
    A Note on Structure and Looking Back Applied to the Complexity of Computable Functions. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1981, v:22, n:1, pp:53-59 [Journal]
  7. Michael Machtey
    Augmented Loop Languages and Classes of Computables Functions. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1972, v:6, n:6, pp:603-624 [Journal]
  8. Michael Machtey
    On the Density of Honest Subrecursive Classes. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1975, v:10, n:2, pp:183-199 [Journal]
  9. Michael Machtey, Paul Young
    Remarks on Recursion versus Diagonalization and Exponentially Difficult Problems. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1981, v:22, n:3, pp:442-453 [Journal]
  10. Michael Machtey
    Admissible Ordinals and Intrinsic Consistency. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1970, v:35, n:3, pp:389-400 [Journal]
  11. Michael Machtey, Karl Winklmann, Paul Young
    Simple Gödel Numberings, Isomorphisms, and Programming Properties. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1978, v:7, n:1, pp:39-60 [Journal]
  12. Michael Machtey
    Minimal Pairs of Polynomial Degrees with Subexponential Complexity. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1976, v:2, n:1, pp:73-76 [Journal]

Search in 0.002secs, Finished in 0.003secs
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