Jacobo Toran

Cited by

	All	Since 2016
Citations	2534	415
h-index	26	10
i10-index	40	10

140

105

19881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020217 17 28 24 41 57 67 74 57 70 92 55 57 58 55 67 84 100 90 114 128 124 88 109 101 121 104 88 87 104 75 64 84 1

Co-authors

Johannes KoeblerProfessor of Theoretical Computer Science, Humboldt-University BerlinVerified email at informatik.hu-berlin.de
Uwe SchöningProfessor of Computer Science, Ulm UniversityVerified email at uni-ulm.de
VIkraman ArvindProfessor, Computer Science, Institute of Mathematical Sciences, Chennai, IndiaVerified email at imsc.res.in
Maria SernaProfessor. Computer Science. Universitat Politecnica de Catalunya. Barcelona TechVerified email at cs.upc.edu
Antoni LozanoProfessor of Computer Science, Universitat Politècnica de CatalunyaVerified email at cs.upc.edu
Alan GibbonsWarwick University, Liverpool University, Kings College LondonVerified email at kcl.ac.uk
Paul SpirakisProfessor of Computer Science U. Liverpool and U. PatrasVerified email at liverpool.ac.uk
Frederic GreenClark UniversityVerified email at clarku.edu
Thomas SchwentickProfessor of Computer Science, TU Dortmund UniversityVerified email at udo.edu
Jose L. BalcazarProfessor, Computer Science, Universitat Politècnica de CatalunyaVerified email at upc.edu
Mike PatersonEmeritus Professor of Computer Science, University of WarwickVerified email at warwick.ac.uk
Patrick ScharpfeneckerUniversity of UlmVerified email at uni-ulm.de
Kenneth ReganAssociate Professor, Department of Computer Science and Engineering, University at Buffalo (SUNY)Verified email at buffalo.edu
Anuj DawarUniversity of CambridgeVerified email at cl.cam.ac.uk
Grammati PantziouProfessor, University of West Attica, GreeceVerified email at uniwa.gr
Sebastian Kuhnertformerly Humboldt-Universität zu BerlinVerified email at sebastian-kuhnert.de
Carme Alvarez FauraPofessor Titular, Universitat Politècnica de CatalunyaVerified email at cs.upc.edu
Arkadev ChattopadhyayAssociate Professor at Tata Institute of Fundamental ResearchVerified email at tifr.res.in
Nicola GalesiSapienza University RomeVerified email at di.uniroma1.it
Navid TalebanfardInstitute of Mathematics of the Czech Academy of SciencesVerified email at math.cas.cz

Jacobo Toran

Professor for theoretical computer science, University of Ulm

Verified email at uni-ulm.de

Theoretical computer science


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
The graph isomorphism problem: its structural complexity J Kobler, U Schöning, J Torán Springer Science & Business Media, 2012	653	2012
On the hardness of graph isomorphism J Torán SIAM Journal on Computing 33 (5), 1093-1108, 2004	153	2004
On the hardness of Graph Isomorphism J Toran FOCS, 180--183, 2000	153*	2000
Complexity classes defined by counting quantifiers J Torán Journal of the ACM (JACM) 38 (3), 752-773, 1991	143	1991
Space bounds for resolution JL Esteban, J Torán Information and Computation 171 (1), 84-97, 2001	115	2001
Turing machines with few accepting computations and low sets for PP J Kobler, U Schöning, S Toda, J Torán Journal of Computer and System Sciences 44 (2), 272-286, 1992	99	1992
On counting and approximation J Köbler, U Schöning, J Torán Acta Informatica 26 (4), 363-379, 1989	88	1989
Graph isomorphism is low for PP J Köbler, U Schöning, J Torán Computational Complexity 2 (4), 301-330, 1992	82	1992
The complexity of algorithmic problems on succinct instances JL Balcázar, A Lozano, J Torán Computer Science, 351-377, 1992	79	1992
Completeness results for graph isomorphism B Jenner, J Köbler, P McKenzie, J Torán Journal of Computer and System Sciences 66 (3), 549-566, 2003	76	2003
Structural properties of the counting hierarchies J Toran Universitat Politècnica de Catalunya, Barcelona, Spain, 1988	70	1988
Computing functions with parallel queries to NP B Jenner, J Torán [1993] Proceedings of the Eigth Annual Structure in Complexity Theory …, 1993	67	1993
Isomorphism testing: Perspective and open problems V Arvind, J Torán	60	2005
Classes of bounded nondeterminism J Diaz, J Toran Mathematical Systems Theory 23 (1), 21-32, 1990	60	1990
Optimal proof systems imply complete sets for promise classes J Köbler, J Messner, J Torán Information and Computation 184 (1), 71-92, 2003	53	2003
The power of the middle bit of a# P function F Green, J Kobler, KW Regan, T Schwentick, J Torán Journal of Computer and System Sciences 50 (3), 456-467, 1995	51	1995
An oracle characterization of the counting hierarchy J Torán 1988 Structure in Complexity Theory Third Annual Conference, 213,214,215,216 …, 1988	43	1988
On the Non-Uniform Complexity of the Graph Isomorphism Problem. A Lozano, J Torán Complexity Theory: Current Research, 245-271, 1992	39	1992
Space bounds for resolution JL Esteban, J Torán Annual Symposium on Theoretical Aspects of Computer Science, 551-560, 1999	34	1999
A combinatorial characterization of treelike resolution space JL Esteban, J Torán Information Processing Letters 87 (6), 295-300, 2003	32	2003

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Upload PDF

Follow this author

Cited by

Co-authors