( en | de | ru )

 

Disambiguation of "Sadakane, Kunihiko"

Author of the publication

copydeleteadd this publication to your clipboard
A Linear-Time Burrows-Wheeler Transform Using Induced Sorting.

, and . SPIRE, volume 5721 of Lecture Notes in Computer Science, page 90-101. Springer, (2009)

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

New text indexing functionalities of the compressed suffix arrays.. J. Algorithms, 48 (2): 294-313 (2003)Engineering Hybrid DenseZDDs., , and . SEA, volume 9685 of Lecture Notes in Computer Science, page 201-216. Springer, (2016)Faster Network Algorithms Based on Graph Decomposition., , and . WALCOM, volume 10755 of Lecture Notes in Computer Science, page 80-92. Springer, (2018)Guest editors' foreword., , and . J. Graph Algorithms Appl., 25 (2): 603-604 (2021)A Novel Computational Model for GPUs with Applications to Efficient Algorithms., and . Int. J. Netw. Comput., 5 (1): 26-60 (2015)Space-Time Trade-offs for Stack-Based Algorithms., , , , and . STACS, volume 20 of LIPIcs, page 281-292. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2013)Compressed Persistent Index for Efficient Rank/Select Queries., , , and . WADS, volume 8037 of Lecture Notes in Computer Science, page 402-414. Springer, (2013)Constructing Compressed Suffix Arrays with Large Alphabets., , , and . ISAAC, volume 2906 of Lecture Notes in Computer Science, page 240-249. Springer, (2003)Shortest Beer Path Queries Based on Graph Decomposition., , , and . ISAAC, volume 283 of LIPIcs, page 37:1-37:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)A Space-Efficient Algorithm for the Dynamic DFS Problem in Undirected Graphs., and . WALCOM, volume 10167 of Lecture Notes in Computer Science, page 295-307. Springer, (2017)