The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Frank Stephan: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Lorenzo Carlucci, John Case, Sanjay Jain, Frank Stephan
    Non U-Shaped Vacillatory and Team Learning. [Citation Graph (0, 0)][DBLP]
    ALT, 2005, pp:241-255 [Conf]
  2. John Case, Sanjay Jain, Susanne Kaufmann, Arun Sharma, Frank Stephan
    Predictive Learning Models for Concept Drift. [Citation Graph (0, 0)][DBLP]
    ALT, 1998, pp:276-290 [Conf]
  3. John Case, Sanjay Jain, Rüdiger Reischuk, Frank Stephan, Thomas Zeugmann
    Learning a Subclass of Regular Patterns in Polynomial Time. [Citation Graph (0, 0)][DBLP]
    ALT, 2003, pp:234-246 [Conf]
  4. John Case, Sanjay Jain, Frank Stephan
    Vacillatory and BC Learning on Noisy Data. [Citation Graph (0, 0)][DBLP]
    ALT, 1996, pp:285-298 [Conf]
  5. John Case, Matthias Ott, Arun Sharma, Frank Stephan
    Learning to Win Process-Control Games Watching Game-Masters. [Citation Graph (0, 0)][DBLP]
    ALT, 1998, pp:31-45 [Conf]
  6. José L. Balcázar, Philip M. Long, Frank Stephan
    Editors' Introduction. [Citation Graph (0, 0)][DBLP]
    ALT, 2006, pp:1-9 [Conf]
  7. Valentina S. Harizanov, Frank Stephan
    On the Learnability of Vector Spaces. [Citation Graph (0, 0)][DBLP]
    ALT, 2002, pp:233-247 [Conf]
  8. Sanjay Jain, Wolfram Menzel, Frank Stephan
    Classes with Easily Learnable Subclasses. [Citation Graph (0, 0)][DBLP]
    ALT, 2002, pp:218-232 [Conf]
  9. Sanjay Jain, Eric Martin, Frank Stephan
    Absolute Versus Probabilistic Classification in a Logical Setting. [Citation Graph (0, 0)][DBLP]
    ALT, 2005, pp:327-342 [Conf]
  10. Sanjay Jain, Frank Stephan
    Learning by Switching Type of Information. [Citation Graph (0, 0)][DBLP]
    ALT, 2001, pp:205-218 [Conf]
  11. Sanjay Jain, Frank Stephan
    Learning How to Separate. [Citation Graph (0, 0)][DBLP]
    ALT, 2001, pp:219-234 [Conf]
  12. Eric Martin, Arun Sharma, Frank Stephan
    Learning, Logic, and Topology in a Common Framework. [Citation Graph (0, 0)][DBLP]
    ALT, 2002, pp:248-262 [Conf]
  13. Eric Martin, Arun Sharma, Frank Stephan
    On Ordinal VC-Dimension and Some Notions of Complexity. [Citation Graph (0, 0)][DBLP]
    ALT, 2003, pp:54-68 [Conf]
  14. Eric Martin, Arun Sharma, Frank Stephan
    On the Data Consumption Benefits of Accepting Increased Uncertainty. [Citation Graph (0, 0)][DBLP]
    ALT, 2004, pp:83-98 [Conf]
  15. Wolfgang Merkle, Frank Stephan
    Refuting Learning Revisited. [Citation Graph (0, 0)][DBLP]
    ALT, 2001, pp:299-314 [Conf]
  16. Andrew R. Mitchell, Tobias Scheffer, Arun Sharma, Frank Stephan
    The VC-Dimension of Subclasses of Pattern. [Citation Graph (0, 0)][DBLP]
    ATL, 1999, pp:93-105 [Conf]
  17. Frank Stephan
    Noisy Inference and Oracles. [Citation Graph (0, 0)][DBLP]
    ALT, 1995, pp:185-200 [Conf]
  18. Frank Stephan, Yuri Ventsov
    Learning Algebraic Structures from Text Using Semantical Knowledge. [Citation Graph (0, 0)][DBLP]
    ALT, 1998, pp:321-335 [Conf]
  19. Frank Stephan, Thomas Zeugmann
    On the Uniform Learnability of Approximations to Non-Recursive Functions. [Citation Graph (0, 0)][DBLP]
    ATL, 1999, pp:276-290 [Conf]
  20. Santiago Figueira, Frank Stephan, Guohua Wu
    Randomness and Universal Machines. [Citation Graph (0, 0)][DBLP]
    CCA, 2005, pp:103-116 [Conf]
  21. Keng Meng Ng, Frank Stephan, Guohua Wu
    Degrees of Weakly Computable Reals. [Citation Graph (0, 0)][DBLP]
    CiE, 2006, pp:413-422 [Conf]
  22. Frank Stephan, Guohua Wu
    Presentations of K-Trivial Reals and Kolmogorov Complexity. [Citation Graph (0, 0)][DBLP]
    CiE, 2005, pp:461-469 [Conf]
  23. Richard Beigel, Martin Kummer, Frank Stephan
    Approximable Sets. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1994, pp:12-23 [Conf]
  24. Klaus Ambos-Spies, Wolfgang Merkle, Jan Reimann, Frank Stephan
    Hausdorff Dimension in Exponential Time. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2001, pp:210-217 [Conf]
  25. Lorenzo Carlucci, John Case, Sanjay Jain, Frank Stephan
    Memory-Limited U-Shaped Learning. [Citation Graph (0, 0)][DBLP]
    COLT, 2006, pp:244-258 [Conf]
  26. Lorenzo Carlucci, Sanjay Jain, Efim B. Kinber, Frank Stephan
    Variations on U-Shaped Learning. [Citation Graph (0, 0)][DBLP]
    COLT, 2005, pp:382-397 [Conf]
  27. John Case, Sanjay Jain, Matthias Ott, Arun Sharma, Frank Stephan
    Robust Learning Aided by Context. [Citation Graph (0, 0)][DBLP]
    COLT, 1998, pp:44-55 [Conf]
  28. John Case, Sanjay Jain, Frank Stephan, Rolf Wiehagen
    Robust Learning - Rich and Poor. [Citation Graph (0, 0)][DBLP]
    COLT/EuroCOLT, 2001, pp:143-159 [Conf]
  29. Susanne Kaufmann, Frank Stephan
    Resource Bounded Next Value and Explanatory Identification: Learning Automata, Patterns and Polynomials On-Line. [Citation Graph (0, 0)][DBLP]
    COLT, 1997, pp:263-274 [Conf]
  30. Efim B. Kinber, Frank Stephan
    Language Learning from Texts: Mind Changes, Limited Memory and Monotonicity (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    COLT, 1995, pp:182-189 [Conf]
  31. Martin Kummer, Frank Stephan
    On the Structure of Degrees of Inferability. [Citation Graph (0, 0)][DBLP]
    COLT, 1993, pp:117-126 [Conf]
  32. Martin Kummer, Frank Stephan
    Inclusion Problems in Parallel Learning and Games (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    COLT, 1994, pp:287-298 [Conf]
  33. Wolfgang Merkle, Frank Stephan
    Trees and Learning. [Citation Graph (0, 0)][DBLP]
    COLT, 1996, pp:270-279 [Conf]
  34. Arun Sharma, Frank Stephan, Yuri Ventsov
    Generalized Notions of Mind Change Complexity. [Citation Graph (0, 0)][DBLP]
    COLT, 1997, pp:96-108 [Conf]
  35. Frank Stephan
    Learning via Queries and Oracles. [Citation Graph (0, 0)][DBLP]
    COLT, 1995, pp:162-169 [Conf]
  36. Frank Stephan, Thomas Zeugmann
    Average-Case Complexity of Learning Polynomials. [Citation Graph (0, 0)][DBLP]
    COLT, 2000, pp:59-68 [Conf]
  37. William I. Gasarch, Frank Stephan
    Finding Isolated Cliques by Queries -- An Approach to Fault Diagnosis with Many Faults. [Citation Graph (0, 0)][DBLP]
    Algebraic Methods in Computational Complexity, 2004, pp:- [Conf]
  38. Eric Martin, Arun Sharma, Frank Stephan
    A General Theory of Deduction, Induction, and Learning. [Citation Graph (0, 0)][DBLP]
    Discovery Science, 2001, pp:228-242 [Conf]
  39. Bernd Borchert, Klaus-Jörn Lange, Frank Stephan, Pascal Tesson, Denis Thérien
    The Dot-Depth and the Polynomial Hierarchy Correspond on the Delta Levels. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2004, pp:89-101 [Conf]
  40. Susanne Kaufmann, Frank Stephan
    Robust Learning with Infinite Additional Information. [Citation Graph (0, 0)][DBLP]
    EuroCOLT, 1997, pp:316-330 [Conf]
  41. Matthias Ott, Frank Stephan
    Structural Measures for Games and Process Control in the Branch Learning Model. [Citation Graph (0, 0)][DBLP]
    EuroCOLT, 1997, pp:94-108 [Conf]
  42. Matthias Ott, Frank Stephan
    Avoiding Coding Tricks by Hyperrobust Learning. [Citation Graph (0, 0)][DBLP]
    EuroCOLT, 1999, pp:183-197 [Conf]
  43. Martin Kummer, Frank Stephan
    The Power of Frequency Computation (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    FCT, 1995, pp:323-332 [Conf]
  44. Frank Stephan, Sebastiaan Terwijn
    The Complexity of Universal Text-Learners. [Citation Graph (0, 0)][DBLP]
    FCT, 1997, pp:441-451 [Conf]
  45. Manindra Agrawal, Frank Stephan, P. S. Thiagarajan, Shaofa Yang
    Behavioural Approximations for Restricted Linear Differential Hybrid Automata. [Citation Graph (0, 0)][DBLP]
    HSCC, 2006, pp:4-18 [Conf]
  46. Ganesh Baliga, John Case, Wolfgang Merkle, Frank Stephan
    Unlearning Helps. [Citation Graph (0, 0)][DBLP]
    ICALP, 2000, pp:844-855 [Conf]
  47. Bernd Borchert, Dietrich Kuske, Frank Stephan
    On Existentially First-Order Definable Languages and Their Relation to NP. [Citation Graph (0, 0)][DBLP]
    ICALP, 1998, pp:17-28 [Conf]
  48. Lance Fortnow, Rusins Freivalds, William I. Gasarch, Martin Kummer, Stuart A. Kurtz, Carl H. Smith, Frank Stephan
    Measure, Category and Learning Theory. [Citation Graph (0, 0)][DBLP]
    ICALP, 1995, pp:558-569 [Conf]
  49. John Case, Sanjay Jain, Eric Martin, Arun Sharma, Frank Stephan
    Identifying Clusters from Positive Data. [Citation Graph (0, 0)][DBLP]
    ICGI, 2004, pp:103-114 [Conf]
  50. Frank Stephan, Sebastiaan Terwijn
    Counting Extensional Differences in BC-Learning. [Citation Graph (0, 0)][DBLP]
    ICGI, 2000, pp:256-269 [Conf]
  51. Eric Martin, Phuong Nguyen, Arun Sharma, Frank Stephan
    Learning in Logic with RichProlog. [Citation Graph (0, 0)][DBLP]
    ICLP, 2002, pp:239-254 [Conf]
  52. Richard Beigel, Lance Fortnow, Frank Stephan
    Infinitely-Often Autoreducible Sets. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2003, pp:98-107 [Conf]
  53. Matthias Ott, Frank Stephan
    The Complexity of Learning Branches and Strategies from Queries. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1997, pp:283-292 [Conf]
  54. Bernd Borchert, Frank Stephan
    Looking for an Analogue of Rice's Theorem in Circuit Complexity Theory. [Citation Graph (0, 0)][DBLP]
    Kurt Gödel Colloquium, 1997, pp:114-127 [Conf]
  55. Martin Kummer, Frank Stephan
    Recursion Theoretic Properties of Frequency Computation and Bounded Queries (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    Kurt Gödel Colloquium, 1993, pp:243-254 [Conf]
  56. Richard Beigel, Martin Kummer, Frank Stephan
    Quantifying the Amount of Verboseness. [Citation Graph (0, 0)][DBLP]
    LFCS, 1992, pp:21-32 [Conf]
  57. Bakhadyr Khoussainov, André Nies, Sasha Rubin, Frank Stephan
    Automatic Structures: Richness and Limitations. [Citation Graph (0, 0)][DBLP]
    LICS, 2004, pp:44-53 [Conf]
  58. Bakhadyr Khoussainov, Sasha Rubin, Frank Stephan
    On Automatic Partial Orders. [Citation Graph (0, 0)][DBLP]
    LICS, 2003, pp:168-177 [Conf]
  59. Richard Beigel, William I. Gasarch, Martin Kummer, Timothy McNicholl, Frank Stephan
    On the Query Complexity of Sets. [Citation Graph (0, 0)][DBLP]
    MFCS, 1996, pp:206-217 [Conf]
  60. John Case, Efim B. Kinber, Arun Sharma, Frank Stephan
    On the Classification of Computable Languages. [Citation Graph (0, 0)][DBLP]
    STACS, 1997, pp:225-236 [Conf]
  61. Bakhadyr Khoussainov, Sasha Rubin, Frank Stephan
    Definability and Regularity in Automatic Structures. [Citation Graph (0, 0)][DBLP]
    STACS, 2004, pp:440-451 [Conf]
  62. Bjørn Kjos-Hanssen, Wolfgang Merkle, Frank Stephan
    Kolmogorov Complexity and the Recursion Theorem. [Citation Graph (0, 0)][DBLP]
    STACS, 2006, pp:149-161 [Conf]
  63. Wolfgang Merkle, Joseph S. Miller, André Nies, Jan Reimann, Frank Stephan
    Kolmogorov-Loveland Randomness and Stochasticity. [Citation Graph (0, 0)][DBLP]
    STACS, 2005, pp:422-433 [Conf]
  64. Marcus Schaefer, Frank Stephan
    Strong Reductions and Immunity for Exponential Time. [Citation Graph (0, 0)][DBLP]
    STACS, 2003, pp:559-570 [Conf]
  65. Sanjay Jain, Jochen Nessel, Frank Stephan
    Invertible Classes. [Citation Graph (0, 0)][DBLP]
    TAMC, 2006, pp:707-720 [Conf]
  66. Sanjay Jain, Frank Stephan
    Some Recent Results in U-Shaped Learning. [Citation Graph (0, 0)][DBLP]
    TAMC, 2006, pp:421-431 [Conf]
  67. Frank Stephan, Liang Yu
    Lowness for Weakly 1-generic and Kurtz-Random. [Citation Graph (0, 0)][DBLP]
    TAMC, 2006, pp:756-764 [Conf]
  68. William I. Gasarch, Mark G. Pleszkoch, Frank Stephan, Mahendran Velauthapillai
    Classification Using Information. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 1998, v:23, n:1-2, pp:147-168 [Journal]
  69. Kejia Ho, Frank Stephan
    Classes bounded by incomplete sets. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2002, v:116, n:1-3, pp:273-295 [Journal]
  70. Lance Fortnow, William I. Gasarch, Sanjay Jain, Efim B. Kinber, Martin Kummer, Stuart A. Kurtz, Mark Pleszkovich, Theodore A. Slaman, Robert Solovay, Frank Stephan
    Extremes in the Degrees of Inferability. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1994, v:66, n:3, pp:231-276 [Journal]
  71. Martin Kummer, Frank Stephan
    Weakly Semirecursive Sets and r.e. Orderings. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1993, v:60, n:2, pp:133-150 [Journal]
  72. Wolfgang Merkle, Joseph S. Miller, André Nies, Jan Reimann, Frank Stephan
    Kolmogorov-Loveland randomness and stochasticity. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2006, v:138, n:1-3, pp:183-210 [Journal]
  73. Frank Stephan
    Learning via Queries and Oracles. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1998, v:94, n:1-3, pp:273-296 [Journal]
  74. Richard Beigel, Harry Buhrman, Peter A. Fejer, Lance Fortnow, Piotr Grabowski, Luc Longpré, Andrei A. Muchnik, Frank Stephan, Leen Torenvliet
    Enumerations of the Kolmogorov Function [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:015, pp:- [Journal]
  75. John Case, Sanjay Jain, Rüdiger Reischuk, Frank Stephan, Thomas Zeugmann
    A Polynomial Time Learner for a Subclass of Regular Patterns [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:038, pp:- [Journal]
  76. John Case, Sanjay Jain, Eric Martin, Arun Sharma, Frank Stephan
    Identifying Clusters from Positive Data [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:058, pp:- [Journal]
  77. Bernd Borchert, Desh Ranjan, Frank Stephan
    On the Computational Complexity of some Classical Equivalence Relations on Boolean Functions [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1996, v:3, n:33, pp:- [Journal]
  78. Bernd Borchert, Dietrich Kuske, Frank Stephan
    On Existentially First-Order Definable Languages and their Relation to NP [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1997, v:4, n:13, pp:- [Journal]
  79. Rodney G. Downey, Denis R. Hirschfeldt, André Nies, Frank Stephan
    Trivial Reals. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2002, v:66, n:1, pp:- [Journal]
  80. Santiago Figueira, André Nies, Frank Stephan
    Lowness Properties and Approximations of the Jump. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2006, v:143, n:, pp:45-57 [Journal]
  81. Richard Beigel, Martin Kummer, Frank Stephan
    Quantifying the Amount of Verboseness [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1995, v:118, n:1, pp:73-90 [Journal]
  82. Richard Beigel, Martin Kummer, Frank Stephan
    Approximable Sets [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1995, v:120, n:2, pp:304-314 [Journal]
  83. John Case, Efim B. Kinber, Arun Sharma, Frank Stephan
    On the classification of recursive languages. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2004, v:192, n:1, pp:15-40 [Journal]
  84. John Case, Matthias Ott, Arun Sharma, Frank Stephan
    Learning to Win Process-Control Games Watching Game-Masters. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2002, v:174, n:1, pp:1-19 [Journal]
  85. Sanjay Jain, Wolfram Menzel, Frank Stephan
    Classes with easily learnable subclasses. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2004, v:190, n:1, pp:81-99 [Journal]
  86. Sanjay Jain, Frank Stephan
    Learning by switching type of information. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2003, v:185, n:1, pp:89-104 [Journal]
  87. Sanjay Jain, Frank Stephan, Sebastiaan Terwijn
    Counting extensional differences in BC-learning. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2004, v:188, n:1, pp:127-142 [Journal]
  88. Efim B. Kinber, Frank Stephan
    Language Learning from Texts: Mindchanges, Limited Memory, and Monotonicity. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1995, v:123, n:2, pp:224-241 [Journal]
  89. Martin Kummer, Frank Stephan
    Recursion Theoretic Properties of Frequency Computation and Bounded Queries [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1995, v:120, n:1, pp:59-77 [Journal]
  90. Arun Sharma, Frank Stephan, Yuri Ventsov
    Generalized notions of mind change complexity. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2004, v:189, n:2, pp:235-262 [Journal]
  91. Frank Stephan, Sebastiaan Terwijn
    The Complexity of Universal Text-Learners. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1999, v:154, n:2, pp:149-166 [Journal]
  92. Lorenzo Carlucci, Sanjay Jain, Efim B. Kinber, Frank Stephan
    Variations on U-shaped learning. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2006, v:204, n:8, pp:1264-1294 [Journal]
  93. Bernd Borchert, Klaus-Jörn Lange, Frank Stephan, Pascal Tesson, Denis Thérien
    The dot-depth and the polynomial hierarchies correspond on the delta levels. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2005, v:16, n:4, pp:625-644 [Journal]
  94. Bernd Borchert, Dietrich Kuske, Frank Stephan
    On existentially first-order definable languages and their relation to NP. [Citation Graph (0, 0)][DBLP]
    ITA, 1999, v:33, n:3, pp:259-270 [Journal]
  95. Henning Fernau, Frank Stephan
    Characterizations of Recursively Enumerable Sets by Programmed Grammars With Unconditional Transfer. [Citation Graph (0, 0)][DBLP]
    Journal of Automata, Languages and Combinatorics, 1999, v:4, n:2, pp:117-152 [Journal]
  96. Santiago Figueira, Frank Stephan, Guohua Wu
    Randomness and universal machines. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 2006, v:22, n:6, pp:738-751 [Journal]
  97. John Case, Sanjay Jain, Matthias Ott, Arun Sharma, Frank Stephan
    Robust Learning Aided by Context. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2000, v:60, n:2, pp:234-257 [Journal]
  98. John Case, Sanjay Jain, Frank Stephan, Rolf Wiehagen
    Robust learning--rich and poor. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2004, v:69, n:2, pp:123-165 [Journal]
  99. Martin Kummer, Frank Stephan
    On the Structure of Degrees of Inferability. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1996, v:52, n:2, pp:214-238 [Journal]
  100. Martin Kummer, Frank Stephan
    Inclusion Problems in Parallel Learning and Games. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1996, v:52, n:3, pp:403-420 [Journal]
  101. Wolfgang Merkle, Frank Stephan
    Trees and learning. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2004, v:68, n:1, pp:134-156 [Journal]
  102. Valentina S. Harizanov, Frank Stephan
    On the learnability of vector spaces. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2007, v:73, n:1, pp:109-122 [Journal]
  103. Richard Beigel, William I. Gasarch, Martin Kummer, Georgia Martin, Timothy McNicholl, Frank Stephan
    The Comlexity of OddAn. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 2000, v:65, n:1, pp:1-18 [Journal]
  104. Frank Stephan
    On The Structures Inside Truth-Table Degrees. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 2001, v:66, n:2, pp:731-770 [Journal]
  105. Bernd Borchert, Frank Stephan
    Looking for an Analogue of Rice's Theorem in Circuit Complexity Theory. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 2000, v:46, n:4, pp:489-504 [Journal]
  106. Carl G. Jockusch Jr., Frank Stephan
    Correction to "A Cohesive Set which is not High". [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 1997, v:43, n:, pp:569- [Journal]
  107. Wolfram Menzel, Frank Stephan
    Topological aspects of numberings. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 2003, v:49, n:2, pp:129-149 [Journal]
  108. Frank Stephan, Carl G. Jockusch Jr.
    A Cohesive Set which is not High. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 1993, v:39, n:, pp:515-530 [Journal]
  109. Frank Stephan, Martin Kummer
    Effective Search Problems. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 1994, v:40, n:, pp:224-236 [Journal]
  110. Bernd Borchert, Desh Ranjan, Frank Stephan
    On the Computational Complexity of Some Classical Equivalence Relations on Boolean Functions. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 1998, v:31, n:6, pp:679-693 [Journal]
  111. John Case, Sanjay Jain, Eric Martin, Arun Sharma, Frank Stephan
    Identifying Clusters from Positive Data. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2006, v:36, n:1, pp:28-55 [Journal]
  112. Bjørn Kjos-Hanssen, André Nies, Frank Stephan
    Lowness for the Class of Schnorr Random Reals. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:35, n:3, pp:647-657 [Journal]
  113. Richard Beigel, Lance Fortnow, Frank Stephan
    Infinitely-Often Autoreducible Sets. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2006, v:36, n:3, pp:595-608 [Journal]
  114. John Case, Sanjay Jain, Susanne Kaufmann, Arun Sharma, Frank Stephan
    Predictive learning models for concept drift. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:268, n:2, pp:323-349 [Journal]
  115. John Case, Sanjay Jain, Frank Stephan
    Vacillatory and BC learning on noisy data. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:241, n:1-2, pp:115-141 [Journal]
  116. Lance Fortnow, Rusins Freivalds, William I. Gasarch, Martin Kummer, Stuart A. Kurtz, Carl H. Smith, Frank Stephan
    On the Relative Sizes of Learnable Sets. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:197, n:1-2, pp:139-156 [Journal]
  117. Sanjay Jain, Frank Stephan
    Learning how to separate. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:313, n:2, pp:209-228 [Journal]
  118. Susanne Kaufmann, Frank Stephan
    Robust learning with infinite additional information. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:259, n:1-2, pp:427-454 [Journal]
  119. Eric Martin, Arun Sharma, Frank Stephan
    Learning power and language expressiveness. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:2, n:298, pp:365-383 [Journal]
  120. Eric Martin, Arun Sharma, Frank Stephan
    Unifying logic, topology and learning in Parametric logic. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:350, n:1, pp:103-124 [Journal]
  121. Wolfgang Merkle, Frank Stephan
    Refuting learning revisited. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:298, pp:145-177 [Journal]
  122. Matthias Ott, Frank Stephan
    Structural measures for games and process control in the branch learning model. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:244, n:1-2, pp:135-165 [Journal]
  123. Matthias Ott, Frank Stephan
    Avoiding coding tricks by hyperrobust learning. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:284, n:1, pp:161-180 [Journal]
  124. Frank Stephan
    Noisy Inference and Oracles. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1997, v:185, n:1, pp:129-157 [Journal]
  125. Frank Stephan, Yuri Ventsov
    Learning algebraic structures from text. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:268, n:2, pp:221-273 [Journal]
  126. Frank Stephan, Thomas Zeugmann
    Learning classes of approximations to non-recursive function. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:288, n:2, pp:309-341 [Journal]
  127. John Case, Sanjay Jain, Rüdiger Reischuk, Frank Stephan, Thomas Zeugmann
    Learning a subclass of regular patterns in polynomial time. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:364, n:1, pp:115-131 [Journal]
  128. Eric Martin, Arun Sharma, Frank Stephan
    On ordinal VC-dimension and some notions of complexity. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:364, n:1, pp:62-76 [Journal]
  129. Bakhadyr Khoussainov, Sasha Rubin, Frank Stephan
    Automatic linear orders and trees. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Comput. Log., 2005, v:6, n:4, pp:675-700 [Journal]
  130. Sanjay Jain, Frank Stephan
    Learning in Friedberg Numberings. [Citation Graph (0, 0)][DBLP]
    ALT, 2007, pp:79-93 [Conf]
  131. Sanjay Jain, Frank Stephan, Nan Ye
    Prescribed Learning of R.E. Classes. [Citation Graph (0, 0)][DBLP]
    ALT, 2007, pp:64-78 [Conf]
  132. Laurent Bienvenu, David Doty, Frank Stephan
    Constructive Dimension and Weak Truth-Table Degrees. [Citation Graph (0, 0)][DBLP]
    CiE, 2007, pp:63-72 [Conf]
  133. Sanjay Jain, Eric Martin, Frank Stephan
    Input-Dependence in Function-Learning. [Citation Graph (0, 0)][DBLP]
    CiE, 2007, pp:378-388 [Conf]
  134. Wolfgang Merkle, Frank Stephan
    On C-Degrees, H-Degrees and T-Degrees. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2007, pp:60-69 [Conf]
  135. Sanjay Jain, Frank Stephan
    Mitotic Classes. [Citation Graph (0, 0)][DBLP]
    COLT, 2007, pp:218-232 [Conf]
  136. Laurent Bienvenu, David Doty, Frank Stephan
    Constructive Dimension and Weak Truth-Table Degrees [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  137. Bakhadyr Khoussainov, André Nies, Sasha Rubin, Frank Stephan
    Automatic Structures: Richness and Limitations [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  138. Lorenzo Carlucci, John Case, Sanjay Jain, Frank Stephan
    Results on memory-limited U-shaped learning. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2007, v:205, n:10, pp:1551-1573 [Journal]
  139. Eric Martin, Arun Sharma, Frank Stephan
    On the data consumption benefits of accepting increased uncertainty. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:382, n:3, pp:170-182 [Journal]
  140. Sanjay Jain, Jochen Nessel, Frank Stephan
    Invertible classes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:384, n:1, pp:49-65 [Journal]

  141. Uncountable Automatic Classes and Learning. [Citation Graph (, )][DBLP]


  142. Editors' Introduction. [Citation Graph (, )][DBLP]


  143. Learning from Streams. [Citation Graph (, )][DBLP]


  144. Iterative Learning of Simple External Contextual Languages. [Citation Graph (, )][DBLP]


  145. Numberings Optimal for Learning. [Citation Graph (, )][DBLP]


  146. Index Sets and Universal Numberings. [Citation Graph (, )][DBLP]


  147. How Powerful Are Integer-Valued Martingales? [Citation Graph (, )][DBLP]


  148. Universal Recursively Enumerable Sets of Strings. [Citation Graph (, )][DBLP]


  149. How Powerful is Unconditional Transfer? - When UT meets AC. [Citation Graph (, )][DBLP]


  150. Splitting of Learnable Classes. [Citation Graph (, )][DBLP]


  151. Learnability of Automatic Classes. [Citation Graph (, )][DBLP]


  152. On one-sided versus two-sided classification. [Citation Graph (, )][DBLP]


  153. I classes, LR degrees and Turing degrees. [Citation Graph (, )][DBLP]


  154. Lowness properties and approximations of the jump. [Citation Graph (, )][DBLP]


  155. Computable categoricity and the Ershov hierarchy. [Citation Graph (, )][DBLP]


  156. How powerful are integer-valued martingales? [Citation Graph (, )][DBLP]


  157. Enumerating randoms [Citation Graph (, )][DBLP]


Search in 0.282secs, Finished in 0.287secs
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