The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Paul Fischer: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Paul Fischer, Klaus-Uwe Höffgen, Hanno Lefmann, Tomasz Luczak
    Approximations with Axis-Aligned Rectangles (Extended Abstract). [Citation Graph (1, 0)][DBLP]
    FCT, 1993, pp:244-255 [Conf]
  2. Svetlana Anoulova, Paul Fischer, Stefan Pölt, Hans-Ulrich Simon
    PAB-Decisions for Boolean and Real-Valued Features. [Citation Graph (0, 0)][DBLP]
    COLT, 1992, pp:353-362 [Conf]
  3. Peter L. Bartlett, Paul Fischer, Klaus-Uwe Höffgen
    Exploiting Random Walks for Learning. [Citation Graph (0, 0)][DBLP]
    COLT, 1994, pp:318-327 [Conf]
  4. Paul Fischer
    More or Less Efficient Agnostic Learning of Convex Polygons. [Citation Graph (0, 0)][DBLP]
    COLT, 1995, pp:337-344 [Conf]
  5. Paul Fischer, Hans-Ulrich Simon
    On Learning Ring-Sum-Expansions. [Citation Graph (0, 0)][DBLP]
    COLT, 1990, pp:130-143 [Conf]
  6. Paul Fisher, Stefan Pölt, Hans-Ulrich Simon
    Probably Almost Bayes Decisions. [Citation Graph (0, 0)][DBLP]
    COLT, 1991, pp:88-94 [Conf]
  7. Nicolò Cesa-Bianchi, Paul Fischer, Eli Shamir, Hans-Ulrich Simon
    Randomized Hypotheses and Minimum Disagreement Hypotheses for Learning with Noise. [Citation Graph (0, 0)][DBLP]
    EuroCOLT, 1997, pp:119-133 [Conf]
  8. Paul Fischer
    Finding Maximum Convex Polygons. [Citation Graph (0, 0)][DBLP]
    FCT, 1993, pp:234-243 [Conf]
  9. Nicolò Cesa-Bianchi, Paul Fischer
    Finite-Time Regret Bounds for the Multiarmed Bandit Problem. [Citation Graph (0, 0)][DBLP]
    ICML, 1998, pp:100-108 [Conf]
  10. Nicolò Cesa-Bianchi, Eli Dichterman, Paul Fischer, Hans-Ulrich Simon
    Noise-Tolerant Learning Near the Information-Theoretic Bound. [Citation Graph (0, 0)][DBLP]
    STOC, 1996, pp:141-150 [Conf]
  11. Paul Fischer, Hans-Ulrich Simon
    Separation Problems and Circular Arc Systems. [Citation Graph (0, 0)][DBLP]
    WG, 1990, pp:251-259 [Conf]
  12. Foued Ameur, Paul Fischer, Klaus-Uwe Höffgen, Friedhelm Meyer auf der Heide
    Trial and Error. A New Approach to Space-Bounded Learning. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1996, v:33, n:7, pp:621-630 [Journal]
  13. Paul Fischer
    Sequential and Parallel Algorithms for Finding a Maximum Convex Polygon. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1997, v:7, n:, pp:187-200 [Journal]
  14. Paul Fischer, Norbert Klasner, Ingo Wegener
    On the Cut-off Point for Combinatorial Group Testing. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1999, v:91, n:1-3, pp:83-92 [Journal]
  15. 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. [Citation Graph (0, 0)][DBLP]
    International Journal of Geographical Information Science, 1997, v:11, n:7, pp:699-718 [Journal]
  16. Svetlana Anoulova, Paul Fischer, Stefan Pölt, Hans-Ulrich Simon
    Probably Almost Bayes Decisions. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1996, v:129, n:1, pp:63-71 [Journal]
  17. Peter L. Bartlett, Paul Fischer, Klaus-Uwe Höffgen
    Exploiting Random Walks for Learning. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2002, v:176, n:2, pp:121-135 [Journal]
  18. Paul Fischer, Klaus-Uwe Höffgen
    Computing a Maximum Axis-Aligned Rectangle in a Convex Polygon. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1994, v:51, n:4, pp:189-193 [Journal]
  19. Nicolò Cesa-Bianchi, Eli Dichterman, Paul Fischer, Eli Shamir, Hans-Ulrich Simon
    Sample-Efficient Strategies for Learning in the Presence of Noise. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1999, v:46, n:5, pp:684-719 [Journal]
  20. Paul Fischer, Jirí Matousek
    A Lower Bound for Families of Natarajan Dimension d. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2001, v:95, n:1, pp:189-195 [Journal]
  21. Paul Fischer
    Pairs Without Infimum in the Recursively Enumerable Weak Truth Table Degrees. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1986, v:51, n:1, pp:117-129 [Journal]
  22. Peter Auer, Nicolò Cesa-Bianchi, Paul Fischer
    Finite-time Analysis of the Multiarmed Bandit Problem. [Citation Graph (0, 0)][DBLP]
    Machine Learning, 2002, v:47, n:2-3, pp:235-256 [Journal]
  23. Paul Fischer, Hans-Ulrich Simon
    On Learning Ring-Sum-Expansions. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1992, v:21, n:1, pp:181-192 [Journal]
  24. Thorsten Bernholt, Paul Fischer
    The complexity of computing the MCD-estimator. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:326, n:1-3, pp:383-398 [Journal]
  25. Paul Fischer, Klaus-Uwe Höffgen, Hanno Lefmann
    PAC-Learning from General Examples. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1997, v:172, n:1-2, pp:43-65 [Journal]
  26. Paul Fischer, Hans-Ulrich Simon, Carl Smith
    Foreword. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:284, n:1, pp:1-2 [Journal]

  27. Faults Analysis in Distributed Systems - Quantitative Estimation of Reliability and Resource Requirements. [Citation Graph (, )][DBLP]


  28. Predicting Protein Secondary Structure with Markov Models. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.005secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002