Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Frank Stephan
2010 – today
- 2013
[j101]Frank Stephan, Guohua Wu: Highness, locally noncappability and nonboundings. Ann. Pure Appl. Logic 164(5): 511-522 (2013)- [j100]Philipp Schlicht, Frank Stephan: Automata on ordinals and automaticity of linear orders. Ann. Pure Appl. Logic 164(5): 523-527 (2013)
- [j99]Pavel Semukhin, Frank Stephan: Automatic models of first order theories. Ann. Pure Appl. Logic 164(9): 837-854 (2013)
- [j98]Marcus Hutter, Frank Stephan, Vladimir Vovk, Thomas Zeugmann: Guest Editors' foreword. Theor. Comput. Sci. 473: 1-3 (2013)
- [j97]Sanjay Jain, Eric Martin, Frank Stephan: Learning and classifying. Theor. Comput. Sci. 482: 73-85 (2013)
- [c103]Ziyuan Gao, Sanjay Jain, Frank Stephan: On Conservative Learning of Recursively Enumerable Languages. CiE 2013: 181-190
- [c102]John Case, Sanjay Jain, Frank Stephan: Effectivity Questions for Kleene's Recursion Theorem. LFCS 2013: 89-103
- [c101]Wolfgang Merkle, Frank Stephan, Jason Teutsch, Wei Wang, Yue Yang: Selection by Recursively Enumerable Sets. TAMC 2013: 144-155
- 2012
- [j96]John Case, Sanjay Jain, Trong Dao Le, Yuh Shin Ong, Pavel Semukhin, Frank Stephan: Automatic learning of subclasses of pattern languages. Inf. Comput. 218: 17-35 (2012)
- [j95]Lorenzo Carlucci, Sanjay Jain, Frank Stephan: Learning with ordinal-bounded memory from positive data. J. Comput. Syst. Sci. 78(5): 1623-1636 (2012)
- [j94]Sanjay Jain, Qinglong Luo, Frank Stephan: Learnability of automatic classes. J. Comput. Syst. Sci. 78(6): 1910-1927 (2012)
- [j93]Frank Stephan, Jason Teutsch: An incomplete set of shortest descriptions. J. Symb. Log. 77(1): 291-307 (2012)
- [j92]Laurent Bienvenu, Frank Stephan, Jason Teutsch: How Powerful Are Integer-Valued Martingales? Theory Comput. Syst. 51(3): 330-351 (2012)
- [j91]Bjørn Kjos-Hanssen, Frank Stephan, Jason Teutsch: Arithmetic complexity via effective names for random sequences. ACM Trans. Comput. Log. 13(3): 24 (2012)
- [c100]
- [c99]Ziyuan Gao, Frank Stephan: Confident and Consistent Partial Learning of Recursive Functions. ALT 2012: 51-65
- [c98]Ziyuan Gao, Frank Stephan, Guohua Wu, Akihiro Yamamoto: Learning Families of Closed Sets in Matroids. Computation, Physics and Beyond 2012: 120-139
- [c97]John Case, Sanjay Jain, Samuel Seah, Frank Stephan: Automatic Functions, Linear Time and Learning. CiE 2012: 96-106
- [c96]
- [c95]Sanjay Jain, Alexei Miasnikov, Frank Stephan: The Complexity of Verbal Languages over Groups. LICS 2012: 405-414
- [c94]Sanjay Jain, Frank Stephan, Thomas Zeugmann: On the Amount of Nonconstructivity in Learning Formal Languages from Positive Data. TAMC 2012: 423-434
- [i11]
- 2011
- [j90]Sanjay Jain, Frank Stephan, Jason Teutsch: Index sets and universal numberings. J. Comput. Syst. Sci. 77(4): 760-773 (2011)
- [j89]Cristian S. Calude, Nicholas J. Hay, Frank Stephan: Representation of left-computable ε-random reals. J. Comput. Syst. Sci. 77(4): 812-819 (2011)
- [j88]Johanna N. Y. Franklin, Frank Stephan: Van Lambalgen's Theorem and High Degrees. Notre Dame Journal of Formal Logic 52(2): 173-185 (2011)
- [j87]Sanjay Jain, Qinglong Luo, Pavel Semukhin, Frank Stephan: Uncountable automatic classes and learning. Theor. Comput. Sci. 412(19): 1805-1820 (2011)
- [j86]Cristian S. Calude, André Nies, Ludwig Staiger, Frank Stephan: Universal recursively enumerable sets of strings. Theor. Comput. Sci. 412(22): 2253-2261 (2011)
- [c93]Sanjay Jain, Eric Martin, Frank Stephan: Robust Learning of Automatic Classes of Languages. ALT 2011: 55-69
- [c92]
- [c91]John Case, Sanjay Jain, Yuh Shin Ong, Pavel Semukhin, Frank Stephan: Automatic Learners with Feedback Queries. CiE 2011: 31-40
- [c90]
- [c89]Frank Stephan, Ryo Yoshinaka, Thomas Zeugmann: On the Parameterised Complexity of Learning Patterns. ISCIS 2011: 277-281
- [c88]John Case, Sanjay Jain, Trong Dao Le, Yuh Shin Ong, Pavel Semukhin, Frank Stephan: Automatic Learning of Subclasses of Pattern Languages. LATA 2011: 192-203
- [c87]
- 2010
- [j85]Bjørn Kjos-Hanssen, André Nies, Frank Stephan, Liang Yu: Higher Kurtz randomness. Ann. Pure Appl. Logic 161(10): 1280-1290 (2010)
- [j84]Sanjay Jain, Yuh Shin Ong, Frank Stephan: Regular patterns, regular languages and context-free languages. Inf. Process. Lett. 110(24): 1114-1119 (2010)
- [j83]Sanjay Jain, Frank Stephan: Numberings optimal for learning. J. Comput. Syst. Sci. 76(3-4): 233-250 (2010)
- [j82]Johanna N. Y. Franklin, Frank Stephan: Schnorr trivial sets and truth-table reducibility. J. Symb. Log. 75(2): 501-521 (2010)
- [j81]Leonor Becerra-Bonache, John Case, Sanjay Jain, Frank Stephan: Iterative learning of simple external contextual languages. Theor. Comput. Sci. 411(29-30): 2741-2756 (2010)
- [c86]
- [c85]Laurent Bienvenu, Frank Stephan, Jason Teutsch: How Powerful Are Integer-Valued Martingales? CiE 2010: 59-68
- [c84]
- [c83]Rupert Hölzl, Thorsten Kräling, Frank Stephan, Guohua Wu: Initial Segment Complexities of Randomness Notions. IFIP TCS 2010: 259-270
- [c82]
- [r4]Sanjay Jain, Frank Stephan: Complexity of Inductive Inference. Encyclopedia of Machine Learning 2010: 198-201
- [r3]Sanjay Jain, Frank Stephan: Computational Complexity of Learning. Encyclopedia of Machine Learning 2010: 201-202
- [r2]
- [r1]
- [e2]Marcus Hutter, Frank Stephan, Vladimir Vovk, Thomas Zeugmann (Eds.): Algorithmic Learning Theory, 21st International Conference, ALT 2010, Canberra, Australia, October 6-8, 2010. Proceedings. Lecture Notes in Computer Science 6331, Springer 2010, ISBN 978-3-642-16107-0
- [i10]Laurent Bienvenu, Frank Stephan, Jason Teutsch: How powerful are integer-valued martingales? CoRR abs/1004.0838 (2010)
- [i9]
2000 – 2009
- 2009
- [j80]Laurent Bienvenu, David Doty, Frank Stephan: Constructive Dimension and Turing Degrees. Theory Comput. Syst. 45(4): 740-755 (2009)
- [j79]Sanjay Jain, Eric Martin, Frank Stephan: Input-Dependence in Function-Learning. Theory Comput. Syst. 45(4): 849-864 (2009)
- [j78]Sanjay Jain, Frank Stephan, Nan Ye: Prescribed learning of r.e. classes. Theor. Comput. Sci. 410(19): 1796-1806 (2009)
- [c81]Sanjay Jain, Qinglong Luo, Pavel Semukhin, Frank Stephan: Uncountable Automatic Classes and Learning. ALT 2009: 293-307
- [c80]
- [c79]
- [c78]
- 2008
- [j77]Santiago Figueira, André Nies, Frank Stephan: Lowness properties and approximations of the jump. Ann. Pure Appl. Logic 152(1-3): 51-66 (2008)
- [j76]George Barmpalias, Andrew E. M. Lewis, Frank Stephan: I classes, LR degrees and Turing degrees. Ann. Pure Appl. Logic 156(1): 21-38 (2008)
- [j75]Bakhadyr Khoussainov, Frank Stephan, Yue Yang: Computable categoricity and the Ershov hierarchy. Ann. Pure Appl. Logic 156(1): 86-95 (2008)
- [j74]Sanjay Jain, Frank Stephan, Nan Ye: Prescribed Learning of Indexed Families. Fundam. Inform. 83(1-2): 159-175 (2008)
- [j73]Ganesh Baliga, John Case, Wolfgang Merkle, Frank Stephan, Rolf Wiehagen: When unlearning helps. Inf. Comput. 206(5): 694-709 (2008)
- [j72]
- [j71]Lorenzo Carlucci, John Case, Sanjay Jain, Frank Stephan: Non-U-shaped vacillatory and team learning. J. Comput. Syst. Sci. 74(4): 409-430 (2008)
- [j70]Frank Stephan, Jason Teutsch: Immunity and Hyperimmunity for Sets of Minimal Indices. Notre Dame Journal of Formal Logic 49(2): 107-125 (2008)
- [j69]Sanjay Jain, Frank Stephan: Mitotic Classes in Inductive Inference. SIAM J. Comput. 38(4): 1283-1299 (2008)
- [j68]Sanjay Jain, Eric Martin, Frank Stephan: Absolute versus probabilistic classification in a logical setting. Theor. Comput. Sci. 397(1-3): 114-128 (2008)
- [j67]
- [c77]Leonor Becerra-Bonache, John Case, Sanjay Jain, Frank Stephan: Iterative Learning of Simple External Contextual Languages. ALT 2008: 359-373
- [c76]
- [c75]Cristian S. Calude, André Nies, Ludwig Staiger, Frank Stephan: Universal Recursively Enumerable Sets of Strings. Developments in Language Theory 2008: 170-182
- 2007
- [j66]Lorenzo Carlucci, John Case, Sanjay Jain, Frank Stephan: Results on memory-limited U-shaped learning. Inf. Comput. 205(10): 1551-1573 (2007)
- [j65]Valentina S. Harizanov, Frank Stephan: On the learnability of vector spaces. J. Comput. Syst. Sci. 73(1): 109-122 (2007)
- [j64]Bakhadyr Khoussainov, Pavel Semukhin, Frank Stephan: Applications of Kolmogorov complexity to computable model theory. J. Symb. Log. 72(3): 1041-1054 (2007)
- [j63]Bakhadyr Khoussainov, André Nies, Sasha Rubin, Frank Stephan: Automatic Structures: Richness and Limitations. Logical Methods in Computer Science 3(2) (2007)
- [j62]Bahareh Afshari, George Barmpalias, S. Barry Cooper, Frank Stephan: Post's Programme for the Ershov Hierarchy. J. Log. Comput. 17(6): 1025-1040 (2007)
- [j61]Eric Martin, Arun Sharma, Frank Stephan: On the data consumption benefits of accepting increased uncertainty. Theor. Comput. Sci. 382(3): 170-182 (2007)
- [j60]Sanjay Jain, Jochen Nessel, Frank Stephan: Invertible classes. Theor. Comput. Sci. 384(1): 49-65 (2007)
- [c74]
- [c73]
- [c72]Laurent Bienvenu, David Doty, Frank Stephan: Constructive Dimension and Weak Truth-Table Degrees. CiE 2007: 63-72
- [c71]
- [c70]Wolfgang Merkle, Frank Stephan: On C-Degrees, H-Degrees and T-Degrees. IEEE Conference on Computational Complexity 2007: 60-69
- [c69]
- [p1]Eric Martin, Arun Sharma, Frank Stephan: Deduction, Induction, and beyond in Parametric Logic. Induction, Algorithmic Learning Theory, and Philosophy 2007: 55-110
- [i8]Laurent Bienvenu, David Doty, Frank Stephan: Constructive Dimension and Weak Truth-Table Degrees. CoRR abs/cs/0701089 (2007)
- [i7]Bakhadyr Khoussainov, André Nies, Sasha Rubin, Frank Stephan: Automatic Structures: Richness and Limitations. CoRR abs/cs/0703064 (2007)
- 2006
- [j59]Wolfgang Merkle, Joseph S. Miller, André Nies, Jan Reimann, Frank Stephan: Kolmogorov-Loveland randomness and stochasticity. Ann. Pure Appl. Logic 138(1-3): 183-210 (2006)
- [j58]Santiago Figueira, André Nies, Frank Stephan: Lowness Properties and Approximations of the Jump. Electr. Notes Theor. Comput. Sci. 143: 45-57 (2006)
- [j57]Lorenzo Carlucci, Sanjay Jain, Efim B. Kinber, Frank Stephan: Variations on U-shaped learning. Inf. Comput. 204(8): 1264-1294 (2006)
- [j56]Santiago Figueira, Frank Stephan, Guohua Wu: Randomness and universal machines. J. Complexity 22(6): 738-751 (2006)
- [j55]Richard Beigel, Harry Buhrman, Peter A. Fejer, Lance Fortnow, Piotr Grabowski, Luc Longpré, Andrej Muchnik, Frank Stephan, Leen Torenvliet: Enumerations of the Kolmogorov function. J. Symb. Log. 71(2): 501-528 (2006)
- [j54]John Case, Sanjay Jain, Eric Martin, Arun Sharma, Frank Stephan: Identifying Clusters from Positive Data. SIAM J. Comput. 36(1): 28-55 (2006)
- [j53]Richard Beigel, Lance Fortnow, Frank Stephan: Infinitely-Often Autoreducible Sets. SIAM J. Comput. 36(3): 595-608 (2006)
- [j52]Eric Martin, Arun Sharma, Frank Stephan: Unifying logic, topology and learning in Parametric logic. Theor. Comput. Sci. 350(1): 103-124 (2006)
- [j51]Eric Martin, Arun Sharma, Frank Stephan: On ordinal VC-dimension and some notions of complexity. Theor. Comput. Sci. 364(1): 62-76 (2006)
- [j50]John Case, Sanjay Jain, Rüdiger Reischuk, Frank Stephan, Thomas Zeugmann: Learning a subclass of regular patterns in polynomial time. Theor. Comput. Sci. 364(1): 115-131 (2006)
- [c68]
- [c67]
- [c66]Lorenzo Carlucci, John Case, Sanjay Jain, Frank Stephan: Memory-Limited U-Shaped Learning. COLT 2006: 244-258
- [c65]Manindra Agrawal, Frank Stephan, P. S. Thiagarajan, Shaofa Yang: Behavioural Approximations for Restricted Linear Differential Hybrid Automata. HSCC 2006: 4-18
- [c64]Bjørn Kjos-Hanssen, Wolfgang Merkle, Frank Stephan: Kolmogorov Complexity and the Recursion Theorem. STACS 2006: 149-161
- [c63]
- [c62]
- [c61]
- [e1]José L. Balcázar, Philip M. Long, Frank Stephan (Eds.): Algorithmic Learning Theory, 17th International Conference, ALT 2006, Barcelona, Spain, October 7-10, 2006, Proceedings. Lecture Notes in Computer Science 4264, Springer 2006, ISBN 3-540-46649-5
- 2005
- [j49]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. Int. J. Found. Comput. Sci. 16(4): 625-644 (2005)
- [j48]André Nies, Frank Stephan, Sebastiaan Terwijn: Randomness, relativization and Turing degrees. J. Symb. Log. 70(2): 515-535 (2005)
- [j47]Bjørn Kjos-Hanssen, André Nies, Frank Stephan: Lowness for the Class of Schnorr Random Reals. SIAM J. Comput. 35(3): 647-657 (2005)
- [j46]Bakhadyr Khoussainov, Sasha Rubin, Frank Stephan: Automatic linear orders and trees. ACM Trans. Comput. Log. 6(4): 675-700 (2005)
- [c60]Lorenzo Carlucci, John Case, Sanjay Jain, Frank Stephan: Non U-Shaped Vacillatory and Team Learning. ALT 2005: 241-255
- [c59]Sanjay Jain, Eric Martin, Frank Stephan: Absolute Versus Probabilistic Classification in a Logical Setting. ALT 2005: 327-342
- [c58]
- [c57]
- [c56]Lorenzo Carlucci, Sanjay Jain, Efim B. Kinber, Frank Stephan: Variations on U-Shaped Learning. COLT 2005: 382-397
- [c55]Wolfgang Merkle, Joseph S. Miller, André Nies, Jan Reimann, Frank Stephan: Kolmogorov-Loveland Randomness and Stochasticity. STACS 2005: 422-433
- 2004
- [j45]Sanjay Jain, Frank Stephan, Sebastiaan Terwijn: Counting extensional differences in BC-learning. Inf. Comput. 188(1): 127-142 (2004)
- [j44]Arun Sharma, Frank Stephan, Yuri Ventsov: Generalized notions of mind change complexity. Inf. Comput. 189(2): 235-262 (2004)
- [j43]Sanjay Jain, Wolfram Menzel, Frank Stephan: Classes with easily learnable subclasses. Inf. Comput. 190(1): 81-99 (2004)
- [j42]John Case, Efim B. Kinber, Arun Sharma, Frank Stephan: On the classification of recursive languages. Inf. Comput. 192(1): 15-40 (2004)
- [j41]
- [j40]John Case, Sanjay Jain, Frank Stephan, Rolf Wiehagen: Robust learning--rich and poor. J. Comput. Syst. Sci. 69(2): 123-165 (2004)
- [j39]
- [c54]Eric Martin, Arun Sharma, Frank Stephan: On the Data Consumption Benefits of Accepting Increased Uncertainty. ALT 2004: 83-98
- [c53]William I. Gasarch, Frank Stephan: Finding Isolated Cliques by Queries -- An Approach to Fault Diagnosis with Many Faults. Algebraic Methods in Computational Complexity 2004
- [c52]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. Developments in Language Theory 2004: 89-101
- [c51]John Case, Sanjay Jain, Eric Martin, Arun Sharma, Frank Stephan: Identifying Clusters from Positive Data. ICGI 2004: 103-114
- [c50]Bakhadyr Khoussainov, André Nies, Sasha Rubin, Frank Stephan: Automatic Structures: Richness and Limitations. LICS 2004: 44-53
- [c49]Bakhadyr Khoussainov, Sasha Rubin, Frank Stephan: Definability and Regularity in Automatic Structures. STACS 2004: 440-451
- [i6]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. Electronic Colloquium on Computational Complexity (ECCC)(015) (2004)
- [i5]John Case, Sanjay Jain, Rüdiger Reischuk, Frank Stephan, Thomas Zeugmann: A Polynomial Time Learner for a Subclass of Regular Patterns. Electronic Colloquium on Computational Complexity (ECCC)(038) (2004)
- [i4]John Case, Sanjay Jain, Eric Martin, Arun Sharma, Frank Stephan: Identifying Clusters from Positive Data. Electronic Colloquium on Computational Complexity (ECCC)(058) (2004)
- 2003
- [j38]Sanjay Jain, Frank Stephan: Learning by switching type of information. Inf. Comput. 185(1): 89-104 (2003)
- [j37]Wolfram Menzel, Frank Stephan: Topological aspects of numberings. Math. Log. Q. 49(2): 129-149 (2003)
- [j36]Wolfgang Merkle, Frank Stephan: Refuting learning revisited. Theor. Comput. Sci. 1(298): 145-177 (2003)
- [j35]Eric Martin, Arun Sharma, Frank Stephan: Learning power and language expressiveness. Theor. Comput. Sci. 2(298): 365-383 (2003)
- [c48]Eric Martin, Arun Sharma, Frank Stephan: On Ordinal VC-Dimension and Some Notions of Complexity. ALT 2003: 54-68
- [c47]John Case, Sanjay Jain, Rüdiger Reischuk, Frank Stephan, Thomas Zeugmann: Learning a Subclass of Regular Patterns in Polynomial Time. ALT 2003: 234-246
- [c46]Richard Beigel, Lance Fortnow, Frank Stephan: Infinitely-Often Autoreducible Sets. ISAAC 2003: 98-107
- [c45]
- [c44]Marcus Schaefer, Frank Stephan: Strong Reductions and Immunity for Exponential Time. STACS 2003: 559-570
- 2002
- [j34]Kejia Ho, Frank Stephan: Classes bounded by incomplete sets. Ann. Pure Appl. Logic 116(1-3): 273-295 (2002)
- [j33]Rodney G. Downey, Denis R. Hirschfeldt, André Nies, Frank Stephan: Trivial Reals. Electr. Notes Theor. Comput. Sci. 66(1): 36-52 (2002)
- [j32]John Case, Matthias Ott, Arun Sharma, Frank Stephan: Learning to Win Process-Control Games Watching Game-Masters. Inf. Comput. 174(1): 1-19 (2002)
- [j31]Matthias Ott, Frank Stephan: Avoiding coding tricks by hyperrobust learning. Theor. Comput. Sci. 284(1): 161-180 (2002)
- [j30]Frank Stephan, Thomas Zeugmann: Learning classes of approximations to non-recursive function. Theor. Comput. Sci. 288(2): 309-341 (2002)
- [c43]Sanjay Jain, Wolfram Menzel, Frank Stephan: Classes with Easily Learnable Subclasses. ALT 2002: 218-232
- [c42]
- [c41]Eric Martin, Arun Sharma, Frank Stephan: Learning, Logic, and Topology in a Common Framework. ALT 2002: 248-262
- [c40]Eric Martin, Phuong Minh Nguyen, Arun Sharma, Frank Stephan: Learning in Logic with RichProlog. ICLP 2002: 239-254
- 2001
- [j29]
- [j28]
- [j27]Susanne Kaufmann, Frank Stephan: Robust learning with infinite additional information. Theor. Comput. Sci. 259(1-2): 427-454 (2001)
- [j26]Frank Stephan, Yuri Ventsov: Learning algebraic structures from text. Theor. Comput. Sci. 268(2): 221-273 (2001)
- [j25]John Case, Sanjay Jain, Susanne Kaufmann, Arun Sharma, Frank Stephan: Predictive learning models for concept drift. Theor. Comput. Sci. 268(2): 323-349 (2001)
- [c39]
- [c38]
- [c37]
- [c36]Klaus Ambos-Spies, Wolfgang Merkle, Jan Reimann, Frank Stephan: Hausdorff Dimension in Exponential Time. IEEE Conference on Computational Complexity 2001: 210-217
- [c35]John Case, Sanjay Jain, Frank Stephan, Rolf Wiehagen: Robust Learning - Rich and Poor. COLT/EuroCOLT 2001: 143-159
- [c34]Eric Martin, Arun Sharma, Frank Stephan: A General Theory of Deduction, Induction, and Learning. Discovery Science 2001: 228-242
- 2000
- [j24]John Case, Sanjay Jain, Matthias Ott, Arun Sharma, Frank Stephan: Robust Learning Aided by Context. J. Comput. Syst. Sci. 60(2): 234-257 (2000)
- [j23]Richard Beigel, William I. Gasarch, Martin Kummer, Georgia Martin, Timothy McNicholl, Frank Stephan: The Comlexity of OddAn. J. Symb. Log. 65(1): 1-18 (2000)
- [j22]Bernd Borchert, Frank Stephan: Looking for an Analogue of Rice's Theorem in Circuit Complexity Theory. Math. Log. Q. 46(4): 489-504 (2000)
- [j21]John Case, Sanjay Jain, Frank Stephan: Vacillatory and BC learning on noisy data. Theor. Comput. Sci. 241(1-2): 115-141 (2000)
- [j20]Matthias Ott, Frank Stephan: Structural measures for games and process control in the branch learning model. Theor. Comput. Sci. 244(1-2): 135-165 (2000)
- [c33]
- [c32]
- [c31]Frank Stephan, Sebastiaan Terwijn: Counting Extensional Differences in BC-Learning. ICGI 2000: 256-269
1990 – 1999
- 1999
- [j19]Frank Stephan, Sebastiaan Terwijn: The Complexity of Universal Text-Learners. Inf. Comput. 154(2): 149-166 (1999)
- [j18]Bernd Borchert, Dietrich Kuske, Frank Stephan: On existentially first-order definable languages and their relation to NP. ITA 33(3): 259-270 (1999)
- [j17]Henning Fernau, Frank Stephan: Characterizations of Recursively Enumerable Sets by Programmed Grammars With Unconditional Transfer. Journal of Automata, Languages and Combinatorics 4(2): 117-152 (1999)
- [c30]Andrew R. Mitchell, Tobias Scheffer, Arun Sharma, Frank Stephan: The VC-Dimension of Subclasses of Pattern. ALT 1999: 93-105
- [c29]Frank Stephan, Thomas Zeugmann: On the Uniform Learnability of Approximations to Non-Recursive Functions. ALT 1999: 276-290
- [c28]
- 1998
- [j16]William I. Gasarch, Mark G. Pleszkoch, Frank Stephan, Mahendran Velauthapillai: Classification Using Information. Ann. Math. Artif. Intell. 23(1-2): 147-168 (1998)
- [j15]
- [j14]Bernd Borchert, Desh Ranjan, Frank Stephan: On the Computational Complexity of Some Classical Equivalence Relations on Boolean Functions. Theory Comput. Syst. 31(6): 679-693 (1998)
- [j13]Lance Fortnow, Rusins Freivalds, William I. Gasarch, Martin Kummer, Stuart A. Kurtz, Carl H. Smith, Frank Stephan: On the Relative Sizes of Learnable Sets. Theor. Comput. Sci. 197(1-2): 139-156 (1998)
- [c27]John Case, Matthias Ott, Arun Sharma, Frank Stephan: Learning to Win Process-Control Games Watching Game-Masters. ALT 1998: 31-45
- [c26]John Case, Sanjay Jain, Susanne Kaufmann, Arun Sharma, Frank Stephan: Predictive Learning Models for Concept Drift. ALT 1998: 276-290
- [c25]Frank Stephan, Yuri Ventsov: Learning Algebraic Structures from Text Using Semantical Knowledge. ALT 1998: 321-335
- [c24]John Case, Sanjay Jain, Matthias Ott, Arun Sharma, Frank Stephan: Robust Learning Aided by Context. COLT 1998: 44-55
- [c23]Bernd Borchert, Dietrich Kuske, Frank Stephan: On Existentially First-Order Definable Languages and Their Relation to NP. ICALP 1998: 17-28
- 1997
- [j12]Carl G. Jockusch Jr., Frank Stephan: Correction to "A Cohesive Set which is not High". Math. Log. Q. 43: 569 (1997)
- [j11]
- [c22]Arun Sharma, Frank Stephan, Yuri Ventsov: Generalized Notions of Mind Change Complexity. COLT 1997: 96-108
- [c21]Susanne Kaufmann, Frank Stephan: Resource Bounded Next Value and Explanatory Identification: Learning Automata, Patterns and Polynomials On-Line. COLT 1997: 263-274
- [c20]Henning Fernau, Frank Stephan: How Powerful is Unconditional Transfer? - When UT meets AC. Developments in Language Theory 1997: 249-260
- [c19]Matthias Ott, Frank Stephan: Structural Measures for Games and Process Control in the Branch Learning Model. EuroCOLT 1997: 94-108
- [c18]Susanne Kaufmann, Frank Stephan: Robust Learning with Infinite Additional Information. EuroCOLT 1997: 316-330
- [c17]
- [c16]Matthias Ott, Frank Stephan: The Complexity of Learning Branches and Strategies from Queries. ISAAC 1997: 283-292
- [c15]Bernd Borchert, Frank Stephan: Looking for an Analogue of Rice's Theorem in Circuit Complexity Theory. Kurt Gödel Colloquium 1997: 114-127
- [c14]John Case, Efim B. Kinber, Arun Sharma, Frank Stephan: On the Classification of Computable Languages. STACS 1997: 225-236
- [i3]Bernd Borchert, Dietrich Kuske, Frank Stephan: On Existentially First-Order Definable Languages and their Relation to NP. Electronic Colloquium on Computational Complexity (ECCC) 4(13) (1997)
- 1996
- [j10]Martin Kummer, Frank Stephan: On the Structure of Degrees of Inferability. J. Comput. Syst. Sci. 52(2): 214-238 (1996)
- [j9]Martin Kummer, Frank Stephan: Inclusion Problems in Parallel Learning and Games. J. Comput. Syst. Sci. 52(3): 403-420 (1996)
- [c13]
- [c12]
- [c11]Richard Beigel, William I. Gasarch, Martin Kummer, Timothy McNicholl, Frank Stephan: On the Query Complexity of Sets. MFCS 1996: 206-217
- [i2]Bernd Borchert, Desh Ranjan, Frank Stephan: On the Computational Complexity of some Classical Equivalence Relations on Boolean Functions. Electronic Colloquium on Computational Complexity (ECCC) 3(33) (1996)
- [i1]Bernd Borchert, Frank Stephan: Looking for an Analogue of Rice's Theorem in Complexity Theory. Electronic Colloquium on Computational Complexity (ECCC) 3(60) (1996)
- 1995
- [j8]Richard Beigel, Martin Kummer, Frank Stephan: Quantifying the Amount of Verboseness. Inf. Comput. 118(1): 73-90 (1995)
- [j7]Martin Kummer, Frank Stephan: Recursion Theoretic Properties of Frequency Computation and Bounded Queries. Inf. Comput. 120(1): 59-77 (1995)
- [j6]Richard Beigel, Martin Kummer, Frank Stephan: Approximable Sets. Inf. Comput. 120(2): 304-314 (1995)
- [j5]Efim B. Kinber, Frank Stephan: Language Learning from Texts: Mindchanges, Limited Memory, and Monotonicity. Inf. Comput. 123(2): 224-241 (1995)
- [c10]
- [c9]
- [c8]Efim B. Kinber, Frank Stephan: Language Learning from Texts: Mind Changes, Limited Memory and Monotonicity (Extended Abstract). COLT 1995: 182-189
- [c7]Martin Kummer, Frank Stephan: The Power of Frequency Computation (Extended Abstract). FCT 1995: 323-332
- [c6]Lance Fortnow, Rusins Freivalds, William I. Gasarch, Martin Kummer, Stuart A. Kurtz, Carl H. Smith, Frank Stephan: Measure, Category and Learning Theory. ICALP 1995: 558-569
- 1994
- [j4]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. Ann. Pure Appl. Logic 66(3): 231-276 (1994)
- [j3]
- [c5]Richard Beigel, Martin Kummer, Frank Stephan: Approximable Sets. Structure in Complexity Theory Conference 1994: 12-23
- [c4]Martin Kummer, Frank Stephan: Inclusion Problems in Parallel Learning and Games (Extended Abstract). COLT 1994: 287-298
- 1993
- [j2]Martin Kummer, Frank Stephan: Weakly Semirecursive Sets and r.e. Orderings. Ann. Pure Appl. Logic 60(2): 133-150 (1993)
- [j1]Frank Stephan, Carl G. Jockusch Jr.: A Cohesive Set which is not High. Math. Log. Q. 39: 515-530 (1993)
- [c3]
- [c2]Martin Kummer, Frank Stephan: Recursion Theoretic Properties of Frequency Computation and Bounded Queries (Extended Abstract). Kurt Gödel Colloquium 1993: 243-254
- 1992
- [c1]Richard Beigel, Martin Kummer, Frank Stephan: Quantifying the Amount of Verboseness. LFCS 1992: 21-32
Coauthor Index
[j97] [c103] [c102] [j96] [j95] [j94] [c100] [c97] [c95] [c94] [j90] [j87] [c93] [c92] [c91] [c88] [c87] [j84] [j83] [j81] [c82] [r4] [r3] [r2] [r1] [j79] [j78] [c81] [c80] [c79] [c78] [j74] [j72] [j71] [j69] [j68] [c77] [c76] [j66] [j60] [c74] [c73] [c71] [c69] [j57] [j54] [j50] [c66] [c63] [c62] [c60] [c59] [c56] [j45] [j43] [j40] [j39] [c51] [i5] [i4] [j38] [c47] [c43] [j25] [c39] [c38] [c35] [j24] [j21] [c26] [c24] [c13] [j4]
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-05 21:30 CEST by the dblp team