André Nies

George Barmpalias, André Nies: Low upper bounds in the Turing degrees revisited. J. Log. Comput. 22(4): 693-699 (2012)

Antonín Kucera, André Nies: Demuth's Path to Randomness. Computation, Physics and Beyond 2012: 159-173

Laurent Bienvenu, Rupert Hölzl, Joseph S. Miller, André Nies: The Denjoy alternative for computable functions. STACS 2012: 543-554

Ekaterina B. Fokina, Sy-David Friedman, André Nies: Equivalence Relations That Are Σ⁰₃ Complete for Computable Reducibility - (Extended Abstract). WoLLIC 2012: 26-33

Michael J. Dinneen, Bakhadyr Khoussainov, André Nies (Eds.): Computation, Physics and Beyond - International Workshop on Theoretical Computer Science, WTCS 2012, Dedicated to Cristian S. Calude on the Occasion of His 60th Birthday, Auckland, New Zealand, February 21-24, 2012, Revised Selected and Invited Papers. Lecture Notes in Computer Science 7160, Springer 2012, isbn 978-3-642-27653-8

George Barmpalias, André Nies: Upper bounds on ideals in the computably enumerable Turing degrees. Ann. Pure Appl. Logic 162(6): 465-473 (2011)

Antonín Kucera, André Nies: Demuth randomness and computational complexity. Ann. Pure Appl. Logic 162(7): 504-513 (2011)

Noam Greenberg, André Nies: Benign cost functions and lowness properties. J. Symb. Log. 76(1): 289-312 (2011)

Greg Hjorth, André Nies: Borel structures and Borel theories. J. Symb. Log. 76(2): 461-476 (2011)

Cristian S. Calude, André Nies, Ludwig Staiger, Frank Stephan: Universal recursively enumerable sets of strings. Theor. Comput. Sci. 412(22): 2253-2261 (2011)

Laurent Bienvenu, Wolfgang Merkle, André Nies: Solovay functions and K-triviality. STACS 2011: 452-463

Bjørn Kjos-Hanssen, André Nies, Frank Stephan, Liang Yu: Higher Kurtz randomness. Ann. Pure Appl. Logic 161(10): 1280-1290 (2010)

Santiago Figueira, Denis R. Hirschfeldt, Joseph S. Miller, Keng Meng Ng, André Nies: Counting the Changes of Random D⁰₂{\Delta^0_2} Sets. CiE 2010: 162-171

André Nies, Pavel Semukhin: Finite automata presentable abelian groups. Ann. Pure Appl. Logic 161(3): 458-467 (2009)

Santiago Figueira, Joseph S. Miller, André Nies: Indifferent Sets. J. Log. Comput. 19(2): 425-443 (2009)

Bjørn Kjos-Hanssen, André Nies: Superhighness. Notre Dame Journal of Formal Logic 50(4): 445-452 (2009)

Andrew E. M. Lewis, André Nies, Andrea Sorbi: The First Order Theories of the Medvedev and Muchnik Lattices. CiE 2009: 324-331

André Nies: Superhighness and Strong Jump Traceability. ICALP (1) 2009: 726-737

Santiago Figueira, André Nies, Frank Stephan: Lowness properties and approximations of the jump. Ann. Pure Appl. Logic 152(1-3): 51-66 (2008)

Cristian S. Calude, André Nies, Ludwig Staiger, Frank Stephan: Universal Recursively Enumerable Sets of Strings. Developments in Language Theory 2008: 170-182

Greg Hjorth, Bakhadyr Khoussainov, Antonio Montalbán, André Nies: From Automatic Structures to Borel Structures. LICS 2008: 431-441

André Nies: Describing Groups. Bulletin of Symbolic Logic 13(3): 305-339 (2007)

Bakhadyr Khoussainov, André Nies, Sasha Rubin, Frank Stephan: Automatic Structures: Richness and Limitations. Logical Methods in Computer Science 3(2) (2007)

Andrew E. M. Lewis, Antonio Montalbán, André Nies: A Weakly 2-Random Set That Is Not Generalized Low. CiE 2007: 474-477

André Nies, Pavel Semukhin: Finite Automata Presentable Abelian Groups. LFCS 2007: 422-436

Bakhadyr Khoussainov, André Nies, Sasha Rubin, Frank Stephan: Automatic Structures: Richness and Limitations. CoRR abs/cs/0703064 (2007)

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)

Joseph S. Miller, André Nies: Randomness and Computability: Open Questions. Bulletin of Symbolic Logic 12(3): 390-410 (2006)

