Frank Stephan

Citirano

	Sve	Od 2020.
Citati	4629	881
H-indeks	34	14
i10-indeks	115	20

240

120

180

19931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202512 32 40 34 66 63 69 35 88 68 108 120 125 186 206 217 155 217 201 231 182 187 161 217 211 225 182 187 182 188 119 176 28

Javni pristup

Prikaži sve

22 članka

0 članaka

dostupno

nije dostupno

Na temelju uvjeta financiranja

Suautori

Sanjay JainProfessor of Computer Science, National University of SingaporePotvrđena adresa e-pošte na comp.nus.edu.sg
Andre NiesUniversity of AucklandPotvrđena adresa e-pošte na cs.auckland.ac.nz
John CaseEmeritus Professor of Computer and Information Sciences, University of DelawarePotvrđena adresa e-pošte na mail.eecis.udel.edu
Bakh KhoussainovProfessor, The Algorithms and Logic Group (ALG), UESTCPotvrđena adresa e-pošte na uestc.edu.cn
Wolfgang MerkleSenior Lecturer, Heidelberg UniversityPotvrđena adresa e-pošte na math.uni-heidelberg.de
Cristian S. CaludeProfessor of Computer Science, The University of AucklandPotvrđena adresa e-pošte na cs.auckland.ac.nz
Bjørn Kjos-HanssenProfessor of Mathematics, University of Hawaii at ManoaPotvrđena adresa e-pošte na hawaii.edu
Richard BeigelTemple UniversityPotvrđena adresa e-pošte na temple.edu
Guohua WuNanyang Technological UniversityPotvrđena adresa e-pošte na ntu.edu.sg
Sasha RubinUniversity of SydneyPotvrđena adresa e-pošte na sydney.edu.au
Lorenzo CarlucciDepartment of Mathematics, University of Roma La SapienzaPotvrđena adresa e-pošte na uniroma1.it
Yu, LiangNanjing universityPotvrđena adresa e-pošte na nju.edu.cn
Sebastiaan TerwijnRadboud University NijmegenPotvrđena adresa e-pošte na math.ru.nl
Jan ReimannAssociate Professor of Mathematics, Pennsylvania State UniversityPotvrđena adresa e-pošte na math.psu.edu
Lance FortnowIllinois Institute of TechnologyPotvrđena adresa e-pošte na iit.edu
Rupert HölzlUniversität der Bundeswehr MünchenPotvrđena adresa e-pošte na hoelzl.fr
Pavel SemukhinLiverpool John Moores UniversityPotvrđena adresa e-pošte na semukhin.name
Santiago FigueiraUniversity of Buenos Aires and CONICETPotvrđena adresa e-pošte na dc.uba.ar
Ludwig StaigerProfessor of Computer Science, Martin-Luther-Universität Halle-WittenbergPotvrđena adresa e-pošte na informatik.uni-halle.de
Carl JockuschProfessor Emeritus of Mathematics, University of Illinois at Urbana-ChampaignPotvrđena adresa e-pošte na math.uiuc.edu

Prati

Frank Stephan

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

Potvrđena adresa e-pošte na comp.nus.edu.sg - Početna stranica

Recursion Theory Inductive Inference Automata Theory Computational Complexity Mathematical Logic


Naslov Poredaj po navodima Poredaj po godini Poredaj po naslovu	Citirano Citirano	Godina
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	329	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	149*	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	135	2003
Approximable sets R Beigel, M Kummer, F Stephan Information and Computation 120 (2), 304-314, 1995	131	1995
Using random sets as oracles DR Hirschfeldt, A Nies, F Stephan Journal of the London Mathematical Society 75 (3), 610-622, 2007	110	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	100	2019
Language learning from texts: mindchanges, limited memory and monotonicity E Kinber, F Stephan Information and Computation 123 (2), 224-241, 1995	94	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	88	2006
A cohesive set which is not high C Jockusch, F Stephan Mathematical Logic Quarterly 39 (1), 515-530, 1993	88	1993
Automatic linear orders and trees B Khoussainov, S Rubin, F Stephan ACM Transactions on Computational Logic (TOCL) 6 (4), 675-700, 2005	81	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	77	2006
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	75	1994
Lowness for the class of Schnorr random reals B Kjos-Hanssen, A Nies, F Stephan SIAM Journal on Computing 35 (3), 647-657, 2005	73*	2005
On the structure of degrees of inferability M Kummer, F Stephan Journal of Computer and System Sciences 52 (2), 214-238, 1996	63	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	59	2008
When unlearning helps G Baliga, J Case, W Merkle, F Stephan, R Wiehagen Information and Computation 206, 694-709, 2008	59*	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	58	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	56	2001

Sustav trenutno ne može provesti ovu radnju. Pokušajte ponovo kasnije.

Članci 1–20

Godišnji broj citata

Dvostruki navodi

Spojeni navodi

Dodavanje suautoraSuautori

Prati

Citirano

Suautori