Jacobo Toran

Cited by

	All	Since 2019
Citations	2989	482
h-index	27	11
i10-index	46	14

140

105

19891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202416 32 33 44 62 63 68 65 71 92 56 60 62 65 78 85 92 103 124 131 129 94 114 100 124 115 90 95 104 78 70 74 84 80 96 76

Public access

View all

8 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
Florian WörzInstitut für Theoretische Informatik, Universität UlmVerified email at uni-ulm.de
Mike PatersonEmeritus Professor of Computer Science, University of WarwickVerified email at warwick.ac.uk
Patrick ScharpfeneckerUniversity of Applied Sciences KemptenVerified email at hs-kempten.de
Jose L. BalcazarProfessor, Computer Science, Universitat Politècnica de CatalunyaVerified email at upc.edu
Arkadev ChattopadhyayProfessor 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	744	2012
On the hardness of Graph Isomorphism J Toran FOCS, 180--183, 2000	186*	2000
Complexity classes defined by counting quantifiers J Torán Journal of the ACM (JACM) 38 (3), 752-773, 1991	159	1991
Space bounds for resolution JL Esteban, J Torán Information and Computation 171 (1), 84-97, 2001	142	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	112	1992
On counting and approximation J Köbler, U Schöning, J Torán Acta Informatica 26 (4), 363-379, 1989	99	1989
Graph isomorphism is low for PP J Köbler, U Schöning, J Torán Computational Complexity 2, 301-330, 1992	96	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	83	2003
The complexity of algorithmic problems on succinct instances JL Balcázar, A Lozano, J Torán Computer science: research and applications, 351-377, 1992	81	1992
Computing functions with parallel queries to NP B Jenner, J Torán [1993] Proceedings of the Eigth Annual Structure in Complexity Theory …, 1993	73	1993
Structural properties of the counting hierarchies J Torán Universitat Politècnica de Catalunya, Barcelona, Spain, 1988	72	1988
Isomorphism testing: Perspective and open problems V Arvind, J Torán	68	2005
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	66	2003
Classes of bounded nondeterminism J Diaz, J Torán Mathematical Systems Theory 23 (1), 21-32, 1990	65	1990
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	54	1995
The Satisfiability Problem: Algorithms and Analyses U Schöning, J Toran The Satisfiability Problem: Algorithms and Analyses, 184, 2013	50	2013
An oracle characterization of the counting hierarchy J Toràn 1988 Structure in Complexity Theory Third Annual Conference, 213,214,215,216 …, 1988	49	1988
A combinatorial characterization of treelike resolution space JL Esteban, J Torán Information Processing Letters 87 (6), 295-300, 2003	42	2003
On the Non-Uniform Complexity of the Graph Isomorphism Problem. A Lozano, J Torán Complexity Theory: Current Research, 245-271, 1992	40	1992
Space bounds for resolution JL Esteban, J Torán Annual Symposium on Theoretical Aspects of Computer Science, 551-560, 1999	37	1999

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