( en | de | ru )

 

Disambiguation of "Torán, Jacobo"

Author of the publication

copydeleteadd this publication to your clipboard
Parallel Algorithms for the Minimum Cut and the Minimum Length Tree Layout Problems.

, , , , , and . Theor. Comput. Sci., 181 (2): 267-287 (1997)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Jacobo Weinstock

Jakob Toräng

Jacobo Martínez Font

Jacobo Jack Duek

Jacobo Manuel Maldonado Hünig

 

Other publications of authors with the same name

On the Hardness of Graph Isomorphism. (2004)Cops-Robber Games and the Resolution of Tseitin Formulas., , and . ACM Trans. Comput. Theory, 12 (2): 9:1-9:22 (2020)On Finding the Number of Graph Automorphisms., , , and . Chic. J. Theor. Comput. Sci., (1999)Number of Variables for Graph Differentiation and the Resolution of Graph Isomorphism Formulas., and . ACM Trans. Comput. Log., 24 (3): 23:1-23:25 (2023)Algebraic and Analytic Methods in Computational Complexity (Dagstuhl Seminar 22371)., , , and . Dagstuhl Reports, 12 (9): 41-59 (September 2022)A Deterministic Algorithm for Testing the Equivalence of Read-Once Branching Programs with Small Discrepancy., and . CiE, volume 10307 of Lecture Notes in Computer Science, page 119-128. Springer, (2017)Complexity Classes with Complete Problems Between P and NP-C., , and . FCT, volume 380 of Lecture Notes in Computer Science, page 13-24. Springer, (1989)On the Resolution Complexity of Graph Non-isomorphism.. SAT, volume 7962 of Lecture Notes in Computer Science, page 52-66. Springer, (2013)The Complexity of Planar Graph Isomorphism., and . Bulletin of the EATCS, (2009)Parallel Algorithms for the Minimum Cut and the Minimum Length Tree Layout Problems., , , , , and . Theor. Comput. Sci., 181 (2): 267-287 (1997)