default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFrank Stephan 0001
Person information
- affiliation: National University of Singapore (NUS), Departments of Mathematics and Computer Science, Singapore
Other persons with the same name
- Frank Stephan 0002 — University of Applied Sciences Dresden (HTW Dresden), Germany
Other persons with a similar name
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j156]André Nies
, Frank Stephan:
Word automatic groups of nilpotency class 2. Inf. Process. Lett. 183: 106426 (2024)- [c141]Karen Frilya Celine, Ziyuan Gao, Sanjay Jain, Ryan Lou, Frank Stephan, Guohua Wu:
Quasi-Isometric Reductions Between Infinite Strings. MFCS 2024: 37:1-37:16 - [c140]Rupert Hölzl, Philip Janicki, Wolfgang Merkle, Frank Stephan:
Randomness Versus Superspeedability. MFCS 2024: 62:1-62:14 - [c139]Gordon Hoi, Sanjay Jain, Ammar Fathin Sabili, Frank Stephan:
A Bisection Approach to Subcubic Maximum Induced Matching. WALCOM 2024: 257-272 - [i33]Karen Frilya Celine, Ziyuan Gao, Sanjay Jain, Ryan Lou, Frank Stephan, Guohua Wu:
Quasi-Isometric Reductions Between Infinite Strings. CoRR abs/2407.14105 (2024) - 2023
- [j155]David R. Bélanger, Ziyuan Gao, Sanjay Jain, Wei Li, Frank Stephan:
Learnability and positive equivalence relations. Inf. Comput. 295(Part B): 104913 (2023) - [j154]Sanjay Jain, Xiaodong Jia, Ammar Fathin Sabili, Frank Stephan:
Addition machines, automatic functions and open problems of Floyd and Knuth. J. Comput. Syst. Sci. 136: 135-156 (2023) - [j153]Dmitry Berdinsky, Sanjay Jain, Bakhadyr Khoussainov, Frank Stephan:
String compression in FA-presentable structures. Theor. Comput. Sci. 947: 113705 (2023) - [c138]Wojciech Czerwinski, Maciej Debski, Tomasz Gogasz, Gordon Hoi, Sanjay Jain, Michal Skrzypczak, Frank Stephan, Christopher Tan:
Languages Given by Finite Automata over the Unary Alphabet. FSTTCS 2023: 22:1-22:20 - [i32]Dmitry Berdinsky, Sanjay Jain, Bakhadyr Khoussainov, Frank Stephan:
String Compression in FA-Presentable Structures. CoRR abs/2302.01009 (2023) - [i31]Gordon Hoi, Sanjay Jain, Frank Stephan, Christopher Tan:
Languages given by Finite Automata over the Unary Alphabet. CoRR abs/2302.06435 (2023) - 2022
- [j152]Sanjay Jain, Birzhan Moldagaliyev, Frank Stephan, Tien Dat Tran:
Lamplighter groups and automata. Acta Informatica 59(4): 451-478 (2022) - [j151]Sanjay Jain, Shao Ning Kuek, Eric Martin, Frank Stephan:
Learners based on transducers. Inf. Comput. 283: 104676 (2022) - [j150]Cristian S. Calude, Sanjay Jain, Bakhadyr Khoussainov, Wei Li, Frank Stephan:
Deciding Parity Games in Quasi-polynomial Time. SIAM J. Comput. 51(2): 17-152 (2022) - [j149]André Nies, Frank Stephan:
Randomness and initial segment complexity for measures. Theor. Comput. Sci. 900: 1-19 (2022) - [j148]Ziyuan Gao, Sanjay Jain, Zeyong Li, Ammar Fathin Sabili, Frank Stephan:
A computation model with automatic functions and relations as primitive operations. Theor. Comput. Sci. 924: 94-116 (2022) - [c137]Keng Meng Ng, Frank Stephan, Yue Yang, Liang Yu:
On Trees Without Hyperimmune Branches. CiE 2022: 234-245 - [c136]Ziyuan Gao, Sanjay Jain, Zeyong Li, Ammar Fathin Sabili, Frank Stephan:
Alternating Automatic Register Machines. ICTAC 2022: 195-211 - [i30]Gordon Hoi, Ammar Fathin Sabili, Frank Stephan:
An Exact Algorithm for finding Maximum Induced Matching in Subcubic Graphs. CoRR abs/2201.03220 (2022) - [i29]Ziyuan Gao, Sanjay Jain, Zeyong Li, Ammar Fathin Sabili, Frank Stephan:
A Computation Model with Automatic Functions and Relations as Primitive Operations. CoRR abs/2201.06836 (2022) - 2021
- [j147]Ivan Georgiev, Lars Kristiansen, Frank Stephan:
Computable irrational numbers with representations of surprising complexity. Ann. Pure Appl. Log. 172(2): 102893 (2021) - [j146]Sanjay Jain, Frank Stephan, Thomas Zeugmann:
On the amount of nonconstructivity in learning formal languages from text. Inf. Comput. 281: 104668 (2021) - [j145]Gordon Hoi, Frank Stephan:
Improved algorithms for the general exact satisfiability problem. Theor. Comput. Sci. 889: 60-84 (2021) - [j144]Cristian S. Calude, Karen Frilya Celine, Ziyuan Gao, Sanjay Jain, Ludwig Staiger, Frank Stephan:
Bi-immunity over different size alphabets. Theor. Comput. Sci. 894: 31-49 (2021) - [c135]David R. Bélanger, Ziyuan Gao, Sanjay Jain, Wei Li, Frank Stephan:
Learnability and Positive Equivalence Relations. LATA 2021: 145-156 - [i28]Gordon Hoi, Frank Stephan:
Improved Algorithms for the General Exact Satisfiability Problem. CoRR abs/2101.08637 (2021) - [i27]Ziyuan Gao, Sanjay Jain, Ji Qi, Philipp Schlicht, Frank Stephan, Jacob Tarr:
Ordered Semiautomatic Rings with Applications to Geometry. CoRR abs/2103.06714 (2021) - [i26]Ziyuan Gao, Sanjay Jain, Zeyong Li, Ammar Fathin Sabili, Frank Stephan:
Alternating Automatic Register Machines. CoRR abs/2111.04254 (2021) - [i25]Sanjay Jain, Xiaodong Jia, Ammar Fathin Sabili, Frank Stephan:
Addition Machines, Automatic Functions and Open Problems of Floyd and Knuth. CoRR abs/2111.08969 (2021) - 2020
- [j143]Rupert Hölzl, Wolfgang Merkle, Joseph S. Miller, Frank Stephan, Liang Yu:
Chaitin's ω as a continuous function. J. Symb. Log. 85(1): 486-510 (2020) - [j142]Cristian S. Calude, Sanjay Jain, Wolfgang Merkle, Frank Stephan:
Searching for shortest and least programs. Theor. Comput. Sci. 807: 114-127 (2020) - [c134]Gordon Hoi, Sanjay Jain, Frank Stephan:
A Faster Exact Algorithm to Count X3SAT Solutions. CP 2020: 375-391 - [c133]Ziyuan Gao, Sanjay Jain, Ji Qi, Philipp Schlicht, Frank Stephan, Jacob Tarr:
Ordered Semiautomatic Rings with Applications to Geometry. LATA 2020: 141-153 - [c132]André Nies, Frank Stephan:
Randomness and Initial Segment Complexity for Probability Measures. STACS 2020: 55:1-55:14 - [i24]Gordon Hoi, Sanjay Jain, Frank Stephan:
A Faster Exact Algorithm to Count X3SAT Solutions. CoRR abs/2007.07553 (2020) - [i23]David R. Bélanger, Ziyuan Gao, Sanjay Jain, Wei Li, Frank Stephan:
Learnability and Positive Equivalence Relations. CoRR abs/2012.01466 (2020)
2010 – 2019
- 2019
- [j141]Ian Herbert, Sanjay Jain, Steffen Lempp, Manat Mustafa, Frank Stephan:
Reductions between types of numberings. Ann. Pure Appl. Log. 170(12) (2019) - [j140]Sanjay Jain, Bakhadyr Khoussainov, Philipp Schlicht, Frank Stephan:
The isomorphism problem for tree-automatic ordinals with addition. Inf. Process. Lett. 149: 19-24 (2019) - [j139]Sanjay Jain, Alexei Miasnikov, Frank Stephan:
The complexity of verbal languages over groups. J. Comput. Syst. Sci. 101: 68-85 (2019) - [j138]John Fearnley, Sanjay Jain, Bart de Keijzer, Sven Schewe, Frank Stephan, Dominik Wojtczak:
An ordered approach to solving parity games in quasi-polynomial time and quasi-linear space. Int. J. Softw. Tools Technol. Transf. 21(3): 325-349 (2019) - [c131]Aquinas Hobor, Elaine Li, Frank Stephan:
Pumping, with or Without Choice. APLAS 2019: 427-446 - [c130]Gordon Hoi, Sanjay Jain, Frank Stephan:
A Fast Exponential Time Algorithm for Max Hamming Distance X3SAT. FSTTCS 2019: 17:1-17:14 - [c129]Gordon Hoi, Frank Stephan:
Measure and Conquer for Max Hamming Distance XSAT. ISAAC 2019: 15:1-15:19 - [c128]Ziyuan Gao, Sanjay Jain, Bakhadyr Khoussainov, Wei Li, Alexander G. Melnikov, Karen Seidel, Frank Stephan:
Random Subgroups of Rationals. MFCS 2019: 25:1-25:14 - [c127]Gordon Hoi, Sanjay Jain, Sibylle Schwarz, Frank Stephan:
Exact Satisfiabitity with Jokers. TAMC 2019: 279-294 - [i22]Ziyuan Gao, Sanjay Jain, Bakhadyr Khoussainov, Wei Li, Alexander G. Melnikov, Karen Seidel, Frank Stephan:
Random Subgroups of Rationals. CoRR abs/1901.04743 (2019) - [i21]Gordon Hoi, Sanjay Jain, Frank Stephan:
A Fast Exponential Time Algorithm for Max Hamming Distance X3SAT. CoRR abs/1910.01293 (2019) - 2018
- [j137]Sanjay Jain, Bakhadyr Khoussainov, Frank Stephan:
Finitely generated semiautomatic groups. Comput. 7(2-3): 273-287 (2018) - [j136]George Barmpalias, Nan Fang, Frank Stephan:
Equivalences between learning of data and probability distributions, and their applications. Inf. Comput. 262: 123-140 (2018) - [j135]Philippe Moser, Frank Stephan:
Limit-depth and DNR degrees. Inf. Process. Lett. 135: 36-40 (2018) - [j134]Kenshi Miyabe, André Nies, Frank Stephan:
Randomness and Solovay degrees. J. Log. Anal. 10 (2018) - [j133]Eric Martin, Frank Stephan:
Implementing fragments of ZFC within an r.e. Universe. J. Log. Comput. 28(1): 1-32 (2018) - [j132]John Case, Sanjay Jain, Frank Stephan:
Effectivity questions for Kleene's recursion theorem. Theor. Comput. Sci. 733: 55-70 (2018) - [j131]Rupert Hölzl, Sanjay Jain, Frank Stephan:
Learning pattern languages over groups. Theor. Comput. Sci. 742: 66-81 (2018) - [c126]Ziyuan Gao, Sanjay Jain, Frank Stephan, Thomas Zeugmann:
On the Help of Bounded Shot Verifiers, Comparators and Standardisers for Learnability in Inductive Inference. ALT 2018: 413-437 - [c125]Ivan Georgiev, Lars Kristiansen, Frank Stephan:
On General Sum Approximations of Irrational Numbers. CiE 2018: 194-203 - [c124]Sanjay Jain, Shao Ning Kuek, Eric Martin, Frank Stephan:
Learners Based on Transducers. LATA 2018: 169-181 - [c123]André Nies, Frank Stephan:
Closure of Resource-Bounded Randomness Notions Under Polynomial-Time Permutations. STACS 2018: 51:1-51:10 - [c122]Birzhan Moldagaliyev, Ludwig Staiger, Frank Stephan:
On the Values for Factor Complexity. CIAA 2018: 274-285 - [i20]George Barmpalias, Nan Fang, Frank Stephan:
Equivalences between learning of data and probability distributions, and their applications. CoRR abs/1801.02566 (2018) - [i19]Sanjay Jain, Bakhadyr Khoussainov, Philipp Schlicht, Frank Stephan:
The isomorphism problem for tree-automatic ordinals with addition. CoRR abs/1810.13153 (2018) - 2017
- [j130]Bjørn Kjos-Hanssen, Frank Stephan, Sebastiaan A. Terwijn:
Covering the recursive sets. Ann. Pure Appl. Log. 168(4): 804-823 (2017) - [j129]Sanjay Jain, Frank Stephan, Jason Teutsch:
Closed left-r.e. sets. Comput. 6(1): 1-21 (2017) - [j128]Philippe Moser, Frank Stephan:
Depth, Highness and DNR degrees. Discret. Math. Theor. Comput. Sci. 19(4) (2017) - [j127]Sanjay Jain, Efim B. Kinber, Frank Stephan:
Automatic learning from positive data and negative counterexamples. Inf. Comput. 255: 45-67 (2017) - [j126]Rahul Jain, Sanjay Jain, Frank Stephan:
Special issue on the conference Theory and Applications of Models of Computation. Inf. Comput. 256: 148 (2017) - [j125]Sanjay Jain, Bakhadyr Khoussainov, Frank Stephan, Dan Teng, Siyuan Zou:
Semiautomatic Structures. Theory Comput. Syst. 61(4): 1254-1287 (2017) - [c121]Rupert Hölzl, Sanjay Jain, Philipp Schlicht, Karen Seidel, Frank Stephan:
Automatic Learning from Repetitive Texts. ALT 2017: 129-150 - [c120]Rupert Hölzl, Dilip Raghavan, Frank Stephan, Jing Zhang:
Weakly Represented Families in Reverse Mathematics. Computability and Complexity 2017: 160-187 - [c119]John Fearnley, Sanjay Jain, Sven Schewe, Frank Stephan, Dominik Wojtczak:
An ordered approach to solving parity games in quasi polynomial time and quasi linear space. SPIN 2017: 112-121 - [c118]Cristian S. Calude, Sanjay Jain, Bakhadyr Khoussainov, Wei Li, Frank Stephan:
Deciding parity games in quasipolynomial time. STOC 2017: 252-263 - [r8]Sanjay Jain, Frank Stephan:
Complexity of Inductive Inference. Encyclopedia of Machine Learning and Data Mining 2017: 247-251 - [r7]Sanjay Jain, Frank Stephan:
Computational Complexity of Learning. Encyclopedia of Machine Learning and Data Mining 2017: 251-253 - [r6]Sanjay Jain, Frank Stephan:
Inductive Inference. Encyclopedia of Machine Learning and Data Mining 2017: 642-648 - [r5]Sanjay Jain, Frank Stephan:
Query-Based Learning. Encyclopedia of Machine Learning and Data Mining 2017: 1044-1047 - [i18]John Fearnley, Sanjay Jain, Sven Schewe, Frank Stephan, Dominik Wojtczak:
An Ordered Approach to Solving Parity Games in Quasi Polynomial Time and Quasi Linear Space. CoRR abs/1703.01296 (2017) - [i17]André Nies, Frank Stephan:
Closure of resource-bounded randomness notions under polynomial time permutations. CoRR abs/1709.08792 (2017) - [i16]George Barmpalias, Frank Stephan:
Algorithmic learning of probability distributions from random data in the limit. CoRR abs/1710.11303 (2017) - 2016
- [j124]Rupert Hölzl, Sanjay Jain, Frank Stephan:
Inductive inference and reverse mathematics. Ann. Pure Appl. Log. 167(12): 1242-1266 (2016) - [j123]Rupert Hölzl, Frank Stephan, Liang Yu:
On Martin's pointed tree theorem. Comput. 5(2): 147-157 (2016) - [j122]Cristian S. Calude, Ludwig Staiger, Frank Stephan:
Finite state incompressible infinite sequences. Inf. Comput. 247: 23-36 (2016) - [j121]Sanjay Jain, Timo Kötzing, Junqi Ma, Frank Stephan:
On the role of update constraints and text-types in iterative learning. Inf. Comput. 247: 152-168 (2016) - [j120]Sanjay Jain, Timo Kötzing, Frank Stephan:
Enlarging learnable classes. Inf. Comput. 251: 194-207 (2016) - [j119]Christopher Hanrui Chak, Rusins Freivalds, Frank Stephan, Henrietta Tan Wan Yik:
On block pumpable languages. Theor. Comput. Sci. 609: 272-285 (2016) - [j118]Alex Gavryushkin, Bakhadyr Khoussainov, Frank Stephan:
Reducibilities among equivalence relations induced by recursively enumerable structures. Theor. Comput. Sci. 612: 137-152 (2016) - [j117]Sanjay Jain, Rémi Munos, Frank Stephan, Thomas Zeugmann:
Guest Editors' foreword. Theor. Comput. Sci. 620: 1-3 (2016) - [j116]Ziyuan Gao, Frank Stephan, Sandra Zilles:
Partial learning of recursively enumerable languages. Theor. Comput. Sci. 620: 15-32 (2016) - [j115]Sanjay Jain, Bakhadyr Khoussainov, Philipp Schlicht, Frank Stephan:
Tree-automatic scattered linear orders. Theor. Comput. Sci. 626: 83-96 (2016) - [c117]Rupert Hölzl, Sanjay Jain, Frank Stephan:
Learning Pattern Languages over Groups. ALT 2016: 189-203 - [c116]Sanjay Jain, Bakhadyr Khoussainov, Frank Stephan:
Finitely Generated Semiautomatic Groups. CiE 2016: 282-291 - [c115]Sanjay Jain, Frank Stephan:
Learning Automatic Families of Languages. SOFSEM 2016: 29-40 - [i15]Sanjay Jain, Prateek Saxena, Frank Stephan, Jason Teutsch:
How to verify computation with a rational network. CoRR abs/1606.05917 (2016) - 2015
- [j114]Stephen G. Simpson, Frank Stephan:
Cone avoidance and randomness preservation. Ann. Pure Appl. Log. 166(6): 713-728 (2015) - [j113]C. T. Chong, Gordon Hoi, Frank Stephan, Daniel Turetsky:
Partial functions and domination. Log. Methods Comput. Sci. 11(3) (2015) - [j112]Cristian S. Calude, Rusins Freivalds, Sanjay Jain, Frank Stephan:
Deterministic Frequency Pushdown Automata. J. Univers. Comput. Sci. 21(12): 1563-1576 (2015) - [c114]Sanjay Jain, Junqi Ma, Frank Stephan:
Priced Learning. ALT 2015: 41-55 - [c113]Ziyuan Gao, Frank Stephan, Sandra Zilles:
Combining Models of Approximation with Partial Learning. ALT 2015: 56-70 - [c112]Bjørn Kjos-Hanssen, Frank Stephan, Sebastiaan A. Terwijn:
Covering the Recursive Sets. CiE 2015: 44-53 - [c111]Philippe Moser, Frank Stephan:
Depth, Highness and DNR Degrees. FCT 2015: 81-94 - [c110]Rupert Hölzl, Sanjay Jain, Frank Stephan:
Inductive Inference and Reverse Mathematics. STACS 2015: 420-433 - [e4]Rahul Jain, Sanjay Jain, Frank Stephan:
Theory and Applications of Models of Computation - 12th Annual Conference, TAMC 2015, Singapore, May 18-20, 2015, Proceedings. Lecture Notes in Computer Science 9076, Springer 2015, ISBN 978-3-319-17141-8 [contents] - [i14]Ziyuan Gao, Frank Stephan, Sandra Zilles:
Combining Models of Approximation with Partial Learning. CoRR abs/1507.01215 (2015) - [i13]Philippe Moser, Frank Stephan:
Depth, Highness and DNR degrees. CoRR abs/1511.05027 (2015) - 2014
- [j111]Alexander Gavruskin, Sanjay Jain, Bakhadyr Khoussainov, Frank Stephan:
Graphs realised by r.e. equivalence relations. Ann. Pure Appl. Log. 165(7-8): 1263-1290 (2014) - [j110]Frank Stephan, Liang Yu:
A reducibility related to being hyperimmune-free. Ann. Pure Appl. Log. 165(7-8): 1291-1300 (2014) - [j109]Keng Meng Ng, André Nies, Frank Stephan:
The Complexity of Recursive Splittings of Random Sets. Comput. 3(1): 1-8 (2014) - [j108]Cameron E. Freer, Bjørn Kjos-Hanssen, André Nies, Frank Stephan:
Algorithmic Aspects of Lipschitz Functions. Comput. 3(1): 45-61 (2014) - [j107]Rupert Hölzl, Thorsten Kräling, Frank Stephan, Guohua Wu:
Initial segment complexities of randomness notions. Inf. Comput. 234: 57-67 (2014) - [j106]Frank Stephan, Jason Teutsch:
Things that can be made into themselves. Inf. Comput. 237: 174-186 (2014) - [j105]Sanjay Jain, Eric Martin, Frank Stephan:
Robust learning of automatic classes of languages. J. Comput. Syst. Sci. 80(4): 777-795 (2014) - [j104]John Case, Sanjay Jain, Yuh Shin Ong, Pavel Semukhin, Frank Stephan:
Automatic learners with feedback queries. J. Comput. Syst. Sci. 80(4): 806-820 (2014) - [j103]Ziyuan Gao, Frank Stephan:
Confident and consistent partial learning of recursive functions. Theor. Comput. Sci. 558: 5-17 (2014) - [c109]Sanjay Jain, Timo Kötzing, Junqi Ma, Frank Stephan:
On the Role of Update Constraints and Text-Types in Iterative Learning. ALT 2014: 55-69 - [c108]Sanjay Jain, Bakhadyr Khoussainov, Frank Stephan, Dan Teng, Siyuan Zou:
Semiautomatic Structures. CSR 2014: 204-217 - [c107]Cristian S. Calude, Ludwig Staiger, Frank Stephan:
Finite State Incompressible Infinite Sequences. TAMC 2014: 50-66 - 2013
- [j102]Frank Stephan, Guohua Wu:
Highness, locally noncappability and nonboundings. Ann. Pure Appl. Log. 164(5): 511-522 (2013) - [j101]Philipp Schlicht, Frank Stephan:
Automata on ordinals and automaticity of linear orders. Ann. Pure Appl. Log. 164(5): 523-527 (2013) - [j100]Pavel Semukhin, Frank Stephan:
Automatic models of first order theories. Ann. Pure Appl. Log. 164(9): 837-854 (2013) - [j99]John Case, Sanjay Jain, Samuel Seah, Frank Stephan:
Automatic functions, linear time and learning. Log. Methods Comput. Sci. 9(3) (2013) - [j98]Johanna N. Y. Franklin, Noam Greenberg, Frank Stephan, Guohua Wu:
Anti-complex sets and reducibilities with tiny use. J. Symb. Log. 78(4): 1307-1327 (2013) - [j97]Marcus Hutter, Frank Stephan, Vladimir Vovk, Thomas Zeugmann:
Guest Editors' foreword. Theor. Comput. Sci. 473: 1-3 (2013) - [j96]Sanjay Jain, Eric Martin, Frank Stephan:
Learning and classifying. Theor. Comput. Sci. 482: 73-85 (2013) - [c106]Sanjay Jain, Rémi Munos, Frank Stephan, Thomas Zeugmann:
Editors' Introduction. ALT 2013: 1-12 - [c105]Ziyuan Gao, Frank Stephan, Sandra Zilles:
Partial Learning of Recursively Enumerable Languages. ALT 2013: 113-127 - [c104]Ziyuan Gao, Sanjay Jain, Frank Stephan:
On Conservative Learning of Recursively Enumerable Languages. CiE 2013: 181-190 - [c103]John Case, Sanjay Jain, Frank Stephan:
Effectivity Questions for Kleene's Recursion Theorem. LFCS 2013: 89-103 - [c102]Wolfgang Merkle, Frank Stephan, Jason Teutsch, Wei Wang, Yue Yang:
Selection by Recursively Enumerable Sets. TAMC 2013: 144-155 - [e3]Sanjay Jain, Rémi Munos, Frank Stephan, Thomas Zeugmann:
Algorithmic Learning Theory - 24th International Conference, ALT 2013, Singapore, October 6-9, 2013. Proceedings. Lecture Notes in Computer Science 8139, Springer 2013, ISBN 978-3-642-40934-9 [contents] - 2012
- [j95]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) - [j94]Lorenzo Carlucci, Sanjay Jain, Frank Stephan:
Learning with ordinal-bounded memory from positive data. J. Comput. Syst. Sci. 78(5): 1623-1636 (2012) - [j93]Sanjay Jain, Qinglong Luo, Frank Stephan:
Learnability of automatic classes. J. Comput. Syst. Sci. 78(6): 1910-1927 (2012) - [j92]Frank Stephan, Jason Teutsch:
An incomplete set of shortest descriptions. J. Symb. Log. 77(1): 291-307 (2012) - [j91]Laurent Bienvenu, Frank Stephan, Jason Teutsch:
How Powerful Are Integer-Valued Martingales? Theory Comput. Syst. 51(3): 330-351 (2012) - [j90]Bjørn Kjos-Hanssen, Frank Stephan, Jason Teutsch:
Arithmetic complexity via effective names for random sequences. ACM Trans. Comput. Log. 13(3): 24:1-24:18 (2012) - [c101]Sanjay Jain, Timo Kötzing, Frank Stephan:
Enlarging Learnable Classes. ALT 2012: 36-50 - [c100]Ziyuan Gao, Frank Stephan:
Confident and Consistent Partial Learning of Recursive Functions. ALT 2012: 51-65 - [c99]Ziyuan Gao, Frank Stephan, Guohua Wu, Akihiro Yamamoto:
Learning Families of Closed Sets in Matroids. Computation, Physics and Beyond 2012: 120-139 - [c98]John Case, Sanjay Jain, Samuel Seah, Frank Stephan:
Automatic Functions, Linear Time and Learning. CiE 2012: 96-106 - [c97]Ziyuan Gao, Frank Stephan:
Learnability of Co-r.e. Classes. LATA 2012: 252-263 - [c96]Sanjay Jain, Alexei Miasnikov, Frank Stephan:
The Complexity of Verbal Languages over Groups. LICS 2012: 405-414 - [c95]Sanjay Jain, Frank Stephan, Thomas Zeugmann:
On the Amount of Nonconstructivity in Learning Formal Languages from Positive Data. TAMC 2012: 423-434 - [p2]Manindra Agrawal, Frank Stephan, P. S. Thiagarajan, Shaofa Yang:
The Discrete Time Behaviour of Restricted Linear Hybrid Automata. Modern Applications of Automata Theory 2012: 437-456 - [i12]Frank Stephan, Jason Teutsch:
Things that can be made into themselves. CoRR abs/1208.0682 (2012) - 2011
- [j89]Sanjay Jain, Frank Stephan, Jason Teutsch:
Index sets and universal numberings. J. Comput. Syst. Sci. 77(4): 760-773 (2011) - [j88]Cristian S. Calude, Nicholas J. Hay, Frank Stephan:
Representation of left-computable ε-random reals. J. Comput. Syst. Sci. 77(4): 812-819 (2011) - [j87]Johanna N. Y. Franklin, Frank Stephan:
Van Lambalgen's Theorem and High Degrees. Notre Dame J. Formal Log. 52(2): 173-185 (2011) - [j86]Sanjay Jain, Qinglong Luo, Pavel Semukhin, Frank Stephan:
Uncountable automatic classes and learning. Theor. Comput. Sci. 412(19): 1805-1820 (2011) - [j85]Cristian S. Calude, André Nies, Ludwig Staiger, Frank Stephan:
Universal recursively enumerable sets of strings. Theor. Comput. Sci. 412(22): 2253-2261 (2011) - [c94]Sanjay Jain, Eric Martin, Frank Stephan:
Robust Learning of Automatic Classes of Languages. ALT 2011: 55-69 - [c93]Sanjay Jain, Eric Martin, Frank Stephan:
Learning and Classifying. ALT 2011: 70-83 - [c92]John Case, Sanjay Jain, Yuh Shin Ong, Pavel Semukhin, Frank Stephan:
Automatic Learners with Feedback Queries. CiE 2011: 31-40 - [c91]Philipp Schlicht, Frank Stephan:
Automata on Ordinals and Linear Orders. CiE 2011: 252-259 - [c90]Frank Stephan, Ryo Yoshinaka, Thomas Zeugmann:
On the Parameterised Complexity of Learning Patterns. ISCIS 2011: 277-281 - [c89]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 - [c88]Sanjay Jain, Frank Stephan, Jason Teutsch:
Closed Left-R.E. Sets. TAMC 2011: 218-229 - 2010
- [j84]Bjørn Kjos-Hanssen, André Nies, Frank Stephan, Liang Yu:
Higher Kurtz randomness. Ann. Pure Appl. Log. 161(10): 1280-1290 (2010) - [j83]Sanjay Jain, Yuh Shin Ong, Frank Stephan:
Regular patterns, regular languages and context-free languages. Inf. Process. Lett. 110(24): 1114-1119 (2010) - [j82]Sanjay Jain, Frank Stephan:
Numberings optimal for learning. J. Comput. Syst. Sci. 76(3-4): 233-250 (2010) - [j81]Johanna N. Y. Franklin, Frank Stephan:
Schnorr trivial sets and truth-table reducibility. J. Symb. Log. 75(2): 501-521 (2010) - [j80]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) - [c87]Marcus Hutter, Frank Stephan, Vladimir Vovk, Thomas Zeugmann:
Editors' Introduction. ALT 2010: 1-10 - [c86]Laurent Bienvenu, Frank Stephan, Jason Teutsch:
How Powerful Are Integer-Valued Martingales? CiE 2010: 59-68 - [c85]Hongyang Li, Frank Stephan:
Splitting of Learnable Classes. ICGI 2010: 109-121 - [c84]Rupert Hölzl, Thorsten Kräling, Frank Stephan, Guohua Wu:
Initial Segment Complexities of Randomness Notions. IFIP TCS 2010: 259-270 - [c83]Sanjay Jain, Qinglong Luo, Frank Stephan:
Learnability of Automatic Classes. LATA 2010: 321-332 - [e2]Marcus Hutter, Frank Stephan, Vladimir Vovk, Thomas Zeugmann:
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 [contents] - [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]Sanjay Jain, Frank Stephan:
Inductive Inference. Encyclopedia of Machine Learning 2010: 523-528 - [r1]Sanjay Jain, Frank Stephan:
Query-Based Learning. Encyclopedia of Machine Learning 2010: 820-822 - [i11]Laurent Bienvenu, Frank Stephan, Jason Teutsch:
How powerful are integer-valued martingales? CoRR abs/1004.0838 (2010) - [i10]Bjørn Kjos-Hanssen, Frank Stephan, Jason Teutsch:
Enumerating randoms. CoRR abs/1008.4825 (2010)
2000 – 2009
- 2009
- [j79]Laurent Bienvenu, David Doty, Frank Stephan:
Constructive Dimension and Turing Degrees. Theory Comput. Syst. 45(4): 740-755 (2009) - [j78]Sanjay Jain, Eric Martin, Frank Stephan:
Input-Dependence in Function-Learning. Theory Comput. Syst. 45(4): 849-864 (2009) - [j77]Sanjay Jain, Frank Stephan, Nan Ye:
Prescribed learning of r.e. classes. Theor. Comput. Sci. 410(19): 1796-1806 (2009) - [c82]Sanjay Jain, Qinglong Luo, Pavel Semukhin, Frank Stephan:
Uncountable Automatic Classes and Learning. ALT 2009: 293-307 - [c81]Sanjay Jain, Frank Stephan, Nan Ye:
Learning from Streams. ALT 2009: 338-352 - [c80]Sanjay Jain, Frank Stephan, Jason Teutsch:
Index Sets and Universal Numberings. CiE 2009: 270-279 - [c79]Sanjay Jain, Frank Stephan:
Consistent Partial Identification. COLT 2009 - 2008
- [j76]Santiago Figueira, André Nies, Frank Stephan:
Lowness properties and approximations of the jump. Ann. Pure Appl. Log. 152(1-3): 51-66 (2008) - [j75]George Barmpalias, Andrew E. M. Lewis, Frank Stephan:
I classes, LR degrees and Turing degrees. Ann. Pure Appl. Log. 156(1): 21-38 (2008) - [j74]Bakhadyr Khoussainov, Frank Stephan, Yue Yang:
Computable categoricity and the Ershov hierarchy. Ann. Pure Appl. Log. 156(1): 86-95 (2008) - [j73]Sanjay Jain, Frank Stephan, Nan Ye:
Prescribed Learning of Indexed Families. Fundam. Informaticae 83(1-2): 159-175 (2008) - [j72]Ganesh Baliga, John Case, Wolfgang Merkle, Frank Stephan, Rolf Wiehagen:
When unlearning helps. Inf. Comput. 206(5): 694-709 (2008) - [j71]Sanjay Jain, Frank Stephan:
Learning in Friedberg numberings. Inf. Comput. 206(6): 776-790 (2008) - [j70]Lorenzo Carlucci, John Case, Sanjay Jain, Frank Stephan:
Non-U-shaped vacillatory and team learning. J. Comput. Syst. Sci. 74(4): 409-430 (2008) - [j69]Frank Stephan, Jason Teutsch:
Immunity and Hyperimmunity for Sets of Minimal Indices. Notre Dame J. Formal Log. 49(2): 107-125 (2008) - [j68]Sanjay Jain, Frank Stephan:
Mitotic Classes in Inductive Inference. SIAM J. Comput. 38(4): 1283-1299 (2008) - [j67]Sanjay Jain, Eric Martin, Frank Stephan:
Absolute versus probabilistic classification in a logical setting. Theor. Comput. Sci. 397(1-3): 114-128 (2008) - [j66]Philip M. Long, Frank Stephan:
Preface. Theor. Comput. Sci. 405(3): 207-208 (2008) - [c78]Leonor Becerra-Bonache, John Case, Sanjay Jain, Frank Stephan:
Iterative Learning of Simple External Contextual Languages. ALT 2008: 359-373 - [c77]Sanjay Jain, Frank Stephan:
Numberings Optimal for Learning. ALT 2008: 434-448 - [c76]Cristian S. Calude, André Nies, Ludwig Staiger, Frank Stephan:
Universal Recursively Enumerable Sets of Strings. Developments in Language Theory 2008: 170-182 - 2007
- [j65]Lorenzo Carlucci, John Case, Sanjay Jain, Frank Stephan:
Results on memory-limited U-shaped learning. Inf. Comput. 205(10): 1551-1573 (2007) - [j64]Valentina S. Harizanov, Frank Stephan:
On the learnability of vector spaces. J. Comput. Syst. Sci. 73(1): 109-122 (2007) - [j63]Bakhadyr Khoussainov, Pavel Semukhin, Frank Stephan:
Applications of Kolmogorov complexity to computable model theory. J. Symb. Log. 72(3): 1041-1054 (2007) - [j62]Bakhadyr Khoussainov, André Nies, Sasha Rubin, Frank Stephan:
Automatic Structures: Richness and Limitations. Log. Methods Comput. Sci. 3(2) (2007) - [j61]Bahareh Afshari, George Barmpalias, S. Barry Cooper, Frank Stephan:
Post's Programme for the Ershov Hierarchy. J. Log. Comput. 17(6): 1025-1040 (2007) - [j60]Eric Martin, Arun Sharma, Frank Stephan:
On the data consumption benefits of accepting increased uncertainty. Theor. Comput. Sci. 382(3): 170-182 (2007) - [j59]Sanjay Jain, Jochen Nessel, Frank Stephan:
Invertible classes. Theor. Comput. Sci. 384(1): 49-65 (2007) - [c75]Sanjay Jain, Frank Stephan, Nan Ye:
Prescribed Learning of R.E. Classes. ALT 2007: 64-78 - [c74]Sanjay Jain, Frank Stephan:
Learning in Friedberg Numberings. ALT 2007: 79-93 - [c73]Laurent Bienvenu, David Doty, Frank Stephan:
Constructive Dimension and Weak Truth-Table Degrees. CiE 2007: 63-72 - [c72]Sanjay Jain, Eric Martin, Frank Stephan:
Input-Dependence in Function-Learning. CiE 2007: 378-388 - [c71]Wolfgang Merkle, Frank Stephan:
On C-Degrees, H-Degrees and T-Degrees. CCC 2007: 60-69 - [c70]Sanjay Jain, Frank Stephan:
Mitotic Classes. COLT 2007: 218-232 - [p1]Eric Martin, Arun Sharma, Frank Stephan:
Deduction, Induction, and beyond in Parametric Logic. Induction, Algorithmic Learning Theory, and Philosophy 2007: 55-110 - [i9]Laurent Bienvenu, David Doty, Frank Stephan:
Constructive Dimension and Weak Truth-Table Degrees. CoRR abs/cs/0701089 (2007) - [i8]Bakhadyr Khoussainov, André Nies, Sasha Rubin, Frank Stephan:
Automatic Structures: Richness and Limitations. CoRR abs/cs/0703064 (2007) - 2006
- [j58]Wolfgang Merkle, Joseph S. Miller, André Nies, Jan Reimann, Frank Stephan:
Kolmogorov-Loveland randomness and stochasticity. Ann. Pure Appl. Log. 138(1-3): 183-210 (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. Complex. 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) - [c69]José L. Balcázar, Philip M. Long, Frank Stephan:
Editors' Introduction. ALT 2006: 1-9 - [c68]Keng Meng Ng, Frank Stephan, Guohua Wu:
Degrees of Weakly Computable Reals. CiE 2006: 413-422 - [c67]Lorenzo Carlucci, John Case, Sanjay Jain, Frank Stephan:
Memory-Limited U-Shaped Learning. COLT 2006: 244-258 - [c66]Manindra Agrawal, Frank Stephan, P. S. Thiagarajan, Shaofa Yang:
Behavioural Approximations for Restricted Linear Differential Hybrid Automata. HSCC 2006: 4-18 - [c65]Bjørn Kjos-Hanssen, Wolfgang Merkle, Frank Stephan:
Kolmogorov Complexity and the Recursion Theorem. STACS 2006: 149-161 - [c64]Sanjay Jain, Frank Stephan:
Some Recent Results in U-Shaped Learning. TAMC 2006: 421-431 - [c63]Sanjay Jain, Jochen Nessel, Frank Stephan:
Invertible Classes. TAMC 2006: 707-720 - [c62]Frank Stephan, Liang Yu:
Lowness for Weakly 1-generic and Kurtz-Random. TAMC 2006: 756-764 - [e1]José L. Balcázar, Philip M. Long, Frank Stephan:
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 [contents] - 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) - [c61]Lorenzo Carlucci, John Case, Sanjay Jain, Frank Stephan:
Non U-Shaped Vacillatory and Team Learning. ALT 2005: 241-255 - [c60]Sanjay Jain, Eric Martin, Frank Stephan:
Absolute Versus Probabilistic Classification in a Logical Setting. ALT 2005: 327-342 - [c59]Santiago Figueira, Frank Stephan, Guohua Wu:
Randomness and Universal Machines. CCA 2005: 103-116 - [c58]Frank Stephan, Guohua Wu:
Presentations of K-Trivial Reals and Kolmogorov Complexity. CiE 2005: 461-469 - [c57]Lorenzo Carlucci, Sanjay Jain, Efim B. Kinber, Frank Stephan:
Variations on U-Shaped Learning. COLT 2005: 382-397 - [c56]Wolfgang Merkle, Joseph S. Miller, André Nies, Jan Reimann, Frank Stephan:
Kolmogorov-Loveland Randomness and Stochasticity. STACS 2005: 422-433 - [c55]Santiago Figueira, André Nies, Frank Stephan:
Lowness Properties and Approximations of the Jump. WoLLIC 2005: 45-57 - 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]Wolfgang Merkle, Frank Stephan:
Trees and learning. J. Comput. Syst. Sci. 68(1): 134-156 (2004) - [j40]John Case, Sanjay Jain, Frank Stephan, Rolf Wiehagen:
Robust learning--rich and poor. J. Comput. Syst. Sci. 69(2): 123-165 (2004) - [j39]Sanjay Jain, Frank Stephan:
Learning how to separate. Theor. Comput. Sci. 313(2): 209-228 (2004) - [c54]Eric Martin, Arun Sharma, Frank Stephan:
On the Data Consumption Benefits of Accepting Increased Uncertainty. ALT 2004: 83-98 - [c53]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 - [c52]John Case, Sanjay Jain, Eric Martin, Arun Sharma, Frank Stephan:
Identifying Clusters from Positive Data. ICGI 2004: 103-114 - [c51]Bakhadyr Khoussainov, André Nies, Sasha Rubin, Frank Stephan:
Automatic Structures: Richness and Limitations. LICS 2004: 44-53 - [c50]Bakhadyr Khoussainov, Sasha Rubin, Frank Stephan:
Definability and Regularity in Automatic Structures. STACS 2004: 440-451 - [i7]William I. Gasarch, Frank Stephan:
Finding Isolated Cliques by Queries -- An Approach to Fault Diagnosis with Many Faults. Algebraic Methods in Computational Complexity 2004 - [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. Electron. Colloquium Comput. Complex. TR04 (2004) - [i5]John Case, Sanjay Jain, Rüdiger Reischuk, Frank Stephan, Thomas Zeugmann:
A Polynomial Time Learner for a Subclass of Regular Patterns. Electron. Colloquium Comput. Complex. TR04 (2004) - [i4]John Case, Sanjay Jain, Eric Martin, Arun Sharma, Frank Stephan:
Identifying Clusters from Positive Data. Electron. Colloquium Comput. Complex. TR04 (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. 298(1): 145-177 (2003) - [j35]Eric Martin, Arun Sharma, Frank Stephan:
Learning power and language expressiveness. Theor. Comput. Sci. 298(2): 365-383 (2003) - [c49]Eric Martin, Arun Sharma, Frank Stephan:
On Ordinal VC-Dimension and Some Notions of Complexity. ALT 2003: 54-68 - [c48]John Case, Sanjay Jain, Rüdiger Reischuk, Frank Stephan, Thomas Zeugmann:
Learning a Subclass of Regular Patterns in Polynomial Time. ALT 2003: 234-246 - [c47]Richard Beigel, Lance Fortnow, Frank Stephan:
Infinitely-Often Autoreducible Sets. ISAAC 2003: 98-107 - [c46]Bakhadyr Khoussainov, Sasha Rubin, Frank Stephan:
On Automatic Partial Orders. LICS 2003: 168-177 - [c45]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. Log. 116(1-3): 273-295 (2002) - [j33]John Case, Matthias Ott, Arun Sharma, Frank Stephan:
Learning to Win Process-Control Games Watching Game-Masters. Inf. Comput. 174(1): 1-19 (2002) - [j32]Matthias Ott, Frank Stephan:
Avoiding coding tricks by hyperrobust learning. Theor. Comput. Sci. 284(1): 161-180 (2002) - [j31]Frank Stephan, Thomas Zeugmann:
Learning classes of approximations to non-recursive function. Theor. Comput. Sci. 288(2): 309-341 (2002) - [c44]Sanjay Jain, Wolfram Menzel, Frank Stephan:
Classes with Easily Learnable Subclasses. ALT 2002: 218-232 - [c43]Valentina S. Harizanov, Frank Stephan:
On the Learnability of Vector Spaces. ALT 2002: 233-247 - [c42]Eric Martin, Arun Sharma, Frank Stephan:
Learning, Logic, and Topology in a Common Framework. ALT 2002: 248-262 - [c41]Eric Martin, Phuong Minh Nguyen, Arun Sharma, Frank Stephan:
Learning in Logic with RichProlog. ICLP 2002: 239-254 - [c40]Rodney G. Downey, Denis R. Hirschfeldt, André Nies, Frank Stephan:
Trivial Reals. CCA 2002: 36-52 - 2001
- [j30]Frank Stephan:
On one-sided versus two-sided classification. Arch. Math. Log. 40(7): 489-513 (2001) - [j29]Frank Stephan:
On The Structures Inside Truth-Table Degrees. J. Symb. Log. 66(2): 731-770 (2001) - [j28]Susanne Kaufmann, Frank Stephan:
Robust learning with infinite additional information. Theor. Comput. Sci. 259(1-2): 427-454 (2001) - [j27]Frank Stephan, Yuri Ventsov:
Learning algebraic structures from text. Theor. Comput. Sci. 268(2): 221-273 (2001) - [j26]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]Sanjay Jain, Frank Stephan:
Learning by Switching Type of Information. ALT 2001: 205-218 - [c38]Sanjay Jain, Frank Stephan:
Learning How to Separate. ALT 2001: 219-234 - [c37]Wolfgang Merkle, Frank Stephan:
Refuting Learning Revisited. ALT 2001: 299-314 - [c36]Klaus Ambos-Spies, Wolfgang Merkle, Jan Reimann, Frank Stephan:
Hausdorff Dimension in Exponential Time. CCC 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
- [j25]John Case, Sanjay Jain, Matthias Ott, Arun Sharma, Frank Stephan:
Robust Learning Aided by Context. J. Comput. Syst. Sci. 60(2): 234-257 (2000) - [j24]Richard Beigel, William I. Gasarch, Martin Kummer, Georgia Martin, Timothy H. McNicholl, Frank Stephan:
The Comlexity of OddAn. J. Symb. Log. 65(1): 1-18 (2000) - [j23]Bernd Borchert, Frank Stephan:
Looking for an Analogue of Rice's Theorem in Circuit Complexity Theory. Math. Log. Q. 46(4): 489-504 (2000) - [j22]John Case, Sanjay Jain, Frank Stephan:
Vacillatory and BC learning on noisy data. Theor. Comput. Sci. 241(1-2): 115-141 (2000) - [j21]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]Frank Stephan, Thomas Zeugmann:
Average-Case Complexity of Learning Polynomials. COLT 2000: 59-68 - [c32]Ganesh Baliga, John Case, Wolfgang Merkle, Frank Stephan:
Unlearning Helps. ICALP 2000: 844-855 - [c31]Frank Stephan, Sebastiaan Terwijn:
Counting Extensional Differences in BC-Learning. ICGI 2000: 256-269
1990 – 1999
- 1999
- [j20]Frank Stephan, Sebastiaan Terwijn:
The Complexity of Universal Text-Learners. Inf. Comput. 154(2): 149-166 (1999) - [j19]Bernd Borchert, Dietrich Kuske, Frank Stephan:
On existentially first-order definable languages and their relation to NP. RAIRO Theor. Informatics Appl. 33(3): 259-270 (1999) - [j18]Henning Fernau, Frank Stephan:
Characterizations of Recursively Enumerable Languages by Programmed Grammars With Unconditional Transfer. J. Autom. Lang. Comb. 4(2): 117-142 (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]Matthias Ott, Frank Stephan:
Avoiding Coding Tricks by Hyperrobust Learning. EuroCOLT 1999: 183-197 - 1998
- [j17]William I. Gasarch, Mark G. Pleszkoch, Frank Stephan, Mahendran Velauthapillai:
Classification Using Information. Ann. Math. Artif. Intell. 23(1-2): 147-168 (1998) - [j16]Frank Stephan:
Learning via Queries and Oracles. Ann. Pure Appl. Log. 94(1-3): 273-296 (1998) - [j15]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) - [j14]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
- [j13]Carl G. Jockusch Jr., Frank Stephan:
Correction to "A Cohesive Set which is not High". Math. Log. Q. 43: 569 (1997) - [j12]Frank Stephan:
Noisy Inference and Oracles. Theor. Comput. Sci. 185(1): 129-157 (1997) - [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]Frank Stephan, Sebastiaan Terwijn:
The Complexity of Universal Text-Learners. FCT 1997: 441-451 - [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. Electron. Colloquium Comput. Complex. TR97 (1997) - 1996
- [j11]Martin Kummer, Frank Stephan:
On the Structure of Degrees of Inferability. J. Comput. Syst. Sci. 52(2): 214-238 (1996) - [j10]Martin Kummer, Frank Stephan:
Inclusion Problems in Parallel Learning and Games. J. Comput. Syst. Sci. 52(3): 403-420 (1996) - [c13]John Case, Sanjay Jain, Frank Stephan:
Vacillatory and BC Learning on Noisy Data. ALT 1996: 285-298 - [c12]Wolfgang Merkle, Frank Stephan:
Trees and Learning. COLT 1996: 270-279 - [c11]Richard Beigel, William I. Gasarch, Martin Kummer, Timothy H. 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. Electron. Colloquium Comput. Complex. TR96 (1996) - [i1]Bernd Borchert, Frank Stephan:
Looking for an Analogue of Rice's Theorem in Complexity Theory. Electron. Colloquium Comput. Complex. TR96 (1996) - 1995
- [j9]Richard Beigel, Martin Kummer, Frank Stephan:
Quantifying the Amount of Verboseness. Inf. Comput. 118(1): 73-90 (1995) - [j8]Martin Kummer, Frank Stephan:
Recursion Theoretic Properties of Frequency Computation and Bounded Queries. Inf. Comput. 120(1): 59-77 (1995) - [j7]Richard Beigel, Martin Kummer, Frank Stephan:
Approximable Sets. Inf. Comput. 120(2): 304-314 (1995) - [j6]Efim B. Kinber, Frank Stephan:
Language Learning from Texts: Mindchanges, Limited Memory, and Monotonicity. Inf. Comput. 123(2): 224-241 (1995) - [c10]Frank Stephan:
Noisy Inference and Oracles. ALT 1995: 185-200 - [c9]Frank Stephan:
Learning via Queries and Oracles. COLT 1995: 162-169 - [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
- [j5]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. Log. 66(3): 231-276 (1994) - [j4]Frank Stephan, Martin Kummer:
Effective Search Problems. Math. Log. Q. 40: 224-236 (1994) - [c5]Richard Beigel, Martin Kummer, Frank Stephan:
Approximable Sets. SCT 1994: 12-23 - [c4]Martin Kummer, Frank Stephan:
Inclusion Problems in Parallel Learning and Games (Extended Abstract). COLT 1994: 287-298 - 1993
- [j3]Martin Kummer, Frank Stephan:
Weakly Semirecursive Sets and r.e. Orderings. Ann. Pure Appl. Log. 60(2): 133-150 (1993) - [j2]Frank Stephan, Carl G. Jockusch Jr.:
A Cohesive Set which is not High. Math. Log. Q. 39: 515-530 (1993) - [j1]Heinrich Braun, Frank Stephan:
On Optimizing Diameter and Average Distance of Directed Interconnected Networks. IEEE Trans. Computers 42(3): 353-358 (1993) - [c3]Martin Kummer, Frank Stephan:
On the Structure of Degrees of Inferability. COLT 1993: 117-126 - [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 - 1990
- [b1]Frank Stephan:
X-Raeume als Verallgemeinerung topologischer Raeume. Karlsruhe University, Germany, 1990
Coauthor Index
[c141] [c139] [i33] [j155] [j154] [j153] [c138] [i32] [i31] [j152] [j151] [j150] [j148] [c136] [i29] [j146] [j144] [c135] [i27] [i26] [i25] [j142] [c134] [c133] [i24] [i23] [j141] [j140] [j139] [j138] [c130] [c128] [c127] [i22] [i21] [j137] [j132] [j131] [c126] [c124] [i19] [j129] [j127] [j126] [j125] [c121] [c119] [c118] [r8] [r7] [r6] [r5] [i18] [j124] [j121] [j120] [j117] [j115] [c117] [c116] [c115] [i15] [j112] [c114] [c110] [e4] [j111] [j105] [j104] [c109] [c108] [j99] [j96] [c106] [c104] [c103] [e3] [j95] [j94] [j93] [c101] [c98] [c96] [c95] [j89] [j86] [c94] [c93] [c92] [c89] [c88] [j83] [j82] [j80] [c83] [r4] [r3] [r2] [r1] [j78] [j77] [c82] [c81] [c80] [c79] [j73] [j71] [j70] [j68] [j67] [c78] [c77] [j65] [j59] [c75] [c74] [c72] [c70] [j57] [j54] [j50] [c67] [c64] [c63] [c61] [c60] [c57] [j45] [j43] [j40] [j39] [c52] [i5] [i4] [j38] [c48] [c44] [j26] [c39] [c38] [c35] [j25] [j22] [c26] [c24] [c13] [j5]
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-30 01:09 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:
