| Publication | Date of Publication | Type |
|---|
| Computing measure as a primitive operation in real number computation | 2026-03-23 | Paper |
| Computably discrete represented spaces | 2025-11-19 | Paper |
| Represented spaces of represented spaces | 2025-11-19 | Paper |
On the Weihrauch degree of the additive Ramsey theorem
Computability | 2025-03-03 | Paper |
| Sequential discontinuity and first-order problems | 2025-02-07 | Paper |
| The weakness of finding descending sequences in ill-founded linear orders | 2025-02-07 | Paper |
Minimal covers in the Weihrauch degrees
Proceedings of the American Mathematical Society | 2024-10-18 | Paper |
| A computability perspective on (verified) machine learning | 2024-06-26 | Paper |
De groot duality for represented spaces
Lecture Notes in Computer Science | 2024-01-12 | Paper |
The complexity of finding supergraphs
Lecture Notes in Computer Science | 2024-01-12 | Paper |
| Minimal covers in the Weihrauch degrees | 2023-11-21 | Paper |
Computing Haar Measures
(available as arXiv preprint) | 2023-02-07 | Paper |
| On the Weihrauch degree of the additive Ramsey theorem | 2023-01-07 | Paper |
Extending Finite-Memory Determinacy by Boolean Combination of Winning Conditions
(available as arXiv preprint) | 2022-07-21 | Paper |
LUZIN’S (N) AND RANDOMNESS REFLECTION
Journal of Symbolic Logic | 2022-06-15 | Paper |
LUZIN’S (N) AND RANDOMNESS REFLECTION
Journal of Symbolic Logic | 2022-06-15 | Paper |
Point Degree Spectra of Represented Spaces
Forum of Mathematics, Sigma | 2022-06-07 | Paper |
scientific article; zbMATH DE number 7533335 (Why is no real title available?)
(available as arXiv preprint) | 2022-05-28 | Paper |
Weihrauch Complexity in Computable Analysis
Theory and Applications of Computability | 2022-01-26 | Paper |
| scientific article; zbMATH DE number 7447732 (Why is no real title available?) | 2021-12-17 | Paper |
scientific article; zbMATH DE number 7447732 (Why is no real title available?)
(available as arXiv preprint) | 2021-12-17 | Paper |
| A semi-potential for finite and infinite sequential games (extended abstract) | 2021-12-07 | Paper |
A semi-potential for finite and infinite sequential games (extended abstract)
(available as arXiv preprint) | 2021-12-07 | Paper |
FINDING DESCENDING SEQUENCES THROUGH ILL-FOUNDED LINEAR ORDERS
Journal of Symbolic Logic | 2021-10-27 | Paper |
| Non-deterministic computation and the Jayne-Rogers theorem | 2021-06-22 | Paper |
Non-deterministic computation and the Jayne-Rogers theorem
(available as arXiv preprint) | 2021-06-22 | Paper |
| Efficient decomposition of bimatrix games (extended abstract) | 2021-06-22 | Paper |
Efficient decomposition of bimatrix games (extended abstract)
(available as arXiv preprint) | 2021-06-22 | Paper |
Searching for an analogue of \(\text{ATR}_0\) in the Weihrauch lattice
Journal of Symbolic Logic | 2021-03-19 | Paper |
| scientific article; zbMATH DE number 7311152 (Why is no real title available?) | 2021-02-16 | Paper |
Equilibria in multi-player multi-outcome infinite sequential games
Information and Computation | 2021-02-08 | Paper |
On the existence of weak subgame perfect equilibria
Information and Computation | 2021-02-08 | Paper |
Ramsey's theorem and products in the Weihrauch degrees
Computability | 2020-11-09 | Paper |
Overt choice
Computability | 2020-11-09 | Paper |
Combinatorial principles equivalent to weak induction
Computability | 2020-11-09 | Paper |
| An update on Weihrauch complexity, and some open questions | 2020-08-25 | Paper |
Luzin's (N) and randomness reflection
(available as arXiv preprint) | 2020-06-12 | Paper |
Noetherian quasi-Polish spaces
(available as arXiv preprint) | 2020-05-26 | Paper |
A semi-potential for finite and infinite games in extensive form
Dynamic Games and Applications | 2020-04-29 | Paper |
Projection operators in the Weihrauch lattice
Computability | 2020-01-17 | Paper |
| Finite choice, convex choice and sorting | 2019-10-15 | Paper |
| Continuous team semantics | 2019-10-15 | Paper |
Game characterizations and lower cones in the Weihrauch degrees
(available as arXiv preprint) | 2019-08-13 | Paper |
Connected choice and the Brouwer fixed point theorem
Journal of Mathematical Logic | 2019-07-08 | Paper |
| Convex choice, finite choice and sorting | 2019-05-01 | Paper |
| Enumeration degrees and non-metrizable topology | 2019-04-08 | Paper |
| Effective local compactness and the hyperspace of located sets | 2019-03-13 | Paper |
On the algebraic structure of Weihrauch degrees
(available as arXiv preprint) | 2018-11-02 | Paper |
Minkowski games
ACM Transactions on Computational Logic | 2018-10-24 | Paper |
| Enumeration degrees and topology | 2018-09-06 | Paper |
Extending finite-memory determinacy to multi-player games
Information and Computation | 2018-06-14 | Paper |
Extending finite-memory determinacy to multi-player games
Information and Computation | 2018-06-14 | Paper |
Mean-payoff games with partial observation
Theoretical Computer Science | 2018-06-05 | Paper |
Comparing representations for function spaces in computable analysis
Theory of Computing Systems | 2018-06-01 | Paper |
Weihrauch-completeness for layerwise computability
(available as arXiv preprint) | 2018-05-30 | Paper |
Descriptive set theory in the category of represented spaces
2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science | 2018-04-23 | Paper |
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) | 2018-04-23 | Paper |
scientific article; zbMATH DE number 6862142 (Why is no real title available?)
(available as arXiv preprint) | 2018-04-19 | Paper |
Dividing by zero -- how bad is it, really?
(available as arXiv preprint) | 2018-03-21 | Paper |
A comparison of concepts from computable analysis and effective descriptive set theory
Mathematical Structures in Computer Science | 2017-11-22 | Paper |
A topological view on algebraic computation models
Journal of Complexity | 2017-11-21 | Paper |
A topological view on algebraic computation models
Journal of Complexity | 2017-11-21 | Paper |
| Game characterizations and lower cones in the Weihrauch degrees | 2017-08-04 | Paper |
On the existence of weak subgame perfect equilibria
Lecture Notes in Computer Science | 2017-05-19 | Paper |
How constructive is constructing measures?
Journal of Logic and Analysis | 2017-05-18 | Paper |
The Vitali Covering Theorem in the Weihrauch Lattice
Computability and Complexity | 2017-04-04 | Paper |
The Vitali Covering Theorem in the Weihrauch Lattice
Computability and Complexity | 2017-04-04 | Paper |
Many-one reductions and the category of multivalued functions
Mathematical Structures in Computer Science | 2017-04-03 | Paper |
The computational complexity of iterated elimination of dominated strategies
Theory of Computing Systems | 2016-09-21 | Paper |
The Brouwer fixed point theorem revisited
Pursuit of the Universal | 2016-08-17 | Paper |
Representations of analytic functions and Weihrauch degrees
Computer Science – Theory and Applications | 2016-07-25 | Paper |
On the topological aspects of the theory of represented spaces
Computability | 2016-07-25 | Paper |
Finite choice, convex choice and finding roots
Logical Methods in Computer Science | 2016-01-07 | Paper |
Weihrauch degrees of finding equilibria in sequential games
Evolving Computability | 2015-10-20 | Paper |
Weihrauch degrees of finding equilibria in sequential games
Evolving Computability | 2015-10-20 | Paper |
Computability on the countable ordinals and the Hausdorff-Kuratowski theorem (extended abstract)
Mathematical Foundations of Computer Science 2015 | 2015-09-16 | Paper |
Computability on the countable ordinals and the Hausdorff-Kuratowski theorem (extended abstract)
Mathematical Foundations of Computer Science 2015 | 2015-09-16 | Paper |
Function spaces for second-order polynomial time
Language, Life, Limits | 2015-02-25 | Paper |
Function spaces for second-order polynomial time
Language, Life, Limits | 2015-02-25 | Paper |
Relative computability and uniform continuity of relations
Journal of Logic and Analysis | 2014-11-20 | Paper |
Point degree spectra of represented spaces
(available as arXiv preprint) | 2014-05-27 | Paper |
Closed choice for finite and for convex sets
Lecture Notes in Computer Science | 2013-08-05 | Paper |
| Towards Synthetic Descriptive Set Theory: An instantiation with represented spaces | 2013-07-07 | Paper |
The degree structure of Weihrauch-reducibility
Logical Methods in Computer Science | 2013-06-20 | Paper |
| How discontinuous is computing Nash equilibria? (Extended abstract) | 2012-09-28 | Paper |
On the computational content of the Brouwer fixed point theorem
Lecture Notes in Computer Science | 2012-08-14 | Paper |
Multi-valued functions in computability theory
Lecture Notes in Computer Science | 2012-08-14 | Paper |
Closed choice and a uniform low basis theorem
Annals of Pure and Applied Logic | 2012-06-01 | Paper |
| How incomputable is finding Nash equilibria? | 2011-02-10 | Paper |
On the (semi)lattices induced by continuous reducibilities
Mathematical Logic Quarterly | 2010-11-04 | Paper |
| How does universality of coproducts depend on the cardinality? | 2010-07-27 | Paper |
| Representing measurement results | 2009-10-28 | Paper |
Surfaces consisting of umbilic points
Elemente der Mathematik | 2008-09-08 | Paper |
Embeddability of graphs and Weihrauch degrees
(available as arXiv preprint) | N/A | Paper |
The weakness of finding descending sequences in ill-founded linear orders
(available as arXiv preprint) | N/A | Paper |
Sequential discontinuity and first-order problems
(available as arXiv preprint) | N/A | Paper |
The equational theory of the Weihrauch lattice with multiplication
(available as arXiv preprint) | N/A | Paper |
