Jacobo Torán

ORCID

Publication Activity (10 Years)

Years Active: 1987-2024
Publications (10 Years): 30

Top Venues

Electron. Colloquium Comput. Complex.

Dagstuhl Reports

SAT

IPEC

Publications

Lisa Jaser, Jacobo Torán
Pebble Games and Algebraic Proof Systems Meet Again. Electron. Colloquium Comput. Complex. (2024)
Tobias Heß, Sean Niklas Semmler, Chico Sundermann, Jacobo Torán, Thomas Thüm
Towards Deterministic Compilation of Binary Decision Diagrams From Feature Models. SPLC (A) (2024)
Lisa-Marie Jaser, Jacobo Torán
Pebble Games and Algebraic Proof Systems. MFCS (2024)
Jacobo Torán, Florian Wörz
Cutting Planes Width and the Complexity of Graph Isomorphism Refutations. Electron. Colloquium Comput. Complex. (2023)
Jacobo Torán, Florian Wörz
Number of Variables for Graph Differentiation and the Resolution of Graph Isomorphism Formulas. ACM Trans. Comput. Log. 24 (3) (2023)
Julian Nickerl, Jacobo Torán
Pure Nash equilibria in a generalization of congestion games allowing resource failures. Theor. Comput. Sci. 963 (2023)
Jacobo Torán, Florian Wörz
Cutting Planes Width and the Complexity of Graph Isomorphism Refutations. SAT (2023)
Jacobo Torán, Florian Wörz
Number of Variables for Graph Differentiation and the Resolution of GI Formulas. CSL (2022)
Markus Bläser, Valentine Kabanets, Ronen Shaltiel, Jacobo Torán
Algebraic and Analytic Methods in Computational Complexity (Dagstuhl Seminar 22371). Dagstuhl Reports 12 (9) (2022)
Vikraman Arvind, Johannes Köbler, Sebastian Kuhnert, Jacobo Torán
Parameterized Complexity of Small Weight Automorphisms and Isomorphisms. Algorithmica 83 (12) (2021)
Jacobo Torán, Florian Wörz
Number of Variables for Graph Identification and the Resolution of GI Formulas. Electron. Colloquium Comput. Complex. 28 (2021)
Julian Nickerl, Jacobo Torán
Pure Nash Equilibria in a Generalization of Congestion Games Allowing Resource Failures. SAGT (2021)
Jacobo Torán, Florian Wörz
Reversible Pebble Games and the Relation Between Tree-Like and General Resolution Space. Comput. Complex. 30 (1) (2021)
Jacobo Torán, Florian Wörz
Reversible Pebble Games and the Relation Between Tree-Like and General Resolution Space. STACS (2020)
Nicola Galesi, Navid Talebanfard, Jacobo Torán
Cops-Robber Games and the Resolution of Tseitin Formulas. ACM Trans. Comput. Theory 12 (2) (2020)
Jacobo Torán, Florian Wörz
Reversible Pebble Games and the Relation Between Tree-Like and General Resolution Space. Electron. Colloquium Comput. Complex. 26 (2019)
Nicola Galesi, Navid Talebanfard, Jacobo Torán
Cops-Robber Games and the Resolution of Tseitin Formulas. SAT (2018)
Markus Bläser, Valentine Kabanets, Jacobo Torán, Christopher Umans
Algebraic Methods in Computational Complexity (Dagstuhl Seminar 18391). Dagstuhl Reports 8 (9) (2018)
Nicola Galesi, Navid Talebanfard, Jacobo Torán
Cops-Robber games and the resolution of Tseitin formulas. Electron. Colloquium Comput. Complex. 25 (2018)
Vikraman Arvind, Johannes Köbler, Sebastian Kuhnert, Jacobo Torán
Finding Small Weight Isomorphisms with Additional Constraints is Fixed-Parameter Tractable. IPEC (2017)
Stefan Arnold, Jacobo Torán
A Deterministic Algorithm for Testing the Equivalence of Read-Once Branching Programs with Small Discrepancy. CiE (2017)
Vikraman Arvind, Johannes Köbler, Sebastian Kuhnert, Jacobo Torán
Finding Small Weight Isomorphisms with Additional Constraints is Fixed-Parameter Tractable. CoRR (2017)
Vikraman Arvind, Johannes Köbler, Sebastian Kuhnert, Jacobo Torán
Parameterized Complexity of Small Weight Automorphisms. STACS (2017)
Bireswar Das, Patrick Scharpfenecker, Jacobo Torán
CNF and DNF succinct graph encodings. Inf. Comput. 253 (2017)
Patrick Scharpfenecker, Jacobo Torán
Solution-Graphs of Boolean Formulas and Isomorphism. J. Satisf. Boolean Model. Comput. 10 (1) (2016)
Patrick Scharpfenecker, Jacobo Torán
Solution-Graphs of Boolean Formulas and Isomorphism. Electron. Colloquium Comput. Complex. 23 (2016)
Vikraman Arvind, Johannes Köbler, Sebastian Kuhnert, Jacobo Torán
Parameterized Complexity of Small Weight Automorphisms. Electron. Colloquium Comput. Complex. 23 (2016)
Vikraman Arvind, Johannes Köbler, Sebastian Kuhnert, Jacobo Torán
Solving Linear Equations Parameterized by Hamming Weight. Algorithmica 75 (2) (2016)
Patrick Scharpfenecker, Jacobo Torán
Solution-Graphs of Boolean Formulas and Isomorphism. SAT (2016)
Valentine Kabanets, Thomas Thierauf, Jacobo Torán, Christopher Umans
Algebraic Methods in Computational Complexity (Dagstuhl Seminar 16411). Dagstuhl Reports 6 (10) (2016)
László Babai, Anuj Dawar, Pascal Schweitzer, Jacobo Torán
The Graph Isomorphism Problem (Dagstuhl Seminar 15511). Dagstuhl Reports 5 (12) (2015)
Johannes Köbler, Jacobo Torán
Lowness results: the next generation. Bull. EATCS 117 (2015)
Bireswar Das, Patrick Scharpfenecker, Jacobo Torán
Succinct Encodings of Graph Isomorphism. Electron. Colloquium Comput. Complex. 22 (2015)
Vikraman Arvind, Johannes Köbler, Sebastian Kuhnert, Jacobo Torán
Solving Linear Equations Parameterized by Hamming Weight. IPEC (2014)
Bireswar Das, Patrick Scharpfenecker, Jacobo Torán
Succinct Encodings of Graph Isomorphism. LATA (2014)
Vikraman Arvind, Sebastian Kuhnert, Johannes Köbler, Jacobo Torán
Solving Linear Equations Parameterized by Hamming Weight. Electron. Colloquium Comput. Complex. 21 (2014)
Jacobo Torán
On the Resolution Complexity of Graph Non-isomorphism. SAT (2013)
Arkadev Chattopadhyay, Jacobo Torán, Fabian Wagner
Graph Isomorphism is Not AC0-Reducible to Group Isomorphism. ACM Trans. Comput. Theory 5 (4) (2013)
Bireswar Das, Jacobo Torán, Fabian Wagner
Restricted space algorithms for isomorphism on bounded treewidth graphs. Inf. Comput. 217 (2012)
Vikraman Arvind, Jacobo Torán
Solvable Group Isomorphism Is (Almost) in NP ∩ coNP. ACM Trans. Comput. Theory 2 (2) (2011)
Jacobo Torán
Reductions to Graph Isomorphism. Theory Comput. Syst. 47 (1) (2010)
Arkadev Chattopadhyay, Jacobo Torán, Fabian Wagner
Graph Isomorphism is not AC^0 reducible to Group Isomorphism. FSTTCS (2010)
Bireswar Das, Jacobo Torán, Fabian Wagner
Restricted Space Algorithms for Isomorphism on Bounded Treewidth Graphs CoRR (2010)
Arkadev Chattopadhyay, Jacobo Torán, Fabian Wagner
Graph Isomorphism is not AC^0 reducible to Group Isomorphism. Electron. Colloquium Comput. Complex. 17 (2010)
Bireswar Das, Jacobo Torán, Fabian Wagner
Restricted Space Algorithms for Isomorphism on Bounded Treewidth Graphs. STACS (2010)
Bireswar Das, Jacobo Torán, Fabian Wagner
Restricted Space Algorithms for Isomorphism on Bounded Treewidth Graphs. Electron. Colloquium Comput. Complex. 16 (2009)
Jacobo Torán, Fabian Wagner
The Complexity of Planar Graph Isomorphism. Bull. EATCS 97 (2009)
Jacobo Torán
Reductions to Graph Isomorphism. Electron. Colloquium Comput. Complex. 14 (071) (2007)
Jacobo Torán
Reductions to Graph Isomorphism. FSTTCS (2007)
Uwe Schöning, Jacobo Torán
A note on the size of Craig Interpolants. Circuits, Logic, and Games (2006)
Birgit 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) (2006)
Vikraman Arvind, Jacobo Torán
The Complexity of Quasigroup Isomorphism and the Minimum Generating Set Problem. ISAAC (2006)
Jacobo Torán
Arthur-Merlin Games and the Problem of Isomorphism Testing. CiE (2005)
Vikraman Arvind, Jacobo Torán
Isomorphism Testing: Perspective and Open Problems. Bull. EATCS 86 (2005)
Jacobo Torán
Space and Width in Propositional Resolution (Column: Computational Complexity). Bull. EATCS 83 (2004)
Vikraman Arvind, Jacobo Torán
Solvable Group Isomorphism is (almost) in NP\cap coNP Electron. Colloquium Comput. Complex. (008) (2004)
Vikraman Arvind, Jacobo Torán
Solvable Group Isomorphism. Computational Complexity Conference (2004)
Jacobo Torán
On the Hardness of Graph Isomorphism. SIAM J. Comput. 33 (5) (2004)
Juan Luis Esteban, Jacobo Torán
A Combinatorial Characterization of Treelike Resolution Space Electron. Colloquium Comput. Complex. (044) (2003)
Johannes Köbler, Jochen Messner, Jacobo Torán
Optimal proof systems imply complete sets for promise classes. Inf. Comput. 184 (1) (2003)
Juan Luis Esteban, Jacobo Torán
A combinatorial characterization of treelike resolution space. Inf. Process. Lett. 87 (6) (2003)
Birgit Jenner, Johannes Köbler, Pierre McKenzie, Jacobo Torán
Completeness results for graph isomorphism. J. Comput. Syst. Sci. 66 (3) (2003)
Johannes Köbler, Jacobo Torán
The Complexity of Graph Isomorphism for Colored Graphs with Color Classes of Size 2 and 3. STACS (2002)
Juan Luis Esteban, Jacobo Torán
Space Bounds for Resolution. Inf. Comput. 171 (1) (2001)
S. Baumer, Juan Luis Esteban, Jacobo Torán
Minimally Unsatisfiable CNF Formulas. Bull. EATCS 74 (2001)
Vikraman Arvind, Jacobo Torán
A nonadaptive NC checker for permutation group intersection. Theor. Comput. Sci. 259 (1-2) (2001)
Vikraman Arvind, Johannes Köbler, Martin Mundhenk, Jacobo Torán
Nondeterministic Instance Complexity and Hard-to-Prove Tautologies. STACS (2000)
Jacobo Torán
On the Hardness of Graph Isomorphism. FOCS (2000)
Jacobo Torán
Lower Bounds for Space in Resolution. CSL (1999)
Vikraman Arvind, Jacobo Torán
Sparse Sets, Approximable Sets, and Parallel Queries to NP. STACS (1999)
Juan Luis Esteban, Jacobo Torán
Space Bounds for Resolution. STACS (1999)
Vikraman Arvind, Jacobo Torán
Sparse Sets, Approximable Sets, and Parallel Queries to NP. Inf. Process. Lett. 69 (4) (1999)
Robert Beals, Richard Chang, William I. Gasarch, Jacobo Torán
On Finding the Number of Graph Automorphisms. Chic. J. Theor. Comput. Sci. 1999 (1999)
Vikraman Arvind, Jacobo Torán
Sparse Sets, Approximable Sets, and Parallel Queries to NP Electron. Colloquium Comput. Complex. 5 (27) (1998)
Jochen Meßner, Jacobo Torán
Optimal Proof Systems for Propositional Logic and Complete Sets. STACS (1998)
Birgit Jenner, Pierre McKenzie, Jacobo Torán
A Note on the Hardness of Tree Isomorphism. Computational Complexity Conference (1998)
Vikraman Arvind, Jacobo Torán
A Nonadaptive NC Checker for Permutation Group Intersection. Computational Complexity Conference (1997)
Jochen Meßner, Jacobo Torán
Optimal proof systems for Propositional Logic and complete sets Electron. Colloquium Comput. Complex. 4 (26) (1997)
Josep 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) (1997)
Josep Díaz, Maria J. Serna, Jacobo Torán
Parallel Approximation Schemes for Problems on Planar Graphs. Acta Informatica 33 (4) (1996)
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)
Birgit Jenner, Jacobo Torán
Computing Functions with Parallel Queries to NP. Theor. Comput. Sci. 141 (1&2) (1995)
Richard Chang, William I. Gasarch, Jacobo Torán
On Finding the Number of Graph Automorphisms. Computational Complexity Conference (1995)
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) (1995)
Birgit Jenner, Jacobo Torán
Computing Functions with Parallel Queries to NP. Computational Complexity Conference (1993)
Josep Díaz, Maria J. Serna, Jacobo Torán
Parallel Approximation Schemes for problems on planar graphs (Extended Abstract). ESA (1993)
Johannes Köbler, Uwe Schöning, Jacobo Torán
Graph Isomorphism is Low for PP. Comput. Complex. 2 (1992)
Antoni Lozano, Jacobo Torán
On the Nonuniform Complexity on the Graph Isomorphism Problem. Computational Complexity Conference (1992)
Johannes Köbler, Uwe Schöning, Jacobo Torán
Graph Isomorphism is Low for PP. STACS (1992)
Antoni Lozano, Jacobo Torán
On the Non-Uniform Complexity of the Graph Isomorphism Problem. Complexity Theory: Current Research (1992)
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) (1992)
Frederic Green, Johannes Köbler, Jacobo Torán
The Power of the Middle Bit. Computational Complexity Conference (1992)
Antoni Lozano, Jacobo Torán
Self-Reducible Sets of Small Sensity. Math. Syst. Theory 24 (2) (1991)
Josep Díaz, Alan Gibbons, Mike Paterson, Jacobo Torán
The MINSUMCUT Problem. WADS (1991)
Jacobo Torán
Complexity Classes Defined by Counting Quantifiers. J. ACM 38 (3) (1991)
Jacobo Torán
Counting the Number of Solutions. MFCS (1990)
Josep Díaz, Jacobo Torán
Classes of Bounded Nondeterminism. Math. Syst. Theory 23 (1) (1990)
Johannes Köbler, Uwe Schöning, Seinosuke Toda, Jacobo Torán
Turing Machines with few Accepting Computations and low Sets for PP. Computational Complexity Conference (1989)
Johannes Köbler, Uwe Schöning, Jacobo Torán
On Counting and Approximation. Acta Informatica 26 (4) (1989)
Carme Àlvarez, Josep Díaz, Jacobo Torán
Complexity Classes with Complete Problems Between P and NP-C. FCT (1989)

Jacobo Torán.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Jacobo Torán