Articles |

A8. Arno Pauly and Martin Ziegler: "Relative computability
and uniform continuity of relations", Journal of Logic & Analysis 5(7) : 1 - 39, 2013 |

A7. Kojiro Higuchi and Arno Pauly: "The degree structure of Weihrauch-reducibility", Logical Methods in Computer Science 9(2) : 1 - 17, 2013 |

A6. Vasco Brattka, Matthew de Brecht and Arno Pauly: "Closed choice and a uniform low basis theorem", Annals of Pure and Applied Logic 163(8) : 986 - 1008, 2012 |

A5. Reinhard Börger and Arno Pauly: "How does universality of coproducts depend on the cardinality?", Topology Proceedings 37 : 177-180, 2011 |

A4. Arno Pauly: "How Incomputable is Finding Nash Equilibria", Journal
of Universal Computer Science 16(18) : 2686-2710, 2010 |

A3. Arno Pauly: "On the (semi)lattices induced by continuous reducibilities", Mathematical Logic Quarterly, 56(5) : 488-502, 2010 |

A2. Arno Pauly: "Representing Measurement Results", Journal
of Universal Computer Science 15(6) : 1280-1300, 2009 |

A1. Arno Pauly: "Flächen
mit lauter Nabelpunkten", Elemente der Mathematik 63 : 141-144,
2008 |

Fully Refereed Conference Proceedings |

P9: Stephane Le Roux and Arno Pauly: "Infinite sequential games with real-valued payoffs", Proceedings of LiCS 2014, 2014 |

P8: Akitoshi Kawamura and Arno Pauly: "Function Spaces for Second-Order Polynomial Timey" Proceedings of CiE 2014, LNCS 8493, 2014 |

P7: Xiang Jiang and Arno Pauly: "Efficient Decomposition of Bimatrix Games (Extended Abstract)", Proceedings of SR 2014, Electronic Proceedings in Theoretical Computer Science 146, 2014 |

P6: Stephane Le Roux and Arno Pauly: "Closed Choice for Finite and for Convex Sets", Proceedings of CiE 2013, LNCS 7921 : 294-305, 2013 |

P5: Arno Pauly and Matthew de Brecht: "Non-deterministic computation and the Jayne Rogers Theorem", Proceedings of DCM 2012, Electronic Proceedings in Theoretical Computer Science 143, 2014 |

P4: Arno Pauly: "Multi-valued Functions in Computability Theory", Proceedings of CiE 2012, LNCS 7318 : 571-580, 2012 |

P3: Vasco Brattka, Stephane Le Roux and Arno Pauly: "On the Computational Content of the Brouwer Fixed Point Theorem", Proceedings of CiE 2012, LNCS 7318 : 56-67, 2012 |

P2: Vasco Brattka and Arno Pauly: "Computation with Advice", Electronic Proceedings in Theoretical Computer Science 24, June 2010 |

P1: Arno Pauly: "How Discontinuous is Computing Nash Equilibria? (Extended Abstract)" in A. Bauer et al., "6th Int'l Conf. on Computability and Complexity in Analysis", DROPS, Schloss Dagstuhl, 2009 |

Informal Proceedings, Preprints and Technical Reports |

R23: Stephane Le Roux and Arno Pauly: "Weihrauch degrees of finding equilibria in sequential games", arXiv:1407.5587, 2014 |

R22: Takayuki Kihara and Arno Pauly: "Point degree spectra of represented spaces", arXiv:1405.6866, 2014 |

R21: Vassilios Gregoriades, Tamas Kispeter and Arno Pauly: "A comparison of concepts from computable analysis and effective descriptive set theory", arXiv:1401.3325, 2014 |

R20: Stephane Le Roux and Arno Pauly: "Infinite sequential games with real-valued payoffs", arXiv:1401.3325, 2014 |

R19: Akitoshi Kawamura and Arno Pauly: "On function spaces and polynomial-time computability", arXiv:1401.2861, 2014 |

R18: Arno Pauly and Matthew de Brecht: "Towards Synthetic Descriptive Set Theory: An instantiation with represented spaces", arXiv:1307.1850, 2013 |

R17: Stephane Le Roux and Arno Pauly: "Closed choice: Cardinality vs convex dimension", arXiv:1302.0380, 2013 |

R16: Xiang Jiang and Arno Pauly: "Efficient Decomposition of Bimatrix Games", arXiv:1212.6355, 2012 |

