Arno Pauly

Cécilia Pradic

CoRR, 2024

Sequential discontinuity and first-order problems.

[BibT_eX]

[DOI]

Giovanni Solda

CoRR, 2024

The weakness of finding descending sequences in ill-founded linear orders.

[BibT_eX]

[DOI]

Jun Le Goh

Manlio Valenti

CoRR, 2024

2023

Minimal covers in the Weihrauch degrees.

[BibT_eX]

[DOI]

Steffen Lempp

Joseph S. Miller

Mariya Ivanova Soskova

Manlio Valenti

CoRR, 2023

Embeddability of graphs and Weihrauch degrees.

[BibT_eX]

[DOI]

Vittorio Cipriani

CoRR, 2023

On the Weihrauch degree of the additive Ramsey theorem.

[BibT_eX]

[DOI]

Cécilia Pradic

Giovanni Solda

CoRR, 2023

De Groot Duality for Represented Spaces.

[BibT_eX]

[DOI]

Proceedings of the Unity of Logic and Computation, 2023

The Complexity of Finding Supergraphs.

[BibT_eX]

[DOI]

Vittorio Cipriani

Proceedings of the Unity of Logic and Computation, 2023

2022

Luzin's (n) and Randomness Reflection.

[BibT_eX]

[DOI]

Linda Westrick

Liang Yu

J. Symb. Log., 2022

A Computability Perspective on (Verified) Machine Learning.

[BibT_eX]

[DOI]

Proceedings of the Recent Trends in Algebraic Development Techniques, 2022

2021

Finding descending sequences through ill-Founded linear Orders.

[BibT_eX]

[DOI]

Jun Le Goh

Manlio Valenti

J. Symb. Log., 2021

Equilibria in multi-player multi-outcome infinite sequential games.

[BibT_eX]

[DOI]

Inf. Comput., 2021

On the existence of weak subgame perfect equilibria.

[BibT_eX]

[DOI]

Inf. Comput., 2021

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

[BibT_eX]

[DOI]

Mathieu Hoyrup

Victor L. Selivanov

Mariya Ivanova Soskova

Dagstuhl Reports, 2021

The Weihrauch degree of finding Nash equilibria in multiplayer games.

[BibT_eX]

[DOI]

Tonicha Crook

CoRR, 2021

Adaptive Neighbourhoods for the Discovery of Adversarial Examples.

[BibT_eX]

[DOI]

CoRR, 2021

Computing Measure as a Primitive Operation in Real Number Computation.

[BibT_eX]

[DOI]

Christine Gaßner

Florian Steinberg

Proceedings of the 29th EACSL Annual Conference on Computer Science Logic, 2021

2020

Searching for an analogue of Atr0 in the Weihrauch Lattice.

[BibT_eX]

[DOI]

Alberto Marcone

J. Symb. Log., 2020

A Semi-Potential for Finite and Infinite Games in Extensive Form.

[BibT_eX]

[DOI]

Dyn. Games Appl., 2020

An update on Weihrauch complexity, and some open questions.

[BibT_eX]

[DOI]

CoRR, 2020

Ramsey's theorem and products in the Weihrauch degrees.

[BibT_eX]

[DOI]

Comput., 2020

Combinatorial principles equivalent to weak induction.

[BibT_eX]

[DOI]

Comput., 2020

Overt choice.

[BibT_eX]

[DOI]

Matthew de Brecht

Matthias Schröder

Comput., 2020

Dagstuhl Seminar on Measuring the Complexity of Computational Content 2018.

[BibT_eX]

[DOI]

Comput., 2020

Computing Haar Measures.

[BibT_eX]

[DOI]

Dongseong Seon

Martin Ziegler

Proceedings of the 28th EACSL Annual Conference on Computer Science Logic, 2020

2019

Game characterizations and lower cones in the Weihrauch degrees.

[BibT_eX]

[DOI]

Hugo Nobrega

Log. Methods Comput. Sci., 2019

Connected choice and the Brouwer fixed point theorem.

[BibT_eX]

[DOI]

J. Math. Log., 2019

Convex choice, finite choice and sorting.

[BibT_eX]

[DOI]

CoRR, 2019

Enumeration degrees and non-metrizable topology.

[BibT_eX]

[DOI]

Keng Meng Ng

CoRR, 2019

Effective local compactness and the hyperspace of located sets.

[BibT_eX]

[DOI]

CoRR, 2019

Computability Aspects of Differential Games in Euclidian Spaces.

[BibT_eX]

[DOI]

Gafurjan I. Ibragimov

Bakh Khoussainov

CoRR, 2019

Projection operators in the Weihrauch lattice.

[BibT_eX]

[DOI]

Guido Gherardi

Alberto Marcone

Comput., 2019

Finite Choice, Convex Choice and Sorting.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2019

Continuous Team Semantics.

[BibT_eX]

[DOI]

Åsa Hirvonen

Juha Kontinen

Proceedings of the Theory and Applications of Models of Computation, 2019

2018

Minkowski Games.

[BibT_eX]

[DOI]

Jean-François Raskin

ACM Trans. Comput. Log., 2018

Mean-payoff games with partial observation.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2018

Comparing Representations for Function Spaces in Computable Analysis.

[BibT_eX]

[DOI]

Florian Steinberg

Theory Comput. Syst., 2018

Weihrauch-completeness for layerwise computability.

