Jacobo Toran

From MaRDI portal
Person:1114674

Available identifiers

zbMath Open toran.jacoboMaRDI QIDQ1114674

List of research outcomes

PublicationDate of PublicationType
https://portal.mardi4nfdi.de/entity/Q61249722024-04-10Paper
Efficient parallel algorithms for some tree layout problems2023-12-12Paper
Number of Variables for Graph Differentiation and the Resolution of Graph Isomorphism Formulas2023-07-18Paper
Pure Nash equilibria in a generalization of congestion games allowing resource failures2023-06-15Paper
Reversible Pebble Games and the Relation Between Tree-Like and General Resolution Space2023-02-07Paper
Cops-Robber Games and the Resolution of Tseitin Formulas2022-12-05Paper
Graph isomorphism is low for PP2022-08-18Paper
Pure Nash equilibria in a generalization of congestion games allowing resource failures2022-06-01Paper
Parameterized complexity of small weight automorphisms and isomorphisms2022-01-18Paper
Solution-Graphs of Boolean Formulas and Isomorphism12021-12-09Paper
Reversible pebble games and the relation between tree-like and general resolution space2021-06-17Paper
Finding Small Weight Isomorphisms with Additional Constraints is Fixed-Parameter Tractable2020-05-27Paper
https://portal.mardi4nfdi.de/entity/Q49671952019-07-03Paper
Cops-robber games and the resolution of Tseitin formulas2018-08-10Paper
Parameterized Complexity of Small Weight Automorphisms.2018-04-19Paper
A deterministic algorithm for testing the equivalence of read-once branching programs with small discrepancy2017-08-04Paper
CNF and DNF succinct graph encodings2017-03-16Paper
A Tutorial on Time and Space Bounds in Tree-Like Resolution2016-09-22Paper
Solving linear equations parameterized by Hamming weight2016-09-07Paper
Solution-Graphs of Boolean Formulas and Isomorphism2016-09-05Paper
Sparse sets, approximable sets, and parallel queries to NP2016-06-16Paper
Solvable Group Isomorphism Is (Almost) in NP ∩ coNP2015-09-24Paper
Graph Isomorphism is Not AC0-Reducible to Group Isomorphism2015-09-24Paper
Solving Linear Equations Parameterized by Hamming Weight2015-09-15Paper
Succinct Encodings of Graph Isomorphism2014-03-31Paper
On the Resolution Complexity of Graph Non-isomorphism2013-08-05Paper
Restricted space algorithms for isomorphism on bounded treewidth graphs2012-10-11Paper
Graph Isomorphism is not AC 0 reducible to Group Isomorphism2012-08-29Paper
Restricted Space Algorithms for Isomorphism on Bounded Treewidth Graphs2012-01-23Paper
Reductions to graph isomorphism2010-08-13Paper
Paradigms for Fast Parallel Approximability2009-10-21Paper
https://portal.mardi4nfdi.de/entity/Q33965582009-09-19Paper
https://portal.mardi4nfdi.de/entity/Q33960002009-09-15Paper
https://portal.mardi4nfdi.de/entity/Q36337392009-06-23Paper
A combinatorial characterization of treelike resolution space2009-04-28Paper
Reductions to Graph Isomorphism2008-04-24Paper
The Complexity of Quasigroup Isomorphism and the Minimum Generating Set Problem2008-04-24Paper
Corrigendum to ``Completeness results for graph isomorphism2006-06-30Paper
New Computational Paradigms2006-01-11Paper
On the Hardness of Graph Isomorphism2005-02-21Paper
https://portal.mardi4nfdi.de/entity/Q47368332004-08-11Paper
https://portal.mardi4nfdi.de/entity/Q27436912003-09-14Paper
Completeness results for graph isomorphism.2003-08-19Paper
Optimal proof systems imply complete sets for promise classes2003-07-29Paper
Space bounds for resolution2003-01-14Paper
A nonadaptive NC checker for permutation group intersection2001-08-20Paper
https://portal.mardi4nfdi.de/entity/Q45015422000-09-04Paper
https://portal.mardi4nfdi.de/entity/Q49452382000-08-23Paper
https://portal.mardi4nfdi.de/entity/Q42585752000-05-04Paper
https://portal.mardi4nfdi.de/entity/Q42510592000-01-09Paper
https://portal.mardi4nfdi.de/entity/Q42599961999-09-08Paper
https://portal.mardi4nfdi.de/entity/Q42510711999-06-17Paper
Paradigms for Fast Parallel Approximability1999-02-28Paper
https://portal.mardi4nfdi.de/entity/Q43813981998-07-20Paper
https://portal.mardi4nfdi.de/entity/Q43594601997-10-08Paper
Parallel approximation schemes for problems on planar graphs1997-03-25Paper
Computing functions with parallel queries to NP1997-02-28Paper
The power of the middle bit of a \(\#\)P function1996-11-04Paper
Complexity classes defined by counting quantifiers1994-08-21Paper
https://portal.mardi4nfdi.de/entity/Q42814991994-04-07Paper
https://portal.mardi4nfdi.de/entity/Q42739471993-12-08Paper
Graph isomorphism is low for PP1993-09-16Paper
Turing machines with few accepting computations and low sets for PP1992-09-27Paper
https://portal.mardi4nfdi.de/entity/Q39748511992-06-26Paper
Self-reducible sets of small density1991-01-01Paper
Classes of bounded nondeterminism1990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33597591990-01-01Paper
On counting and approximation1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47307851989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38000161988-01-01Paper
On the complexity of computable real sequences1987-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Jacobo Toran