Jacobo Toran

Cited by

	All	Since 2017
Citations	2671	461
h-index	26	11
i10-index	41	11

140

105

198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202215 26 24 39 56 67 74 61 68 89 51 54 67 50 68 86 96 91 114 131 126 91 108 102 114 109 88 88 103 79 71 70 98 39

Public access

View all

8 articles

0 articles

available

not available

Based on funding mandates

Co-authors

Johannes KoeblerProfessor of Theoretical Computer Science, Humboldt-University BerlinVerified email at informatik.hu-berlin.de
Uwe SchöningProfessor of Computer Science, Ulm University, retiredVerified 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
Thomas SchwentickProfessor of Computer Science, TU Dortmund UniversityVerified email at udo.edu
Frederic GreenClark UniversityVerified email at clarku.edu
Bireswar DasAssociate Professor, IIT GandhinagarVerified email at iitgn.ac.in
Mike PatersonEmeritus Professor of Computer Science, University of WarwickVerified email at warwick.ac.uk
Patrick ScharpfeneckerUniversity of UlmVerified email at uni-ulm.de
Anuj DawarUniversity of CambridgeVerified email at cl.cam.ac.uk
Laszlo BabaiUniversity of ChicagoVerified email at cs.uchicago.edu
Jose L. BalcazarProfessor, Computer Science, Universitat Politècnica de CatalunyaVerified email at upc.edu
Arkadev ChattopadhyayAssociate Professor at Tata Institute of Fundamental ResearchVerified email at tifr.res.in
Sebastian Kuhnertformerly Humboldt-Universität zu BerlinVerified email at sebastian-kuhnert.de
Kenneth ReganAssociate Professor, Department of Computer Science and Engineering, University at Buffalo (SUNY)Verified email at buffalo.edu
Carme Alvarez FauraPofessor Titular, Universitat Politècnica de CatalunyaVerified email at cs.upc.edu
Grammati PantziouProfessor, University of West Attica, GreeceVerified email at uniwa.gr

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	678	2012
On the hardness of graph isomorphism J Torán SIAM Journal on Computing 33 (5), 1093-1108, 2004	172	2004
On the hardness of Graph Isomorphism J Toran FOCS, 180--183, 2000	172*	2000
Complexity classes defined by counting quantifiers J Torán Journal of the ACM (JACM) 38 (3), 752-773, 1991	146	1991
Space bounds for resolution JL Esteban, J Torán Information and Computation 171 (1), 84-97, 2001	130	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	105	1992
Graph isomorphism is low for PP J Köbler, U Schöning, J Torán Computational Complexity 2 (4), 301-330, 1992	91	1992
On counting and approximation J Köbler, U Schöning, J Torán Acta Informatica 26 (4), 363-379, 1989	90	1989
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	77	2003
The complexity of algorithmic problems on succinct instances JL Balcázar, A Lozano, J Torán Computer Science, 351-377, 1992	76	1992
Computing functions with parallel queries to NP B Jenner, J Torán Theoretical Computer Science 141 (1-2), 175-193, 1995	68	1995
Classes of bounded nondeterminism J Diaz, J Torán Mathematical Systems Theory 23 (1), 21-32, 1990	67	1990
Isomorphism testing: Perspective and open problems V Arvind, J Torán	65	2005
Structural properties of the counting hierarchies J Toran Universitat Politècnica de Catalunya, Barcelona, Spain, 1988	65	1988
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	58	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
A combinatorial characterization of treelike resolution space JL Esteban, J Torán Information Processing Letters 87 (6), 295-300, 2003	39	2003
Space bounds for resolution JL Esteban, J Torán Annual Symposium on Theoretical Aspects of Computer Science, 551-560, 1999	35	1999
On the Non-Uniform Complexity of the Graph Isomorphism Problem. A Lozano, J Torán Complexity Theory: Current Research, 245-271, 1992	35	1992

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

Follow this author

Cited by

Co-authors