[BibT_eX]

[DOI]

Willem L. Fouché

George Davie

Log. Methods Comput. Sci., 2018

On the algebraic structure of Weihrauch degrees.

[BibT_eX]

[DOI]

Vasco Brattka

Log. Methods Comput. Sci., 2018

A topological view on algebraic computation models.

[BibT_eX]

[DOI]

Eike Neumann

J. Complex., 2018

Extending finite-memory determinacy to multi-player games.

[BibT_eX]

[DOI]

Inf. Comput., 2018

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

[BibT_eX]

[DOI]

Dagstuhl Reports, 2018

Searching for an analogue of ATR in the Weihrauch lattice.

[BibT_eX]

[DOI]

Alberto Marcone

CoRR, 2018

Parameterized Games and Parameterized Automata.

[BibT_eX]

[DOI]

Proceedings of the Proceedings Ninth International Symposium on Games, 2018

Extending Finite-Memory Determinacy by Boolean Combination of Winning Conditions.

[BibT_eX]

[DOI]

Mickael Randour

Proceedings of the 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2018

Beyond Admissibility: Dominance Between Chains of Strategies.

[BibT_eX]

[DOI]

Marie van den Bogaard

Proceedings of the 27th EACSL Annual Conference on Computer Science Logic, 2018

Enumeration Degrees and Topology.

[BibT_eX]

[DOI]

Proceedings of the Sailing Routes in the World of Computation, 2018

2017

Many-one reductions and the category of multivalued functions.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2017

Preface to the special issue: Continuity, computability, constructivity: from logic to algorithms 2013.

[BibT_eX]

[DOI]

Hajime Ishihara

Margarita V. Korovina

Monika Seisenberger

Dieter Spreen

Math. Struct. Comput. Sci., 2017

A comparison of concepts from computable analysis and effective descriptive set theory.

[BibT_eX]

[DOI]

Vassilios Gregoriades

Tamás Kispéter

Math. Struct. Comput. Sci., 2017

How constructive is constructing measures?

[BibT_eX]

[DOI]

Willem L. Fouché

J. Log. Anal., 2017

Weihrauch Complexity in Computable Analysis.

[BibT_eX]

[DOI]

Vasco Brattka

Guido Gherardi

CoRR, 2017

Noetherian Quasi-Polish spaces.

[BibT_eX]

[DOI]

Matthew de Brecht

Proceedings of the 26th EACSL Annual Conference on Computer Science Logic, 2017

Admissibility in Games with Imperfect Information (Invited Talk).

[BibT_eX]

[DOI]

Proceedings of the 28th International Conference on Concurrency Theory, 2017

The Vitali Covering Theorem in the Weihrauch Lattice.

[BibT_eX]

[DOI]

Proceedings of the Computability and Complexity, 2017

2016

The Computational Complexity of Iterated Elimination of Dominated Strategies.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2016

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

[BibT_eX]

[DOI]

Hideki Tsuiki

CoRR, 2016

A Semi-Potential for Finite and Infinite Sequential Games (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Seventh International Symposium on Games, 2016

Extending Finite Memory Determinacy to Multiplayer Games.

[BibT_eX]

[DOI]

Proceedings of the 4th International Workshop on Strategic Reasoning, 2016

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

[BibT_eX]

[DOI]

CoRR, 2016

On the topological aspects of the theory of represented spaces.

[BibT_eX]

[DOI]

Comput., 2016

Dividing by Zero - How Bad Is It, Really?.

[BibT_eX]

[DOI]

Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

Representations of Analytic Functions and Weihrauch Degrees.

[BibT_eX]

[DOI]

Florian Steinberg

Proceedings of the Computer Science - Theory and Applications, 2016

The Brouwer Fixed Point Theorem Revisited.

[BibT_eX]

[DOI]

Proceedings of the Pursuit of the Universal - 12th Conference on Computability in Europe, 2016

2015

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

[BibT_eX]

[DOI]

Dagstuhl Reports, 2015

Closed choice: Cardinality vs convex dimension

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2015

Computability on the countable ordinals and the Hausdorff-Kuratowski theorem.

[BibT_eX]

[DOI]

CoRR, 2015

Computability on the Countable Ordinals and the Hausdorff-Kuratowski Theorem (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2015, 2015

Descriptive Set Theory in the Category of Represented Spaces.

[BibT_eX]

[DOI]

Matthew de Brecht

Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015

Weihrauch Degrees of Finding Equilibria in Sequential Games.

[BibT_eX]

[DOI]

Proceedings of the Evolving Computability - 11th Conference on Computability in Europe, 2015

2014

The descriptive theory of represented spaces.

[BibT_eX]

[DOI]

CoRR, 2014

Point degree spectra of represented spaces.

[BibT_eX]

[DOI]

CoRR, 2014

On function spaces and polynomial-time computability.

[BibT_eX]

[DOI]

Akitoshi Kawamura

CoRR, 2014

Efficient Decomposition of Bimatrix Games (Extended Abstract).

[BibT_eX]

[DOI]

Xiang Jiang

Proceedings of the Proceedings 2nd International Workshop on Strategic Reasoning, 2014

Infinite sequential games with real-valued payoffs.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Akitoshi Kawamura

Proceedings of the Language, Life, Limits - 10th Conference on Computability in Europe, 2014

2013

Relative computability and uniform continuity of relations.

[BibT_eX]

[DOI]