R15: Vasco Brattka, Stephane Le Roux and Arno Pauly: "Connected Choice and the Brouwer Fixed Point Theorem", arXiv:1206.4809, 2012 |

R14: Arno Pauly: "A new introduction to the theory of represented spaces", arXiv:1204.3763, 2012 (formerly "Compactness and Separation for Represented Spaces)" |

R13: Arno Pauly: "The structure of Weihrauch degrees", Acts of the programme \Semantics and Syntax", Isaac Newton Institute, Cambridge, 2012 |

R12: Arno Pauly: "Non-determinism in TTE", Preprint-Reihe Mathematik 3, Ernst-Moritz-Arndt-Universität Greifswald, 2011 |

R11: Arno Pauly and Martin Ziegler: "Relative Computability and Uniform Continuity of Relations", arXiv:1105.3050, Mai 2011 |

R10: Arno Pauly: "Many-one reductions between search problems", arXiv:1102.3151, February 2011 |

R9: Kojiro Higuchi and Arno Pauly: "The degree structure of Weihrauch-reducibility", arXiv:1101.0112, January 2011 |

R8: Arno Pauly: "Nash Equilibria and Fixed Points in the BSS-Model", Preprint-Reihe Mathematik 6, Ernst-Moritz-Arndt-Universität Greifswald, February 2010 |

R7: Vasco Brattka, Matthew de Brecht and Arno Pauly: "Closed Choice and a Uniform Low Basis Theorem", arXiv:1002.2800, February 2010 |

R6: Arno Pauly: "The Complexity of Iterated Strategy Elimination", arXiv:0910.5107, October 2009 |

R5: Arno Pauly: "How Discontinuous is Computing Nash Equilibria? (Extended Abstract)" in A. Bauer et al., "Conference on Computability and Complexity in Analysis", Informatik Berichte 353, pages 219 - 230, FernUniversität Hagen, August 2009 |

R4: Arno Pauly: "Infinite Oracle Queries in Type-2 Machines", arXiv:0907.3230, July 2009 |

R3: Arno Pauly: "How discontinuous is Computing Nash Equilibria?", arXiv:0907.1482, July 2009 |

R2: Arno Pauly: "On the (semi)lattices induced by continuous reducibilities", arXiv:0903.2177, March 2009 |

R1: Arno Pauly: "Representing Measurement Results" in V. Brattka et al., "Conference on Computability and Complexity in Analysis", Informatik Berichte 348, pages 187 - 198, FernUniversität Hagen, August 2008 (Newer version: A2) |

Talks |

T43: "Descriptive Set Theory of Represented Spaces (Invited talk)", CCA 2014, Darmstadt, Germany, July 2014 |

T42: "Relative Computability and Uniform Continuity of Non-Extensional (aka Multivalued) 'Functions'", CL&L 2014, Vienna, Austria, July 2014 |

T41: "On function spaces and polynomial-time computability", CiE 2014, Budapest, Hungary, June 2014 |

T40: "Decomposing Bimatrix Games", Strategic Reasoning 2014, Grenoble, France, April 2014, Slides |

T39: "On function spaces and polynomial-time computability", Logik Seminar, Technical University of Darmstadt, March 2014, Slides |

T38: "Vertices and Edges -- Modeling in Computer Science", Raising Aspirations Lecture Series, London, February 2014 |

T37: "Point degree spectra of represented spaces", ARA 2014 South Africa, Pretoria, South Africa, February 2014, Slides |

T36: "From dimension of spaces to degrees of points", Topology Seminar, University of Cape Town, South Africa, January 2014 |

T35: "The Logic of Weihrauch Degrees", BLC 2013, Leeds, UK, September 2013, Slides |

T34: " A duality approach to Descriptive Set Theory", Duality in Computer Science, Dagstuhl Seminar, July 2013, Abstract, Slides |

T33: "Towards Synthetic Descriptive Set Theory: An instantiation with represented spaces", CCA 2013, Nancy, France, July 2013, Slides |

T32: "Closed choice for finite and for convex sets", CiE 2013, Milan, Italy, July 2013, Slides |

T31: "A tutorial on Weihrauch reducibility", CCC 2013, Gregynog, Wales, June 2013, Slides |

T30: "Dimension of sets and the difficulty of finding points", Kyoto University, Japan, May 2013, Slides |

T29: "Synthetic Descriptive Set Theory", JAIST, Japan, April 2013 |

T28: "A new introduction to the theory of represented spaces", AAAC2013, Matsushima, Japan, April 2013, Slides |

T27: "Undecidable Problems", Raising Aspirations Lecture Series, London, March 2013 |

T26: "Beyond effective descriptive set theory: Uniform and synthetic approaches", Oberseminar Mathematische Logic, University of Freiburg, Germany, November 2012, Slides |

T25: "Beyond effective descriptive set theory: Uniform and synthetic approaches", Seminar for Theoretical Computer Science and Mathematical Logic, University of the Armed Forces Munich, Germany, November 2012, Slides |

T24: "The category of multivalued functions, with an application to many-one reductions", Theory Group research seminar, Queen Mary, London, November 2012, Slides |

T23: "Synthetic Descriptive Set Theory", Logik Seminar, Technical University of Darmstadt, September 2012, Slides |

T22: " Comparing the computational content of mathematical theorems", PhD Colloquium (invited talk, part of Colloquium Logicum), Paderborn, September 2012, Slides |

T21: "Compactness and Separation for Represented Spaces", Computability and Complexity in Analysis, Cambridge, June 2012, Slides |

T20: "Multivalued functions in computability theory", Computability in Europe, Cambridge, June 2012, Slides |

T19: "Non-deterministic computation and the Jayne Rogers Theorem", Developments in Computational Models, Cambridge, June 2012, Slides |

T18: "Cardinality vs Dimension of Convex Sets", Continuity, Computability, Constructivity - From Logic to Algorithms, Trier, May 2012, Slides |

T17: "The structure of Weihrauch degrees", Syntax and Semantic: A legacy of Alan Turing, Isaac Newton Institute, February 2012 |

T16: "The Intermediate Value Theorem is not idempotent", Computing with Infinite Data: Topological and Logical Foundations, Dagstuhl Seminar, October 2011, Abstract, Slides |

T15: "Non-determinism in TTE", Different models of computation , University of Greifswald (Germany), July 2011 |

T14: "Problems arising from non-injective representations", Logik Seminar, Technical University of Darmstadt, March 2011, Slides |

T13: "The degree structure of Weihrauch-reducibility", Computability and Complexity in Analysis, February 2011, Slides |

T12: "Placing BSS and analytic machines in the Weihrauch-lattice", Real Computation and BSS Complexity, University of Greifswald (Germany), July 2010 |

T11: "Weihrauch-Reduzierbarkeit und Metamathematik", Real Computation and BSS Complexity, University of Greifswald (Germany), July 2010 |

T10: "The Complexity of Iterated Strategy Elimination", Computability in Europe, July 2010 |

T9: "Computation with Advice", Computability and Complexity in Analysis, June 2010 |

T8: "Beyond Computation into the Abyss", Robinson College Research Day, April 2010 |

T7: "Nash Equilibria and Fixed Points in the BSS-Model", Logical Approaches to Barriers in Computing and Complexity, Greifswald (Germany), February 2010, Slides, Extended Abstract: P8 |

T6: "How discontinuous is Computing Nash Equilibria?", FACS Seminar, University of Cape Town, SA, September 2009 |

T5: "How discontinuous is Computing Nash Equilibria?", Computability and Complexity in Analysis, August 2009, Slides, Extended Abstract: P5 |

T4: "Real Hypercomputation with Infinite Oracle Queries", Computability in Europe, Juli 2009, Abstract, Slides |

T3: "Distributivität und Universalität in Abhängigkeit von der Kardinalität", Seminar of the Department of Mathematics and Computer Science, FernUniversität Hagen, April 2009, Abstract, Slides |

T2: "On the (semi)lattices induced by certain reducibilities", BCTCS 2009, April 2009, Abstract, Slides |

T1: "Representing Measurement Results", Computability and Complexity in Analysis, August 2008, Extended Abstract: P1 |

Dissertations |

D4: "Computable Metamathematics and its Application to Game Theory", PhD Thesis, University of Cambridge, September 2011, Advisor Anuj Dawar |

D3: "Universalität von Coprodukten vorgegebener Kardinalität", Diplomarbeit, FernUniversität Hagen, September 2008, Advisor Reinhard Börger |

D2: "Methoden zum Vergleich der Unstetigkeit von Funktionen", Master's Thesis, FernUniversität Hagen, March 2007, Advisor Klaus Weihrauch |

D1: "Eine Axiomatik der temporalen Relationen von MultiNet", Bachelor's Thesis, FernUniversität Hagen, January 2003, Advisor Hermann Helbig |