André Nies

ORCID

Publication Activity (10 Years)

Years Active: 1992-2024
Publications (10 Years): 21

Top Venues

Publications

André Nies, Frank Stephan
Word automatic groups of nilpotency class 2. Inf. Process. Lett. 183 (2024)
Steffen Lempp, Joseph S. Miller, André Nies, Mariya Ivanova Soskova
Maximal Towers and Ultrafilter Bases in Computability Theory. J. Symb. Log. 88 (3) (2023)
André Nies, Frank Stephan
Randomness and initial segment complexity for measures. Theor. Comput. Sci. 900 (2022)
André Nies, Philipp Schlicht, Katrin Tent
Coarse groups, and the isomorphism problem for oligomorphic groups. J. Math. Log. 22 (1) (2022)
André Nies, Marcus Anthony Triplett, Keita Yokoyama
The Reverse Mathematics of theorems of Jordan and Lebesgue. J. Symb. Log. 86 (4) (2021)
Benoit Monin, André Nies
Muchnik Degrees and cardinal characteristics. J. Symb. Log. 86 (2) (2021)
David Bryant, André Nies, Paul F. Tupper
FraïSSé Limits for Relational Metric Structures. J. Symb. Log. 86 (3) (2021)
Noam Greenberg, Joseph S. Miller, André Nies
Computing from projections of random points. J. Math. Log. 20 (1) (2020)
André Nies, Paul Shafer
Randomness Notions and Reverse Mathematics. J. Symb. Log. 85 (1) (2020)
André Nies, Frank Stephan
Randomness and Initial Segment Complexity for Probability Measures. STACS (2020)
Rodney G. Downey, Satyadev Nandakumar, André Nies
Martin-Löf Randomness Implies Multiple Recurrence in Effectively Closed Sets. Notre Dame J. Formal Log. 60 (3) (2019)
Achilles A. Beros, Mushfeq Khan, Bjørn Kjos-Hanssen, André Nies
From Eventually Different Functions to Pandemic Numberings. CiE (2018)
André Nies, Frank Stephan
Closure of Resource-Bounded Randomness Notions Under Polynomial-Time Permutations. STACS (2018)
André Nies, Andrea Sorbi
Calibrating word problems of groups via the complexity of equivalence relations. Math. Struct. Comput. Sci. 28 (3) (2018)
Alexander S. Kechris, André Nies, Katrin Tent
The Complexity of Topological Group Isomorphism. J. Symb. Log. 83 (3) (2018)
Kenshi Miyabe, André Nies, Frank Stephan
Randomness and Solovay degrees. J. Log. Anal. 10 (2018)
André Nies, Frank Stephan
Closure of resource-bounded randomness notions under polynomial time permutations. CoRR (2017)
André Nies
Lowness, Randomness, and Computable Analysis. Computability and Complexity (2017)
Kenshi Miyabe, André Nies, Jing Zhang
Using Almost-everywhere theorems from Analysis to Study Randomness. Bull. Symb. Log. 22 (3) (2016)
Aleksander Galicki, André Nies
A Computational Approach to the Borwein-Ditor Theorem. CiE (2016)
Gemma Carotenuto, André Nies
-Completeness of Density Sets Under Effective Wadge Reducibility. CiE (2016)
Santiago Figueira, André Nies
Feasible Analysis, Randomness, and Base Invariance. Theory Comput. Syst. 56 (3) (2015)
Laurent Bienvenu, Rodney G. Downey, André Nies, Wolfgang Merkle
Solovay functions and their applications in algorithmic randomness. J. Comput. Syst. Sci. 81 (8) (2015)
André Nies, Slawomir Solecki
Local Compactness for Computable Polish Metric Spaces is \varPi ^1_1 Π 1 1 -complete. CiE (2015)
Santiago Figueira, Denis R. Hirschfeldt, Joseph S. Miller, Keng Meng Ng, André Nies
Counting the changes of random Δ20 sets. J. Log. Comput. 25 (4) (2015)
Antonín Kucera, André Nies, Christopher P. Porter
Demuth's Path to Randomness. Bull. Symb. Log. 21 (3) (2015)
Benoit Monin, André Nies
A Unifying Approach to the Gamma Question. LICS (2015)
Laurent Bienvenu, Rod Downey, Noam Greenberg, André Nies, Daniel Turetsky
Characterizing Lowness for Demuth Randomness. J. Symb. Log. 79 (2) (2014)
Laurent Bienvenu, Rupert Hölzl, Joseph S. Miller, André Nies
Denjoy, Demuth and density. J. Math. Log. 14 (1) (2014)
Rodney G. Downey, Kenshi Miyabe, André Nies, Osamu Watanabe
Algorithmic Randomness and Complexity (NII Shonan Meeting 2014-10). NII Shonan Meet. Rep. 2014 (2014)
André Nies
Differentiability of polynomial time computable functions. STACS (2014)
Cameron E. Freer, Bjørn Kjos-Hanssen, André Nies, Frank Stephan
Algorithmic Aspects of Lipschitz Functions. Comput. 3 (1) (2014)
Egor Ianovski, Russell G. Miller, Keng Meng Ng, André Nies
Complexity of Equivalence Relations and Preorders from Computability Theory. J. Symb. Log. 79 (3) (2014)
Laurent Bienvenu, Adam R. Day, Noam Greenberg, Antonín Kucera, Joseph S. Miller, André Nies, Dan Turetsky
Computing k-Trivial Sets by Incomplete Random Sets. Bull. Symb. Log. 20 (1) (2014)
Keng Meng Ng, André Nies, Frank Stephan
The Complexity of Recursive Splittings of Random Sets. Comput. 3 (1) (2014)
Laurent Bienvenu, Noam Greenberg, Antonín Kucera, Joseph S. Miller, André Nies, Daniel Turetsky
Joining non-low C.E. sets with diagonally non-computable functions. J. Log. Comput. 23 (6) (2013)
Alexander G. Melnikov, André Nies
The Classification Problem for Compact Computable Metric Spaces. CiE (2013)
André Nies
Computably enumerable sets below random sets. Ann. Pure Appl. Log. 163 (11) (2012)
George Barmpalias, André Nies
Low upper bounds in the Turing degrees revisited. J. Log. Comput. 22 (4) (2012)
Laurent Bienvenu, Rupert Hölzl, Joseph S. Miller, André Nies
The Denjoy alternative for computable functions. STACS (2012)
Antonín Kucera, André Nies
Demuth's Path to Randomness. Computation, Physics and Beyond (2012)
Ekaterina B. Fokina, Sy-David Friedman, André Nies
Complete for Computable Reducibility - (Extended Abstract). WoLLIC (2012)
Antonín Kucera, André Nies
Demuth randomness and computational complexity. Ann. Pure Appl. Log. 162 (7) (2011)
George Barmpalias, André Nies
Upper bounds on ideals in the computably enumerable Turing degrees. Ann. Pure Appl. Log. 162 (6) (2011)
Laurent Bienvenu, Wolfgang Merkle, André Nies
Solovay functions and K-triviality. STACS (2011)
Cristian S. Calude, André Nies, Ludwig Staiger, Frank Stephan
Universal recursively enumerable sets of strings. Theor. Comput. Sci. 412 (22) (2011)
Noam Greenberg, André Nies
Benign cost functions and lowness properties. J. Symb. Log. 76 (1) (2011)
Vasco Brattka, Joseph S. Miller, André Nies
Randomness and Differentiability. CoRR (2011)
Greg Hjorth, André Nies
Borel structures and Borel theories. J. Symb. Log. 76 (2) (2011)
Bjørn Kjos-Hanssen, André Nies, Frank Stephan, Liang Yu
Higher Kurtz randomness. Ann. Pure Appl. Log. 161 (10) (2010)
Santiago Figueira, Denis R. Hirschfeldt, Joseph S. Miller, Keng Meng Ng, André Nies
Sets. CiE (2010)
André Nies
Superhighness and Strong Jump Traceability. ICALP (1) (2009)
Andrew E. M. Lewis, André Nies, Andrea Sorbi
The First Order Theories of the Medvedev and Muchnik Lattices. CiE (2009)
Santiago Figueira, Joseph S. Miller, André Nies
Indifferent Sets. J. Log. Comput. 19 (2) (2009)
André Nies, Pavel Semukhin
Finite automata presentable abelian groups. Ann. Pure Appl. Log. 161 (3) (2009)
Bjørn Kjos-Hanssen, André Nies
Superhighness. Notre Dame J. Formal Log. 50 (4) (2009)
Santiago Figueira, André Nies, Frank Stephan
Lowness properties and approximations of the jump. Ann. Pure Appl. Log. 152 (1-3) (2008)
Greg Hjorth, Bakhadyr Khoussainov, Antonio Montalbán, André Nies
From Automatic Structures to Borel Structures. LICS (2008)
Cristian S. Calude, André Nies, Ludwig Staiger, Frank Stephan
Universal Recursively Enumerable Sets of Strings. Developments in Language Theory (2008)
André Nies, Pavel Semukhin
Finite Automata Presentable Abelian Groups. LFCS (2007)
Andrew E. M. Lewis, Antonio Montalbán, André Nies
A Weakly 2-Random Set That Is Not Generalized Low. CiE (2007)
André Nies
Describing Groups. Bull. Symb. Log. 13 (3) (2007)
Bakhadyr Khoussainov, André Nies, Sasha Rubin, Frank Stephan
Automatic Structures: Richness and Limitations. Log. Methods Comput. Sci. 3 (2) (2007)
Bakhadyr Khoussainov, André Nies, Sasha Rubin, Frank Stephan
Automatic Structures: Richness and Limitations CoRR (2007)
Rodney G. Downey, Denis R. Hirschfeldt, André Nies, Sebastiaan Terwijn
Calibrating Randomness. Bull. Symb. Log. 12 (3) (2006)
Rod Downey, André Nies, Rebecca Weber, Liang Yu
nullsets. J. Symb. Log. 71 (3) (2006)
Joseph S. Miller, André Nies
Randomness and Computability: Open Questions. Bull. Symb. Log. 12 (3) (2006)
Santiago Figueira, André Nies, Frank Stephan
Lowness Properties and Approximations of the Jump. Electron. Notes Theor. Comput. Sci. 143 (2006)
Wolfgang Merkle, Joseph S. Miller, André Nies, Jan Reimann, Frank Stephan
Kolmogorov-Loveland randomness and stochasticity. Ann. Pure Appl. Log. 138 (1-3) (2006)
Wolfgang Merkle, Joseph S. Miller, André Nies, Jan Reimann, Frank Stephan
Kolmogorov-Loveland Randomness and Stochasticity. STACS (2005)
André Nies, Frank Stephan, Sebastiaan Terwijn
Randomness, relativization and Turing degrees. J. Symb. Log. 70 (2) (2005)
Bjørn Kjos-Hanssen, André Nies, Frank Stephan
Lowness for the Class of Schnorr Random Reals. SIAM J. Comput. 35 (3) (2005)
Rod Downey, Denis R. Hirschfeldt, Joseph S. Miller, André Nies
Relativizing Chaitin's Halting Probability. J. Math. Log. 5 (2) (2005)
Verónica Becher, Santiago Figueira, André Nies, Silvana Picchi
Program Size Complexity for Possibly Infinite Computations. Notre Dame J. Formal Log. 46 (1) (2005)
Bakhadyr Khoussainov, André Nies, Sasha Rubin, Frank Stephan
Automatic Structures: Richness and Limitations. LICS (2004)
André Nies
Parameter Definability in the Recursively Enumerable Degrees. J. Math. Log. 3 (1) (2003)
Benjamín René Callejas Bedregal, André Nies
Lowness Properties of Reals and Hyper-Immunity. Electron. Notes Theor. Comput. Sci. 84 (2003)
André Nies
Separating Classes of Groups by First-Order Sentences. Int. J. Algebra Comput. 13 (3) (2003)
Rodney G. Downey, Denis R. Hirschfeldt, André Nies, Frank Stephan
Trivial Reals. Electron. Notes Theor. Comput. Sci. 66 (1) (2002)
Rodney G. Downey, Denis R. Hirschfeldt, André Nies
Randomness, Computability, and Density. SIAM J. Comput. 31 (4) (2002)
André Nies
Interpreting N in the computably enumerable weak truth talble degrees. Ann. Pure Appl. Log. 107 (1-3) (2001)
Douglas A. Cenzer, André Nies
Classes. J. Symb. Log. 66 (4) (2001)
Steffen Lempp, André Nies, Reed Solomon
On the filter of computably enumerable supersets of an r-maximal set. Arch. Math. Log. 40 (6) (2001)
Rodney G. Downey, Denis R. Hirschfeldt, André Nies
Randomness, Computability, and Density. STACS (2001)
André Nies
Model theory of the computably enumerable many-one degrees. Log. J. IGPL 8 (5) (2000)
Steffen Lempp, André Nies
Differences of Computably Enumerable Sets. Math. Log. Q. 46 (4) (2000)
André Nies, Andrea Sorbi
Enumeration Degrees. J. Symb. Log. 65 (1) (2000)
Rodney G. Downey, André Nies
Undecidability Results for Low Complexity Time Classes. J. Comput. Syst. Sci. 60 (2) (2000)
Rodney G. Downey, Geoffrey LaForte, André Nies
Addendum to "Computably Enumerable Sets and Quasi-Reducibility". Ann. Pure Appl. Log. 98 (1-3) (1999)
André Nies
A New Spectrum of Recursive Models. Notre Dame J. Formal Log. 40 (3) (1999)
Rodney G. Downey, Geoffrey LaForte, André Nies
Computably Enumerable Sets and Quasi-Reducibility. Ann. Pure Appl. Log. 95 (1-3) (1998)
Cristian Calude, André Nies
Chaitin Omega Numbers and Strong Reducibilities. J. Univers. Comput. Sci. 3 (11) (1997)
Rodney G. Downey, André Nies
Undecidability Results for Low Complexity Degree Structures. Computational Complexity Conference (1997)
Bakhadyr Khoussainov, André Nies, Richard A. Shore
Computable Models of Theories with Few Models. Notre Dame J. Formal Log. 38 (2) (1997)
André Nies, Richard A. Shore, Theodore A. Slaman
Definability in the recursively enumerable degrees. Bull. Symb. Log. 2 (4) (1996)
Steffen Lempp, André Nies
-Theory for the R. E. WTT and Turing Degrees. J. Symb. Log. 60 (4) (1995)
Wilfrid Hodges, André Nies
Noninterpretability of Infinite Linear Orders. Logic Colloquium (1995)
André Nies, Richard A. Shore
Interpreting True Arithmetic in the Theory of the r.e. Truth Table Degrees. Ann. Pure Appl. Log. 75 (3) (1995)
André Nies
Recursively Enumerable Equivalence Relations Modulo Finite Differences. Math. Log. Q. 40 (1994)
André Nies
Interpreting True Arithmetic in Degree Structures. Kurt Gödel Colloquium (1993)

André Nies.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

André Nies