default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArno Pauly
Person information
- affiliation: Swansea University, Department of Computer Science, UK
- affiliation: Université Libre de Bruxelles (ULB), Computer Science Department, Brussels, Belgium
- affiliation (PhD 2012): University of Cambridge, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j34]Arno Pauly, Cécilia Pradic, Giovanni Soldà:
On the Weihrauch degree of the additive Ramsey theorem. Comput. 13(3-4): 459-483 (2024)- [c36]Jun Le Goh
, Arno Pauly, Manlio Valenti:
The Weakness of Finding Descending Sequences in Ill-Founded Linear Orders. CiE 2024: 339-350 - [c35]Arno Pauly, Giovanni Soldà:
Sequential Discontinuity and First-Order Problems. CiE 2024: 351-365 - [i54]Jun Le Goh, Arno Pauly, Manlio Valenti:
The weakness of finding descending sequences in ill-founded linear orders. CoRR abs/2401.11807 (2024) - [i53]Arno Pauly, Giovanni Soldà:
Sequential discontinuity and first-order problems. CoRR abs/2401.12641 (2024) - [i52]Eike Neumann, Arno Pauly, Cécilia Pradic:
The equational theory of the Weihrauch lattice with multiplication. CoRR abs/2403.13975 (2024) - [i51]Arno Pauly:
More on the indivisibility of Q. CoRR abs/2407.03722 (2024) - 2023
- [c34]Takayuki Kihara, Arno Pauly:
De Groot Duality for Represented Spaces. CiE 2023: 89-101 - [c33]Vittorio Cipriani, Arno Pauly:
The Complexity of Finding Supergraphs. CiE 2023: 178-189 - [i50]Arno Pauly, Cécilia Pradic, Giovanni Soldà:
On the Weihrauch degree of the additive Ramsey theorem. CoRR abs/2301.02833 (2023) - [i49]Vittorio Cipriani, Arno Pauly:
Embeddability of graphs and Weihrauch degrees. CoRR abs/2305.00935 (2023) - [i48]Steffen Lempp, Joseph S. Miller, Arno Pauly, Mariya Ivanova Soskova, Manlio Valenti:
Minimal covers in the Weihrauch degrees. CoRR abs/2311.12676 (2023) - 2022
- [j33]Arno Pauly, Linda Westrick, Liang Yu:
Luzin's (n) and Randomness Reflection. J. Symb. Log. 87(2): 802-828 (2022) - [c32]Tonicha Crook, Jay Paul Morgan, Arno Pauly, Markus Roggenbach:
A Computability Perspective on (Verified) Machine Learning. WADT 2022: 63-80 - [e2]Ulrich Berger, Johanna N. Y. Franklin, Florin Manea, Arno Pauly:
Revolutions and Revelations in Computability - 18th Conference on Computability in Europe, CiE 2022, Swansea, UK, July 11-15, 2022, Proceedings. Lecture Notes in Computer Science 13359, Springer 2022, ISBN 978-3-031-08739-4 [contents] - 2021
- [j32]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: 104553 (2021) - [j31]Stéphane Le Roux, Arno Pauly:
Equilibria in multi-player multi-outcome infinite sequential games. Inf. Comput. 276: 104557 (2021) - [j30]Jun Le Goh, Arno Pauly, Manlio Valenti:
Finding descending sequences through ill-Founded linear Orders. J. Symb. Log. 86(2): 817-854 (2021) - [c31]Christine Gaßner, Arno Pauly, Florian Steinberg:
Computing Measure as a Primitive Operation in Real Number Computation. CSL 2021: 22:1-22:22 - [i47]Jay Paul Morgan, Adeline Paiement, Arno Pauly, Monika Seisenberger:
Adaptive Neighbourhoods for the Discovery of Adversarial Examples. CoRR abs/2101.09108 (2021) - [i46]Tonicha Crook, Jay Paul Morgan, Arno Pauly, Markus Roggenbach:
A Computability Perspective on (Verified) Machine Learning. CoRR abs/2102.06585 (2021) - [i45]Tonicha Crook, Arno Pauly:
The Weihrauch degree of finding Nash equilibria in multiplayer games. CoRR abs/2109.00972 (2021) - [i44]Mathieu Hoyrup, Arno Pauly, Victor L. Selivanov, Mariya Ivanova Soskova:
Descriptive Set Theory and Computable Topology (Dagstuhl Seminar 21461). Dagstuhl Reports 11(10): 72-93 (2021) - 2020
- [j29]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): 85-110 (2020) - [j28]Vasco Brattka, Damir D. Dzhafarov, Alberto Marcone, Arno Pauly:
Dagstuhl Seminar on Measuring the Complexity of Computational Content 2018. Comput. 9(3-4): 167-168 (2020) - [j27]Matthew de Brecht, Arno Pauly, Matthias Schröder:
Overt choice. Comput. 9(3-4): 169-191 (2020) - [j26]Caleb Davis, Denis R. Hirschfeldt, Jeffry L. Hirst, Jake Pardo, Arno Pauly, Keita Yokoyama:
Combinatorial principles equivalent to weak induction. Comput. 9(3-4): 219-229 (2020) - [j25]Stéphane Le Roux, Arno Pauly:
A Semi-Potential for Finite and Infinite Games in Extensive Form. Dyn. Games Appl. 10(1): 120-144 (2020) - [j24]Takayuki Kihara, Alberto Marcone, Arno Pauly:
Searching for an analogue of Atr0 in the Weihrauch Lattice. J. Symb. Log. 85(3): 1006-1043 (2020) - [c30]Arno Pauly, Dongseong Seon, Martin Ziegler:
Computing Haar Measures. CSL 2020: 34:1-34:17 - [e1]Marcella Anselmo, Gianluca Della Vedova, Florin Manea, Arno Pauly:
Beyond the Horizon of Computability - 16th Conference on Computability in Europe, CiE 2020, Fisciano, Italy, June 29 - July 3, 2020, Proceedings. Lecture Notes in Computer Science 12098, Springer 2020, ISBN 978-3-030-51465-5 [contents] - [i43]Arno Pauly:
An update on Weihrauch complexity, and some open questions. CoRR abs/2008.11168 (2020) - [i42]Jun Le Goh, Arno Pauly, Manlio Valenti:
Finding descending sequences through ill-founded linear orders. CoRR abs/2010.03840 (2020)
2010 – 2019
- 2019
- [j23]Guido Gherardi, Alberto Marcone, Arno Pauly:
Projection operators in the Weihrauch lattice. Comput. 8(3-4): 281-304 (2019) - [j22]Vasco Brattka, Stéphane Le Roux, Joseph S. Miller, Arno Pauly:
Connected choice and the Brouwer fixed point theorem. J. Math. Log. 19(1): 1950004:1-1950004:46 (2019) - [j21]Hugo Nobrega, Arno Pauly:
Game characterizations and lower cones in the Weihrauch degrees. Log. Methods Comput. Sci. 15(3) (2019) - [c29]Åsa Hirvonen, Juha Kontinen, Arno Pauly:
Continuous Team Semantics. TAMC 2019: 262-278 - [c28]Takayuki Kihara, Arno Pauly:
Finite Choice, Convex Choice and Sorting. TAMC 2019: 378-393 - [i41]Matthew de Brecht, Arno Pauly, Matthias Schröder:
Overt choice. CoRR abs/1902.05926 (2019) - [i40]Gafurjan I. Ibragimov, Bakh Khoussainov, Arno Pauly:
Computability Aspects of Differential Games in Euclidian Spaces. CoRR abs/1903.00688 (2019) - [i39]Arno Pauly:
Effective local compactness and the hyperspace of located sets. CoRR abs/1903.05490 (2019) - [i38]Takayuki Kihara, Keng Meng Ng, Arno Pauly:
Enumeration degrees and non-metrizable topology. CoRR abs/1904.04107 (2019) - [i37]Takayuki Kihara, Arno Pauly:
Convex choice, finite choice and sorting. CoRR abs/1905.03190 (2019) - [i36]Arno Pauly, Dongseong Seon, Martin Ziegler:
Computing Haar Measures. CoRR abs/1906.12220 (2019) - 2018
- [j20]Stéphane Le Roux, Arno Pauly:
Extending finite-memory determinacy to multi-player games. Inf. Comput. 261: 676-694 (2018) - [j19]Eike Neumann, Arno Pauly:
A topological view on algebraic computation models. J. Complex. 44: 1-22 (2018) - [j18]Arno Pauly, Willem L. Fouché, George Davie:
Weihrauch-completeness for layerwise computability. Log. Methods Comput. Sci. 14(2) (2018) - [j17]Vasco Brattka, Arno Pauly:
On the algebraic structure of Weihrauch degrees. Log. Methods Comput. Sci. 14(4) (2018) - [j16]Arno Pauly, Florian Steinberg:
Comparing Representations for Function Spaces in Computable Analysis. Theory Comput. Syst. 62(3): 557-582 (2018) - [j15]Paul Hunter, Arno Pauly, Guillermo A. Pérez, Jean-François Raskin:
Mean-payoff games with partial observation. Theor. Comput. Sci. 735: 82-110 (2018) - [j14]Stéphane Le Roux, Arno Pauly, Jean-François Raskin:
Minkowski Games. ACM Trans. Comput. Log. 19(3): 20:1-20:29 (2018) - [c27]Arno Pauly:
Enumeration Degrees and Topology. CiE 2018: 328-337 - [c26]Nicolas Basset, Ismaël Jecker, Arno Pauly, Jean-François Raskin, Marie van den Bogaard:
Beyond Admissibility: Dominance Between Chains of Strategies. CSL 2018: 10:1-10:22 - [c25]Stéphane Le Roux, Arno Pauly, Mickael Randour:
Extending Finite-Memory Determinacy by Boolean Combination of Winning Conditions. FSTTCS 2018: 38:1-38:20 - [c24]Arno Pauly:
Parameterized Games and Parameterized Automata. GandALF 2018: 30-42 - [i35]Nicolas Basset, Ismaël Jecker, Arno Pauly, Jean-François Raskin, Marie van den Bogaard:
Beyond admissibility: Dominance between chains of strategies. CoRR abs/1805.11608 (2018) - [i34]Stéphane Le Roux, Arno Pauly, Mickael Randour:
Extending finite-memory determinacy by Boolean combination of winning conditions. CoRR abs/1808.05791 (2018) - [i33]Takayuki Kihara, Alberto Marcone, Arno Pauly:
Searching for an analogue of ATR in the Weihrauch lattice. CoRR abs/1812.01549 (2018) - [i32]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): 1-28 (2018) - 2017
- [j13]Arno Pauly, Willem L. Fouché:
How constructive is constructing measures? J. Log. Anal. 9 (2017) - [j12]Arno Pauly:
Many-one reductions and the category of multivalued functions. Math. Struct. Comput. Sci. 27(3): 376-404 (2017) - [j11]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): 1285-1286 (2017) - [j10]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): 1414-1436 (2017) - [c23]Vasco Brattka, Guido Gherardi, Rupert Hölzl, Arno Pauly:
The Vitali Covering Theorem in the Weihrauch Lattice. Computability and Complexity 2017: 188-200 - [c22]Hugo Nobrega, Arno Pauly:
Game Characterizations and Lower Cones in the Weihrauch Degrees. CiE 2017: 327-337 - [c21]Romain Brenguier, Arno Pauly, Jean-François Raskin, Ocan Sankur:
Admissibility in Games with Imperfect Information (Invited Talk). CONCUR 2017: 2:1-2:23 - [c20]Matthew de Brecht, Arno Pauly:
Noetherian Quasi-Polish spaces. CSL 2017: 16:1-16:17 - [c19]Véronique Bruyère, Stéphane Le Roux, Arno Pauly, Jean-François Raskin:
On the Existence of Weak Subgame Perfect Equilibria. FoSSaCS 2017: 145-161 - [c18]Stéphane Le Roux, Arno Pauly, Jean-François Raskin:
Minkowski Games. STACS 2017: 50:1-50:13 - [i31]Vasco Brattka, Guido Gherardi, Arno Pauly:
Weihrauch Complexity in Computable Analysis. CoRR abs/1707.03202 (2017) - 2016
- [j9]Arno Pauly:
On the topological aspects of the theory of represented spaces. Comput. 5(2): 159-180 (2016) - [j8]Arno Pauly:
The Computational Complexity of Iterated Elimination of Dominated Strategies. Theory Comput. Syst. 59(1): 52-75 (2016) - [c17]Vasco Brattka, Stéphane Le Roux, Joseph S. Miller, Arno Pauly:
The Brouwer Fixed Point Theorem Revisited. CiE 2016: 58-67 - [c16]Arno Pauly, Florian Steinberg:
Representations of Analytic Functions and Weihrauch Degrees. CSR 2016: 367-381 - [c15]Takayuki Kihara, Arno Pauly:
Dividing by Zero - How Bad Is It, Really?. MFCS 2016: 58:1-58:14 - [c14]Stéphane Le Roux, Arno Pauly:
Extending Finite Memory Determinacy to Multiplayer Games. SR 2016: 27-40 - [c13]Stéphane Le Roux, Arno Pauly:
A Semi-Potential for Finite and Infinite Sequential Games (Extended Abstract). GandALF 2016: 242-256 - [i30]Eike Neumann, Arno Pauly:
A topological view on algebraic computation models. CoRR abs/1602.08004 (2016) - [i29]Stéphane Le Roux, Arno Pauly:
Extending finite memory determinacy: General techniques and an application to energy parity games. CoRR abs/1602.08912 (2016) - [i28]Arno Pauly, Hideki Tsuiki:
Tω-representations of compact sets. CoRR abs/1604.00258 (2016) - [i27]Vasco Brattka, Arno Pauly:
On the algebraic structure of Weihrauch degrees. CoRR abs/1604.08348 (2016) - [i26]Vasco Brattka, Guido Gherardi, Rupert Hölzl, Arno Pauly:
The Vitali Covering Theorem in the Weihrauch Lattice. CoRR abs/1605.03354 (2016) - [i25]Takayuki Kihara, Arno Pauly:
Dividing by zero - how bad is it, really? CoRR abs/1606.04126 (2016) - [i24]Matthew de Brecht, Arno Pauly:
Noetherian Quasi-Polish Spaces. CoRR abs/1607.07291 (2016) - [i23]Stéphane Le Roux, Arno Pauly, Jean-François Raskin:
Minkowski games. CoRR abs/1609.07048 (2016) - [i22]Véronique Bruyère, Stéphane Le Roux, Arno Pauly, Jean-François Raskin:
On the existence of weak subgame perfect equilibria. CoRR abs/1612.01402 (2016) - 2015
- [j7]Stéphane Le Roux, Arno Pauly:
Closed choice: Cardinality vs convex dimension. Log. Methods Comput. Sci. 11(4) (2015) - [c12]Stéphane Le Roux, Arno Pauly:
Weihrauch Degrees of Finding Equilibria in Sequential Games. CiE 2015: 246-257 - [c11]Arno Pauly, Matthew de Brecht:
Descriptive Set Theory in the Category of Represented Spaces. LICS 2015: 438-449 - [c10]Arno Pauly:
Computability on the Countable Ordinals and the Hausdorff-Kuratowski Theorem (Extended Abstract). MFCS (1) 2015: 407-418 - [i21]Arno Pauly:
Computability on the countable ordinals and the Hausdorff-Kuratowski theorem. CoRR abs/1501.00386 (2015) - [i20]Arno Pauly, George Davie, Willem L. Fouché:
Weihrauch-completeness for layerwise computability. CoRR abs/1505.02091 (2015) - [i19]Hugo Nobrega, Arno Pauly:
Game characterizations and lower cones in the Weihrauch degrees. CoRR abs/1511.03693 (2015) - [i18]Arno Pauly, Florian Steinberg:
Representations of analytic functions and Weihrauch degrees. CoRR abs/1512.03024 (2015) - [i17]Vasco Brattka, Akitoshi Kawamura, Alberto Marcone, Arno Pauly:
Measuring the Complexity of Computational Content (Dagstuhl Seminar 15392). Dagstuhl Reports 5(9): 77-104 (2015) - 2014
- [c9]Akitoshi Kawamura, Arno Pauly:
Function Spaces for Second-Order Polynomial Time. CiE 2014: 245-254 - [c8]Stéphane Le Roux, Arno Pauly:
Infinite sequential games with real-valued payoffs. CSL-LICS 2014: 62:1-62:10 - [c7]Xiang Jiang, Arno Pauly:
Efficient Decomposition of Bimatrix Games (Extended Abstract). SR 2014: 75-81 - [i16]Akitoshi Kawamura, Arno Pauly:
On function spaces and polynomial-time computability. CoRR abs/1401.2861 (2014) - [i15]Stéphane Le Roux, Arno Pauly:
Infinite sequential games with real-valued payoffs. CoRR abs/1401.3325 (2014) - [i14]Vassilios Gregoriades, Tamás Kispéter, Arno Pauly:
A comparison of concepts from computable analysis and effective descriptive set theory. CoRR abs/1403.7997 (2014) - [i13]Takayuki Kihara, Arno Pauly:
Point degree spectra of represented spaces. CoRR abs/1405.6866 (2014) - [i12]Stéphane Le Roux, Arno Pauly:
Weihrauch degrees of finding equilibria in sequential games. CoRR abs/1407.5587 (2014) - [i11]Arno Pauly:
The descriptive theory of represented spaces. CoRR abs/1408.5329 (2014) - [i10]Arno Pauly, Willem L. Fouché:
How constructive is constructing measures? CoRR abs/1409.3428 (2014) - 2013
- [j6]Arno Pauly, Martin Ziegler:
Relative computability and uniform continuity of relations. J. Log. Anal. 5 (2013) - [c6]Stéphane Le Roux, Arno Pauly:
Closed Choice for Finite and for Convex Sets. CiE 2013: 294-305 - [i9]Arno Pauly, Matthew de Brecht:
Towards Synthetic Descriptive Set Theory: An instantiation with represented spaces. CoRR abs/1307.1850 (2013) - 2012
- [b1]Arno Pauly:
Computable metamathematics and its application to game theory. University of Cambridge, UK, 2012 - [j5]Vasco Brattka, Matthew de Brecht, Arno Pauly:
Closed choice and a Uniform Low Basis Theorem. Ann. Pure Appl. Log. 163(8): 986-1008 (2012) - [c5]Vasco Brattka, Stéphane Le Roux, Arno Pauly:
On the Computational Content of the Brouwer Fixed Point Theorem. CiE 2012: 56-67 - [c4]Arno Pauly:
Multi-valued Functions in Computability Theory. CiE 2012: 571-580 - [c3]Arno Pauly, Matthew de Brecht:
Non-deterministic computation and the Jayne-Rogers Theorem. DCM 2012: 87-96 - [i8]Vasco Brattka, Stéphane Le Roux, Arno Pauly:
Connected Choice and the Brouwer Fixed Point Theorem. CoRR abs/1206.4809 (2012) - [i7]Xiang Jiang, Arno Pauly:
Efficient Decomposition of Bimatrix Games. CoRR abs/1212.6355 (2012) - 2011
- [j4]Kojiro Higuchi, Arno Pauly:
The degree structure of Weihrauch-reducibility. Log. Methods Comput. Sci. 9(2) (2011) - [i6]Arno Pauly:
Many-one reductions between search problems. CoRR abs/1102.3151 (2011) - 2010
- [j3]Arno Pauly:
How Incomputable is Finding Nash Equilibria? J. Univers. Comput. Sci. 16(18): 2686-2710 (2010) - [j2]Arno Pauly:
On the (semi)lattices induced by continuous reducibilities. Math. Log. Q. 56(5): 488-502 (2010) - [c2]Vasco Brattka, Arno Pauly:
Computation with Advice. CCA 2010: 41-55 - [i5]Vasco Brattka, Matthew de Brecht, Arno Pauly:
Closed Choice and a Uniform Low Basis Theorem. CoRR abs/1002.2800 (2010)
2000 – 2009
- 2009
- [j1]Arno Pauly:
Representing Measurement Results. J. Univers. Comput. Sci. 15(6): 1280-1300 (2009) - [c1]Arno Pauly:
How Discontinuous is Computing Nash Equilibria? (Extended Abstract). CCA 2009 - [i4]Arno Pauly:
On the (semi)lattices induced by continuous reducibilities. CoRR abs/0903.2177 (2009) - [i3]Arno Pauly:
How discontinuous is Computing Nash Equilibria? CoRR abs/0907.1482 (2009) - [i2]Arno Pauly:
Infinite Oracle Queries in Type-2 Machines (Extended Abstract). CoRR abs/0907.3230 (2009) - [i1]Arno Pauly:
The Complexity of Iterated Strategy Elimination. CoRR abs/0910.5107 (2009)