( en | de | ru )

 

Disambiguation of "Sadakane, Kunihiko"

Author of the publication

copydeleteadd this publication to your clipboard
The hitting and cover times of Metropolis walks.

, , , and . Theor. Comput. Sci., 411 (16-18): 1889-1894 (2010)

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

Enumerating Range Modes., , , and . CoRR, (2019)Space-Economical Algorithms for Finding Maximal Unique Matches., and . CPM, volume 2373 of Lecture Notes in Computer Science, page 144-152. Springer, (2002)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)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)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)Compressed indexes for dynamic text collections., , , and . ACM Trans. Algorithms, 3 (2): 21 (2007)A Cooperative Distributed Text Database Management Method Unifying Search and Compression Based on the Burrows-Wheeler Transformation., and . ER Workshops, volume 1552 of Lecture Notes in Computer Science, page 434-445. Springer, (1998)Canadians Should Travel Randomly., , , and . ICALP (1), volume 8572 of Lecture Notes in Computer Science, page 380-391. Springer, (2014)Faster algorithms for shortest path and network flow based on graph decomposition., , and . J. Graph Algorithms Appl., 23 (5): 781-813 (2019)Succinct data structures for flexible text retrieval systems.. J. Discrete Algorithms, 5 (1): 12-22 (2007)