Frank Stephan 个人学术档案

引用次数

	总计	2019 年至今
引用	4493	981
h 指数	33	13
i10 指数	112	22

240

120

180

1993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202411 30 40 32 56 62 62 35 87 64 107 112 122 188 208 212 160 205 202 221 177 192 153 217 217 221 182 184 187 186 130 112

开放获取的出版物数量

查看全部

21 篇文章

0 篇文章

可查看的文章

无法查看的文章

根据资助方的强制性开放获取政策

合著作者

Sanjay JainProfessor of Computer Science, National University of Singapore在 comp.nus.edu.sg 的电子邮件经过验证
Andre NiesUniversity of Auckland在 cs.auckland.ac.nz 的电子邮件经过验证
John CaseEmeritus Professor of Computer and Information Sciences, University of Delaware在 mail.eecis.udel.edu 的电子邮件经过验证
Bakh KhoussainovProfessor, The Algorithms and Logic Group (ALG), UESTC在 uestc.edu.cn 的电子邮件经过验证
Wolfgang MerkleSenior Lecturer, Heidelberg University在 math.uni-heidelberg.de 的电子邮件经过验证
Cristian S. CaludeProfessor of Computer Science, The University of Auckland在 cs.auckland.ac.nz 的电子邮件经过验证
Bjørn Kjos-HanssenProfessor of Mathematics, University of Hawaii at Manoa在 hawaii.edu 的电子邮件经过验证
Richard BeigelTemple University在 temple.edu 的电子邮件经过验证
Sasha RubinUniversity of Sydney在 sydney.edu.au 的电子邮件经过验证
Lorenzo CarlucciDepartment of Mathematics, University of Roma La Sapienza在 uniroma1.it 的电子邮件经过验证
Guohua WuNanyang Technological University在 ntu.edu.sg 的电子邮件经过验证
Yu, LiangNanjing university在 nju.edu.cn 的电子邮件经过验证
Sebastiaan TerwijnRadboud University Nijmegen在 math.ru.nl 的电子邮件经过验证
Jan ReimannAssociate Professor of Mathematics, Pennsylvania State University在 math.psu.edu 的电子邮件经过验证
Lance FortnowIllinois Institute of Technology在 iit.edu 的电子邮件经过验证
Rupert HölzlUniversität der Bundeswehr München在 hoelzl.fr 的电子邮件经过验证
Pavel SemukhinLiverpool John Moores University在 semukhin.name 的电子邮件经过验证
Santiago FigueiraUniversity of Buenos Aires and CONICET在 dc.uba.ar 的电子邮件经过验证
Ludwig StaigerProfessor of Computer Science, Martin-Luther-Universität Halle-Wittenberg在 informatik.uni-halle.de 的电子邮件经过验证
Carl JockuschProfessor Emeritus of Mathematics, University of Illinois at Urbana-Champaign在 math.uiuc.edu 的电子邮件经过验证

关注

Frank Stephan

National University of Singapore, Department of Mathematics and Department of Computer Science

在 comp.nus.edu.sg 的电子邮件经过验证 - 首页

Recursion Theory Inductive Inference Automata Theory Computational Complexity Games on Finite


标题按引用次数排序按年份排序按标题排序	引用次数引用次数	年份
Deciding parity games in quasipolynomial time CS Calude, S Jain, B Khoussainov, W Li, F Stephan STOC 2017 - 49th Symposium on Theory of Computing (Best Paper STOC 2017 …, 2017	305	2017
Randomness, relativization and Turing degrees A Nies, F Stephan, SA Terwijn The Journal of Symbolic Logic 70 (2), 515-535, 2005	174	2005
Kolmogorov complexity and the recursion theorem B Kjos-Hanssen, W Merkle, F Stephan Transactions of the American Mathematical Society 363 (10), 5465-5480, 2011	144*	2011
Automatic structures: richness and limitations B Khoussainov, A Nies, S Rubin, F Stephan Logical Methods in Computer Science 3, 2007	135	2007
Trivial reals RG Downey, DR Hirschfeldt, A Nies, F Stephan Proceedings of the 7th and 8th Asian Logic Conferences, 103-131, 2003	133	2003
Approximable sets R Beigel, M Kummer, F Stephan Information and Computation 120 (2), 304-314, 1995	128	1995
Using random sets as oracles DR Hirschfeldt, A Nies, F Stephan Journal of the London Mathematical Society 75 (3), 610-622, 2007	111	2007
An ordered approach to solving parity games in quasi-polynomial time and quasi-linear space J Fearnley, S Jain, B de Keijzer, S Schewe, F Stephan, D Wojtczak International Journal on Software Tools for Technology Transfer 21 (3), 325-349, 2019	99	2019
Language learning from texts: mindchanges, limited memory and monotonicity E Kinber, F Stephan Information and Computation 123 (2), 224-241, 1995	91	1995
Kolmogorov–Loveland randomness and stochasticity W Merkle, JS Miller, A Nies, J Reimann, F Stephan Annals of Pure and Applied Logic 138 (1-3), 183-210, 2006	86	2006
A cohesive set which is not high C Jockusch, F Stephan Mathematical Logic Quarterly 39 (1), 515-530, 1993	86	1993
Automatic linear orders and trees B Khoussainov, S Rubin, F Stephan ACM Transactions on Computational Logic (TOCL) 6 (4), 675-700, 2005	80	2005
Martin-Löf random and PA-complete sets F Stephan Proceedings of ASL Logic Colloquium 2002, ASL Lecture Notes in Logic 27, 342-348, 2006	76	2006
Lowness for the class of Schnorr random reals B Kjos-Hanssen, A Nies, F Stephan SIAM Journal on Computing 35 (3), 647-657, 2005	75*	2005
Extremes in the degrees of inferability L Fortnow, W Gasarch, S Jain, E Kinber, M Kummer, S Kurtz, ... Annals of pure and applied logic 66 (3), 231-276, 1994	72	1994
On the structure of degrees of inferability M Kummer, F Stephan Journal of Computer and System Sciences 52 (2), 214-238, 1996	59	1996
Lowness properties and approximations of the jump S Figueira, A Nies, F Stephan Annals of Pure and Applied Logic 152 (1-3), 51-66, 2008	58	2008
When unlearning helps G Baliga, J Case, W Merkle, F Stephan, R Wiehagen Information and Computation 206, 694-709, 2008	58*	2008
On the computational complexity of some classical equivalence relations on Boolean functions B Borchert, D Ranjan, F Stephan Theory of Computing Systems 31 (6), 679-693, 1998	56	1998
Hausdorff dimension in exponential time K Ambos-Spies, W Merkle, J Reimann, F Stephan Proceedings 16th Annual IEEE Conference on Computational Complexity, 210-217, 2001	53	2001

系统目前无法执行此操作，请稍后再试。

文章 1–20

每年引用数

重复的引用

合并的引用

添加合著者合著作者

上传 PDF

关注此作者

引用次数

合著作者

引用