Closed choice and a uniform low basis theorem V Brattka, M de Brecht, A Pauly Annals of Pure and Applied Logic 163 (8), 986–1008, 2012 | 141 | 2012 |
On the topological aspects of the theory of represented spaces A Pauly Computability 5 (2), 159-180, 2016 | 124* | 2016 |
Weihrauch complexity in computable analysis V Brattka, G Gherardi, A Pauly Handbook of computability and complexity in analysis, 367-417, 2021 | 99 | 2021 |
On the (semi) lattices induced by continuous reducibilities A Pauly Mathematical Logic Quarterly 56 (5), 488-502, 2010 | 74 | 2010 |
A topological view on algebraic computation models E Neumann, A Pauly Journal of Complexity 44, 1-22, 2018 | 65 | 2018 |
On the algebraic structure of Weihrauch degrees V Brattka, A Pauly Logical Methods in Computer Science 14 (Computability and logic), 2018 | 62 | 2018 |
How incomputable is finding Nash equilibria? A Pauly J. Univers. Comput. Sci. 16 (18), 2686-2710, 2010 | 60 | 2010 |
On the computational content of the Brouwer fixed point theorem V Brattka, S Le Roux, A Pauly How the World Computes: Turing Centenary Conference and 8th Conference on …, 2012 | 58* | 2012 |
The degree structure of Weihrauch-reducibility K Higuchi, A Pauly Logical Methods in Computer Science 9 (2), 2010 | 48 | 2010 |
A comparison of concepts from computable analysis and effective descriptive set theory V Gregoriades, T Kispéter, A Pauly Mathematical Structures in Computer Science 27 (8), 1414-1436, 2017 | 44 | 2017 |
Non-deterministic computation and the Jayne-Rogers theorem A Pauly, M de Brecht arXiv preprint arXiv:1404.0079, 2014 | 44 | 2014 |
Computation with advice V Brattka, A Pauly arXiv preprint arXiv:1006.0395, 2010 | 44 | 2010 |
Point degree spectra of represented spaces T Kihara, A Pauly arXiv preprint arXiv:1405.6866, 2014 | 43 | 2014 |
Descriptive set theory in the category of represented spaces A Pauly, M De Brecht 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 438-449, 2015 | 41 | 2015 |
Finite choice, convex choice and finding roots S Le Roux, A Pauly Logical Methods in Computer Science 11, 2015 | 34 | 2015 |
Relative computability and uniform continuity of relations A Pauly, M Ziegler arXiv preprint arXiv:1105.3050, 2011 | 34 | 2011 |
Searching for an analogue of ATR0 in the Weihrauch lattice T Kihara, A Marcone, A Pauly The Journal of Symbolic Logic 85 (3), 1006-1043, 2020 | 33 | 2020 |
Overt choice M de Brecht, A Pauly, M Schröder Computability 9 (3-4), 169-191, 2020 | 30 | 2020 |
Infinite sequential games with real-valued payoffs S Le Roux, A Pauly Proceedings of the joint meeting of the twenty-third EACSL annual conference …, 2014 | 28 | 2014 |
Finding descending sequences through ill-founded linear orders J Le Goh, A Pauly, M Valenti The Journal of Symbolic Logic 86 (2), 817-854, 2021 | 25 | 2021 |