( en | de | ru )

 

Disambiguation of "Sadakane, Kunihiko"

Author of the publication

copydeleteadd this publication to your clipboard
Fully-Online Grammar Compression.

, , , and . SPIRE, volume 8214 of Lecture Notes in Computer Science, page 218-229. Springer, (2013)

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. You can also use the button next to the name to display some publications already assigned to the person.

Kunihiko Nagasawa

Masahiro Sadakane

 

Other publications of authors with the same name

Compressed indexes for dynamic text collections., , , and . ACM Trans. Algorithms, 3 (2): 21 (2007)Compressed Orthogonal Search on Suffix Arrays with Applications to Range LCP., , , and . CPM, volume 161 of LIPIcs, page 23:1-23:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Storing Set Families More Compactly with Top ZDDs., , and . SEA, volume 160 of LIPIcs, page 6:1-6:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Output-size Sensitiveness of OBDD Construction Through Maximal Independent Set Problem., , and . COCOON, volume 959 of Lecture Notes in Computer Science, page 229-234. Springer, (1995)Efficient Algorithms for Constructing a Pyramid from a Terrain., , and . IEICE Trans. Inf. Syst., 89-D (2): 783-788 (2006)Quantum Algorithms for Intersection and Proximity Problems., , and . IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 86-A (5): 1113-1119 (2003)Faster algorithms for shortest path and network flow based on graph decomposition., , and . J. Graph Algorithms Appl., 23 (5): 781-813 (2019)A Fast, Accurate, and Simple Method for Pricing European-Asian and Saving-Asian Options., , , and . Algorithmica, 42 (2): 141-158 (2005)Approximating the Canadian Traveller Problem with Online Randomization., , , and . Algorithmica, 83 (5): 1524-1543 (2021)Rooted Maximum Agreement Supertrees., , , and . Algorithmica, 43 (4): 293-307 (2005)