Arno Pauly - RankMe

131 papers A* 1A 1B 7C 20Misc 1Journal 90Unranked 10

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