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