André Nies - RankMe

106 papers A* 3A 9C 13Misc 1Journal 73Unranked 5

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