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
[j60]Sankardeep Chakraborty, Seungbum Jo
, Kunihiko Sadakane, Srinivasa Rao Satti:
Succinct data structures for bounded clique-width graphs. Discret. Appl. Math. 352: 55-68 (2024)- [j59]Girish Balakrishnan, Sankardeep Chakraborty, N. S. Narayanaswamy, Kunihiko Sadakane:
Succinct data structure for path graphs. Inf. Comput. 296: 105124 (2024) - [j58]Sankardeep Chakraborty, Seungbum Jo, Kunihiko Sadakane, Srinivasa Rao Satti:
Succinct Data Structures for SP, Block-Cactus and 3-Leaf Power Graphs. Int. J. Found. Comput. Sci. 35(6): 705-722 (2024) - [c107]Nuttapong Attrapadung, Kota Isayama, Kunihiko Sadakane, Kazunari Tozawa:
Secure Parallel Computation with Oblivious State Transitions. CCS 2024: 3008-3022 - [c106]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 - [c105]Girish Balakrishnan, Sankardeep Chakraborty, Seungbum Jo, N. S. Narayanaswamy, Kunihiko Sadakane:
Succinct Data Structure for Graphs with d-Dimensional t-Representation. DCC 2024: 546 - [c104]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 - [c103]Sankardeep Chakraborty, Seungbum Jo, Geunho Kim, Kunihiko Sadakane:
Succinct Data Structures for Baxter Permutation and Related Families. ISAAC 2024: 17:1-17:17 - [c102]Sankardeep Chakraborty, Kunihiko Sadakane, Wiktor Zuba:
Enhancing Generalized Compressed Suffix Trees, with Applications. ISAAC 2024: 18:1-18:15 - [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 - [i28]Girish Balakrishnan, Sankardeep Chakraborty, N. S. Narayanaswamy, Kunihiko Sadakane:
Succinct Data Structure for Chordal Graphs with Bounded Vertex Leafage. CoRR abs/2402.03748 (2024) - [i27]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) - [i26]Sankardeep Chakraborty, Seungbum Jo, Geunho Kim, Kunihiko Sadakane:
Succinct Data Structures for Baxter Permutation and Related Families. CoRR abs/2409.16650 (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]Tetsuo Shibuya, Jesper Jansson, Kunihiko Sadakane:
Linear-time protein 3-D structure searching with insertions and deletions. Algorithms Mol. Biol. 5: 7 (2010) - [j18]Ei Ando, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita:
The Space Complexity of Leader Election in Anonymous Networks. Int. J. Found. Comput. Sci. 21(3): 427-440 (2010) - [j17]Yoshiaki Nonaka, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita:
The hitting and cover times of Metropolis walks. Theor. Comput. Sci. 411(16-18): 1889-1894 (2010) - [c57]Diego Arroyuelo, Rodrigo Cánovas, Gonzalo Navarro, Kunihiko Sadakane:
Succinct Trees in Practice. ALENEX 2010: 84-97 - [c56]Tetsuo Asano, Jesper Jansson, Kunihiko Sadakane, Ryuhei Uehara, Gabriel Valiente:
Faster Computation of the Robinson-Foulds Distance between Phylogenetic Networks. CPM 2010: 190-201 - [c55]Kunihiko Sadakane, Gonzalo Navarro:
Fully-Functional Succinct Trees. SODA 2010: 134-149 - [i4]Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung:
Compressed random access memory. CoRR abs/1011.1708 (2010)
2000 – 2009
- 2009
- [j16]Wing-Kai Hon, Kunihiko Sadakane, Wing-Kin Sung:
Breaking a Time-and-Space Barrier in Constructing Full-Text Indices. SIAM J. Comput. 38(6): 2162-2178 (2009) - [c54]Yoshiaki Nonaka, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita:
How to Design a Linear Cover Time Random Walk on a Finite Graph. SAGA 2009: 104-116 - [c53]Jurek Czyzowicz, Stefan Dobrev, Leszek Gasieniec, David Ilcinkas, Jesper Jansson, Ralf Klasing, Ioannis Lignos, Russell A. Martin, Kunihiko Sadakane, Wing-Kin Sung:
More Efficient Periodic Traversal in Anonymous Undirected Graphs. SIROCCO 2009: 167-181 - [c52]Daisuke Okanohara, Kunihiko Sadakane:
A Linear-Time Burrows-Wheeler Transform Using Induced Sorting. SPIRE 2009: 90-101 - [c51]Ei Ando, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita:
Computing the Exact Distribution Function of the Stochastic Longest Path Length in a DAG. TAMC 2009: 98-107 - [c50]Tetsuo Shibuya, Jesper Jansson, Kunihiko Sadakane:
Linear-Time Protein 3-D Structure Searching with Insertions and Deletions. WABI 2009: 310-320 - [i3]Kunihiko Sadakane, Gonzalo Navarro:
Fully-Functional Static and Dynamic Succinct Trees. CoRR abs/0905.0768 (2009) - [i2]Jurek Czyzowicz, Stefan Dobrev, Leszek Gasieniec, David Ilcinkas, Jesper Jansson, Ralf Klasing, Yannis Lignos, Russell A. Martin, Kunihiko Sadakane, Wing-Kin Sung:
More efficient periodic traversal in anonymous undirected graphs. CoRR abs/0905.1737 (2009) - 2008
- [c49]Suguru Kawashimo, Yen Kaow Ng, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita:
Speeding Up Local-Search Type Algorithms for Designing DNA Sequences under Thermodynamical Constraints. DNA 2008: 168-178 - [c48]Daisuke Okanohara, Kunihiko Sadakane:
An Online Algorithm for Finding the Longest Previous Factors. ESA 2008: 696-707 - [c47]Ei Ando, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita:
The space complexity of the leader election in anonymous networks. IPDPS 2008: 1-8 - [c46]Yuta Harada, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita:
The Balanced Edge Cover Problem. ISAAC 2008: 246-257 - 2007
- [j15]Wing-Kai Hon, Tak Wah Lam, Kunihiko Sadakane, Wing-Kin Sung, Siu-Ming Yiu:
A Space and Time Efficient Algorithm for Constructing Compressed Suffix Arrays. Algorithmica 48(1): 23-36 (2007) - [j14]Yuta Harada, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita:
Optimal Balanced Semi-Matchings for Weighted Bipartite Graphs. Inf. Media Technol. 2(4): 1103-1112 (2007) - [j13]Kunihiko Sadakane:
Succinct data structures for flexible text retrieval systems. J. Discrete Algorithms 5(1): 12-22 (2007) - [j12]Kunihiko Sadakane:
Compressed Suffix Trees with Full Functionality. Theory Comput. Syst. 41(4): 589-607 (2007) - [j11]Ho-Leung Chan, Wing-Kai Hon, Tak Wah Lam, Kunihiko Sadakane:
Compressed indexes for dynamic text collections. ACM Trans. Algorithms 3(2): 21 (2007) - [j10]N. Jesper Larsson, Kunihiko Sadakane:
Faster suffix sorting. Theor. Comput. Sci. 387(3): 258-272 (2007) - [c45]Daisuke Okanohara, Kunihiko Sadakane:
Practical Entropy-Compressed Rank/Select Dictionary. ALENEX 2007 - [c44]Suguru Kawashimo, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita:
Dynamic Neighborhood Searches for Thermodynamically Designing DNA Sequence. DNA 2007: 130-139 - [c43]Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung:
Compressed Dynamic Tries with Applications to LZ-Compression in Sublinear Time and Space. FSTTCS 2007: 424-435 - [c42]Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung:
Ultra-succinct representation of ordered trees. SODA 2007: 575-584 - 2006
- [j9]Jinhee Chun, Kunihiko Sadakane, Takeshi Tokuyama:
Linear Time Algorithm for Approximating a Curve by a Single-Peaked Curve. Algorithmica 44(2): 103-115 (2006) - [j8]Jinhee Chun, Kunihiko Sadakane, Takeshi Tokuyama:
Efficient Algorithms for Constructing a Pyramid from a Terrain. IEICE Trans. Inf. Syst. 89-D(2): 783-788 (2006) - [c41]Diego Arroyuelo, Gonzalo Navarro, Kunihiko Sadakane:
Reducing the Space Requirement of LZ-Index. CPM 2006: 318-329 - [c40]Suguru Kawashimo, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita:
DNA Sequence Design by Dynamic Neighborhood Searches. DNA 2006: 157-171 - [c39]Masashi Shiozaki, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita:
A Probabilistic Model of the DNA Conformational Change. DNA 2006: 274-285 - [c38]Yuichi Kurumida, Tsukasa Ogata, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita:
A generic search strategy for large-scale real-world networks. Infoscale 2006: 2 - [c37]Yuichi Kurumida, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita:
Forest Search: A Paradigm for Faster Exploration of Scale-Free Networks. ISPA 2006: 39-50 - [c36]Kunihiko Sadakane, Roberto Grossi:
Squeezing succinct data structures into entropy bounds. SODA 2006: 1230-1239 - [i1]Daisuke Okanohara, Kunihiko Sadakane:
Practical Entropy-Compressed Rank/Select Dictionary. CoRR abs/cs/0610001 (2006) - 2005
- [j7]Kenichiro Ohta, Kunihiko Sadakane, Akiyoshi Shioura, Takeshi Tokuyama:
A Fast, Accurate, and Simple Method for Pricing European-Asian and Saving-Asian Options. Algorithmica 42(2): 141-158 (2005) - [j6]Jesper Jansson, Joseph H.-K. Ng, Kunihiko Sadakane, Wing-Kin Sung:
Rooted Maximum Agreement Supertrees. Algorithmica 43(4): 293-307 (2005) - [j5]Kunihiko Sadakane, Nadia Takki-Chebihi, Takeshi Tokuyama:
Combinatorics and algorithms for low-discrepancy roundings of a real sequence. Theor. Comput. Sci. 331(1): 23-36 (2005) - [j4]Charles Choy, Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung:
Computing the maximum agreement of phylogenetic networks. Theor. Comput. Sci. 335(1): 93-107 (2005) - [c35]Tsutomu Takeda, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita:
A Local Search Based Barrier Height Estimation Algorithm for DNA Molecular Transitions. DNA 2005: 359-370 - [c34]Stefan Dobrev, Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung:
Finding Short Right-Hand-on-the-Wall Walks in Graphs. SIROCCO 2005: 127-139 - [c33]Ho-Leung Chan, Wing-Kai Hon, Tak Wah Lam, Kunihiko Sadakane:
Dynamic dictionary matching and compressed suffix trees. SODA 2005: 13-22 - [c32]Shay Kutten, Hirotaka Ono, David Peleg, Kunihiko Sadakane, Masafumi Yamashita:
Energy-Optimal Online Algorithms for Broadcasting in Wireless Networks. WONS 2005: 125-130 - 2004
- [c31]Yohei Ikawa, Kunihiko Sadakane:
A Web Page Scoring Method for Local Web Search Engines. DASFAA 2004: 606-617 - [c30]Wing-Kai Hon, Tak Wah Lam, Kunihiko Sadakane, Wing-Kin Sung, Siu-Ming Yiu:
Compressed Index for Dynamic Text. Data Compression Conference 2004: 102-111 - [c29]Veli Mäkinen, Gonzalo Navarro, Kunihiko Sadakane:
Advantages of Backward Searching - Efficient Secondary Memory and Distributed Implementation of Compressed Suffix Arrays. ISAAC 2004: 681-692 - [c28]Jesper Jansson, Joseph H.-K. Ng, Kunihiko Sadakane, Wing-Kin Sung:
Rooted Maximum Agreement Supertrees. LATIN 2004: 499-508 - [c27]Yuichi Handa, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita:
Neighborhood Composition: A Parallelization of Local Search Algorithms. PVM/MPI 2004: 155-163 - [c26]Charles Choy, Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung:
Computing the Maximum Agreement of Phylogenetic Networks. CATS 2004: 134-147 - 2003
- [j3]Kunihiko Sadakane, Norito Sugawara, Takeshi Tokuyama:
Quantum Algorithms for Intersection and Proximity Problems. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 86-A(5): 1113-1119 (2003) - [j2]Kunihiko Sadakane:
New text indexing functionalities of the compressed suffix arrays. J. Algorithms 48(2): 294-313 (2003) - [j1]Chiu-Yuen Koo, Tak Wah Lam, Tsuen-Wan Ngan, Kunihiko Sadakane, Kar-Keung To:
On-line scheduling with tight deadlines. Theor. Comput. Sci. 295: 251-261 (2003) - [c25]Wing-Kai Hon, Kunihiko Sadakane, Wing-Kin Sung:
Breaking a Time-and-Space Barrier in Constructing Full-Text Indices. FOCS 2003: 251-260 - [c24]Jinhee Chun, Kunihiko Sadakane, Takeshi Tokuyama:
Linear Time Algorithm for Approximating a Curve by a Single-Peaked Curve. ISAAC 2003: 6-15 - [c23]Wing-Kai Hon, Tak Wah Lam, Kunihiko Sadakane, Wing-Kin Sung:
Constructing Compressed Suffix Arrays with Large Alphabets. ISAAC 2003: 240-249 - [c22]Wing-Kai Hon, Kunihiko Sadakane, Wing-Kin Sung:
Succinct Data Structures for Searchable Partial Sums. ISAAC 2003: 505-516 - 2002
- [c21]Tak Wah Lam, Kunihiko Sadakane, Wing-Kin Sung, Siu-Ming Yiu:
A Space and Time Efficient Algorithm for Constructing Compressed Suffix Arrays. COCOON 2002: 401-410 - [c20]Wing-Kai Hon, Kunihiko Sadakane:
Space-Economical Algorithms for Finding Maximal Unique Matches. CPM 2002: 144-152 - [c19]Takumi Okazaki, Kunihiko Sadakane, Hiroshi Imai:
Data Compression Method Combining Properties of PPM and CTW. Progress in Discovery Science 2002: 268-283 - [c18]Kenichiro Ohta, Kunihiko Sadakane, Akiyoshi Shioura, Takeshi Tokuyama:
A Fast, Accurate and Simple Method for Pricing European-Asian and Saving-Asian Options. ESA 2002: 772-784 - [c17]Kunihiko Sadakane:
Space-Efficient Data Structures for Flexible Text Retrieval Systems. ISAAC 2002: 14-24 - [c16]Jinhee Chun, Kunihiko Sadakane, Takeshi Tokuyama:
Efficient Algorithms for Constructing a Pyramid from a Terrain. JCDCG 2002: 108-117 - [c15]Kunihiko Sadakane:
Succinct representations of lcp information and improvements in the compressed suffix arrays. SODA 2002: 225-232 - [c14]Kunihiko Sadakane, Nadia Takki-Chebihi, Takeshi Tokuyama:
Discrepancy-Based Digital Halftoning: Automatic Evaluation and Optimization. Theoretical Foundations of Computer Vision 2002: 301-319 - 2001
- [c13]Kunihiko Sadakane, Nadia Takki-Chebihi, Takeshi Tokuyama:
Combinatorics and Algorithms on Low-Discrepancy Roundings of a Real Sequence. ICALP 2001: 166-177 - [c12]Kunihiko Sadakane, Norito Sugawara, Takeshi Tokuyama:
Quantum Algorithms for Intersection and Proximity Problems. ISAAC 2001: 148-159 - 2000
- [c11]Kunihiko Sadakane, Takumi Okazaki, Hiroshi Imai:
Implementing the Context Tree Weighting Method for Text Compression. Data Compression Conference 2000: 123-132 - [c10]Kunihiko Sadakane:
Compressed Text Databases with Efficient Query Algorithms Based on the Compressed Suffix Array. ISAAC 2000: 410-421
1990 – 1999
- 1999
- [c9]Kunihiko Sadakane, Hiroshi Imai:
Text Retrieval by Using k-word Proximity Search. DANTE 1999: 183-188 - [c8]Kunihiko Sadakane:
A Modified Burrows-Wheeler Transformation for Case-Insensitive Search with Application to Suffix Array Compression. Data Compression Conference 1999: 548 - [c7]Kunihiko Sadakane, Hiroshi Imai:
Finding Meaningful Regions Containing Given Keywords from Large Text Collections. Discovery Science 1999: 353-354 - 1998
- [c6]Kunihiko Sadakane, Hiroshi Imai, Kensuke Onishi, Mary Inaba, Fumihiko Takeuchi, Keiko Imai:
Voronoi Diagrams by Divergences with Additive Weights. SCG 1998: 403-404 - [c5]Kunihiko Sadakane:
A Fast Algorithms for Making Suffix Arrays and for Burrows-Wheeler Transformation. Data Compression Conference 1998: 129-138 - [c4]Kunihiko Sadakane:
On Optimality of Varients of the Block Sorting Compression. Data Compression Conference 1998: 570 - [c3]Kunihiko Sadakane, Hiroshi Imai:
A Cooperative Distributed Text Database Management Method Unifying Search and Compression Based on the Burrows-Wheeler Transformation. ER Workshops 1998: 434-445 - 1997
- [c2]Kunihiko Sadakane:
Text compression using recency rank with context and relation to context sorting, block sorting and PPM*. SEQUENCES 1997: 305-319 - 1995
- [c1]Kazuyoshi Hayase, Kunihiko Sadakane, Seiichiro Tani:
Output-size Sensitiveness of OBDD Construction Through Maximal Independent Set Problem. COCOON 1995: 229-234
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 21:43 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
