Paul Fischer

Martin Ebbesen, Paul Fischer, Carsten Witt: Edge-Matching Problems with Rotations. FCT 2011: 114-125

Christian Dauer Thorenfeldt Sellberg, Michael R. Hansen, Paul Fischer: Faults Analysis in Distributed Systems - Quantitative Estimation of Reliability and Resource Requirements. ICSOFT (SE/MUSE/GSDCA) 2008: 45-52

Thorsten Bernholt, Paul Fischer: The complexity of computing the MCD-estimator. Theor. Comput. Sci. 326(1-3): 383-398 (2004)

Paul Fischer, Simon Larsen, Claus Thomsen: Predicting Protein Secondary Structure with Markov Models. GfKl 2004: 27-33

Peter L. Bartlett, Paul Fischer, Klaus-Uwe Höffgen: Exploiting Random Walks for Learning. Inf. Comput. 176(2): 121-135 (2002)

Peter Auer, Nicolò Cesa-Bianchi, Paul Fischer: Finite-time Analysis of the Multiarmed Bandit Problem. Machine Learning 47(2-3): 235-256 (2002)

Paul Fischer, Hans-Ulrich Simon, Carl Smith: Foreword. Theor. Comput. Sci. 284(1): 1-2 (2002)

Paul Fischer, Jirí Matousek: A Lower Bound for Families of Natarajan Dimension d. J. Comb. Theory, Ser. A 95(1): 189-195 (2001)

Paul Fischer, Norbert Klasner, Ingo Wegener: On the Cut-off Point for Combinatorial Group Testing. Discrete Applied Mathematics 91(1-3): 83-92 (1999)

Nicolò Cesa-Bianchi, Eli Dichterman, Paul Fischer, Eli Shamir, Hans-Ulrich Simon: Sample-Efficient Strategies for Learning in the Presence of Noise. J. ACM 46(5): 684-719 (1999)

Paul Fischer, Hans-Ulrich Simon (Eds.): Computational Learning Theory, 4th European Conference, EuroCOLT '99, Nordkirchen, Germany, March 29-31, 1999, Proceedings. Lecture Notes in Computer Science 1572, Springer 1999, isbn 3-540-65701-0

Nicolò Cesa-Bianchi, Paul Fischer: Finite-Time Regret Bounds for the Multiarmed Bandit Problem. ICML 1998: 100-108

Paul Fischer: Sequential and Parallel Algorithms for Finding a Maximum Convex Polygon. Comput. Geom. 7: 187-200 (1997)

David J. Briggs, Susan Collins, Paul Elliott, Paul Fischer, Simon Kingham, Erik Lebret, Karel Pryl, Hans van Reeuwijk, Kirsty Smallbone, Andre van der Veen: Mapping Urban Air Pollution Using GIS: A Regression-Based Approach. International Journal of Geographical Information Science 11(7): 699-718 (1997)

Paul Fischer, Klaus-Uwe Höffgen, Hanno Lefmann: PAC-Learning from General Examples. Theor. Comput. Sci. 172(1-2): 43-65 (1997)

Nicolò Cesa-Bianchi, Paul Fischer, Eli Shamir, Hans-Ulrich Simon: Randomized Hypotheses and Minimum Disagreement Hypotheses for Learning with Noise. EuroCOLT 1997: 119-133

Foued Ameur, Paul Fischer, Klaus-Uwe Höffgen, Friedhelm Meyer auf der Heide: Trial and Error. A New Approach to Space-Bounded Learning. Acta Inf. 33(7): 621-630 (1996)

Svetlana Anoulova, Paul Fischer, Stefan Pölt, Hans-Ulrich Simon: Probably Almost Bayes Decisions. Inf. Comput. 129(1): 63-71 (1996)

Nicolò Cesa-Bianchi, Eli Dichterman, Paul Fischer, Hans-Ulrich Simon: Noise-Tolerant Learning Near the Information-Theoretic Bound. STOC 1996: 141-150

Paul Fischer: More or Less Efficient Agnostic Learning of Convex Polygons. COLT 1995: 337-344

Paul Fischer, Klaus-Uwe Höffgen: Computing a Maximum Axis-Aligned Rectangle in a Convex Polygon. Inf. Process. Lett. 51(4): 189-193 (1994)

Peter L. Bartlett, Paul Fischer, Klaus-Uwe Höffgen: Exploiting Random Walks for Learning. COLT 1994: 318-327

Paul Fischer: Finding Maximum Convex Polygons. FCT 1993: 234-243

Paul Fischer, Klaus-Uwe Höffgen, Hanno Lefmann, Tomasz Luczak: Approximations with Axis-Aligned Rectangles (Extended Abstract). FCT 1993: 244-255

Paul Fischer, Hans-Ulrich Simon: On Learning Ring-Sum-Expansions. SIAM J. Comput. 21(1): 181-192 (1992)

Svetlana Anoulova, Paul Fischer, Stefan Pölt, Hans-Ulrich Simon: PAB-Decisions for Boolean and Real-Valued Features. COLT 1992: 353-362

Paul Fischer, Stefan Pölt, Hans-Ulrich Simon: Probably Almost Bayes Decisions. COLT 1991: 88-94

Paul Fischer, Hans-Ulrich Simon: On Learning Ring-Sum-Expansions. COLT 1990: 130-143

Paul Fischer, Hans-Ulrich Simon: Separation Problems and Circular Arc Systems. WG 1990: 251-259

Paul Fischer: Pairs Without Infimum in the Recursively Enumerable Weak Truth Table Degrees. J. Symb. Log. 51(1): 117-129 (1986)