( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Storing Set Families More Compactly with Top ZDDs.

, , и . SEA, том 160 из LIPIcs, стр. 6:1-6:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)

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.

Kunihiko Nagasawa

Masahiro Sadakane

 

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

Canadians Should Travel Randomly., , , и . ICALP (1), том 8572 из Lecture Notes in Computer Science, стр. 380-391. Springer, (2014)Compressed indexes for dynamic text collections., , , и . ACM Trans. Algorithms, 3 (2): 21 (2007)A Cooperative Distributed Text Database Management Method Unifying Search and Compression Based on the Burrows-Wheeler Transformation., и . ER Workshops, том 1552 из Lecture Notes in Computer Science, стр. 434-445. Springer, (1998)Space-Economical Algorithms for Finding Maximal Unique Matches., и . CPM, том 2373 из Lecture Notes in Computer Science, стр. 144-152. Springer, (2002)Storing Set Families More Compactly with Top ZDDs., , и . SEA, том 160 из LIPIcs, стр. 6:1-6:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Compressed Orthogonal Search on Suffix Arrays with Applications to Range LCP., , , и . CPM, том 161 из LIPIcs, стр. 23:1-23:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Output-size Sensitiveness of OBDD Construction Through Maximal Independent Set Problem., , и . COCOON, том 959 из Lecture Notes in Computer Science, стр. 229-234. Springer, (1995)Enumerating Range Modes., , , и . CoRR, (2019)Efficient Algorithms for Constructing a Pyramid from a Terrain., , и . IEICE Trans. Inf. Syst., 89-D (2): 783-788 (2006)Quantum Algorithms for Intersection and Proximity Problems., , и . IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 86-A (5): 1113-1119 (2003)