default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKunihiko Sadakane
Person information
- affiliation: Tokyo University, Japan
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j59]Sankardeep Chakraborty, Seungbum Jo
, Kunihiko Sadakane, Srinivasa Rao Satti:
Succinct data structures for bounded clique-width graphs. Discret. Appl. Math. 352: 55-68 (2024)- [j58]Girish Balakrishnan, Sankardeep Chakraborty, N. S. Narayanaswamy, Kunihiko Sadakane:
Succinct data structure for path graphs. Inf. Comput. 296: 105124 (2024) - [c104]Long-Qi Chen, Che-Wei Tsao, Jin-Jie Deng, Wing-Kai Hon, Kunihiko Sadakane:
τλ-Index: Locating Rare Patterns in Similar Strings. DCC 2024: 233-242 - [c103]Girish Balakrishnan, Sankardeep Chakraborty, Seungbum Jo, N. S. Narayanaswamy, Kunihiko Sadakane:
Succinct Data Structure for Graphs with d-Dimensional t-Representation. DCC 2024: 546 - [c102]Kou Hamada, Sankardeep Chakraborty, Seungbum Jo, Takuto Koriyama, Kunihiko Sadakane, Srinivasa Rao Satti:
A Simple Representation of Tree Covering Utilizing Balanced Parentheses and Efficient Implementation of Average-Case Optimal RMQs. ESA 2024: 64:1-64:18 - [c101]Girish Balakrishnan, Sankardeep Chakraborty, N. S. Narayanaswamy, Kunihiko Sadakane:
Succinct Data Structure for Chordal Graphs with Bounded Vertex Leafage. SWAT 2024: 4:1-4:16 - [i27]Girish Balakrishnan, Sankardeep Chakraborty, N. S. Narayanaswamy, Kunihiko Sadakane:
Succinct Data Structure for Chordal Graphs with Bounded Vertex Leafage. CoRR abs/2402.03748 (2024) - [i26]Kou Hamada, Sankardeep Chakraborty, Seungbum Jo, Takuto Koriyama, Kunihiko Sadakane, Srinivasa Rao Satti:
A Simple Representation of Tree Covering Utilizing Balanced Parentheses and Efficient Implementation of Average-Case Optimal RMQs. CoRR abs/2407.00573 (2024) - [i25]Hiraku Morita, Erik Pohle, Kunihiko Sadakane, Peter Scholl, Kazunari Tozawa, Daniel Tschudi:
MAESTRO: Multi-party AES using Lookup Tables. IACR Cryptol. ePrint Arch. 2024: 1317 (2024) - 2023
- [j57]Kuo-Kai Lee, Wing-Kai Hon, Chung-Shou Liao, Kunihiko Sadakane, Meng-Tsung Tsai:
Fully Dynamic No-Back-Edge-Traversal Forest via 2D-Range Queries. Int. J. Comput. Geom. Appl. 33(1&2): 43-54 (2023) - [j56]Sankardeep Chakraborty, Roberto Grossi, Kunihiko Sadakane, Srinivasa Rao Satti:
Succinct representation for (non)deterministic finite automata. J. Comput. Syst. Sci. 131: 1-12 (2023) - [c100]Seungbum Jo, Wooyoung Park, Kunihiko Sadakane, Srinivasa Rao Satti:
Practical Implementations of Compressed RAM. DCC 2023: 168-177 - [c99]Tesshu Hanaka, Hirotaka Ono, Kunihiko Sadakane, Kosuke Sugiyama:
Shortest Beer Path Queries Based on Graph Decomposition. ISAAC 2023: 37:1-37:20 - [i24]Tesshu Hanaka, Hirotaka Ono, Kunihiko Sadakane, Kosuke Sugiyama:
Shortest Beer Path Queries based on Graph Decomposition. CoRR abs/2307.02787 (2023) - [i23]Girish Balakrishnan, Sankardeep Chakraborty, Seungbum Jo, N. S. Narayanaswamy, Kunihiko Sadakane:
Succinct Data Structure for Graphs with d-Dimensional t-Representation. CoRR abs/2311.02427 (2023) - 2022
- [j55]Hao-Ting Wei, Wing-Kai Hon, Paul Horn, Chung-Shou Liao, Kunihiko Sadakane:
Approximating Dynamic Weighted Vertex Cover with Soft Capacities. Algorithmica 84(1): 124-149 (2022) - [j54]Tatsuya Inoha, Kunihiko Sadakane, Yushi Uno, Yuma Yonebayashi:
Efficient Computation of Betweenness Centrality by Graph Decompositions and Their Applications to Real-World Networks. IEICE Trans. Inf. Syst. 105-D(3): 451-458 (2022) - [j53]Hüseyin Acan, Sankardeep Chakraborty, Seungbum Jo, Kei Nakashima, Kunihiko Sadakane, Srinivasa Rao Satti:
Succinct navigational oracles for families of intersection graphs on a circle. Theor. Comput. Sci. 928: 151-166 (2022) - [c98]Yuma Arakawa, Gonzalo Navarro, Kunihiko Sadakane:
Bi-Directional r-Indexes. CPM 2022: 11:1-11:14 - [c97]Jin Jie Deng, Wing-Kai Hon, Dominik Köppl, Kunihiko Sadakane:
FM-Indexing Grammars Induced by Suffix Sorting for Long Patterns. DCC 2022: 63-72 - [c96]Girish Balakrishnan, N. S. Narayanaswamy, Sankardeep Chakraborty, Kunihiko Sadakane:
Succinct Data Structure for Path Graphs. DCC 2022: 262-271 - [c95]Kunihiko Sadakane:
Succinct Representations of Graphs (Invited Talk). ISAAC 2022: 1:1-1:1 - [c94]Tatsuya Yanagita, Sankardeep Chakraborty, Kunihiko Sadakane, Srinivasa Rao Satti:
Space-Efficient Data Structure for Posets with Applications. SWAT 2022: 33:1-33:16 - 2021
- [j52]Erik D. Demaine, Yamming Huang, Chung-Shou Liao, Kunihiko Sadakane:
Approximating the Canadian Traveller Problem with Online Randomization. Algorithmica 83(5): 1524-1543 (2021) - [j51]Kotaro Matsuda, Shuhei Denzumi, Kunihiko Sadakane:
Storing Set Families More Compactly with Top ZDDs. Algorithms 14(6): 172 (2021) - [j50]M. Sohel Rahman, Kunihiko Sadakane, Wing-Kin Sung:
Guest editors' foreword. J. Graph Algorithms Appl. 25(2): 603-604 (2021) - [j49]Arnab Ganguly, Wing-Kai Hon, Kunihiko Sadakane, Rahul Shah, Sharma V. Thankachan, Yilin Yang:
A framework for designing space-efficient dictionaries for parameterized and order-preserving matching. Theor. Comput. Sci. 854: 52-62 (2021) - [c93]Sankardeep Chakraborty, Seungbum Jo, Kunihiko Sadakane, Srinivasa Rao Satti:
Succinct Data Structures for Series-Parallel, Block-Cactus and 3-Leaf Power Graphs. COCOA 2021: 416-430 - [c92]Hüseyin Acan, Sankardeep Chakraborty, Seungbum Jo, Kei Nakashima, Kunihiko Sadakane, Srinivasa Rao Satti:
Succinct representations of Intersection Graphs on a Circle. DCC 2021: 123-132 - [c91]Sankardeep Chakraborty, Seungbum Jo, Kunihiko Sadakane, Srinivasa Rao Satti:
Succinct Data Structures for Small Clique-Width Graphs. DCC 2021: 133-142 - [c90]Sankardeep Chakraborty, Roberto Grossi, Kunihiko Sadakane, Srinivasa Rao Satti:
Succinct Representations for (Non)Deterministic Finite Automata. LATA 2021: 55-67 - [e4]Hee-Kap Ahn, Kunihiko Sadakane:
32nd International Symposium on Algorithms and Computation, ISAAC 2021, December 6-8, 2021, Fukuoka, Japan. LIPIcs 212, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2021, ISBN 978-3-95977-214-3 [contents] - [i22]Sankardeep Chakraborty, Seungbum Jo, Kunihiko Sadakane, Srinivasa Rao Satti:
Succinct Data Structures for Series-Parallel, Block-Cactus and 3-Leaf Power Graphs. CoRR abs/2108.10776 (2021) - [i21]Jin Jie Deng, Wing-Kai Hon, Dominik Köppl, Kunihiko Sadakane:
FM-Indexing Grammars Induced by Suffix Sorting for Long Patterns. CoRR abs/2110.01181 (2021) - [i20]Girish Balakrishnan, Sankardeep Chakraborty, N. S. Narayanaswamy, Kunihiko Sadakane:
Succinct Data Structure for Path Graphs. CoRR abs/2111.04332 (2021) - 2020
- [j48]Kazuki Ishiyama, Kunihiko Sadakane:
Compact and succinct data structures for multidimensional orthogonal range searching. Inf. Comput. 273: 104519 (2020) - [j47]Paniz Abedin, Arnab Ganguly, Wing-Kai Hon, Kotaro Matsuda, Yakov Nekrich, Kunihiko Sadakane, Rahul Shah, Sharma V. Thankachan:
A linear-space data structure for range-LCP queries in poly-logarithmic time. Theor. Comput. Sci. 822: 15-22 (2020) - [j46]Jianbin Qin, Chuan Xiao, Sheng Hu, Jie Zhang, Wei Wang, Yoshiharu Ishikawa, Koji Tsuda, Kunihiko Sadakane:
Efficient query autocompletion with edit distance-based error tolerance. VLDB J. 29(4): 919-943 (2020) - [c89]Kotaro Matsuda, Kunihiko Sadakane, Tatiana Starikovskaya, Masakazu Tateshita:
Compressed Orthogonal Search on Suffix Arrays with Applications to Range LCP. CPM 2020: 23:1-23:13 - [c88]Kentaro Sumigawa, Sankardeep Chakraborty, Kunihiko Sadakane, Srinivasa Rao Satti:
Enumerating Range Modes. ISAAC 2020: 29:1-29:16 - [c87]Sankardeep Chakraborty, Kunihiko Sadakane, Srinivasa Rao Satti:
Optimal In-place Algorithms for Basic Graph Problems. IWOCA 2020: 126-139 - [c86]Kotaro Matsuda, Shuhei Denzumi, Kunihiko Sadakane:
Storing Set Families More Compactly with Top ZDDs. SEA 2020: 6:1-6:13 - [e3]M. Sohel Rahman, Kunihiko Sadakane, Wing-Kin Sung:
WALCOM: Algorithms and Computation - 14th International Conference, WALCOM 2020, Singapore, March 31 - April 2, 2020, Proceedings. Lecture Notes in Computer Science 12049, Springer 2020, ISBN 978-3-030-39880-4 [contents] - [i19]Kotaro Matsuda, Shuhei Denzumi, Kunihiko Sadakane:
Storing Set Families More Compactly with Top ZDDs. CoRR abs/2004.04586 (2020) - [i18]Hüseyin Acan, Sankardeep Chakraborty, Seungbum Jo, Kei Nakashima, Kunihiko Sadakane, Srinivasa Rao Satti:
Succinct Navigational Oracles for Families of Intersection Graphs on a Circle. CoRR abs/2010.04333 (2020)
2010 – 2019
- 2019
- [j45]Kengo Nakamura, Kunihiko Sadakane:
Space-Efficient Fully Dynamic DFS in Undirected Graphs. Algorithms 12(3): 52 (2019) - [j44]Kunihiko Sadakane:
Foreword. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 102-A(9): 986 (2019) - [j43]Manas Jyoti Kashyop, Tsunehiko Nagayama, Kunihiko Sadakane:
Faster algorithms for shortest path and network flow based on graph decomposition. J. Graph Algorithms Appl. 23(5): 781-813 (2019) - [j42]Kentaro Sumigawa, Kunihiko Sadakane:
Storing Partitions of Integers in Sublinear Space. Rev. Socionetwork Strateg. 13(2): 237-252 (2019) - [c85]Sankardeep Chakraborty, Kunihiko Sadakane:
Indexing Graph Search Trees and Applications. MFCS 2019: 67:1-67:14 - [i17]Sankardeep Chakraborty, Kunihiko Sadakane:
Indexing Graph Search Trees and Applications. CoRR abs/1906.07871 (2019) - [i16]Sankardeep Chakraborty, Roberto Grossi, Kunihiko Sadakane, Srinivasa Rao Satti:
Succinct Representation for (Non)Deterministic Finite Automata. CoRR abs/1907.09271 (2019) - [i15]Sankardeep Chakraborty, Kunihiko Sadakane, Srinivasa Rao Satti:
Optimal In-place Algorithms for Basic Graph Problems. CoRR abs/1907.09280 (2019) - [i14]Kentaro Sumigawa, Sankardeep Chakraborty, Kunihiko Sadakane, Srinivasa Rao Satti:
Enumerating Range Modes. CoRR abs/1907.10984 (2019) - 2018
- [j41]Johannes Fischer, Tomohiro I, Dominik Köppl, Kunihiko Sadakane:
Lempel-Ziv Factorization Powered by Space Efficient Suffix Trees. Algorithmica 80(7): 2048-2081 (2018) - [j40]Shuhei Denzumi, Jun Kawahara, Koji Tsuda, Hiroki Arimura, Shin-ichi Minato, Kunihiko Sadakane:
DenseZDD: A Compact and Fast Index for Families of Sets. Algorithms 11(8): 128 (2018) - [c84]Hao-Ting Wei, Wing-Kai Hon, Paul Horn, Chung-Shou Liao, Kunihiko Sadakane:
An O(1)-Approximation Algorithm for Dynamic Weighted Vertex Cover with Soft Capacity. APPROX-RANDOM 2018: 27:1-27:14 - [c83]Paniz Abedin, Arnab Ganguly, Wing-Kai Hon, Yakov Nekrich, Kunihiko Sadakane, Rahul Shah, Sharma V. Thankachan:
A Linear-Space Data Structure for Range-LCP Queries in Poly-Logarithmic Time. COCOON 2018: 615-625 - [c82]Kentaro Sumigawa, Kunihiko Sadakane:
An Efficient Representation of Partitions of Integers. IWOCA 2018: 361-373 - [c81]Alessio Conte, Gaspare Ferraro, Roberto Grossi, Andrea Marino, Kunihiko Sadakane, Takeaki Uno:
Node Similarity with q -Grams for Real-World Labeled Networks. KDD 2018: 1282-1291 - [c80]Manas Jyoti Kashyop, Tsunehiko Nagayama, Kunihiko Sadakane:
Faster Network Algorithms Based on Graph Decomposition. WALCOM 2018: 80-92 - [i13]Hao-Ting Wei, Wing-Kai Hon, Paul Horn, Chung-Shou Liao, Kunihiko Sadakane:
An O(1)-Approximation Algorithm for Dynamic Weighted Vertex Cover with Soft Capacity. CoRR abs/1802.05623 (2018) - 2017
- [j39]Zechao Liu, Zoe Lin Jiang, Xuan Wang, Xinyi Huang, Siu-Ming Yiu, Kunihiko Sadakane:
Offline/online attribute-based encryption with verifiable outsourced decryption. Concurr. Comput. Pract. Exp. 29(7) (2017) - [j38]Takuya Takagi, Shunsuke Inenaga, Kunihiko Sadakane, Hiroki Arimura:
Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 100-A(9): 1785-1793 (2017) - [c79]Kazuki Ishiyama, Kunihiko Sadakane:
A Succinct Data Structure for Multidimensional Orthogonal Range Searching. DCC 2017: 270-279 - [c78]Kazuki Ishiyama, Kunihiko Sadakane:
Practical Space-Efficient Data Structures for High-Dimensional Orthogonal Range Searching. SISAP 2017: 234-246 - [c77]Kazuki Ishiyama, Koji Kobayashi, Kunihiko Sadakane:
Succinct Quadtrees for Road Data. SISAP 2017: 262-272 - [c76]Kengo Nakamura, Kunihiko Sadakane:
A Space-Efficient Algorithm for the Dynamic DFS Problem in Undirected Graphs. WALCOM 2017: 295-307 - [c75]Patrick Dinklage, Johannes Fischer, Dominik Köppl, Marvin Löbel, Kunihiko Sadakane:
Compression with the tudocomp Framework. SEA 2017: 13:1-13:22 - [i12]Patrick Dinklage, Johannes Fischer, Dominik Köppl, Marvin Löbel, Kunihiko Sadakane:
Compression with the tudocomp Framework. CoRR abs/1702.07577 (2017) - [i11]Kunihiko Sadakane, Gonzalo Navarro:
Computation over Compressed Structured Data (NII Shonan Meeting 2017-15). NII Shonan Meet. Rep. 2017 (2017) - 2016
- [c74]Arnab Ganguly, Wing-Kai Hon, Kunihiko Sadakane, Rahul Shah, Sharma V. Thankachan, Yilin Yang:
Space-Efficient Dictionaries for Parameterized and Order-Preserving Pattern Matching. CPM 2016: 2:1-2:12 - [c73]Dominik Köppl, Kunihiko Sadakane:
Lempel-Ziv Computation in Compressed Space (LZ-CICS). DCC 2016: 3-12 - [c72]Takuya Takagi, Shunsuke Inenaga, Kunihiko Sadakane, Hiroki Arimura:
Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing. IWOCA 2016: 213-225 - [c71]Taito Lee, Shuhei Denzumi, Kunihiko Sadakane:
Engineering Hybrid DenseZDDs. SEA 2016: 201-216 - [e2]Shunsuke Inenaga, Kunihiko Sadakane, Tetsuya Sakai:
String Processing and Information Retrieval - 23rd International Symposium, SPIRE 2016, Beppu, Japan, October 18-20, 2016, Proceedings. Lecture Notes in Computer Science 9954, 2016, ISBN 978-3-319-46048-2 [contents] - [r1]Gonzalo Navarro, Kunihiko Sadakane:
Compressed Tree Representations. Encyclopedia of Algorithms 2016: 397-401 - [i10]Takuya Takagi, Shunsuke Inenaga, Kunihiko Sadakane, Hiroki Arimura:
Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing. CoRR abs/1602.00422 (2016) - 2015
- [j37]Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung:
Linked Dynamic Tries with Applications to LZ-Compression in Sublinear Time and Space. Algorithmica 71(4): 969-988 (2015) - [j36]Luis Barba, Matias Korman, Stefan Langerman, Kunihiko Sadakane, Rodrigo I. Silveira:
Space-Time Trade-offs for Stack-Based Algorithms. Algorithmica 72(4): 1097-1129 (2015) - [j35]Dinghua Li, Chi-Man Liu, Ruibang Luo, Kunihiko Sadakane, Tak Wah Lam:
MEGAHIT: an ultra-fast single-node solution for large and complex metagenomics assembly via succinct de Bruijn graph. Bioinform. 31(10): 1674-1676 (2015) - [j34]Atsushi Koike, Kunihiko Sadakane:
A Novel Computational Model for GPUs with Applications to Efficient Algorithms. Int. J. Netw. Comput. 5(1): 26-60 (2015) - [j33]Philip Bille, Gad M. Landau, Rajeev Raman, Kunihiko Sadakane, Srinivasa Rao Satti, Oren Weimann:
Random Access to Grammar-Compressed Strings and Trees. SIAM J. Comput. 44(3): 513-539 (2015) - [j32]Wing-Kin Sung, Kunihiko Sadakane, Tetsuo Shibuya, Abha Belorkar, Iana Pyrogova:
An O(m, log m)-Time Algorithm for Detecting Superbubbles. IEEE ACM Trans. Comput. Biol. Bioinform. 12(4): 770-777 (2015) - [j31]Sudebkumar Prasant Pal, Kunihiko Sadakane:
Guest Editors' foreword. Theor. Comput. Sci. 575: 1-2 (2015) - [c70]Christina Boucher, Alexander Bowe, Travis Gagie, Simon J. Puglisi, Kunihiko Sadakane:
Variable-Order de Bruijn Graphs. DCC 2015: 383-392 - [i9]Dominik Köppl, Kunihiko Sadakane:
Lempel Ziv Computation In Compressed Space (LZ-CICS). CoRR abs/1510.02882 (2015) - 2014
- [j30]Sudebkumar Prasant Pal, Kunihiko Sadakane:
Guest Editors' Foreword. J. Graph Algorithms Appl. 18(4): 491-492 (2014) - [j29]Gonzalo Navarro, Kunihiko Sadakane:
Fully Functional Static and Dynamic Succinct Trees. ACM Trans. Algorithms 10(3): 16:1-16:39 (2014) - [j28]Huy Hoang Do, Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung:
Fast relative Lempel-Ziv self-index for similar sequences. Theor. Comput. Sci. 532: 14-30 (2014) - [c69]Erik D. Demaine, Yamming Huang, Chung-Shou Liao, Kunihiko Sadakane:
Canadians Should Travel Randomly. ICALP (1) 2014: 380-391 - [c68]Atsushi Koike, Kunihiko Sadakane:
A Novel Computational Model for GPUs with Application to I/O Optimal Sorting Algorithms. IPDPS Workshops 2014: 614-623 - [c67]Shuhei Denzumi, Jun Kawahara, Koji Tsuda, Hiroki Arimura, Shin-ichi Minato, Kunihiko Sadakane:
DenseZDD: A Compact and Fast Index for Families of Sets. SEA 2014: 187-198 - [e1]Sudebkumar Prasant Pal, Kunihiko Sadakane:
Algorithms and Computation - 8th International Workshop, WALCOM 2014, Chennai, India, February 13-15, 2014, Proceedings. Lecture Notes in Computer Science 8344, Springer 2014, ISBN 978-3-319-04656-3 [contents] - [i8]Christina Boucher, Alexander Bowe, Travis Gagie, Simon J. Puglisi, Kunihiko Sadakane:
Variable-Order de Bruijn Graphs. CoRR abs/1411.2718 (2014) - 2013
- [j27]Chuan Xiao, Jianbin Qin, Wei Wang, Yoshiharu Ishikawa, Koji Tsuda, Kunihiko Sadakane:
Efficient Error-tolerant Query Autocompletion. Proc. VLDB Endow. 6(6): 373-384 (2013) - [c66]Hoa Vu, Francis Y. L. Chin, Wing-Kai Hon, Henry C. M. Leung, Kunihiko Sadakane, Ken Wing-Kin Sung, Siu-Ming Yiu:
Reconstructing k-Reticulated Phylogenetic Network from a Set of Gene Trees. ISBRA 2013: 112-124 - [c65]Shirou Maruyama, Yasuo Tabei, Hiroshi Sakamoto, Kunihiko Sadakane:
Fully-Online Grammar Compression. SPIRE 2013: 218-229 - [c64]Luis Barba, Matias Korman, Stefan Langerman, Rodrigo I. Silveira, Kunihiko Sadakane:
Space-Time Trade-offs for Stack-Based Algorithms. STACS 2013: 281-292 - [c63]Taku Onodera, Kunihiko Sadakane, Tetsuo Shibuya:
Detecting Superbubbles in Assembly Graphs. WABI 2013: 338-348 - [c62]Wing-Kai Hon, Lap-Kei Lee, Kunihiko Sadakane, Konstantinos Tsakalidis:
Compressed Persistent Index for Efficient Rank/Select Queries. WADS 2013: 402-414 - [i7]Taku Onodera, Kunihiko Sadakane, Tetsuo Shibuya:
Detecting Superbubbles in Assembly Graphs. CoRR abs/1307.7925 (2013) - [i6]Kunihiko Sadakane, Wing-Kin Sung:
Compact Data structures for Big Data (NII Shonan Meeting 2013-10). NII Shonan Meet. Rep. 2013 (2013) - 2012
- [j26]Diego Arroyuelo, Gonzalo Navarro, Kunihiko Sadakane:
Stronger Lempel-Ziv Based Compressed Text Indexing. Algorithmica 62(1-2): 54-101 (2012) - [j25]Tatsuya Akutsu, Daiji Fukagawa, Jesper Jansson, Kunihiko Sadakane:
Inferring a graph from path frequency. Discret. Appl. Math. 160(10-11): 1416-1428 (2012) - [j24]Tetsuo Asano, Jesper Jansson, Kunihiko Sadakane, Ryuhei Uehara, Gabriel Valiente:
Faster computation of the Robinson-Foulds distance between phylogenetic networks. Inf. Sci. 197: 77-90 (2012) - [j23]Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung:
Ultra-succinct representation of ordered trees with applications. J. Comput. Syst. Sci. 78(2): 619-631 (2012) - [j22]Christopher Ma, Thomas K. F. Wong, Tak Wah Lam, Wing-Kai Hon, Kunihiko Sadakane, Siu-Ming Yiu:
An Efficient Alignment Algorithm for Searching Simple Pseudoknots over Long Genomic Sequence. IEEE ACM Trans. Comput. Biol. Bioinform. 9(6): 1629-1638 (2012) - [j21]Jurek Czyzowicz, Stefan Dobrev, Leszek Gasieniec, David Ilcinkas, Jesper Jansson, Ralf Klasing, Ioannis Lignos, Russell Martin, Kunihiko Sadakane, Wing-Kin Sung:
More efficient periodic traversal in anonymous undirected graphs. Theor. Comput. Sci. 444: 60-76 (2012) - [c61]Huy Hoang Do, Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung:
Fast Relative Lempel-Ziv Self-index for Similar Sequences. FAW-AAIM 2012: 291-302 - [c60]Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung:
CRAM: Compressed Random Access Memory. ICALP (1) 2012: 510-521 - [c59]Alexander Bowe, Taku Onodera, Kunihiko Sadakane, Tetsuo Shibuya:
Succinct de Bruijn Graphs. WABI 2012: 225-235 - [i5]Luis Barba, Matias Korman, Stefan Langerman, Kunihiko Sadakane, Rodrigo I. Silveira:
Space-Time Trade-offs for Stack-Based Algorithms. CoRR abs/1208.3663 (2012) - 2011
- [j20]Wing-Kai Hon, Kunihiko Sadakane, Wing-Kin Sung:
Succinct data structures for Searchable Partial Sums with optimal worst-case performance. Theor. Comput. Sci. 412(39): 5176-5186 (2011) - [c58]Philip Bille, Gad M. Landau, Rajeev Raman, Kunihiko Sadakane, Srinivasa Rao Satti, Oren Weimann:
Random Access to grammar-Compressed Strings. SODA 2011: 373-389 - 2010
- [j19]