default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPaul Fischer
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j20]Ping-Hsuan Tsai, Paul Fischer, Traian Iliescu:
A time-relaxation reduced order model for the turbulent channel flow. J. Comput. Phys. 521: 113563 (2025)- 2024
- [c27]Paul Fischer
, John Alasdair Warwicker, Carsten Witt:
A Runtime Analysis of Bias-invariant Neuroevolution and Dynamic Fitness Evaluation. GECCO 2024 - [c26]Anna M. Wundram, Paul Fischer, Michael Mühlebach, Lisa M. Koch, Christian F. Baumgartner:
Conformal Performance Range Prediction for Segmentation Output Quality Control. UNSURE@MICCAI 2024: 81-91 - [c25]Paul Fischer, Hannah Willms, Moritz Schneider, Daniela Thorwarth, Michael Muehlebach, Christian F. Baumgartner:
Subgroup-Specific Risk-Controlled Dose Estimation in Radiotherapy. MICCAI (10) 2024: 696-706 - [c24]Leonard Siegert, Paul Fischer, Mattias P. Heinrich, Christian F. Baumgartner:
PULPo: Probabilistic Unsupervised Laplacian Pyramid Registration. MICCAI (2) 2024: 717-727 - [i8]Paul Fischer, Hannah Willms, Moritz Schneider, Daniela Thorwarth, Michael Muehlebach, Christian F. Baumgartner:
Subgroup-Specific Risk-Controlled Dose Estimation in Radiotherapy. CoRR abs/2407.08432 (2024) - [i7]Leonard Siegert, Paul Fischer, Mattias P. Heinrich, Christian F. Baumgartner:
PULPo: Probabilistic Unsupervised Laplacian Pyramid Registration. CoRR abs/2407.10567 (2024) - [i6]Anna M. Wundram, Paul Fischer, Michael Muehlebach, Lisa M. Koch, Christian F. Baumgartner:
Conformal Performance Range Prediction for Segmentation Output Quality Control. CoRR abs/2407.13307 (2024) - 2023
- [c23]Paul Fischer, Emil Lundt Larsen, Carsten Witt:
First Steps Towards a Runtime Analysis of Neuroevolution. FOGA 2023: 61-72 - [c22]Paul Fischer, Thomas Küstner, Christian F. Baumgartner:
Uncertainty Estimation and Propagation in Accelerated MRI Reconstruction. UNSURE@MICCAI 2023: 84-94 - [i5]Paul Fischer, Emil Lundt Larsen, Carsten Witt:
First Steps towards a Runtime Analysis of Neuroevolution. CoRR abs/2307.00799 (2023) - [i4]Paul Fischer, Thomas Küstner, Christian F. Baumgartner:
Uncertainty Estimation and Propagation in Accelerated MRI Reconstruction. CoRR abs/2308.02631 (2023) - [i3]Ping-Hsuan Tsai, Paul Fischer, Edgar Solomonik:
Accelerating the Galerkin Reduced-Order Model with the Tensor Decomposition for Turbulent Flows. CoRR abs/2311.03694 (2023) - [i2]Ping-Hsuan Tsai, Paul Fischer, Traian Iliescu:
A Time-Relaxation Reduced Order Model for the Turbulent Channel Flow. CoRR abs/2312.13272 (2023)
2010 – 2019
- 2019
- [c21]Han Wui Then, Sansaptak Dasgupta, Marko Radosavljevic, Sanaz Gardner, Seung-Hoon Sung, Paul Fischer:
High-K Gate Dielectric GaN MOS-HEMTs with Regrown n+ InGaN Source/Drain (Invited Paper). DRC 2019: 39-40 - 2017
- [j19]Benjamin Doerr, Paul Fischer, Astrid Hilbert, Carsten Witt:
Detecting structural breaks in time series via genetic algorithms. Soft Comput. 21(16): 4707-4720 (2017) - [i1]Martin Ebbesen, Paul Fischer, Carsten Witt:
Edge-matching Problems with Rotations. CoRR abs/1703.09421 (2017) - 2014
- [c20]Karunakar Reddy Bayyapu, Paul Fischer:
Load Scheduling in a Cloud Based Massive Video-Storage Environment. SYNASC 2014: 349-356 - 2013
- [c19]Moongon Jung, Taigon Song, Yang Wan, Young-Joon Lee, Debabrata Mohapatra, Hong Wang, Greg Taylor, Devang Jariwala, Vijay Pitchumani, Patrick Morrow, Clair Webb, Paul Fischer, Sung Kyu Lim:
How to reduce power in 3D IC designs: A case study with OpenSPARC T2 core. CICC 2013: 1-4 - [c18]Benjamin Doerr, Paul Fischer, Astrid Hilbert, Carsten Witt:
Evolutionary algorithms for the detection of structural breaks in time series: extended abstract. GECCO (Companion) 2013: 119-120 - 2011
- [c17]Martin Ebbesen, Paul Fischer, Carsten Witt:
Edge-Matching Problems with Rotations. FCT 2011: 114-125
2000 – 2009
- 2008
- [c16]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 - 2004
- [j18]Thorsten Bernholt, Paul Fischer:
The complexity of computing the MCD-estimator. Theor. Comput. Sci. 326(1-3): 383-398 (2004) - [c15]Paul Fischer, Simon Larsen, Claus Thomsen:
Predicting Protein Secondary Structure with Markov Models. GfKl 2004: 27-33 - 2002
- [j17]Andreas Christmann, Paul Fischer, Thorsten Joachims:
Comparison between various regression depth methods and the support vector machine to approximate the minimum number of misclassifications. Comput. Stat. 17(2): 273-287 (2002) - [j16]Peter L. Bartlett, Paul Fischer, Klaus-Uwe Höffgen:
Exploiting Random Walks for Learning. Inf. Comput. 176(2): 121-135 (2002) - [j15]Peter Auer, Nicolò Cesa-Bianchi, Paul Fischer:
Finite-time Analysis of the Multiarmed Bandit Problem. Mach. Learn. 47(2-3): 235-256 (2002) - [j14]Paul Fischer, Hans Ulrich Simon, Carl Smith:
Foreword. Theor. Comput. Sci. 284(1): 1-2 (2002) - [c14]Andreas Christmann, Paul Fischer, Thorsten Joachims:
Classification Based on the Support Vector Machine, Regression Depth, and Discriminant Analysis. COMPSTAT 2002: 225-230 - 2001
- [j13]Paul Fischer, Jirí Matousek:
A Lower Bound for Families of Natarajan Dimension d. J. Comb. Theory A 95(1): 189-195 (2001)
1990 – 1999
- 1999
- [b1]Paul Fischer:
Algorithmisches Lernen. Leitfäden der Informatik, Teubner 1999, ISBN 978-3-519-02946-5, pp. 1-194 - [j12]Paul Fischer, Norbert Klasner, Ingo Wegener:
On the Cut-off Point for Combinatorial Group Testing. Discret. Appl. Math. 91(1-3): 83-92 (1999) - [j11]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) - [j10]Paul Fischer, Eckhard Platen:
Applications of the balanced method to stochastic differential equations in filtering. Monte Carlo Methods Appl. 5(1): 19-38 (1999) - [e1]Paul Fischer, Hans Ulrich Simon:
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 [contents] - 1998
- [c13]Nicolò Cesa-Bianchi, Paul Fischer:
Finite-Time Regret Bounds for the Multiarmed Bandit Problem. ICML 1998: 100-108 - 1997
- [j9]Paul Fischer:
Sequential and Parallel Algorithms for Finding a Maximum Convex Polygon. Comput. Geom. 7: 187-200 (1997) - [j8]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. Int. J. Geogr. Inf. Sci. 11(7): 699-718 (1997) - [j7]Paul Fischer, David I. Gottlieb:
On the Optimal Number of Subdomains for Hyperbolic Problems on Parallel Computers. Int. J. High Perform. Comput. Appl. 11(1): 65-76 (1997) - [j6]Paul Fischer, Klaus-Uwe Höffgen, Hanno Lefmann:
PAC-Learning from General Examples. Theor. Comput. Sci. 172(1-2): 43-65 (1997) - [c12]Nicolò Cesa-Bianchi, Paul Fischer, Eli Shamir, Hans Ulrich Simon:
Randomized Hypotheses and Minimum Disagreement Hypotheses for Learning with Noise. EuroCOLT 1997: 119-133 - 1996
- [j5]Foued Ameur, Paul Fischer, Klaus-Uwe Höffgen, Friedhelm Meyer auf der Heide:
Trial and Error. A New Approach to Space-Bounded Learning. Acta Informatica 33(7): 621-630 (1996) - [j4]Svetlana Anoulova, Paul Fischer, Stefan Pölt, Hans Ulrich Simon:
Probably Almost Bayes Decisions. Inf. Comput. 129(1): 63-71 (1996) - [c11]Nicolò Cesa-Bianchi, Eli Dichterman, Paul Fischer, Hans Ulrich Simon:
Noise-Tolerant Learning Near the Information-Theoretic Bound. STOC 1996: 141-150 - 1995
- [c10]Paul Fischer:
More or Less Efficient Agnostic Learning of Convex Polygons. COLT 1995: 337-344 - 1994
- [j3]Paul Fischer, Klaus-Uwe Höffgen:
Computing a Maximum Axis-Aligned Rectangle in a Convex Polygon. Inf. Process. Lett. 51(4): 189-193 (1994) - [c9]Peter L. Bartlett, Paul Fischer, Klaus-Uwe Höffgen:
Exploiting Random Walks for Learning. COLT 1994: 318-327 - 1993
- [c8]Paul Fischer:
Learning unions of convex polygons. EuroCOLT 1993: 61-67 - [c7]Foued Ameur, Paul Fischer, Klaus-Uwe Höffgen, Friedhelm Meyer auf der Heide:
Trial and error: a new approach to space-bounded learning. EuroCOLT 1993: 133-144 - [c6]Paul Fischer:
Finding Maximum Convex Polygons. FCT 1993: 234-243 - [c5]Paul Fischer, Klaus-Uwe Höffgen, Hanno Lefmann, Tomasz Luczak:
Approximations with Axis-Aligned Rectangles (Extended Abstract). FCT 1993: 244-255 - 1992
- [j2]Paul Fischer, Hans Ulrich Simon:
On Learning Ring-Sum-Expansions. SIAM J. Comput. 21(1): 181-192 (1992) - [c4]Svetlana Anoulova, Paul Fischer, Stefan Pölt, Hans Ulrich Simon:
PAB-Decisions for Boolean and Real-Valued Features. COLT 1992: 353-362 - 1991
- [c3]Paul Fischer, Stefan Pölt, Hans Ulrich Simon:
Probably Almost Bayes Decisions. COLT 1991: 88-94 - 1990
- [c2]Paul Fischer, Hans Ulrich Simon:
On Learning Ring-Sum-Expansions. COLT 1990: 130-143 - [c1]Paul Fischer, Hans Ulrich Simon:
Separation Problems and Circular Arc Systems. WG 1990: 251-259
1980 – 1989
- 1986
- [j1]Paul Fischer:
Pairs Without Infimum in the Recursively Enumerable Weak Truth Table Degrees. J. Symb. Log. 51(1): 117-129 (1986)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-18 20:48 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
