( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
A deterministic parallel algorithm for bipartite perfect matching.

, , и . Commun. ACM, 62 (3): 109-115 (2019)

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.

Thomas Thierauf

Thomas Thierauf

Thomas Thierauf

Thomas Thierauf

Paul Thierauf

 

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

Lower bounds on the sum of 25th-powers of univariates lead to complete derandomization of PIT., , и . Electron. Colloquium Comput. Complex., (2020)Linear Matroid Intersection is in Quasi-NC., и . Comput. Complex., 29 (2): 9 (2020)Bipartite Perfect Matching is in Quasi-NC., , и . SIAM J. Comput., (2021)Isolating a Vertex via Lattices: Polytopes with Totally Unimodular Faces., , и . SIAM J. Comput., 50 (2): 636-661 (2021)On Closure Properties of #P in the Context of PF ° #P., , , и . J. Comput. Syst. Sci., 53 (2): 171-179 (1996)The Complexity of Poset Games., , , , и . J. Graph Algorithms Appl., 26 (1): 1-14 (2022)A Largish Sum-Of-Squares Implies Circuit Hardness and Derandomization., , и . ITCS, том 185 из LIPIcs, стр. 23:1-23:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)On Closure Properties of #P in the Context of PF°#P., , , и . SCT, стр. 139-146. IEEE Computer Society, (1993)Factorization of Polynomials Given By Arithmetic Branching Programs., и . CCC, том 169 из LIPIcs, стр. 33:1-33:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)The complexity of regex crosswords., , и . Inf. Comput., (2022)