Jacobo Toran

Citée par

	Toutes	Depuis 2016
Citations	2543	428
indice h	25	10
indice i10	40	10

140

105

19891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202115 28 26 36 57 68 75 59 66 87 52 55 62 57 68 90 93 91 113 130 126 87 108 104 120 109 85 88 101 75 67 85 11

Coauteurs

Johannes KoeblerProfessor of Theoretical Computer Science, Humboldt-University BerlinAdresse e-mail validée de informatik.hu-berlin.de
Uwe SchöningProfessor of Computer Science, Ulm UniversityAdresse e-mail validée de uni-ulm.de
VIkraman ArvindProfessor, Computer Science, Institute of Mathematical Sciences, Chennai, IndiaAdresse e-mail validée de imsc.res.in
Maria SernaProfessor. Computer Science. Universitat Politecnica de Catalunya. Barcelona TechAdresse e-mail validée de cs.upc.edu
Antoni LozanoProfessor of Computer Science, Universitat Politècnica de CatalunyaAdresse e-mail validée de cs.upc.edu
Alan GibbonsWarwick University, Liverpool University, Kings College LondonAdresse e-mail validée de kcl.ac.uk
Paul SpirakisProfessor of Computer Science U. Liverpool and U. PatrasAdresse e-mail validée de liverpool.ac.uk
Frederic GreenClark UniversityAdresse e-mail validée de clarku.edu
Thomas SchwentickProfessor of Computer Science, TU Dortmund UniversityAdresse e-mail validée de udo.edu
Mike PatersonEmeritus Professor of Computer Science, University of WarwickAdresse e-mail validée de warwick.ac.uk
Jose L. BalcazarProfessor, Computer Science, Universitat Politècnica de CatalunyaAdresse e-mail validée de upc.edu
Patrick ScharpfeneckerUniversity of UlmAdresse e-mail validée de uni-ulm.de
Anuj DawarUniversity of CambridgeAdresse e-mail validée de cl.cam.ac.uk
Bireswar DasAssociate Professor, IIT GandhinagarAdresse e-mail validée de iitgn.ac.in
Kenneth ReganAssociate Professor, Department of Computer Science and Engineering, University at Buffalo (SUNY)Adresse e-mail validée de buffalo.edu
Grammati PantziouProfessor, University of West Attica, GreeceAdresse e-mail validée de uniwa.gr
Sebastian Kuhnertformerly Humboldt-Universität zu BerlinAdresse e-mail validée de sebastian-kuhnert.de
Carme Alvarez FauraPofessor Titular, Universitat Politècnica de CatalunyaAdresse e-mail validée de cs.upc.edu
Arkadev ChattopadhyayAssociate Professor at Tata Institute of Fundamental ResearchAdresse e-mail validée de tifr.res.in
Nicola GalesiSapienza University RomeAdresse e-mail validée de di.uniroma1.it

Jacobo Toran

Professor for theoretical computer science, University of Ulm

Adresse e-mail validée de uni-ulm.de

Theoretical computer science


Titre Trier par citations Trier par année Trier par titre	Citée par Citée par	Année
The graph isomorphism problem: its structural complexity J Kobler, U Schöning, J Torán Springer Science & Business Media, 2012	650	2012
On the hardness of graph isomorphism J Torán SIAM Journal on Computing 33 (5), 1093-1108, 2004	157	2004
On the hardness of Graph Isomorphism J Toran FOCS, 180--183, 2000	157*	2000
Complexity classes defined by counting quantifiers J Torán Journal of the ACM (JACM) 38 (3), 752-773, 1991	141	1991
Space bounds for resolution JL Esteban, J Torán Information and Computation 171 (1), 84-97, 2001	122	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	100	1992
On counting and approximation J Köbler, U Schöning, J Torán Acta Informatica 26 (4), 363-379, 1989	91	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
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
The complexity of algorithmic problems on succinct instances JL Balcázar, A Lozano, J Torán Computer Science, 351-377, 1992	71	1992
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
Structural properties of the counting hierarchies J Toran Ph. D. Thesis, 1988	66	1988
Isomorphism testing: Perspective and open problems V Arvind, J Torán	60	2005
Classes of bounded nondeterminism J Diaz, J Torán 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	56	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	41	1988
On the Non-Uniform Complexity of the Graph Isomorphism Problem. A Lozano, J Torán Complexity Theory: Current Research, 245-271, 1992	37	1992
A combinatorial characterization of treelike resolution space JL Esteban, J Torán Information Processing Letters 87 (6), 295-300, 2003	36	2003
Solvable Group Isomorphism Is (Almost) in NP∩ coNP V Arvind, J Torán ACM Transactions on Computation Theory (TOCT) 2 (2), 4, 2011	33*	2011

Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.

Articles 1–20

Nombre de citations par an

Citations en double

Citations fusionnées

Ajouter les coauteursCoauteurs

Importer un PDF

Suivre les mises à jour de cet auteur

Citée par

Coauteurs