Stop the war!Остановите войну!
for scientists:
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
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]