| Proceedings, Preprints and Technical Reports |
| P20: Stephane Le Roux and Arno Pauly: "Closed choice: Cardinality vs convex dimension", arXiv:1302.0380, 2013 |
| P19: Xiang Jiang and Arno Pauly: "Efficient Decomposition of Bimatrix Games", arXiv:1212.6355, 2012 |
| P18: Vasco Brattka, Stephane le Roux and Arno Pauly: "Connected Choice and the Brouwer Fixed Point Theorem", arXiv:1206.4809, 2012 |
| P17: Arno Pauly: "Multi-valued Functions in Computability Theory", Proceedings of CiE 2012, LNCS 7318 : 571-580, 2012 |
| P16: 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-56, 2012 |
| P15: Arno Pauly: "Compactness and Separation for Represented Spaces", arXiv:1204.3763, 2012 |
| P14: Arno Pauly: "The structure of Weihrauch degrees", Acts of the programme
\Semantics and Syntax",
Isaac Newton Institute, Cambridge, 2012 |
| P13: Arno Pauly: "Non-determinism in TTE", Preprint-Reihe Mathematik 3,
Ernst-Moritz-Arndt-Universität Greifswald, 2011 |
| P12: Arno Pauly and Martin Ziegler: "Relative Computability and Uniform Continuity of Relations", arXiv:1105.3050, Mai 2011 |
| P11: Arno Pauly: "Many-one reductions between search problems", arXiv:1102.3151, February 2011 |
| P10: Kojiro Higuchi and Arno Pauly: "The degree structure of Weihrauch-reducibility", arXiv:1101.0112, January 2011 |
| P9: Vasco Brattka and Arno Pauly: "Computation with Advice", Electronic Proceedings in Theoretical Computer Science 24, June 2010 |
| P8: Arno Pauly: "Nash Equilibria and Fixed Points in the BSS-Model", Preprint-Reihe Mathematik 6,
Ernst-Moritz-Arndt-Universität Greifswald, February 2010 |
| P7: Vasco Brattka, Matthew de Brecht and Arno Pauly: "Closed Choice and a Uniform Low Basis Theorem", arXiv:1002.2800, February 2010 |
| P6: Arno Pauly: "The Complexity of Iterated Strategy Elimination", arXiv:0910.5107, October 2009 |
| P5a: 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 (Long version: P3) |
| P5b: 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 (Long version: P3) |
| P4: Arno Pauly: "Infinite Oracle Queries in Type-2 Machines", arXiv:0907.3230, July 2009 |
| P3: Arno Pauly: "How discontinuous is Computing Nash Equilibria?", arXiv:0907.1482, July 2009 |
| P2: Arno Pauly: "On the (semi)lattices induced by continuous reducibilities", arXiv:0903.2177, March 2009 |
| P1: 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 |
| T30: "Dimension of sets and the difficulty of finding
points",
Kyoto University, Japan, May 2013, Slides |
| T28: "A new introduction to the theory of represented spaces",
AAAC2013, Matsushima, Japan, April 2013 |
| 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 |