Arno Pauly

Orcid: 0000-0002-0173-3295

Affiliations:
  • Swansea University, Department of Computer Science, UK
  • Université Libre de Bruxelles (ULB), Computer Science Department, Brussels, Belgium
  • University of Cambridge, UK (PhD 2012)


According to our database1, Arno Pauly authored at least 97 papers between 2009 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
More on the indivisibility of Q.
CoRR, 2024

The equational theory of the Weihrauch lattice with multiplication.
CoRR, 2024

Sequential Discontinuity and First-Order Problems.
Proceedings of the Twenty Years of Theoretical and Practical Synergies, 2024

The Weakness of Finding Descending Sequences in Ill-Founded Linear Orders.
Proceedings of the Twenty Years of Theoretical and Practical Synergies, 2024

2023
Minimal covers in the Weihrauch degrees.
CoRR, 2023

Embeddability of graphs and Weihrauch degrees.
CoRR, 2023

On the Weihrauch degree of the additive Ramsey theorem.
CoRR, 2023

De Groot Duality for Represented Spaces.
Proceedings of the Unity of Logic and Computation, 2023

The Complexity of Finding Supergraphs.
Proceedings of the Unity of Logic and Computation, 2023

2022
Luzin's (n) and Randomness Reflection.
J. Symb. Log., 2022

A Computability Perspective on (Verified) Machine Learning.
Proceedings of the Recent Trends in Algebraic Development Techniques, 2022

2021
Finding descending sequences through ill-Founded linear Orders.
J. Symb. Log., 2021

Equilibria in multi-player multi-outcome infinite sequential games.
Inf. Comput., 2021

On the existence of weak subgame perfect equilibria.
Inf. Comput., 2021

Descriptive Set Theory and Computable Topology (Dagstuhl Seminar 21461).
Dagstuhl Reports, 2021

The Weihrauch degree of finding Nash equilibria in multiplayer games.
CoRR, 2021

Adaptive Neighbourhoods for the Discovery of Adversarial Examples.
CoRR, 2021

Computing Measure as a Primitive Operation in Real Number Computation.
Proceedings of the 29th EACSL Annual Conference on Computer Science Logic, 2021

2020
Searching for an analogue of Atr0 in the Weihrauch Lattice.
J. Symb. Log., 2020

A Semi-Potential for Finite and Infinite Games in Extensive Form.
Dyn. Games Appl., 2020

An update on Weihrauch complexity, and some open questions.
CoRR, 2020

Ramsey's theorem and products in the Weihrauch degrees.
Comput., 2020

Combinatorial principles equivalent to weak induction.
Comput., 2020

Overt choice.
Comput., 2020

Dagstuhl Seminar on Measuring the Complexity of Computational Content 2018.
Comput., 2020

Computing Haar Measures.
Proceedings of the 28th EACSL Annual Conference on Computer Science Logic, 2020

2019
Game characterizations and lower cones in the Weihrauch degrees.
Log. Methods Comput. Sci., 2019

Connected choice and the Brouwer fixed point theorem.
J. Math. Log., 2019

Convex choice, finite choice and sorting.
CoRR, 2019

Enumeration degrees and non-metrizable topology.
CoRR, 2019

Effective local compactness and the hyperspace of located sets.
CoRR, 2019

Computability Aspects of Differential Games in Euclidian Spaces.
CoRR, 2019

Projection operators in the Weihrauch lattice.
Comput., 2019

Finite Choice, Convex Choice and Sorting.
Proceedings of the Theory and Applications of Models of Computation, 2019

Continuous Team Semantics.
Proceedings of the Theory and Applications of Models of Computation, 2019

2018
Minkowski Games.
ACM Trans. Comput. Log., 2018

Mean-payoff games with partial observation.
Theor. Comput. Sci., 2018

Comparing Representations for Function Spaces in Computable Analysis.
Theory Comput. Syst., 2018

Weihrauch-completeness for layerwise computability.
Log. Methods Comput. Sci., 2018

On the algebraic structure of Weihrauch degrees.
Log. Methods Comput. Sci., 2018

A topological view on algebraic computation models.
J. Complex., 2018

Extending finite-memory determinacy to multi-player games.
Inf. Comput., 2018

Measuring the Complexity of Computational Content: From Combinatorial Problems to Analysis (Dagstuhl Seminar 18361).
Dagstuhl Reports, 2018

Searching for an analogue of ATR in the Weihrauch lattice.
CoRR, 2018

Parameterized Games and Parameterized Automata.
Proceedings of the Proceedings Ninth International Symposium on Games, 2018

Extending Finite-Memory Determinacy by Boolean Combination of Winning Conditions.
Proceedings of the 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2018

Beyond Admissibility: Dominance Between Chains of Strategies.
Proceedings of the 27th EACSL Annual Conference on Computer Science Logic, 2018

Enumeration Degrees and Topology.
Proceedings of the Sailing Routes in the World of Computation, 2018

2017
Many-one reductions and the category of multivalued functions.
Math. Struct. Comput. Sci., 2017

