The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

André Nies: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Rodney G. Downey, André Nies
    Undecidability Results for Low Complexity Degree Structures. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1997, pp:128-132 [Conf]
  2. André Nies
    Interpreting True Arithmetic in Degree Structures. [Citation Graph (0, 0)][DBLP]
    Kurt Gödel Colloquium, 1993, pp:255-262 [Conf]
  3. Bakhadyr Khoussainov, André Nies, Sasha Rubin, Frank Stephan
    Automatic Structures: Richness and Limitations. [Citation Graph (0, 0)][DBLP]
    LICS, 2004, pp:44-53 [Conf]
  4. Klaus Ambos-Spies, André Nies
    The Theory of the Polynomial Many-One Degrees of Recursive Sets is Undecidable. [Citation Graph (0, 0)][DBLP]
    STACS, 1992, pp:209-218 [Conf]
  5. Rodney G. Downey, Denis R. Hirschfeldt, André Nies
    Randomness, Computability, and Density. [Citation Graph (0, 0)][DBLP]
    STACS, 2001, pp:195-205 [Conf]
  6. Wolfgang Merkle, Joseph S. Miller, André Nies, Jan Reimann, Frank Stephan
    Kolmogorov-Loveland Randomness and Stochasticity. [Citation Graph (0, 0)][DBLP]
    STACS, 2005, pp:422-433 [Conf]
  7. Rodney G. Downey, Geoffrey LaForte, André Nies
    Computably Enumerable Sets and Quasi-Reducibility. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1998, v:95, n:1-3, pp:1-35 [Journal]
  8. Wolfgang Merkle, Joseph S. Miller, André Nies, Jan Reimann, Frank Stephan
    Kolmogorov-Loveland randomness and stochasticity. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2006, v:138, n:1-3, pp:183-210 [Journal]
  9. André Nies
    Interpreting N in the computably enumerable weak truth talble degrees. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2001, v:107, n:1-3, pp:35-48 [Journal]
  10. André Nies, Richard A. Shore
    Interpreting True Arithmetic in the Theory of the r.e. Truth Table Degrees. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1995, v:75, n:3, pp:269-311 [Journal]
  11. André Nies, Richard A. Shore, Theodore A. Slaman
    Definability in the recursively enumerable degrees. [Citation Graph (0, 0)][DBLP]
    Bulletin of Symbolic Logic, 1996, v:2, n:4, pp:392-404 [Journal]
  12. Benjamín René Callejas Bedregal, André Nies
    Lowness Properties of Reals and Hyper-Immunity. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2003, v:84, n:, pp:- [Journal]
  13. Rodney G. Downey, Denis R. Hirschfeldt, André Nies, Frank Stephan
    Trivial Reals. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2002, v:66, n:1, pp:- [Journal]
  14. Santiago Figueira, André Nies, Frank Stephan
    Lowness Properties and Approximations of the Jump. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2006, v:143, n:, pp:45-57 [Journal]
  15. André Nies
    Model theory of the computably enumerable many-one degrees. [Citation Graph (0, 0)][DBLP]
    Logic Journal of the IGPL, 2000, v:8, n:5, pp:- [Journal]
  16. André Nies
    Separating Classes of Groups by First-Order Sentences. [Citation Graph (0, 0)][DBLP]
    IJAC, 2003, v:13, n:3, pp:287-302 [Journal]
  17. Rodney G. Downey, André Nies
    Undecidability Results for Low Complexity Time Classes. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2000, v:60, n:2, pp:465-479 [Journal]
  18. Klaus Ambos-Spies, André Nies, Richard A. Shore
    The Theory of the Recursively Enumerable Weak Truth-Table Degrees Is Undecidability. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1992, v:57, n:3, pp:864-874 [Journal]
  19. Douglas A. Cenzer, André Nies
    Initial Segments of The Lattice of PI01 Classes. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 2001, v:66, n:4, pp:1749-1765 [Journal]
  20. Steffen Lempp, André Nies
    The Undecidability of the Pi4-Theory for the R. E. WTT and Turing Degrees. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1995, v:60, n:4, pp:1118-1136 [Journal]
  21. André Nies, Andrea Sorbi
    Structural Properties and Sigma02 Enumeration Degrees. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 2000, v:65, n:1, pp:285-292 [Journal]
  22. Cristian Calude, André Nies
    Chaitin Omega Numbers and Strong Reducibilities. [Citation Graph (0, 0)][DBLP]
    J. UCS, 1997, v:3, n:11, pp:1162-1166 [Journal]
  23. Steffen Lempp, André Nies
    Differences of Computably Enumerable Sets. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 2000, v:46, n:4, pp:555-561 [Journal]
  24. André Nies
    Recursively Enumerable Equivalence Relations Modulo Finite Differences. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 1994, v:40, n:, pp:490-518 [Journal]
  25. Bakhadyr Khoussainov, André Nies, Richard A. Shore
    Computable Models of Theories with Few Models. [Citation Graph (0, 0)][DBLP]
    Notre Dame Journal of Formal Logic, 1997, v:38, n:2, pp:165-178 [Journal]
  26. André Nies
    A New Spectrum of Recursive Models. [Citation Graph (0, 0)][DBLP]
    Notre Dame Journal of Formal Logic, 1999, v:40, n:3, pp:307-314 [Journal]
  27. Rodney G. Downey, Denis R. Hirschfeldt, André Nies
    Randomness, Computability, and Density. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2002, v:31, n:4, pp:1169-1183 [Journal]
  28. Bjørn Kjos-Hanssen, André Nies, Frank Stephan
    Lowness for the Class of Schnorr Random Reals. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:35, n:3, pp:647-657 [Journal]
  29. Andrew Lewis, Antonio Montalbán, André Nies
    A Weakly 2-Random Set That Is Not Generalized Low. [Citation Graph (0, 0)][DBLP]
    CiE, 2007, pp:474-477 [Conf]
  30. André Nies, Pavel Semukhin
    Finite Automata Presentable Abelian Groups. [Citation Graph (0, 0)][DBLP]
    LFCS, 2007, pp:422-436 [Conf]
  31. Bakhadyr Khoussainov, André Nies, Sasha Rubin, Frank Stephan
    Automatic Structures: Richness and Limitations [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]

  32. The First Order Theories of the Medvedev and Muchnik Lattices. [Citation Graph (, )][DBLP]


  33. Counting the Changes of Random D02{\Delta^0_2} Sets. [Citation Graph (, )][DBLP]


  34. Universal Recursively Enumerable Sets of Strings. [Citation Graph (, )][DBLP]


  35. Superhighness and Strong Jump Traceability. [Citation Graph (, )][DBLP]


  36. From Automatic Structures to Borel Structures. [Citation Graph (, )][DBLP]


  37. On the filter of computably enumerable supersets of an r-maximal set. [Citation Graph (, )][DBLP]


  38. Lowness properties and approximations of the jump. [Citation Graph (, )][DBLP]


  39. Finite automata presentable abelian groups. [Citation Graph (, )][DBLP]


  40. Calibrating Randomness. [Citation Graph (, )][DBLP]


  41. Randomness and Computability: Open Questions. [Citation Graph (, )][DBLP]


  42. Describing Groups. [Citation Graph (, )][DBLP]


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