Jacobo Toran

Cited by

	All	Since 2018
Citations	2859	476
h-index	25	12
i10-index	44	12

140

105

1989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202317 30 35 38 64 61 66 63 70 93 52 57 69 64 77 85 92 98 121 133 127 94 108 99 116 111 88 91 105 80 66 75 86 77 91

Public access

View all

7 articles

1 article

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
Juan Luis Esteban AngelesComputer Science Department, Universitat Politècnica de CatalunyaVerified email at upc.edu
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
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
Mike PatersonEmeritus Professor of Computer Science, University of WarwickVerified email at warwick.ac.uk
Florian WörzInstitut für Theoretische Informatik, Universität UlmVerified email at uni-ulm.de
Patrick ScharpfeneckerUniversity of Applied Sciences KemptenVerified email at hs-kempten.de
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

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	726	2012
On the hardness of graph isomorphism J Torán SIAM Journal on Computing 33 (5), 1093-1108, 2004	180	2004
On the hardness of Graph Isomorphism J Toran FOCS, 180--183, 2000	180*	2000
Space bounds for resolution JL Esteban, J Torán Information and Computation 171 (1), 84-97, 2001	158	2001
Complexity classes defined by counting quantifiers J Torán Journal of the ACM (JACM) 38 (3), 752-773, 1991	152	1991
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	107	1992
On counting and approximation J Köbler, U Schöning, J Torán Acta Informatica 26, 363-379, 1989	98	1989
Graph isomorphism is low for PP J Köbler, U Schöning, J Torán Computational Complexity 2, 301-330, 1992	96	1992
The complexity of algorithmic problems on succinct instances JL Balcázar, A Lozano, J Torán Computer science: research and applications, 351-377, 1992	82	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	81	2003
Computing functions with parallel queries to NP B Jenner, J Torán [1993] Proceedings of the Eigth Annual Structure in Complexity Theory …, 1993	72	1993
Structural properties of the counting hierarchies J Torán Universitat Politècnica de Catalunya, Barcelona, Spain, 1988	69	1988
Isomorphism testing: Perspective and open problems V Arvind, J Torán	67	2005
Classes of bounded nondeterminism J Diaz, J Torán Mathematical Systems Theory 23 (1), 21-32, 1990	66	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	64	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	52	1995
An oracle characterization of the counting hierarchy J Toràn 1988 Structure in Complexity Theory Third Annual Conference, 213,214,215,216 …, 1988	46	1988
The Satisfiability Problem: Algorithms and Analyses U Schöning, J Toran The Satisfiability Problem: Algorithms and Analyses, 184, 2013	42	2013
On the Non-Uniform Complexity of the Graph Isomorphism Problem. A Lozano, J Torán Complexity Theory: Current Research, 245-271, 1992	40	1992
A combinatorial characterization of treelike resolution space JL Esteban, J Torán Information Processing Letters 87 (6), 295-300, 2003	39	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

Follow

Cited by

Co-authors