dblp.uni-trier.dewww.uni-trier.de

Jacobo Torán Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
Home Page

*2007
57EEJacobo Torán: Reductions to Graph Isomorphism. FSTTCS 2007: 158-167
56EEJacobo Torán: Reductions to Graph Isomorphism. Electronic Colloquium on Computational Complexity (ECCC) 14(071): (2007)
2006
55EEUwe Schöning, Jacobo Torán: A note on the size of Craig Interpolants. Circuits, Logic, and Games 2006
54EEVikraman Arvind, Jacobo Torán: The Complexity of Quasigroup Isomorphism and the Minimum Generating Set Problem. ISAAC 2006: 233-242
53EEBirgit Jenner, Johannes Köbler, Pierre McKenzie, Jacobo Torán: Corrigendum to "Completeness results for graph isomorphism" [J. Comput. System Sci. 66(2003) 549-566]. J. Comput. Syst. Sci. 72(4): 783 (2006)
2005
52EEJacobo Torán: Arthur-Merlin Games and the Problem of Isomorphism Testing. CiE 2005: 495-506
51 Vikraman Arvind, Jacobo Torán: Isomorphism Testing: Perspective and Open Problems. Bulletin of the EATCS 86: 66-84 (2005)
2004
50EEVikraman Arvind, Jacobo Torán: Solvable Group Isomorphism. IEEE Conference on Computational Complexity 2004: 91-103
49 Jacobo Torán: Space and Width in Propositional Resolution (Column: Computational Complexity). Bulletin of the EATCS 83: 86-104 (2004)
48EEVikraman Arvind, Jacobo Torán: Solvable Group Isomorphism is (almost) in NP\cap coNP Electronic Colloquium on Computational Complexity (ECCC)(008): (2004)
47EEJacobo Torán: On the Hardness of Graph Isomorphism. SIAM J. Comput. 33(5): 1093-1108 (2004)
2003
46EEJuan Luis Esteban, Jacobo Torán: A Combinatorial Characterization of Treelike Resolution Space Electronic Colloquium on Computational Complexity (ECCC)(044): (2003)
45EEJohannes Köbler, Jochen Messner, Jacobo Torán: Optimal proof systems imply complete sets for promise classes. Inf. Comput. 184(1): 71-92 (2003)
44EEJuan Luis Esteban, Jacobo Torán: A combinatorial characterization of treelike resolution space. Inf. Process. Lett. 87(6): 295-300 (2003)
43EEBirgit Jenner, Johannes Köbler, Pierre McKenzie, Jacobo Torán: Completeness results for graph isomorphism. J. Comput. Syst. Sci. 66(3): 549-566 (2003)
2002
42EEJohannes Köbler, Jacobo Torán: The Complexity of Graph Isomorphism for Colored Graphs with Color Classes of Size 2 and 3. STACS 2002: 121-132
2001
41 S. Baumer, Juan Luis Esteban, Jacobo Torán: Minimally Unsatisfiable CNF Formulas. Bulletin of the EATCS 74: 190-192 (2001)
40 Juan Luis Esteban, Jacobo Torán: Space Bounds for Resolution. Inf. Comput. 171(1): 84-97 (2001)
39EEVikraman Arvind, Jacobo Torán: A nonadaptive NC checker for permutation group intersection. Theor. Comput. Sci. 259(1-2): 597-611 (2001)
2000
38 Jacobo Torán: On the Hardness of Graph Isomorphism. FOCS 2000: 180-186
37EEVikraman Arvind, Johannes Köbler, Martin Mundhenk, Jacobo Torán: Nondeterministic Instance Complexity and Hard-to-Prove Tautologies. STACS 2000: 314-323
1999
36EEJacobo Torán: Lower Bounds for Space in Resolution. CSL 1999: 362-373
35EEVikraman Arvind, Jacobo Torán: Sparse Sets, Approximable Sets, and Parallel Queries to NP. STACS 1999: 281-290
34EEJuan Luis Esteban, Jacobo Torán: Space Bounds for Resolution. STACS 1999: 551-560
33EERobert Beals, Richard Chang, William I. Gasarch, Jacobo Torán: On Finding the Number of Graph Automorphisms. Chicago J. Theor. Comput. Sci. 1999: (1999)
32EEVikraman Arvind, Jacobo Torán: Sparse Sets, Approximable Sets, and Parallel Queries to NP. Inf. Process. Lett. 69(4): 181-188 (1999)
1998
31EEBirgit Jenner, Pierre McKenzie, Jacobo Torán: A Note on the Hardness of Tree Isomorphism. IEEE Conference on Computational Complexity 1998: 101-105
30EEJochen Meßner, Jacobo Torán: Optimal Proof Systems for Propositional Logic and Complete Sets. STACS 1998: 477-487
29EEVikraman Arvind, Jacobo Torán: Sparse Sets, Approximable Sets, and Parallel Queries to NP Electronic Colloquium on Computational Complexity (ECCC) 5(27): (1998)
1997
28EEVikraman Arvind, Jacobo Torán: A Nonadaptive NC Checker for Permutation Group Intersection. IEEE Conference on Computational Complexity 1997: 204-212
27EEJochen Meßner, Jacobo Torán: Optimal proof systems for Propositional Logic and complete sets Electronic Colloquium on Computational Complexity (ECCC) 4(26): (1997)
26EEJosep Díaz, Alan Gibbons, Grammati E. Pantziou, Maria J. Serna, Paul G. Spirakis, Jacobo Torán: Parallel Algorithms for the Minimum Cut and the Minimum Length Tree Layout Problems. Theor. Comput. Sci. 181(2): 267-287 (1997)
1996
25 Josep Díaz, Maria J. Serna, Jacobo Torán: Parallel Approximation Schemes for Problems on Planar Graphs. Acta Inf. 33(4): 387-408 (1996)
1995
24 Josep Díaz, Alan Gibbons, Grammati E. Pantziou, Maria J. Serna, Paul G. Spirakis, Jacobo Torán: Efficient Parallel Algorithms for some Tree Layout Problems. COCOON 1995: 313-323
23 Richard Chang, William I. Gasarch, Jacobo Torán: On Finding the Number of Graph Automorphisms. Structure in Complexity Theory Conference 1995: 288-298
22 Frederic Green, Johannes Köbler, Kenneth W. Regan, Thomas Schwentick, Jacobo Torán: The Power of the Middle Bit of a #P Function. J. Comput. Syst. Sci. 50(3): 456-467 (1995)
21EEBirgit Jenner, Jacobo Torán: Computing Functions with Parallel Queries to NP. Theor. Comput. Sci. 141(1&2): 175-193 (1995)
1993
20EEJosep Díaz, Maria J. Serna, Jacobo Torán: Parallel Approximation Schemes for problems on planar graphs (Extended Abstract). ESA 1993: 145-156
19 Birgit Jenner, Jacobo Torán: Computing Functions with Parallel Queries to NP. Structure in Complexity Theory Conference 1993: 280-291
1992
18 Antoni Lozano, Jacobo Torán: On the Non-Uniform Complexity of the Graph Isomorphism Problem. Complexity Theory: Current Research 1992: 245-271
17EEJohannes Köbler, Uwe Schöning, Jacobo Torán: Graph Isomorphism is Low for PP. STACS 1992: 401-411
16 Frederic Green, Johannes Köbler, Jacobo Torán: The Power of the Middle Bit. Structure in Complexity Theory Conference 1992: 111-117
15 Antoni Lozano, Jacobo Torán: On the Nonuniform Complexity on the Graph Isomorphism Problem. Structure in Complexity Theory Conference 1992: 118-129
14 Johannes Köbler, Uwe Schöning, Jacobo Torán: Graph Isomorphism is Low for PP. Computational Complexity 2: 301-330 (1992)
13 Johannes Köbler, Uwe Schöning, Seinosuke Toda, Jacobo Torán: Turing Machines with Few Accepting Computations and Low Sets for PP. J. Comput. Syst. Sci. 44(2): 272-286 (1992)
1991
12 Josep Díaz, Alan Gibbons, Mike Paterson, Jacobo Torán: The MINSUMCUT Problem. WADS 1991: 65-89
11EEJacobo Torán: Complexity Classes Defined by Counting Quantifiers. J. ACM 38(3): 753-774 (1991)
10 Antoni Lozano, Jacobo Torán: Self-Reducible Sets of Small Sensity. Mathematical Systems Theory 24(2): 83-100 (1991)
1990
9EEJacobo Torán: Counting the Number of Solutions. MFCS 1990: 121-134
8 Josep Díaz, Jacobo Torán: Classes of Bounded Nondeterminism. Mathematical Systems Theory 23(1): 21-32 (1990)
1989
7 Carme Àlvarez, Josep Díaz, Jacobo Torán: Complexity Classes with Complete Problems Between P and NP-C. FCT 1989: 13-24
6EEJacobo Torán: A Combinatorial Technique for Separating Counting Complexity Classes. ICALP 1989: 733-744
5 Johannes Köbler, Uwe Schöning, Seinosuke Toda, Jacobo Torán: Turing Machines with few Accepting Computations and low Sets for PP. Structure in Complexity Theory Conference 1989: 208-215
4 Johannes Köbler, Uwe Schöning, Jacobo Torán: On Counting and Approximation. Acta Inf. 26(4): 363-379 (1989)
1988
3EEJacobo Torán: Succinct Representations of Counting Problems. AAECC 1988: 415-426
2EEJohannes Köbler, Uwe Schöning, Jacobo Torán: On Counting and Approximation. CAAP 1988: 40-51
1987
1 Jacobo Torán: On The Complexity of Computable Real Sequences. ITA 21(2): 175-180 (1987)

Coauthor Index

1Carme Àlvarez [7]
2Vikraman Arvind [28] [29] [32] [35] [37] [39] [48] [50] [51] [54]
3S. Baumer [41]
4Robert Beals [33]
5Richard Chang [23] [33]
6Josep Díaz [7] [8] [12] [20] [24] [25] [26]
7Juan Luis Esteban [34] [40] [41] [44] [46]
8William I. Gasarch [23] [33]
9Alan Gibbons [12] [24] [26]
10Frederic Green [16] [22]
11Birgit Jenner [19] [21] [31] [43] [53]
12Johannes Köbler [2] [4] [5] [13] [14] [16] [17] [22] [37] [42] [43] [45] [53]
13Antoni Lozano [10] [15] [18]
14Pierre McKenzie [31] [43] [53]
15Jochen Messner (Jochen Meßner) [27] [30] [45]
16Martin Mundhenk [37]
17Grammati E. Pantziou [24] [26]
18Mike Paterson [12]
19Kenneth W. Regan [22]
20Uwe Schöning [2] [4] [5] [13] [14] [17] [55]
21Thomas Schwentick [22]
22Maria J. Serna [20] [24] [25] [26]
23Paul G. Spirakis [24] [26]
24Seinosuke Toda [5] [13]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)