( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
A Universal Error Measure for Input Predictions Applied to Online Graph Problems.

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

César Bernardini

Elisa Bernardini

Francesco Bernardini

Nadia Bernardini

Giulia Agostini

 

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

Reverse-Safe Text Indexing., , , , и . ACM J. Exp. Algorithmics, (2021)On Two Measures of Distance Between Fully-Labelled Trees., , и . CPM, том 161 из LIPIcs, стр. 6:1-6:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Making de Bruijn Graphs Eulerian., , , , , и . CPM, том 223 из LIPIcs, стр. 12:1-12:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Longest property-preserved common factor: A new string-processing framework., , , , , , и . Theor. Comput. Sci., (2020)Hide and Mine in Strings: Hardness and Algorithms., , , , , , , , , и . ICDM, стр. 924-929. IEEE, (2020)Comparing Degenerate Strings., , , , , , , и . Fundam. Informaticae, 175 (1-4): 41-58 (2020)A Universal Error Measure for Input Predictions Applied to Online Graph Problems., , , , , и . NeurIPS, (2022)Incomplete Directed Perfect Phylogeny in Linear Time., , и . WADS, том 12808 из Lecture Notes in Computer Science, стр. 172-185. Springer, (2021)A Unifying Taxonomy of Pattern Matching in Degenerate Strings and Founder Graphs., , , , , , и . WABI, том 312 из LIPIcs, стр. 14:1-14:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)On Strings Having the Same Length- k Substrings., , , , , , , и . CPM, том 223 из LIPIcs, стр. 16:1-16:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)