( 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.

Matthias Fenner

Rosemarie Fenner

Jörg Fenner

Emilie Fenner

Christian Fenner

 

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

The complexity of learning SUBSEQ(A)., , и . J. Symb. Log., 74 (3): 939-975 (2009)Complexity Theory Newsflash., , и . SIGACT News, 27 (3): 126 (1996)Functions that preserve p-randomness. CoRR, (2012)Two oracles that force a big crunch., , , и . Comput. Complex., 10 (2): 93-116 (2001)Complexity of Regex Crosswords., и . LATA, том 11417 из Lecture Notes in Computer Science, стр. 215-230. Springer, (2019)The Isomorphism Conjecture Holds Relative to an Oracle., , и . SIAM J. Comput., 25 (1): 193-206 (1996)Gap-Definable Counting Classes., , и . J. Comput. Syst. Sci., 48 (1): 116-148 (1994)An oracle builder's toolkit., , , и . Inf. Comput., 182 (2): 95-136 (2003)Implementing the fanout operation with simple pairwise interactions., и . CoRR, (2022)Bipartite Perfect Matching is in Quasi-NC., , и . SIAM J. Comput., (2021)