 | 2004 |
|---|
| 6 |       | 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
Electronic Colloquium on Computational Complexity (ECCC)(015): (2004) |
| 2001 |
|---|
| 5 |  | Klaus Ambos-Spies,
Peter A. Fejer:
Embedding of N5 and the contiguous degrees.
Ann. Pure Appl. Logic 112(2-3): 151-188 (2001) |
| 4 | | Peter A. Fejer,
Richard A. Shore:
Every incomplete computably enumerable truth-table degree is branching.
Arch. Math. Log. 40(2): 113-123 (2001) |
| 1998 |
|---|
| 3 | | Peter A. Fejer:
Lattice Representations for Computability Theory.
Ann. Pure Appl. Logic 94(1-3): 53-74 (1998) |
| 1996 |
|---|
| 2 | | 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.
J. Symb. Log. 61(3): 880-905 (1996) |
| 1988 |
|---|
| 1 | | Klaus Ambos-Spies,
Peter A. Fejer:
Degree Theoretical Splitting Properties of Recursively Enumerable Sets.
J. Symb. Log. 53(4): 1110-1137 (1988) |
