Arno Pauly

ORCID

Publication Activity (10 Years)

Years Active: 2009-2024
Publications (10 Years): 83

Top Venues

University of Cambridge, UK (PHD)

Education History

University of Cambridge, UK

PHD

Publications

Arno Pauly
More on the indivisibility of Q. CoRR (2024)
Jun Le Goh, Arno Pauly, Manlio Valenti
The Weakness of Finding Descending Sequences in Ill-Founded Linear Orders. CiE (2024)
Eike Neumann, Arno Pauly, Cécilia Pradic
The equational theory of the Weihrauch lattice with multiplication. CoRR (2024)
Jun Le Goh, Arno Pauly, Manlio Valenti
The weakness of finding descending sequences in ill-founded linear orders. CoRR (2024)
Arno Pauly, Giovanni Soldà
Sequential Discontinuity and First-Order Problems. CiE (2024)
Arno Pauly, Giovanni Solda
Sequential discontinuity and first-order problems. CoRR (2024)
Steffen Lempp, Joseph S. Miller, Arno Pauly, Mariya Ivanova Soskova, Manlio Valenti
Minimal covers in the Weihrauch degrees. CoRR (2023)
Vittorio Cipriani, Arno Pauly
The Complexity of Finding Supergraphs. CiE (2023)
Arno Pauly, Pierre Pradic, Giovanni Solda
On the Weihrauch degree of the additive Ramsey theorem. CoRR (2023)
Vittorio Cipriani, Arno Pauly
Embeddability of graphs and Weihrauch degrees. CoRR (2023)
Takayuki Kihara, Arno Pauly
De Groot Duality for Represented Spaces. CiE (2023)
Tonicha Crook, Jay Paul Morgan, Arno Pauly, Markus Roggenbach
A Computability Perspective on (Verified) Machine Learning. WADT (2022)
Arno Pauly, Linda Westrick, Liang Yu
Luzin's (n) and Randomness Reflection. J. Symb. Log. 87 (2) (2022)
Jay Morgan, Adeline Paiement, Arno Pauly, Monika Seisenberger
Adaptive Neighbourhoods for the Discovery of Adversarial Examples. CoRR (2021)
Tonicha Crook, Arno Pauly
The Weihrauch degree of finding Nash equilibria in multiplayer games. CoRR (2021)
Christine Gaßner, Arno Pauly, Florian Steinberg
Computing Measure as a Primitive Operation in Real Number Computation. CSL (2021)
Tonicha Crook, Jay Morgan, Arno Pauly, Markus Roggenbach
A Computability Perspective on (Verified) Machine Learning. CoRR (2021)
Véronique Bruyère, Stéphane Le Roux, Arno Pauly, Jean-François Raskin
On the existence of weak subgame perfect equilibria. Inf. Comput. 276 (2021)
Mathieu Hoyrup, Arno Pauly, Victor L. Selivanov, Mariya Ivanova Soskova
Descriptive Set Theory and Computable Topology (Dagstuhl Seminar 21461). Dagstuhl Reports 11 (10) (2021)
Jun Le Goh, Arno Pauly, Manlio Valenti
Finding descending sequences through ill-Founded linear Orders. J. Symb. Log. 86 (2) (2021)
Stéphane Le Roux, Arno Pauly
Equilibria in multi-player multi-outcome infinite sequential games. Inf. Comput. 276 (2021)
Damir D. Dzhafarov, Jun Le Goh, Denis R. Hirschfeldt, Ludovic Patey, Arno Pauly
Ramsey's theorem and products in the Weihrauch degrees. Comput. 9 (2) (2020)
Caleb Davis, Denis R. Hirschfeldt, Jeffry L. Hirst, Jake Pardo, Arno Pauly, Keita Yokoyama
Combinatorial principles equivalent to weak induction. Comput. 9 (3-4) (2020)
Arno Pauly, Dongseong Seon, Martin Ziegler
Computing Haar Measures. CSL (2020)
Jun Le Goh, Arno Pauly, Manlio Valenti
Finding descending sequences through ill-founded linear orders. CoRR (2020)
Arno Pauly
An update on Weihrauch complexity, and some open questions. CoRR (2020)
Takayuki Kihara, Alberto Marcone, Arno Pauly
Searching for an analogue of Atr0 in the Weihrauch Lattice. J. Symb. Log. 85 (3) (2020)
Vasco Brattka, Damir D. Dzhafarov, Alberto Marcone, Arno Pauly
Dagstuhl Seminar on Measuring the Complexity of Computational Content 2018. Comput. 9 (3-4) (2020)
Stéphane Le Roux, Arno Pauly
A Semi-Potential for Finite and Infinite Games in Extensive Form. Dyn. Games Appl. 10 (1) (2020)
Matthew de Brecht, Arno Pauly, Matthias Schröder
Overt choice. Comput. 9 (3-4) (2020)
Arno Pauly, Dongseong Seon, Martin Ziegler
Computing Haar Measures. CoRR (2019)
Takayuki Kihara, Arno Pauly
Convex choice, finite choice and sorting. CoRR (2019)
Hugo Nobrega, Arno Pauly
Game characterizations and lower cones in the Weihrauch degrees. Log. Methods Comput. Sci. 15 (3) (2019)
Matthew de Brecht, Arno Pauly, Matthias Schröder
Overt choice. CoRR (2019)
Åsa Hirvonen, Juha Kontinen, Arno Pauly
Continuous Team Semantics. TAMC (2019)
Gafurjan I. Ibragimov, Bakh Khoussainov, Arno Pauly
Computability Aspects of Differential Games in Euclidian Spaces. CoRR (2019)
Guido Gherardi, Alberto Marcone, Arno Pauly
Projection operators in the Weihrauch lattice. Comput. 8 (3-4) (2019)
Takayuki Kihara, Arno Pauly
Finite Choice, Convex Choice and Sorting. TAMC (2019)
Vasco Brattka, Stéphane Le Roux, Joseph S. Miller, Arno Pauly
Connected choice and the Brouwer fixed point theorem. J. Math. Log. 19 (1) (2019)
Takayuki Kihara, Keng Meng Ng, Arno Pauly
Enumeration degrees and non-metrizable topology. CoRR (2019)
Arno Pauly
Effective local compactness and the hyperspace of located sets. CoRR (2019)
Vasco Brattka, Arno Pauly
On the algebraic structure of Weihrauch degrees. Log. Methods Comput. Sci. 14 (4) (2018)
Arno Pauly, Willem L. Fouché, George Davie
Weihrauch-completeness for layerwise computability. Log. Methods Comput. Sci. 14 (2) (2018)
Arno Pauly
Enumeration Degrees and Topology. CiE (2018)
Nicolas Basset, Ismaël Jecker, Arno Pauly, Jean-François Raskin, Marie van den Bogaard
Beyond Admissibility: Dominance Between Chains of Strategies. CSL (2018)
Takayuki Kihara, Alberto Marcone, Arno Pauly
Searching for an analogue of ATR in the Weihrauch lattice. CoRR (2018)
Nicolas Basset, Ismaël Jecker, Arno Pauly, Jean-François Raskin, Marie van den Bogaard
Beyond admissibility: Dominance between chains of strategies. CoRR (2018)
Eike Neumann, Arno Pauly
A topological view on algebraic computation models. J. Complex. 44 (2018)
Arno Pauly
Parameterized Games and Parameterized Automata. GandALF (2018)
Stéphane Le Roux, Arno Pauly, Jean-François Raskin
Minkowski Games. ACM Trans. Comput. Log. 19 (3) (2018)
Stéphane Le Roux, Arno Pauly, Mickael Randour
Extending finite-memory determinacy by Boolean combination of winning conditions. CoRR (2018)
Paul Hunter, Arno Pauly, Guillermo A. Pérez, Jean-François Raskin
Mean-payoff games with partial observation. Theor. Comput. Sci. 735 (2018)
Stéphane Le Roux, Arno Pauly
Extending finite-memory determinacy to multi-player games. Inf. Comput. 261 (2018)
Stéphane Le Roux, Arno Pauly, Mickael Randour
Extending Finite-Memory Determinacy by Boolean Combination of Winning Conditions. FSTTCS (2018)
Vasco Brattka, Damir D. Dzhafarov, Alberto Marcone, Arno Pauly
Measuring the Complexity of Computational Content: From Combinatorial Problems to Analysis (Dagstuhl Seminar 18361). Dagstuhl Reports 8 (9) (2018)
Arno Pauly, Florian Steinberg
Comparing Representations for Function Spaces in Computable Analysis. Theory Comput. Syst. 62 (3) (2018)
Matthew de Brecht, Arno Pauly
Noetherian Quasi-Polish spaces. CSL (2017)
Vassilios Gregoriades, Tamás Kispéter, Arno Pauly
A comparison of concepts from computable analysis and effective descriptive set theory. Math. Struct. Comput. Sci. 27 (8) (2017)
Arno Pauly
Many-one reductions and the category of multivalued functions. Math. Struct. Comput. Sci. 27 (3) (2017)
Vasco Brattka, Guido Gherardi, Arno Pauly
Weihrauch Complexity in Computable Analysis. CoRR (2017)
Romain Brenguier, Arno Pauly, Jean-François Raskin, Ocan Sankur
Admissibility in Games with Imperfect Information (Invited Talk). CONCUR (2017)
Vasco Brattka, Guido Gherardi, Rupert Hölzl, Arno Pauly
The Vitali Covering Theorem in the Weihrauch Lattice. Computability and Complexity (2017)
Stéphane Le Roux, Arno Pauly, Jean-François Raskin
Minkowski Games. STACS (2017)
Véronique Bruyère, Stéphane Le Roux, Arno Pauly, Jean-François Raskin
On the Existence of Weak Subgame Perfect Equilibria. FoSSaCS (2017)
Hugo Nobrega, Arno Pauly
Game Characterizations and Lower Cones in the Weihrauch Degrees. CiE (2017)
Hajime Ishihara, Margarita V. Korovina, Arno Pauly, Monika Seisenberger, Dieter Spreen
Preface to the special issue: Continuity, computability, constructivity: from logic to algorithms 2013. Math. Struct. Comput. Sci. 27 (8) (2017)
Arno Pauly, Willem L. Fouché
How constructive is constructing measures? J. Log. Anal. 9 (2017)
Matthew de Brecht, Arno Pauly
Noetherian Quasi-Polish Spaces. CoRR (2016)
Arno Pauly
The Computational Complexity of Iterated Elimination of Dominated Strategies. Theory Comput. Syst. 59 (1) (2016)
Stéphane Le Roux, Arno Pauly, Jean-François Raskin
Minkowski games. CoRR (2016)
Vasco Brattka, Arno Pauly
On the algebraic structure of Weihrauch degrees. CoRR (2016)
Vasco Brattka, Stéphane Le Roux, Joseph S. Miller, Arno Pauly
The Brouwer Fixed Point Theorem Revisited. CiE (2016)
Takayuki Kihara, Arno Pauly
Dividing by Zero - How Bad Is It, Really?. MFCS (2016)
Vasco Brattka, Guido Gherardi, Rupert Hölzl, Arno Pauly
The Vitali Covering Theorem in the Weihrauch Lattice. CoRR (2016)
Arno Pauly, Hideki Tsuiki
-representations of compact sets. CoRR (2016)
Stéphane Le Roux, Arno Pauly
Extending finite memory determinacy: General techniques and an application to energy parity games. CoRR (2016)
Eike Neumann, Arno Pauly
A topological view on algebraic computation models. CoRR (2016)
Stéphane Le Roux, Arno Pauly
Extending Finite Memory Determinacy to Multiplayer Games. SR (2016)
Arno Pauly
On the topological aspects of the theory of represented spaces. Comput. 5 (2) (2016)
Stéphane Le Roux, Arno Pauly
A Semi-Potential for Finite and Infinite Sequential Games (Extended Abstract). GandALF (2016)
Véronique Bruyère, Stéphane Le Roux, Arno Pauly, Jean-François Raskin
On the existence of weak subgame perfect equilibria. CoRR (2016)
Arno Pauly, Florian Steinberg
Representations of Analytic Functions and Weihrauch Degrees. CSR (2016)
Takayuki Kihara, Arno Pauly
Dividing by zero - how bad is it, really? CoRR (2016)
Stéphane Le Roux, Arno Pauly
Weihrauch Degrees of Finding Equilibria in Sequential Games. CiE (2015)
Arno Pauly, Florian Steinberg
Representations of analytic functions and Weihrauch degrees. CoRR (2015)
Arno Pauly
Computability on the countable ordinals and the Hausdorff-Kuratowski theorem. CoRR (2015)
Arno Pauly, Matthew de Brecht
Descriptive Set Theory in the Category of Represented Spaces. LICS (2015)
Arno Pauly
Computability on the Countable Ordinals and the Hausdorff-Kuratowski Theorem (Extended Abstract). MFCS (1) (2015)
Arno Pauly, George Davie, Willem L. Fouché
Weihrauch-completeness for layerwise computability. CoRR (2015)
Stéphane Le Roux, Arno Pauly
Closed choice: Cardinality vs convex dimension Log. Methods Comput. Sci. 11 (4) (2015)
Hugo Nobrega, Arno Pauly
Game characterizations and lower cones in the Weihrauch degrees. CoRR (2015)
Vasco Brattka, Akitoshi Kawamura, Alberto Marcone, Arno Pauly
Measuring the Complexity of Computational Content (Dagstuhl Seminar 15392). Dagstuhl Reports 5 (9) (2015)
Xiang Jiang, Arno Pauly
Efficient Decomposition of Bimatrix Games (Extended Abstract). SR (2014)
Stéphane Le Roux, Arno Pauly
Infinite sequential games with real-valued payoffs. CoRR (2014)
Stéphane Le Roux, Arno Pauly
Infinite sequential games with real-valued payoffs. CSL-LICS (2014)
Arno Pauly, Willem L. Fouché
How constructive is constructing measures? CoRR (2014)
Stéphane Le Roux, Arno Pauly
Weihrauch degrees of finding equilibria in sequential games. CoRR (2014)
Akitoshi Kawamura, Arno Pauly
On function spaces and polynomial-time computability. CoRR (2014)
Takayuki Kihara, Arno Pauly
Point degree spectra of represented spaces. CoRR (2014)
Arno Pauly
The descriptive theory of represented spaces. CoRR (2014)

Arno Pauly.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Arno Pauly