The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Pascal Michel: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Pascal Michel
    Small Turing machines and generalized busy beaver competition. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:326, n:1-3, pp:45-56 [Journal]
  2. Pascal Michel
    An NP-Complete Language Accepted in Linear Time by a One-Tape Turing Machine. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:85, n:1, pp:205-212 [Journal]
  3. Pascal Michel
    A Survey of Space Complexity. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1992, v:101, n:1, pp:99-132 [Journal]
  4. Pascal Michel
    Complexity of Logical Theories Involving Coprimality. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1992, v:106, n:2, pp:221-241 [Journal]
  5. Pascal Michel
    Computational complexity of logical theories of one successor and another unary function. [Citation Graph (0, 0)][DBLP]
    Arch. Math. Log., 2007, v:46, n:2, pp:123-148 [Journal]

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