 | 2009 |
|---|
| 42 |       | Andrew Lewis,
André Nies,
Andrea Sorbi:
The First Order Theories of the Medvedev and Muchnik Lattices.
CiE 2009: 324-331 |
| 41 | | André Nies:
Superhighness and Strong Jump Traceability.
ICALP (1) 2009: 726-737 |
| 40 | | Santiago Figueira,
Joseph S. Miller,
André Nies:
Indifferent Sets.
J. Log. Comput. 19(2): 425-443 (2009) |
| 2008 |
|---|
| 39 | | Cristian S. Calude,
André Nies,
Ludwig Staiger,
Frank Stephan:
Universal Recursively Enumerable Sets of Strings.
Developments in Language Theory 2008: 170-182 |
| 38 | | Greg Hjorth,
Bakhadyr Khoussainov,
Antonio Montalbán,
André Nies:
From Automatic Structures to Borel Structures.
LICS 2008: 431-441 |
| 37 | | Santiago Figueira,
André Nies,
Frank Stephan:
Lowness properties and approximations of the jump.
Ann. Pure Appl. Logic 152(1-3): 51-66 (2008) |
| 2007 |
|---|
| 36 | | Andrew Lewis,
Antonio Montalbán,
André Nies:
A Weakly 2-Random Set That Is Not Generalized Low.
CiE 2007: 474-477 |
| 35 | | André Nies,
Pavel Semukhin:
Finite Automata Presentable Abelian Groups.
LFCS 2007: 422-436 |
| 34 | | André Nies:
Describing Groups.
Bulletin of Symbolic Logic 13(3): 305-339 (2007) |
| 33 | | Bakhadyr Khoussainov,
André Nies,
Sasha Rubin,
Frank Stephan:
Automatic Structures: Richness and Limitations
CoRR abs/cs/0703064: (2007) |
| 32 | | Bakhadyr Khoussainov,
André Nies,
Sasha Rubin,
Frank Stephan:
Automatic Structures: Richness and Limitations.
Logical Methods in Computer Science 3(2): (2007) |
| 2006 |
|---|
| 31 | | Wolfgang Merkle,
Joseph S. Miller,
André Nies,
Jan Reimann,
Frank Stephan:
Kolmogorov-Loveland randomness and stochasticity.
Ann. Pure Appl. Logic 138(1-3): 183-210 (2006) |
| 30 | | Joseph S. Miller,
André Nies:
Randomness and Computability: Open Questions.
Bulletin of Symbolic Logic 12(3): 390-410 (2006) |
| 29 | | Rodney G. Downey,
Denis R. Hirschfeldt,
André Nies,
Sebastiaan Terwijn:
Calibrating Randomness.
Bulletin of Symbolic Logic 12(3): 411-491 (2006) |
| 28 | | Santiago Figueira,
André Nies,
Frank Stephan:
Lowness Properties and Approximations of the Jump.
Electr. Notes Theor. Comput. Sci. 143: 45-57 (2006) |
| 2005 |
|---|
| 27 | | Wolfgang Merkle,
Joseph S. Miller,
André Nies,
Jan Reimann,
Frank Stephan:
Kolmogorov-Loveland Randomness and Stochasticity.
STACS 2005: 422-433 |
| 26 | | Bjørn Kjos-Hanssen,
André Nies,
Frank Stephan:
Lowness for the Class of Schnorr Random Reals.
SIAM J. Comput. 35(3): 647-657 (2005) |
| 2004 |
|---|
| 25 | | Bakhadyr Khoussainov,
André Nies,
Sasha Rubin,
Frank Stephan:
Automatic Structures: Richness and Limitations.
LICS 2004: 44-53 |
| 2003 |
|---|
| 24 | | Benjamín René Callejas Bedregal,
André Nies:
Lowness Properties of Reals and Hyper-Immunity.
Electr. Notes Theor. Comput. Sci. 84: (2003) |
| 23 | | André Nies:
Separating Classes of Groups by First-Order Sentences.
IJAC 13(3): 287-302 (2003) |
| 2002 |
|---|
| 22 | | Rodney G. Downey,
Denis R. Hirschfeldt,
André Nies,
Frank Stephan:
Trivial Reals.
Electr. Notes Theor. Comput. Sci. 66(1): (2002) |
| 21 | | Rodney G. Downey,
Denis R. Hirschfeldt,
André Nies:
Randomness, Computability, and Density.
SIAM J. Comput. 31(4): 1169-1183 (2002) |
| 2001 |
|---|
| 20 | | Rodney G. Downey,
Denis R. Hirschfeldt,
André Nies:
Randomness, Computability, and Density.
STACS 2001: 195-205 |
| 19 |  | André Nies:
Interpreting N in the computably enumerable weak truth talble degrees.
Ann. Pure Appl. Logic 107(1-3): 35-48 (2001) |
| 18 | | Steffen Lempp,
André Nies,
Reed Solomon:
On the filter of computably enumerable supersets of an r-maximal set.
Arch. Math. Log. 40(6): 415-423 (2001) |
| 17 | | Douglas A. Cenzer,
André Nies:
Initial Segments of The Lattice of PI01 Classes.
J. Symb. Log. 66(4): 1749-1765 (2001) |
| 2000 |
|---|
| 16 | | Rodney G. Downey,
André Nies:
Undecidability Results for Low Complexity Time Classes.
J. Comput. Syst. Sci. 60(2): 465-479 (2000) |
| 15 | | André Nies,
Andrea Sorbi:
Structural Properties and Sigma02 Enumeration Degrees.
J. Symb. Log. 65(1): 285-292 (2000) |
| 14 | | André Nies:
Model theory of the computably enumerable many-one degrees.
Logic Journal of the IGPL 8(5): (2000) |
| 13 | | Steffen Lempp,
André Nies:
Differences of Computably Enumerable Sets.
Math. Log. Q. 46(4): 555-561 (2000) |
| 1999 |
|---|
| 12 | | André Nies:
A New Spectrum of Recursive Models.
Notre Dame Journal of Formal Logic 40(3): 307-314 (1999) |
| 1998 |
|---|
| 11 | | Rodney G. Downey,
Geoffrey LaForte,
André Nies:
Computably Enumerable Sets and Quasi-Reducibility.
Ann. Pure Appl. Logic 95(1-3): 1-35 (1998) |
| 1997 |
|---|
| 10 | | Rodney G. Downey,
André Nies:
Undecidability Results for Low Complexity Degree Structures.
IEEE Conference on Computational Complexity 1997: 128-132 |
| 9 | | Cristian Calude,
André Nies:
Chaitin Omega Numbers and Strong Reducibilities.
J. UCS 3(11): 1162-1166 (1997) |
| 8 | | Bakhadyr Khoussainov,
André Nies,
Richard A. Shore:
Computable Models of Theories with Few Models.
Notre Dame Journal of Formal Logic 38(2): 165-178 (1997) |
| 1996 |
|---|
| 7 | | André Nies,
Richard A. Shore,
Theodore A. Slaman:
Definability in the recursively enumerable degrees.
Bulletin of Symbolic Logic 2(4): 392-404 (1996) |
| 1995 |
|---|
| 6 | | André Nies,
Richard A. Shore:
Interpreting True Arithmetic in the Theory of the r.e. Truth Table Degrees.
Ann. Pure Appl. Logic 75(3): 269-311 (1995) |
| 5 | | Steffen Lempp,
André Nies:
The Undecidability of the Pi4-Theory for the R. E. WTT and Turing Degrees.
J. Symb. Log. 60(4): 1118-1136 (1995) |
| 1994 |
|---|
| 4 | | André Nies:
Recursively Enumerable Equivalence Relations Modulo Finite Differences.
Math. Log. Q. 40: 490-518 (1994) |
| 1993 |
|---|
| 3 | | André Nies:
Interpreting True Arithmetic in Degree Structures.
Kurt Gödel Colloquium 1993: 255-262 |
| 1992 |
|---|
| 2 | | Klaus Ambos-Spies,
André Nies:
The Theory of the Polynomial Many-One Degrees of Recursive Sets is Undecidable.
STACS 1992: 209-218 |
| 1 | | Klaus Ambos-Spies,
André Nies,
Richard A. Shore:
The Theory of the Recursively Enumerable Weak Truth-Table Degrees Is Undecidability.
J. Symb. Log. 57(3): 864-874 (1992) |
