( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Parallel Algorithms for the Minimum Cut and the Minimum Length Tree Layout Problems.

, , , , , и . 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.

Jacobo Weinstock

Jakob Toräng

Jacobo Martínez Font

Jacobo Jack Duek

Jacobo Manuel Maldonado Hünig

 

Другие публикации лиц с тем же именем

Space and Width in Propositional Resolution (Column: Computational Complexity).. Bulletin of the EATCS, (2004)On the Non-Uniform Complexity of the Graph Isomorphism Problem., и . Complexity Theory: Current Research, стр. 245-271. Cambridge University Press, (1992)A Combinatorial Technique for Separating Counting Complexity Classes.. ICALP, том 372 из Lecture Notes in Computer Science, стр. 733-744. Springer, (1989)Restricted Space Algorithms for Isomorphism on Bounded Treewidth Graphs., , и . STACS, том 5 из LIPIcs, стр. 227-238. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2010)Restricted Space Algorithms for Isomorphism on Bounded Treewidth Graphs., , и . Electron. Colloquium Comput. Complex., (2009)Number of Variables for Graph Identification and the Resolution of GI Formulas., и . Electron. Colloquium Comput. Complex., (2021)On the Nonuniform Complexity on the Graph Isomorphism Problem., и . SCT, стр. 118-129. IEEE Computer Society, (1992)Computing Functions with Parallel Queries to NP., и . SCT, стр. 280-291. IEEE Computer Society, (1993)Graph Isomorphism is not AC^0 reducible to Group Isomorphism., , и . FSTTCS, том 8 из LIPIcs, стр. 317-326. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2010)Pebble Games and Algebraic Proof Systems., и . MFCS, том 306 из LIPIcs, стр. 64:1-64:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)