André Nies
Orcid: 0000-0002-0666-5180
According to our database1,
André Nies
authored at least 96 papers
between 1992 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
1995
2000
2005
2010
2015
2020
0
1
2
3
4
5
6
7
8
9
1
1
1
2
3
2
1
3
1
4
7
1
2
6
1
3
2
4
4
2
1
3
4
2
1
2
1
2
1
2
1
2
1
2
2
1
1
3
1
1
2
1
1
1
1
1
1
1
1
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
2023
2022
J. Math. Log., 2022
2021
2020
Proceedings of the 37th International Symposium on Theoretical Aspects of Computer Science, 2020
2019
Notre Dame J. Formal Log., 2019
2018
Math. Struct. Comput. Sci., 2018
Proceedings of the 35th Symposium on Theoretical Aspects of Computer Science, 2018
Proceedings of the Sailing Routes in the World of Computation, 2018
2017
Proceedings of the Computability and Complexity, 2017
Proceedings of the Incomputable: Journeys Beyond the Turing Barrier, 2017
2016
Bull. Symb. Log., 2016
Proceedings of the Pursuit of the Universal - 12th Conference on Computability in Europe, 2016
Lightface Π<sub>3</sub><sup>0</sup>-Completeness of Density Sets Under Effective Wadge Reducibility.
Proceedings of the Pursuit of the Universal - 12th Conference on Computability in Europe, 2016
2015
J. Comput. Syst. Sci., 2015
Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015
Local Compactness for Computable Polish Metric Spaces is \varPi ^1_1 Π 1 1 -complete.
Proceedings of the Evolving Computability - 11th Conference on Computability in Europe, 2015
2014
NII Shonan Meet. Rep., 2014
J. Symb. Log., 2014
Proceedings of the 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 2014
2013
J. Log. Comput., 2013
Proceedings of the Nature of Computation. Logic, Algorithms, Applications, 2013
2012
Equivalence Relations That Are Σ<sup>0</sup><sub>3</sub> Complete for Computable Reducibility - (Extended Abstract).
Proceedings of the Logic, Language, Information and Computation, 2012
Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, 2012
Proceedings of the Computation, Physics and Beyond, 2012
2011
Ann. Pure Appl. Log., 2011
Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science, 2011
2010
Proceedings of the Programs, Proofs, Processes, 6th Conference on Computability in Europe, 2010
2009
Proceedings of the Automata, Languages and Programming, 36th International Colloquium, 2009
Proceedings of the Mathematical Theory and Computational Practice, 2009
2008
Proceedings of the Twenty-Third Annual IEEE Symposium on Logic in Computer Science, 2008
2007
Proceedings of the Computation and Logic in the Real World, 2007
2006
2005
Notre Dame J. Formal Log., 2005
Proceedings of the 12th Workshop on Logic, Language, Information and Computation, 2005
2003
Proceedings of the 10th Workshop on Logic, Language, Information and Computation, 2003
2002
2001
J. Symb. Log., 2001
Ann. Pure Appl. Log., 2001
Arch. Math. Log., 2001
2000
J. Symb. Log., 2000
1999
Ann. Pure Appl. Log., 1999
1998
1997
Proceedings of the Twelfth Annual IEEE Conference on Computational Complexity, 1997
1996
1995
The Undecidability of the Pi<sub>4</sub>-Theory for the R. E. WTT and Turing Degrees.
J. Symb. Log., 1995
Ann. Pure Appl. Log., 1995
Proceedings of the Annual European Summer Meeting of the Association of Symbolic Logic, 1995
1994
Math. Log. Q., 1994
1993
Proceedings of the Computational Logic and Proof Theory, Third Kurt Gödel Colloquium, 1993
1992
J. Symb. Log., 1992
Proceedings of the STACS 92, 1992