Preface to the special issue: Continuity, computability, constructivity: from logic to algorithms 2013.
Math. Struct. Comput. Sci., 2017

A comparison of concepts from computable analysis and effective descriptive set theory.
Math. Struct. Comput. Sci., 2017

How constructive is constructing measures?
J. Log. Anal., 2017

Weihrauch Complexity in Computable Analysis.
CoRR, 2017

Noetherian Quasi-Polish spaces.
Proceedings of the 26th EACSL Annual Conference on Computer Science Logic, 2017

Admissibility in Games with Imperfect Information (Invited Talk).
Proceedings of the 28th International Conference on Concurrency Theory, 2017

The Vitali Covering Theorem in the Weihrauch Lattice.
Proceedings of the Computability and Complexity, 2017

2016
The Computational Complexity of Iterated Elimination of Dominated Strategies.
Theory Comput. Syst., 2016

T<sup>ω</sup>-representations of compact sets.
CoRR, 2016

A Semi-Potential for Finite and Infinite Sequential Games (Extended Abstract).
Proceedings of the Seventh International Symposium on Games, 2016

Extending Finite Memory Determinacy to Multiplayer Games.
Proceedings of the 4th International Workshop on Strategic Reasoning, 2016

Extending finite memory determinacy: General techniques and an application to energy parity games.
CoRR, 2016

On the topological aspects of the theory of represented spaces.
Comput., 2016

Dividing by Zero - How Bad Is It, Really?.
Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

Representations of Analytic Functions and Weihrauch Degrees.
Proceedings of the Computer Science - Theory and Applications, 2016

The Brouwer Fixed Point Theorem Revisited.
Proceedings of the Pursuit of the Universal - 12th Conference on Computability in Europe, 2016

2015
Measuring the Complexity of Computational Content (Dagstuhl Seminar 15392).
Dagstuhl Reports, 2015

Closed choice: Cardinality vs convex dimension
Log. Methods Comput. Sci., 2015

Computability on the countable ordinals and the Hausdorff-Kuratowski theorem.
CoRR, 2015

Computability on the Countable Ordinals and the Hausdorff-Kuratowski Theorem (Extended Abstract).
Proceedings of the Mathematical Foundations of Computer Science 2015, 2015

Descriptive Set Theory in the Category of Represented Spaces.
Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015

Weihrauch Degrees of Finding Equilibria in Sequential Games.
Proceedings of the Evolving Computability - 11th Conference on Computability in Europe, 2015

2014
The descriptive theory of represented spaces.
CoRR, 2014

Point degree spectra of represented spaces.
CoRR, 2014

On function spaces and polynomial-time computability.
CoRR, 2014

Efficient Decomposition of Bimatrix Games (Extended Abstract).
Proceedings of the Proceedings 2nd International Workshop on Strategic Reasoning, 2014

Infinite sequential games with real-valued payoffs.
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2014

Function Spaces for Second-Order Polynomial Time.
Proceedings of the Language, Life, Limits - 10th Conference on Computability in Europe, 2014

2013
Relative computability and uniform continuity of relations.
J. Log. Anal., 2013

Towards Synthetic Descriptive Set Theory: An instantiation with represented spaces.
CoRR, 2013

Closed Choice for Finite and for Convex Sets.
Proceedings of the Nature of Computation. Logic, Algorithms, Applications, 2013

2012
Computable metamathematics and its application to game theory.
PhD thesis, 2012

Efficient Decomposition of Bimatrix Games
CoRR, 2012

Connected Choice and the Brouwer Fixed Point Theorem
CoRR, 2012

Non-deterministic computation and the Jayne-Rogers Theorem.
Proceedings of the Proceedings 8th International Workshop on Developments in Computational Models, 2012

Closed choice and a Uniform Low Basis Theorem.
Ann. Pure Appl. Log., 2012

Multi-valued Functions in Computability Theory.
Proceedings of the How the World Computes, 2012

On the Computational Content of the Brouwer Fixed Point Theorem.
Proceedings of the How the World Computes, 2012

2011
Many-one reductions between search problems
CoRR, 2011

The degree structure of Weihrauch-reducibility
Log. Methods Comput. Sci., 2011

2010
On the (semi)lattices induced by continuous reducibilities.
Math. Log. Q., 2010

How Incomputable is Finding Nash Equilibria?
J. Univers. Comput. Sci., 2010

Computation with Advice
Proceedings of the Proceedings Seventh International Conference on Computability and Complexity in Analysis, 2010

2009
Representing Measurement Results.
J. Univers. Comput. Sci., 2009

The Complexity of Iterated Strategy Elimination
CoRR, 2009

Infinite Oracle Queries in Type-2 Machines (Extended Abstract)
CoRR, 2009

How discontinuous is Computing Nash Equilibria?
CoRR, 2009

How Discontinuous is Computing Nash Equilibria? (Extended Abstract).
Proceedings of the Sixth International Conference on Computability and Complexity in Analysis, 2009


  Loading...