default search action
André Nies
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j68]André Nies
, Frank Stephan
Word automatic groups of nilpotency class 2. Inf. Process. Lett. 183: 106426 (2024) - 2023
- [j67]Steffen Lempp
Maximal Towers and Ultrafilter Bases in Computability Theory. J. Symb. Log. 88(3): 1170-1190 (2023) - 2022
- [j66]André Nies, Philipp Schlicht
Coarse groups, and the isomorphism problem for oligomorphic groups. J. Math. Log. 22(1): 2150029:1-2150029:31 (2022) - [j65]André Nies, Frank Stephan
Randomness and initial segment complexity for measures. Theor. Comput. Sci. 900: 1-19 (2022) - 2021
- [j64]Benoit Monin, André Nies:
Muchnik Degrees and cardinal characteristics. J. Symb. Log. 86(2): 471-498 (2021) - [j63]David Bryant, André Nies, Paul F. Tupper:
FraïSSé Limits for Relational Metric Structures. J. Symb. Log. 86(3): 913-934 (2021) - [j62]André Nies, Marcus Anthony Triplett, Keita Yokoyama
The Reverse Mathematics of theorems of Jordan and Lebesgue. J. Symb. Log. 86(4): 1657-1675 (2021) - 2020
- [j61]Noam Greenberg, Joseph S. Miller
Computing from projections of random points. J. Math. Log. 20(1): 1950014 (2020) - [j60]André Nies, Paul Shafer:
Randomness Notions and Reverse Mathematics. J. Symb. Log. 85(1): 271-299 (2020) - [c31]André Nies, Frank Stephan
Randomness and Initial Segment Complexity for Probability Measures. STACS 2020: 55:1-55:14
2010 – 2019
- 2019
- [j59]Rodney G. Downey, Satyadev Nandakumar
Martin-Löf Randomness Implies Multiple Recurrence in Effectively Closed Sets. Notre Dame J. Formal Log. 60(3): 491-502 (2019) - 2018
- [j58]Kenshi Miyabe, André Nies, Frank Stephan:
Randomness and Solovay degrees. J. Log. Anal. 10 (2018) - [j57]Alexander S. Kechris, André Nies
The Complexity of Topological Group Isomorphism. J. Symb. Log. 83(3): 1190-1203 (2018) - [j56]André Nies
Calibrating word problems of groups via the complexity of equivalence relations. Math. Struct. Comput. Sci. 28(3): 457-471 (2018) - [c30]Achilles A. Beros, Mushfeq Khan, Bjørn Kjos-Hanssen
From Eventually Different Functions to Pandemic Numberings. CiE 2018: 97-106 - [c29]André Nies
Closure of Resource-Bounded Randomness Notions Under Polynomial-Time Permutations. STACS 2018: 51:1-51:10 - 2017
- [c28]André Nies
Lowness, Randomness, and Computable Analysis. Computability and Complexity 2017: 738-754 - [p1]André Nies:
Calculus of Cost Functions. The Incomputable 2017: 183-216 - [i4]André Nies, Frank Stephan:
Closure of resource-bounded randomness notions under polynomial time permutations. CoRR abs/1709.08792 (2017) - 2016
- [j55]Kenshi Miyabe, André Nies
Using Almost-everywhere theorems from Analysis to Study Randomness. Bull. Symb. Log. 22(3): 305-331 (2016) - [c27]Aleksander Galicki, André Nies
A Computational Approach to the Borwein-Ditor Theorem. CiE 2016: 99-104 - [c26]Gemma Carotenuto, André Nies
Lightface Π30-Completeness of Density Sets Under Effective Wadge Reducibility. CiE 2016: 234-239 - 2015
- [j54]Antonín Kucera
Demuth's Path to Randomness. Bull. Symb. Log. 21(3): 270-305 (2015) - [j53]Laurent Bienvenu, Rodney G. Downey, André Nies
Solovay functions and their applications in algorithmic randomness. J. Comput. Syst. Sci. 81(8): 1575-1591 (2015) - [j52]Santiago Figueira, Denis R. Hirschfeldt, Joseph S. Miller
Counting the changes of random Δ20 sets. J. Log. Comput. 25(4): 1073-1089 (2015) - [j51]Santiago Figueira, André Nies
Feasible Analysis, Randomness, and Base Invariance. Theory Comput. Syst. 56(3): 439-464 (2015) - [c25]André Nies
Local Compactness for Computable Polish Metric Spaces is \varPi ^1_1 Π 1 1 -complete. CiE 2015: 286-290 - [c24]Benoit Monin, André Nies
A Unifying Approach to the Gamma Question. LICS 2015: 585-596 - 2014
- [j50]Laurent Bienvenu, Adam R. Day
Computing k-Trivial Sets by Incomplete Random Sets. Bull. Symb. Log. 20(1): 80-90 (2014) - [j49]Keng Meng Ng
The Complexity of Recursive Splittings of Random Sets. Comput. 3(1): 1-8 (2014) - [j48]Cameron E. Freer, Bjørn Kjos-Hanssen, André Nies
Algorithmic Aspects of Lipschitz Functions. Comput. 3(1): 45-61 (2014) - [j47]Laurent Bienvenu, Rupert Hölzl, Joseph S. Miller
Denjoy, Demuth and density. J. Math. Log. 14(1): 1450004 (2014) - [j46]Laurent Bienvenu, Rod Downey, Noam Greenberg, André Nies
Characterizing Lowness for Demuth Randomness. J. Symb. Log. 79(2): 526-560 (2014) - [j45]Egor Ianovski
Complexity of Equivalence Relations and Preorders from Computability Theory. J. Symb. Log. 79(3): 859-881 (2014) - [c23]André Nies
Differentiability of polynomial time computable functions. STACS 2014: 602-613 - [i3]Rodney G. Downey, Kenshi Miyabe, André Nies, Osamu Watanabe:
Algorithmic Randomness and Complexity (NII Shonan Meeting 2014-10). NII Shonan Meet. Rep. 2014 (2014) - 2013
- [j44]Laurent Bienvenu, Noam Greenberg, Antonín Kucera
Joining non-low C.E. sets with diagonally non-computable functions. J. Log. Comput. 23(6): 1183-1194 (2013) - [c22]Alexander G. Melnikov
The Classification Problem for Compact Computable Metric Spaces. CiE 2013: 320-328 - 2012
- [j43]André Nies
Computably enumerable sets below random sets. Ann. Pure Appl. Log. 163(11): 1596-1610 (2012) - [j42]George Barmpalias
Low upper bounds in the Turing degrees revisited. J. Log. Comput. 22(4): 693-699 (2012) - [c21]Antonín Kucera
Demuth's Path to Randomness. Computation, Physics and Beyond 2012: 159-173 - [c20]Laurent Bienvenu, Rupert Hölzl, Joseph S. Miller
The Denjoy alternative for computable functions. STACS 2012: 543-554 - [c19]Ekaterina B. Fokina
Equivalence Relations That Are Σ03 Complete for Computable Reducibility - (Extended Abstract). WoLLIC 2012: 26-33 - [e1]Michael J. Dinneen, Bakhadyr Khoussainov, André Nies:
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. Lecture Notes in Computer Science 7160, Springer 2012, ISBN 978-3-642-27653-8 [contents] - 2011
- [j41]George Barmpalias
Upper bounds on ideals in the computably enumerable Turing degrees. Ann. Pure Appl. Log. 162(6): 465-473 (2011) - [j40]Antonín Kucera
Demuth randomness and computational complexity. Ann. Pure Appl. Log. 162(7): 504-513 (2011) - [j39]Noam Greenberg, André Nies
Benign cost functions and lowness properties. J. Symb. Log. 76(1): 289-312 (2011) - [j38]Greg Hjorth, André Nies
Borel structures and Borel theories. J. Symb. Log. 76(2): 461-476 (2011) - [j37]Cristian S. Calude
Universal recursively enumerable sets of strings. Theor. Comput. Sci. 412(22): 2253-2261 (2011) - [c18]Laurent Bienvenu, Wolfgang Merkle, André Nies
Solovay functions and K-triviality. STACS 2011: 452-463 - [i2]Vasco Brattka, Joseph S. Miller, André Nies:
Randomness and Differentiability. CoRR abs/1104.4465 (2011) - 2010
- [j36]Bjørn Kjos-Hanssen, André Nies
Higher Kurtz randomness. Ann. Pure Appl. Log. 161(10): 1280-1290 (2010) - [c17]Santiago Figueira, Denis R. Hirschfeldt, Joseph S. Miller
Counting the Changes of Random D02 Sets. CiE 2010: 162-171
2000 – 2009
- 2009
- [j35]André Nies
Finite automata presentable abelian groups. Ann. Pure Appl. Log. 161(3): 458-467 (2009) - [j34]Santiago Figueira, Joseph S. Miller
Indifferent Sets. J. Log. Comput. 19(2): 425-443 (2009) - [j33]Bjørn Kjos-Hanssen, André Nies
Superhighness. Notre Dame J. Formal Log. 50(4): 445-452 (2009) - [c16]Andrew E. M. Lewis, André Nies
The First Order Theories of the Medvedev and Muchnik Lattices. CiE 2009: 324-331 - [c15]André Nies
Superhighness and Strong Jump Traceability. ICALP (1) 2009: 726-737 - 2008
- [j32]Santiago Figueira, André Nies
Lowness properties and approximations of the jump. Ann. Pure Appl. Log. 152(1-3): 51-66 (2008) - [c14]Cristian S. Calude
Universal Recursively Enumerable Sets of Strings. Developments in Language Theory 2008: 170-182 - [c13]Greg Hjorth, Bakhadyr Khoussainov, Antonio Montalbán, André Nies
From Automatic Structures to Borel Structures. LICS 2008: 431-441 - 2007
- [j31]André Nies
Describing Groups. Bull. Symb. Log. 13(3): 305-339 (2007) - [j30]Bakhadyr Khoussainov, André Nies
Automatic Structures: Richness and Limitations. Log. Methods Comput. Sci. 3(2) (2007) - [c12]Andrew E. M. Lewis, Antonio Montalbán, André Nies
A Weakly 2-Random Set That Is Not Generalized Low. CiE 2007: 474-477 - [c11]André Nies, Pavel Semukhin
Finite Automata Presentable Abelian Groups. LFCS 2007: 422-436 - [i1]Bakhadyr Khoussainov, André Nies, Sasha Rubin, Frank Stephan:
Automatic Structures: Richness and Limitations. CoRR abs/cs/0703064 (2007) - 2006
- [j29]Wolfgang Merkle, Joseph S. Miller
Kolmogorov-Loveland randomness and stochasticity. Ann. Pure Appl. Log. 138(1-3): 183-210 (2006) - [j28]Joseph S. Miller
Randomness and Computability: Open Questions. Bull. Symb. Log. 12(3): 390-410 (2006) - [j27]Rodney G. Downey, Denis R. Hirschfeldt, André Nies
Calibrating Randomness. Bull. Symb. Log. 12(3): 411-491 (2006) - [j26]Rod Downey, André Nies
Lowness and Π20 nullsets. J. Symb. Log. 71(3): 1044-1052 (2006) - 2005
- [j25]Rod Downey, Denis R. Hirschfeldt, Joseph S. Miller
Relativizing Chaitin's Halting Probability. J. Math. Log. 5(2) (2005) - [j24]André Nies
Randomness, relativization and Turing degrees. J. Symb. Log. 70(2): 515-535 (2005) - [j23]Verónica Becher
Program Size Complexity for Possibly Infinite Computations. Notre Dame J. Formal Log. 46(1): 51-64 (2005) - [j22]Bjørn Kjos-Hanssen, André Nies
Lowness for the Class of Schnorr Random Reals. SIAM J. Comput. 35(3): 647-657 (2005) - [c10]Wolfgang Merkle, Joseph S. Miller
Kolmogorov-Loveland Randomness and Stochasticity. STACS 2005: 422-433 - [c9]Santiago Figueira, André Nies
Lowness Properties and Approximations of the Jump. WoLLIC 2005: 45-57 - 2004
- [c8]Bakhadyr Khoussainov, André Nies, Sasha Rubin, Frank Stephan:
Automatic Structures: Richness and Limitations. LICS 2004: 44-53 - 2003
- [j21]André Nies
Separating Classes of Groups by First-Order Sentences. Int. J. Algebra Comput. 13(3): 287-302 (2003) - [j20]André Nies:
Parameter Definability in the Recursively Enumerable Degrees. J. Math. Log. 3(1) (2003) - [c7]Benjamín René Callejas Bedregal, André Nies
Lowness Properties of Reals and Hyper-Immunity. WoLLIC 2003: 73-79 - 2002
- [j19]Rodney G. Downey, Denis R. Hirschfeldt, André Nies
Randomness, Computability, and Density. SIAM J. Comput. 31(4): 1169-1183 (2002) - [c6]Rodney G. Downey, Denis R. Hirschfeldt, André Nies
Trivial Reals. CCA 2002: 36-52 - 2001
- [j18]Steffen Lempp, André Nies
On the filter of computably enumerable supersets of an r-maximal set. Arch. Math. Log. 40(6): 415-423 (2001) - [j17]André Nies
Interpreting N in the computably enumerable weak truth talble degrees. Ann. Pure Appl. Log. 107(1-3): 35-48 (2001) - [j16]Douglas A. Cenzer, André Nies:
Initial Segments of The Lattice of PI01 Classes. J. Symb. Log. 66(4): 1749-1765 (2001) - [c5]Rodney G. Downey, Denis R. Hirschfeldt, André Nies:
Randomness, Computability, and Density. STACS 2001: 195-205 - 2000
- [j15]André Nies:
Model theory of the computably enumerable many-one degrees. Log. J. IGPL 8(5): 701-706 (2000) - [j14]Rodney G. Downey, André Nies
Undecidability Results for Low Complexity Time Classes. J. Comput. Syst. Sci. 60(2): 465-479 (2000) - [j13]André Nies, Andrea Sorbi:
Structural Properties and Sigma02 Enumeration Degrees. J. Symb. Log. 65(1): 285-292 (2000) - [j12]Steffen Lempp, André Nies:
Differences of Computably Enumerable Sets. Math. Log. Q. 46(4): 555-561 (2000)
1990 – 1999
- 1999
- [j11]Rodney G. Downey, Geoffrey LaForte, André Nies:
Addendum to "Computably Enumerable Sets and Quasi-Reducibility". Ann. Pure Appl. Log. 98(1-3): 295 (1999) - [j10]André Nies
A New Spectrum of Recursive Models. Notre Dame J. Formal Log. 40(3): 307-314 (1999) - 1998
- [j9]Rodney G. Downey, Geoffrey LaForte, André Nies
Computably Enumerable Sets and Quasi-Reducibility. Ann. Pure Appl. Log. 95(1-3): 1-35 (1998) - 1997
- [j8]Cristian Calude, André Nies:
Chaitin Omega Numbers and Strong Reducibilities. J. Univers. Comput. Sci. 3(11): 1162-1166 (1997) - [j7]Bakhadyr Khoussainov, André Nies
Computable Models of Theories with Few Models. Notre Dame J. Formal Log. 38(2): 165-178 (1997) - [c4]Rodney G. Downey, André Nies
Undecidability Results for Low Complexity Degree Structures. CCC 1997: 128-132 - 1996
- [j6]André Nies
Definability in the recursively enumerable degrees. Bull. Symb. Log. 2(4): 392-404 (1996) - 1995
- [j5]André Nies
Interpreting True Arithmetic in the Theory of the r.e. Truth Table Degrees. Ann. Pure Appl. Log. 75(3): 269-311 (1995) - [j4]Steffen Lempp, André Nies:
The Undecidability of the Pi4-Theory for the R. E. WTT and Turing Degrees. J. Symb. Log. 60(4): 1118-1136 (1995) - [c3]Wilfrid Hodges, André Nies:
Noninterpretability of Infinite Linear Orders. Logic Colloquium 1995: 73-78 - 1994
- [j3]André Nies
Recursively Enumerable Equivalence Relations Modulo Finite Differences. Math. Log. Q. 40: 490-518 (1994) - 1993
- [c2]André Nies:
Interpreting True Arithmetic in Degree Structures. Kurt Gödel Colloquium 1993: 255-262 - 1992
- [j2]Klaus Ambos-Spies, André Nies
Cappable recursively enumerable degrees and Post's program. Arch. Math. Log. 32(1): 51-56 (1992) - [j1]Klaus Ambos-Spies, André Nies, Richard A. Shore:
The Theory of the Recursively Enumerable Weak Truth-Table Degrees Is Undecidability. J. Symb. Log. 57(3): 864-874 (1992) - [c1]Klaus Ambos-Spies, André Nies:
The Theory of the Polynomial Many-One Degrees of Recursive Sets is Undecidable. STACS 1992: 209-218
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-30 00:12 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: