On The Complexity of Computable Real Sequences. - Jacobo Torán (RAIRO Theor. Informatics Appl., 1987)

Succinct Representations of Counting Problems. - Jacobo Torán (AAECC, 1988)

An oracle characterization of the counting hierarchy. - Jacobo Torán (SCT, 1988)

Complexity Classes with Complete Problems Between P and NP-C. - Carme Àlvarez; Josep Díaz; Jacobo Torán (FCT, 1989)

A Combinatorial Technique for Separating Counting Complexity Classes. - Jacobo Torán (ICALP, 1989)

On Counting and Approximation. - Johannes Köbler; Uwe Schöning; Jacobo Torán (Acta Informatica, 1989)

Counting the Number of Solutions. - Jacobo Torán (MFCS, 1990)

Classes of Bounded Nondeterminism. - Josep Díaz; Jacobo Torán (Math. Syst. Theory, 1990)

The MINSUMCUT Problem. - Josep Díaz; Alan Gibbons; Mike Paterson; Jacobo Torán (WADS, 1991)

Complexity Classes Defined by Counting Quantifiers. - Jacobo Torán (J. ACM, 1991)

Self-Reducible Sets of Small Sensity. - Antoni Lozano; Jacobo Torán (Math. Syst. Theory, 1991)

The Power of the Middle Bit. - Frederic Green; Johannes Köbler; Jacobo Torán (SCT, 1992)

On the Nonuniform Complexity on the Graph Isomorphism Problem. - Antoni Lozano; Jacobo Torán (SCT, 1992)

On the Non-Uniform Complexity of the Graph Isomorphism Problem. - Antoni Lozano; Jacobo Torán (Complexity Theory: Current Research, 1992)

Graph Isomorphism is Low for PP. - Johannes Köbler; Uwe Schöning; Jacobo Torán (Comput. Complex., 1992)

Turing Machines with Few Accepting Computations and Low Sets for PP. - Johannes Köbler; Uwe Schöning; Seinosuke Toda; Jacobo Torán (J. Comput. Syst. Sci., 1992)

The Graph Isomorphism Problem: Its Structural Complexity - Johannes Köbler; Uwe Schöning; Jacobo Torán (Birkhäuser/Springer, 1993)

Parallel Approximation Schemes for problems on planar graphs (Extended Abstract). - Josep Díaz; Maria J. Serna; Jacobo Torán (ESA, 1993)

On Finding the Number of Graph Automorphisms. - Richard Chang 001; William I. Gasarch; Jacobo Torán (SCT, 1995)

Efficient Parallel Algorithms for some Tree Layout Problems. - Josep Díaz; Alan Gibbons; Grammati E. Pantziou; Maria J. Serna; Paul G. Spirakis; Jacobo Torán (COCOON, 1995)

The Power of the Middle Bit of a #P Function. - Frederic Green; Johannes Köbler; Kenneth W. Regan; Thomas Schwentick; Jacobo Torán (J. Comput. Syst. Sci., 1995)

Computing Functions with Parallel Queries to NP. - Birgit Jenner; Jacobo Torán (Theor. Comput. Sci., 1995)

Parallel Approximation Schemes for Problems on Planar Graphs. - Josep Díaz; Maria J. Serna; Jacobo Torán (Acta Informatica, 1996)

Optimal proof systems for Propositional Logic and complete sets - Jochen Meßner; Jacobo Torán (Electron. Colloquium Comput. Complex., 1997)

Parallel Algorithms for the Minimum Cut and the Minimum Length Tree Layout Problems. - Josep Díaz; Alan Gibbons; Grammati E. Pantziou; Maria J. Serna; Paul G. Spirakis; Jacobo Torán (Theor. Comput. Sci., 1997)

A Note on the Hardness of Tree Isomorphism. - Birgit Jenner; Pierre McKenzie; Jacobo Torán (CCC, 1998)

Lower Bounds for Space in Resolution. - Jacobo Torán (CSL, 1999)

On Finding the Number of Graph Automorphisms. - Robert Beals; Richard Chang 001; William I. Gasarch; Jacobo Torán (Chic. J. Theor. Comput. Sci., 1999)

Sparse Sets, Approximable Sets, and Parallel Queries to NP. - Vikraman Arvind; Jacobo Torán (Inf. Process. Lett., 1999)

Nondeterministic Instance Complexity and Hard-to-Prove Tautologies. - Vikraman Arvind; Johannes Köbler; Martin Mundhenk; Jacobo Torán (STACS, 2000)

Minimally Unsatisfiable CNF Formulas. - Sven Baumer; Juan Luis Esteban; Jacobo Torán (Bull. EATCS, 2001)

Space Bounds for Resolution. - Juan Luis Esteban; Jacobo Torán (Inf. Comput., 2001)

A nonadaptive NC checker for permutation group intersection. - Vikraman Arvind; Jacobo Torán (Theor. Comput. Sci., 2001)

The Complexity of Graph Isomorphism for Colored Graphs with Color Classes of Size 2 and 3. - Johannes Köbler; Jacobo Torán (STACS, 2002)

Optimal proof systems imply complete sets for promise classes. - Johannes Köbler; Jochen Messner; Jacobo Torán (Inf. Comput., 2003)

A combinatorial characterization of treelike resolution space. - Juan Luis Esteban; Jacobo Torán (Inf. Process. Lett., 2003)

Completeness results for graph isomorphism. - Birgit Jenner; Johannes Köbler; Pierre McKenzie; Jacobo Torán (J. Comput. Syst. Sci., 2003)

Solvable Group Isomorphism. - Vikraman Arvind; Jacobo Torán (CCC, 2004)

Space and Width in Propositional Resolution (Column: Computational Complexity). - Jacobo Torán (Bull. EATCS, 2004)

Solvable Group Isomorphism is (almost) in NP cap coNP - Vikraman Arvind; Jacobo Torán (Electron. Colloquium Comput. Complex., 2004)

On the Hardness of Graph Isomorphism. - Jacobo Torán (SIAM J. Comput., 2004)

Arthur-Merlin Games and the Problem of Isomorphism Testing. - Jacobo Torán (CiE, 2005)

Isomorphism Testing: Perspective and Open Problems. - Vikraman Arvind; Jacobo Torán (Bull. EATCS, 2005)

A note on the size of Craig Interpolants. - Uwe Schöning; Jacobo Torán (Circuits, Logic, and Games, 2006)

The Complexity of Quasigroup Isomorphism and the Minimum Generating Set Problem. - Vikraman Arvind; Jacobo Torán (ISAAC, 2006)

Corrigendum to "Completeness results for graph isomorphism" [J. Comput. System Sci. 66(2003) 549-566]. - Birgit Jenner; Johannes Köbler; Pierre McKenzie; Jacobo Torán (J. Comput. Syst. Sci., 2006)

Reductions to Graph Isomorphism. - Jacobo Torán (Electron. Colloquium Comput. Complex., 2007)

Paradigms for fast parallel approximability (Reprint from 1997). - Josep Díaz; Maria J. Serna; Paul G. Spirakis; Jacobo Torán (Cambridge University Press, 2009)

The Complexity of Planar Graph Isomorphism. - Jacobo Torán; Fabian Wagner (Bull. EATCS, 2009)

Restricted Space Algorithms for Isomorphism on Bounded Treewidth Graphs. - Bireswar Das; Jacobo Torán; Fabian Wagner (Electron. Colloquium Comput. Complex., 2009)

Graph Isomorphism is not AC^0 reducible to Group Isomorphism. - Arkadev Chattopadhyay; Jacobo Torán; Fabian Wagner (Electron. Colloquium Comput. Complex., 2010)

Solvable Group Isomorphism Is (Almost) in NP ∩ coNP. - Vikraman Arvind; Jacobo Torán (ACM Trans. Comput. Theory, 2011)

Das Erfüllbarkeitsproblem SAT - Algorithmen und Analysen. - Uwe Schöning; Jacobo Torán (Lehmann, 2012)

On the Resolution Complexity of Graph Non-isomorphism. - Jacobo Torán (SAT, 2013)

Graph Isomorphism is Not AC0-Reducible to Group Isomorphism. - Arkadev Chattopadhyay; Jacobo Torán; Fabian Wagner (ACM Trans. Comput. Theory, 2013)

Solving Linear Equations Parameterized by Hamming Weight. - Vikraman Arvind; Sebastian Kuhnert; Johannes Köbler; Jacobo Torán (Electron. Colloquium Comput. Complex., 2014)

The Graph Isomorphism Problem (Dagstuhl Seminar 15511). - László Babai; Anuj Dawar; Pascal Schweitzer; Jacobo Torán (Dagstuhl Reports, 2015)

Lowness results: the next generation. - Johannes Köbler; Jacobo Torán (Bull. EATCS, 2015)

Succinct Encodings of Graph Isomorphism. - Bireswar Das; Patrick Scharpfenecker; Jacobo Torán (Electron. Colloquium Comput. Complex., 2015)

Algebraic Methods in Computational Complexity (Dagstuhl Seminar 16411). - Valentine Kabanets; Thomas Thierauf; Jacobo Torán; Christopher Umans (Dagstuhl Reports, 2016)

Parameterized Complexity of Small Weight Automorphisms. - Vikraman Arvind; Johannes Köbler; Sebastian Kuhnert; Jacobo Torán (Electron. Colloquium Comput. Complex., 2016)

Solution-Graphs of Boolean Formulas and Isomorphism. - Patrick Scharpfenecker; Jacobo Torán (J. Satisf. Boolean Model. Comput., 2016)

A Deterministic Algorithm for Testing the Equivalence of Read-Once Branching Programs with Small Discrepancy. - Stefan Arnold; Jacobo Torán (CiE, 2017)

Finding Small Weight Isomorphisms with Additional Constraints is Fixed-Parameter Tractable. - Vikraman Arvind; Johannes Köbler; Sebastian Kuhnert; Jacobo Torán (IPEC, 2017)

CNF and DNF succinct graph encodings. - Bireswar Das; Patrick Scharpfenecker; Jacobo Torán (Inf. Comput., 2017)

Algebraic Methods in Computational Complexity (Dagstuhl Seminar 18391). - Markus Bläser; Valentine Kabanets; Jacobo Torán; Christopher Umans (Dagstuhl Reports, 2018)

Cops-Robber games and the resolution of Tseitin formulas. - Nicola Galesi; Navid Talebanfard; Jacobo Torán (Electron. Colloquium Comput. Complex., 2018)

Parameterized Complexity of Small Weight Automorphisms and Isomorphisms. - Vikraman Arvind; Johannes Köbler; Sebastian Kuhnert; Jacobo Torán (Algorithmica, 2021)

Reversible Pebble Games and the Relation Between Tree-Like and General Resolution Space. - Jacobo Torán; Florian Wörz (Comput. Complex., 2021)

Number of Variables for Graph Identification and the Resolution of GI Formulas. - Jacobo Torán; Florian Wörz (Electron. Colloquium Comput. Complex., 2021)

Number of Variables for Graph Differentiation and the Resolution of GI Formulas. - Jacobo Torán; Florian Wörz (CSL, 2022)

Algebraic and Analytic Methods in Computational Complexity (Dagstuhl Seminar 22371). - Markus Bläser; Valentine Kabanets; Ronen Shaltiel; Jacobo Torán (Dagstuhl Reports, 2022)

Cutting Planes Width and the Complexity of Graph Isomorphism Refutations. - Jacobo Torán; Florian Wörz (Electron. Colloquium Comput. Complex., 2023)

Pure Nash equilibria in a generalization of congestion games allowing resource failures. - Julian Nickerl; Jacobo Torán (Theor. Comput. Sci., 2023)

Number of Variables for Graph Differentiation and the Resolution of Graph Isomorphism Formulas. - Jacobo Torán; Florian Wörz (ACM Trans. Comput. Log., 2023)

Pebble Games and Algebraic Proof Systems. - Lisa-Marie Jaser; Jacobo Torán (MFCS, 2024)

Towards Deterministic Compilation of Binary Decision Diagrams From Feature Models. - Tobias Heß; Sean Niklas Semmler; Chico Sundermann; Jacobo Torán; Thomas Thüm (SPLC (A), 2024)

Algebraic and Analytic Methods in Computational Complexity (Dagstuhl Seminar 24381). - Markus Bläser; Shubhangi Saraf; Ronen Shaltiel; Jacobo Torán; Kilian Rothmund (Dagstuhl Reports, 2024)

Pebble Games and Algebraic Proof Systems Meet Again. - Lisa-Marie Jaser; Jacobo Torán (Electron. Colloquium Comput. Complex., 2024)