( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Safety in Multi-Assembly via Paths Appearing in All Path Covers of a DAG.

, , , , , , и . IEEE ACM Trans. Comput. Biol. Bioinform., 19 (6): 3673-3684 (2022)

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.

Pedro Ibrahim Cairo Cairo

Massimo Viola

Massimo Malagó

Massimo Tallarida

Massimo Moser

 

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

A Streamlined Model of Conditional Simple Temporal Networks - Semantics and Equivalence Results., , , и . TIME, том 90 из LIPIcs, стр. 10:1-10:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Sparsifying, Shrinking and Splicing for Minimum Path Cover in Parameterized Linear Time., , , , и . CoRR, (2021)Safety in s-t Paths, Trails and Walks., , , , и . CoRR, (2020)Decoding Hidden Markov Models Faster Than Viterbi Via Online Matrix-Vector (max, +)-Multiplication., , и . AAAI, стр. 1484-1490. AAAI Press, (2016)Cut Paths and Their Remainder Structure, with Applications., , , , , и . STACS, том 254 из LIPIcs, стр. 17:1-17:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Dynamic Controllability of Conditional Simple Temporal Networks Is PSPACE-complete., и . TIME, стр. 90-99. IEEE Computer Society, (2016)Dynamic Controllability Made Simple., и . TIME, том 90 из LIPIcs, стр. 8:1-8:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Genome Assembly, from Practice to Theory: Safe, Complete and Linear-Time., , , и . ACM Trans. Algorithms, 20 (1): 4:1-4:26 (января 2024)SDNN24 Estimation from Semi-Continuous HR Measures., , , , и . Sensors, 21 (4): 1463 (2021)An Optimal O(nm) Algorithm for Enumerating All Walks Common to All Closed Edge-covering Walks of a Graph., , , , и . ACM Trans. Algorithms, 15 (4): 48:1-48:17 (2019)