The SCEAS System
Navigation Menu

Search the dblp DataBase


Peter A. Fejer: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Klaus Ambos-Spies, Peter A. Fejer
    Embedding of N5 and the contiguous degrees. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2001, v:112, n:2-3, pp:151-188 [Journal]
  2. Peter A. Fejer
    Lattice Representations for Computability Theory. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1998, v:94, n:1-3, pp:53-74 [Journal]
  3. Richard Beigel, Harry Buhrman, Peter A. Fejer, Lance Fortnow, Piotr Grabowski, Luc Longpré, Andrei A. Muchnik, Frank Stephan, Leen Torenvliet
    Enumerations of the Kolmogorov Function [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:015, pp:- [Journal]
  4. Klaus Ambos-Spies, Peter A. Fejer
    Degree Theoretical Splitting Properties of Recursively Enumerable Sets. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1988, v:53, n:4, pp:1110-1137 [Journal]
  5. Klaus Ambos-Spies, Peter A. Fejer, Steffen Lempp, Manuel Lerman
    Decidability of the Two-Quantifier Theory of the Recursively Enumerable Weak Truth-Table Degrees and Other Distributive Upper Semi-Lattices. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1996, v:61, n:3, pp:880-905 [Journal]

  6. Every incomplete computably enumerable truth-table degree is branching. [Citation Graph (, )][DBLP]

Search in 0.024secs, Finished in 0.024secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
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 [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002