| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Laurent Bienvenu, Rupert Hölzl, Joseph S. Miller, André Nies |
The Denjoy alternative for computable functions.  |
STACS  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
Computation, Physics and Beyond |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Antonín Kucera, André Nies |
Demuth's Path to Randomness. |
Computation, Physics and Beyond |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Cristian S. Calude, André Nies, Ludwig Staiger, Frank Stephan |
Universal recursively enumerable sets of strings. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Greg Hjorth, André Nies |
Borel structures and Borel theories. |
J. Symb. Log. |
2011 |
DBLP BibTeX RDF |
|
| 1 | Noam Greenberg, André Nies |
Benign cost functions and lowness properties. |
J. Symb. Log. |
2011 |
DBLP BibTeX RDF |
|
| 1 | Antonín Kucera, André Nies |
Demuth randomness and computational complexity. |
Ann. Pure Appl. Logic |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | George Barmpalias, André Nies |
Upper bounds on ideals in the computably enumerable Turing degrees. |
Ann. Pure Appl. Logic |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Laurent Bienvenu, Wolfgang Merkle, André Nies |
Solovay functions and K-triviality. |
STACS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Bjørn Kjos-Hanssen, André Nies, Frank Stephan, Liang Yu |
Higher Kurtz randomness. |
Ann. Pure Appl. Logic |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Santiago Figueira, Denis R. Hirschfeldt, Joseph S. Miller, Keng Meng Ng, André Nies |
Counting the Changes of Random D02{\Delta^0_2} Sets. |
CiE |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Bjørn Kjos-Hanssen, André Nies |
Superhighness. |
Notre Dame Journal of Formal Logic |
2009 |
DBLP BibTeX RDF |
|
| 1 | Santiago Figueira, Joseph S. Miller, André Nies |
Indifferent Sets. |
J. Log. Comput. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | André Nies, Pavel Semukhin |
Finite automata presentable abelian groups. |
Ann. Pure Appl. Logic |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | André Nies |
Superhighness and Strong Jump Traceability. |
ICALP |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew E. M. Lewis, André Nies, Andrea Sorbi |
The First Order Theories of the Medvedev and Muchnik Lattices. |
CiE |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Santiago Figueira, André Nies, Frank Stephan |
Lowness properties and approximations of the jump. |
Ann. Pure Appl. Logic |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Cristian S. Calude, André Nies, Ludwig Staiger, Frank Stephan |
Universal Recursively Enumerable Sets of Strings. |
Developments in Language Theory |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Greg Hjorth, Bakhadyr Khoussainov, Antonio Montalbán, André Nies |
From Automatic Structures to Borel Structures. |
LICS |
2008 |
DBLP DOI BibTeX RDF |
Borel, Buechi, automata, isomorphism |
| 1 | Bakhadyr Khoussainov, André Nies, Sasha Rubin, Frank Stephan |
Automatic Structures: Richness and Limitations. |
Logical Methods in Computer Science |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | André Nies |
Describing Groups. |
Bulletin of Symbolic Logic |
2007 |
DBLP BibTeX RDF |
|
| 1 | Bakhadyr Khoussainov, André Nies, Sasha Rubin, Frank Stephan |
Automatic Structures: Richness and Limitations |
CoRR |
2007 |
DBLP BibTeX RDF |
|
| 1 | André Nies, Pavel Semukhin |
Finite Automata Presentable Abelian Groups. |
LFCS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew E. M. Lewis, Antonio Montalbán, André Nies |
A Weakly 2-Random Set That Is Not Generalized Low. |
CiE |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Rod Downey, André Nies, Rebecca Weber, Liang Yu |
Lowness and Pi20 nullsets. |
J. Symb. Log. |
2006 |
DBLP BibTeX RDF |
|
| 1 | Rodney G. Downey, Denis R. Hirschfeldt, André Nies, Sebastiaan Terwijn |
Calibrating Randomness. |
Bulletin of Symbolic Logic |
2006 |
DBLP BibTeX RDF |
|
| 1 | Joseph S. Miller, André Nies |
Randomness and Computability: Open Questions. |
Bulletin of Symbolic Logic |
2006 |
DBLP BibTeX RDF |
|
| 1 | Santiago Figueira, André Nies, Frank Stephan |
Lowness Properties and Approximations of the Jump. |
Electr. Notes Theor. Comput. Sci. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Wolfgang Merkle, Joseph S. Miller, André Nies, Jan Reimann, Frank Stephan |
Kolmogorov-Loveland randomness and stochasticity. |
Ann. Pure Appl. Logic |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Verónica Becher, Santiago Figueira, André Nies, Silvana Picchi |
Program Size Complexity for Possibly Infinite Computations. |
Notre Dame Journal of Formal Logic |
2005 |
DBLP BibTeX RDF |
|
| 1 | André Nies, Frank Stephan, Sebastiaan Terwijn |
Randomness, relativization and Turing degrees. |
J. Symb. Log. |
2005 |
DBLP BibTeX RDF |
|
| 1 | Bjørn Kjos-Hanssen, André Nies, Frank Stephan |
Lowness for the Class of Schnorr Random Reals. |
SIAM J. Comput. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Wolfgang Merkle, Joseph S. Miller, André Nies, Jan Reimann, Frank Stephan |
Kolmogorov-Loveland Randomness and Stochasticity. |
STACS |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Bakhadyr Khoussainov, André Nies, Sasha Rubin, Frank Stephan |
Automatic Structures: Richness and Limitations. |
LICS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | André Nies |
Separating Classes of Groups by First-Order Sentences. |
IJAC |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamín René Callejas Bedregal, André Nies |
Lowness Properties of Reals and Hyper-Immunity. |
Electr. Notes Theor. Comput. Sci. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Rodney G. Downey, Denis R. Hirschfeldt, André Nies, Frank Stephan |
Trivial Reals. |
Electr. Notes Theor. Comput. Sci. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Rodney G. Downey, Denis R. Hirschfeldt, André Nies |
Randomness, Computability, and Density. |
SIAM J. Comput. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Douglas A. Cenzer, André Nies |
Initial Segments of The Lattice of PI01 Classes. |
J. Symb. Log. |
2001 |
DBLP BibTeX RDF |
|
| 1 | André Nies |
Interpreting N in the computably enumerable weak truth talble degrees. |
Ann. Pure Appl. Logic |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Steffen Lempp, André Nies, Reed Solomon |
On the filter of computably enumerable supersets of an r-maximal set. |
Arch. Math. Log. |
2001 |
DBLP DOI BibTeX RDF |
Computably enumerable set, r-maximal set, Superset, Tower |
| 1 | Rodney G. Downey, Denis R. Hirschfeldt, André Nies |
Randomness, Computability, and Density. |
STACS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Steffen Lempp, André Nies |
Differences of Computably Enumerable Sets. |
Math. Log. Q. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | André Nies |
Model theory of the computably enumerable many-one degrees. |
Logic Journal of the IGPL |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | André Nies, Andrea Sorbi |
Structural Properties and Sigma02 Enumeration Degrees. |
J. Symb. Log. |
2000 |
DBLP BibTeX RDF |
|
| 1 | Rodney G. Downey, André Nies |
Undecidability Results for Low Complexity Time Classes. |
J. Comput. Syst. Sci. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | André Nies |
A New Spectrum of Recursive Models. |
Notre Dame Journal of Formal Logic |
1999 |
DBLP BibTeX RDF |
|
| 1 | Rodney G. Downey, Geoffrey LaForte, André Nies |
Computably Enumerable Sets and Quasi-Reducibility. |
Ann. Pure Appl. Logic |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Bakhadyr Khoussainov, André Nies, Richard A. Shore |
Computable Models of Theories with Few Models. |
Notre Dame Journal of Formal Logic |
1997 |
DBLP BibTeX RDF |
|
| 1 | Cristian Calude, André Nies |
Chaitin Omega Numbers and Strong Reducibilities. |
J. UCS |
1997 |
DBLP BibTeX RDF |
|
| 1 | Rodney G. Downey, André Nies |
Undecidability Results for Low Complexity Degree Structures. (PDF / PS) |
IEEE Conference on Computational Complexity |
1997 |
DBLP DOI BibTeX RDF |
undecidability results, low complexity degree structures, EXPTIME degrees, polynomial time Turing, many-one reducibility, coding method, ideal lattices, hyper-polynomial time classes, Boolean algebra, Boolean algebras |
| 1 | André Nies, Richard A. Shore, Theodore A. Slaman |
Definability in the recursively enumerable degrees. |
Bulletin of Symbolic Logic |
1996 |
DBLP BibTeX RDF |
|
| 1 | Steffen Lempp, André Nies |
The Undecidability of the Pi4-Theory for the R. E. WTT and Turing Degrees. |
J. Symb. Log. |
1995 |
DBLP BibTeX RDF |
|
| 1 | André Nies, Richard A. Shore |
Interpreting True Arithmetic in the Theory of the r.e. Truth Table Degrees. |
Ann. Pure Appl. Logic |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | André Nies |
Recursively Enumerable Equivalence Relations Modulo Finite Differences. |
Math. Log. Q. |
1994 |
DBLP BibTeX RDF |
|
| 1 | André Nies |
Interpreting True Arithmetic in Degree Structures. |
Kurt Gödel Colloquium |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Ambos-Spies, André Nies, Richard A. Shore |
The Theory of the Recursively Enumerable Weak Truth-Table Degrees Is Undecidability. |
J. Symb. Log. |
1992 |
DBLP BibTeX RDF |
|
| 1 | Klaus Ambos-Spies, André Nies |
The Theory of the Polynomial Many-One Degrees of Recursive Sets is Undecidable. |
STACS |
1992 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")