Rodney G. Downey, Denis R. Hirschfeldt, André Nies, Sebastiaan Terwijn: Calibrating Randomness. Bulletin of Symbolic Logic 12(3): 411-491 (2006)

Santiago Figueira, André Nies, Frank Stephan: Lowness Properties and Approximations of the Jump. Electr. Notes Theor. Comput. Sci. 143: 45-57 (2006)

Rod Downey, André Nies, Rebecca Weber, Liang Yu: Lowness and Pi₂⁰ nullsets. J. Symb. Log. 71(3): 1044-1052 (2006)

André Nies, Frank Stephan, Sebastiaan Terwijn: Randomness, relativization and Turing degrees. J. Symb. Log. 70(2): 515-535 (2005)

Verónica Becher, Santiago Figueira, André Nies, Silvana Picchi: Program Size Complexity for Possibly Infinite Computations. Notre Dame Journal of Formal Logic 46(1): 51-64 (2005)

Bjørn Kjos-Hanssen, André Nies, Frank Stephan: Lowness for the Class of Schnorr Random Reals. SIAM J. Comput. 35(3): 647-657 (2005)

Wolfgang Merkle, Joseph S. Miller, André Nies, Jan Reimann, Frank Stephan: Kolmogorov-Loveland Randomness and Stochasticity. STACS 2005: 422-433

Bakhadyr Khoussainov, André Nies, Sasha Rubin, Frank Stephan: Automatic Structures: Richness and Limitations. LICS 2004: 44-53

Benjamín René Callejas Bedregal, André Nies: Lowness Properties of Reals and Hyper-Immunity. Electr. Notes Theor. Comput. Sci. 84: 73-79 (2003)

André Nies: Separating Classes of Groups by First-Order Sentences. IJAC 13(3): 287-302 (2003)

Rodney G. Downey, Denis R. Hirschfeldt, André Nies, Frank Stephan: Trivial Reals. Electr. Notes Theor. Comput. Sci. 66(1): 36-52 (2002)

Rodney G. Downey, Denis R. Hirschfeldt, André Nies: Randomness, Computability, and Density. SIAM J. Comput. 31(4): 1169-1183 (2002)

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)

André Nies: Interpreting N in the computably enumerable weak truth talble degrees. Ann. Pure Appl. Logic 107(1-3): 35-48 (2001)

Douglas A. Cenzer, André Nies: Initial Segments of The Lattice of PI⁰₁ Classes. J. Symb. Log. 66(4): 1749-1765 (2001)

Rodney G. Downey, Denis R. Hirschfeldt, André Nies: Randomness, Computability, and Density. STACS 2001: 195-205

André Nies: Model theory of the computably enumerable many-one degrees. Logic Journal of the IGPL 8(5): 701-706 (2000)

Rodney G. Downey, André Nies: Undecidability Results for Low Complexity Time Classes. J. Comput. Syst. Sci. 60(2): 465-479 (2000)

André Nies, Andrea Sorbi: Structural Properties and Sigma⁰₂ Enumeration Degrees. J. Symb. Log. 65(1): 285-292 (2000)

Steffen Lempp, André Nies: Differences of Computably Enumerable Sets. Math. Log. Q. 46(4): 555-561 (2000)

André Nies: A New Spectrum of Recursive Models. Notre Dame Journal of Formal Logic 40(3): 307-314 (1999)

Rodney G. Downey, Geoffrey LaForte, André Nies: Computably Enumerable Sets and Quasi-Reducibility. Ann. Pure Appl. Logic 95(1-3): 1-35 (1998)

Cristian Calude, André Nies: Chaitin Omega Numbers and Strong Reducibilities. J. UCS 3(11): 1162-1166 (1997)

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)

Rodney G. Downey, André Nies: Undecidability Results for Low Complexity Degree Structures. IEEE Conference on Computational Complexity 1997: 128-132

André Nies, Richard A. Shore, Theodore A. Slaman: Definability in the recursively enumerable degrees. Bulletin of Symbolic Logic 2(4): 392-404 (1996)

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)

Steffen Lempp, André Nies: The Undecidability of the Pi₄-Theory for the R. E. WTT and Turing Degrees. J. Symb. Log. 60(4): 1118-1136 (1995)

André Nies: Recursively Enumerable Equivalence Relations Modulo Finite Differences. Math. Log. Q. 40: 490-518 (1994)

André Nies: Interpreting True Arithmetic in Degree Structures. Kurt Gödel Colloquium 1993: 255-262

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)

Klaus Ambos-Spies, André Nies: The Theory of the Polynomial Many-One Degrees of Recursive Sets is Undecidable. STACS 1992: 209-218