( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Pushing the Online Boolean Matrix-vector Multiplication conjecture off-line and identifying its easy cases.

, , , , и . J. Comput. Syst. Sci., (2021)

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.

Andrzej Lingas

Andrzej Szplit

Andrzej Tamborek

Andrzej Debski

Andrzej Piotrowski

 

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

Editor's Foreword.. Nord. J. Comput., 1 (3): 273 (1994)Exact and Approximation Algorithms for Geometric and Capacitated Set Cover Problems with Applications, , и . CoRR, (2009)Efficient Algorithms for Subgraph Listing., и . Algorithms, 7 (2): 243-252 (2014)The do-all problem in broadcast networks., , и . PODC, стр. 117-127. ACM, (2001)Performing work in broadcast networks., , и . Distributed Comput., 18 (6): 435-451 (2006)Trade-Offs Between Load and Degree in Virtual Path Layouts., , и . Parallel Process. Lett., 13 (3): 485-496 (2003)Clearing directed subgraphs by mobile agents: Variations on covering with paths., , , , и . J. Comput. Syst. Sci., (2019)A Path Cover Technique for LCAs in Dags., , и . SWAT, том 5124 из Lecture Notes in Computer Science, стр. 222-233. Springer, (2008)Fast Algorithms for Greedy Triangulation., и . SWAT, том 447 из Lecture Notes in Computer Science, стр. 238-250. Springer, (1990)Maximum Tree-Packing in Time O(n5/2).. COCOON, том 959 из Lecture Notes in Computer Science, стр. 121-130. Springer, (1995)