Frank Stephan

Citata da

	Tutte	Dal 2019
Citazioni	4541	1021
Indice H	33	14
i10-index	114	25

240

120

180

199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202430 40 33 56 62 62 35 87 65 107 112 122 189 208 212 155 207 201 225 178 192 153 218 221 221 187 183 181 187 121 162

Accesso pubblico

Visualizza tutto

21 articoli

0 articoli

Disponibili

Non disponibili

In base ai mandati di finanziamento

Coautori

Sanjay JainProfessor of Computer Science, National University of SingaporeEmail verificata su comp.nus.edu.sg
Andre NiesUniversity of AucklandEmail verificata su cs.auckland.ac.nz
John CaseEmeritus Professor of Computer and Information Sciences, University of DelawareEmail verificata su mail.eecis.udel.edu
Bakh KhoussainovProfessor, The Algorithms and Logic Group (ALG), UESTCEmail verificata su uestc.edu.cn
Wolfgang MerkleSenior Lecturer, Heidelberg UniversityEmail verificata su math.uni-heidelberg.de
Cristian S. CaludeProfessor of Computer Science, The University of AucklandEmail verificata su cs.auckland.ac.nz
Bjørn Kjos-HanssenProfessor of Mathematics, University of Hawaii at ManoaEmail verificata su hawaii.edu
Richard BeigelTemple UniversityEmail verificata su temple.edu
Guohua WuNanyang Technological UniversityEmail verificata su ntu.edu.sg
Sasha RubinUniversity of SydneyEmail verificata su sydney.edu.au
Lorenzo CarlucciDepartment of Mathematics, University of Roma La SapienzaEmail verificata su uniroma1.it
Yu, LiangNanjing universityEmail verificata su nju.edu.cn
Sebastiaan TerwijnRadboud University NijmegenEmail verificata su math.ru.nl
Jan ReimannAssociate Professor of Mathematics, Pennsylvania State UniversityEmail verificata su math.psu.edu
Rupert HölzlUniversität der Bundeswehr MünchenEmail verificata su hoelzl.fr
Lance FortnowIllinois Institute of TechnologyEmail verificata su iit.edu
Pavel SemukhinLiverpool John Moores UniversityEmail verificata su semukhin.name
Santiago FigueiraUniversity of Buenos Aires and CONICETEmail verificata su dc.uba.ar
Ludwig StaigerProfessor of Computer Science, Martin-Luther-Universität Halle-WittenbergEmail verificata su informatik.uni-halle.de
Carl JockuschProfessor Emeritus of Mathematics, University of Illinois at Urbana-ChampaignEmail verificata su math.uiuc.edu

Segui

Frank Stephan

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

Email verificata su comp.nus.edu.sg - Home page

Recursion Theory Inductive Inference Automata Theory Computational Complexity Mathematical Logic


Titolo Ordina per citazioni Ordina per anno Ordina per titolo	Citata da Citata da	Anno
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	319	2017
Randomness, relativization and Turing degrees A Nies, F Stephan, SA Terwijn The Journal of Symbolic Logic 70 (2), 515-535, 2005	175	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	146*	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	134	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	101	2019
Language learning from texts: mindchanges, limited memory and monotonicity E Kinber, F Stephan Information and Computation 123 (2), 224-241, 1995	91	1995
A cohesive set which is not high C Jockusch, F Stephan Mathematical Logic Quarterly 39 (1), 515-530, 1993	87	1993
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
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
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	59	2008
On the structure of degrees of inferability M Kummer, F Stephan Journal of Computer and System Sciences 52 (2), 214-238, 1996	59	1996
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	57	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

Il sistema al momento non può eseguire l'operazione. Riprova più tardi.

Articoli 1–20

Citazioni per anno

Citazioni duplicate

Citazioni unite

Aggiungi coautoriCoautori

Segui

Citata da

Coautori