Kunihiko Sadakane

208 papers A* 12A 7B 58C 13Misc 3Journal 90Unranked 24

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Variations on the Problem of Identifying Spectrum-Preserving String Sets. CoRR Sankardeep Chakraborty, Roberto Grossi, Ren Kimura, Giulia Punzi, Kunihiko Sadakane, Wiktor Zuba
2026	J	`jnl`	τ λ -Index: A framework for locating rare patterns in repetitive corpora. Inf. Syst. Che-Wei Tsao, Jin Jie Deng, Long-Qi Chen, Wing-Kai Hon, Dominik Köppl, Kunihiko Sadakane
2025	—	`conf`	Graph Indexing Beyond Wheeler Graphs. The Expanding World of Compressed Data Jarno N. Alanko, Elena Biagi, Massimo Equi, Veli Mäkinen, Simon J. Puglisi, Nicola Rizzo, Kunihiko Sadakane, Jouni Sirén
2025	A*	`conf`	MAESTRO: Multi-Party AES Using Lookup Tables. USENIX Security Symposium Hiraku Morita, Erik Pohle, Kunihiko Sadakane, Peter Scholl, Kazunari Tozawa, Daniel Tschudi
2025	—	`conf`	Oblivious Suffix Sorting: A Multi-Party Computation Scheme for Secure and Efficient Suffix Sorting. ACNS (1) Kota Isayama, Koki Jimbo, Naohiro Okamoto, Kunihiko Sadakane, Kazunari Tozawa
2025	B	`conf`	Pangenome Graph Indexing via the Multidollar-BWT. SEA Davide Cozzi, Brian Riccardi, Luca Denti, Simone Ciccolella, Kunihiko Sadakane, Paola Bonizzoni
2025	—	`conf`	Secure Compressed Suffix Arrays. From Strings to Graphs, and Back Again Kunihiko Sadakane
2025	A*	`conf`	Surpassing the Word Size Limitation of TFHE with Noise Calibration. CCS Takumi Nishimura, Kazunari Tozawa, Kunihiko Sadakane
2024	A	`conf`	A Simple Representation of Tree Covering Utilizing Balanced Parentheses and Efficient Implementation of Average-Case Optimal RMQs. ESA Kou Hamada, Sankardeep Chakraborty, Seungbum Jo, Takuto Koriyama, Kunihiko Sadakane, Srinivasa Rao Satti
2024	J	`jnl`	A Simple Representation of Tree Covering Utilizing Balanced Parentheses and Efficient Implementation of Average-Case Optimal RMQs. CoRR Kou Hamada, Sankardeep Chakraborty, Seungbum Jo, Takuto Koriyama, Kunihiko Sadakane, Srinivasa Rao Satti
2024	B	`conf`	Enhancing Generalized Compressed Suffix Trees, with Applications. ISAAC Sankardeep Chakraborty, Kunihiko Sadakane, Wiktor Zuba
2024	J	`jnl`	MAESTRO: Multi-party AES using Lookup Tables. IACR Cryptol. ePrint Arch. Hiraku Morita, Erik Pohle, Kunihiko Sadakane, Peter Scholl, Kazunari Tozawa, Daniel Tschudi
2024	A*	`conf`	Secure Parallel Computation with Oblivious State Transitions. CCS Nuttapong Attrapadung, Kota Isayama, Kunihiko Sadakane, Kazunari Tozawa
2024	—	`conf`	Succinct Data Structure for Chordal Graphs with Bounded Vertex Leafage. SWAT Girish Balakrishnan, Sankardeep Chakraborty, N. S. Narayanaswamy, Kunihiko Sadakane
2024	J	`jnl`	Succinct Data Structure for Chordal Graphs with Bounded Vertex Leafage. CoRR Girish Balakrishnan, Sankardeep Chakraborty, N. S. Narayanaswamy, Kunihiko Sadakane
2024	B	`conf`	Succinct Data Structure for Graphs with d-Dimensional t-Representation. DCC Girish Balakrishnan, Sankardeep Chakraborty, Seungbum Jo, N. S. Narayanaswamy, Kunihiko Sadakane
2024	B	`conf`	Succinct Data Structures for Baxter Permutation and Related Families. ISAAC Sankardeep Chakraborty, Seungbum Jo, Geunho Kim, Kunihiko Sadakane
2024	J	`jnl`	Succinct Data Structures for Baxter Permutation and Related Families. CoRR Sankardeep Chakraborty, Seungbum Jo, Geunho Kim, Kunihiko Sadakane
2024	J	`jnl`	Succinct Data Structures for SP, Block-Cactus and 3-Leaf Power Graphs. Int. J. Found. Comput. Sci. Sankardeep Chakraborty, Seungbum Jo, Kunihiko Sadakane, Srinivasa Rao Satti
2024	J	`jnl`	Succinct data structure for path graphs. Inf. Comput. Girish Balakrishnan, Sankardeep Chakraborty, N. S. Narayanaswamy, Kunihiko Sadakane
2024	J	`jnl`	Succinct data structures for bounded clique-width graphs. Discret. Appl. Math. Sankardeep Chakraborty, Seungbum Jo, Kunihiko Sadakane, Srinivasa Rao Satti
2024	B	`conf`	τλ-Index: Locating Rare Patterns in Similar Strings. DCC Long-Qi Chen, Che-Wei Tsao, Jin Jie Deng, Wing-Kai Hon, Kunihiko Sadakane
2023	J	`jnl`	Fully Dynamic No-Back-Edge-Traversal Forest via 2D-Range Queries. Int. J. Comput. Geom. Appl. Kuo-Kai Lee, Wing-Kai Hon, Chung-Shou Liao, Kunihiko Sadakane, Meng-Tsung Tsai
2023	B	`conf`	Practical Implementations of Compressed RAM. DCC Seungbum Jo, Wooyoung Park, Kunihiko Sadakane, Srinivasa Rao Satti
2023	B	`conf`	Shortest Beer Path Queries Based on Graph Decomposition. ISAAC Tesshu Hanaka, Hirotaka Ono, Kunihiko Sadakane, Kosuke Sugiyama
2023	J	`jnl`	Shortest Beer Path Queries based on Graph Decomposition. CoRR Tesshu Hanaka, Hirotaka Ono, Kunihiko Sadakane, Kosuke Sugiyama
2023	J	`jnl`	Succinct Data Structure for Graphs with d-Dimensional t-Representation. CoRR Girish Balakrishnan, Sankardeep Chakraborty, Seungbum Jo, N. S. Narayanaswamy, Kunihiko Sadakane
2023	J	`jnl`	Succinct representation for (non)deterministic finite automata. J. Comput. Syst. Sci. Sankardeep Chakraborty, Roberto Grossi, Kunihiko Sadakane, Srinivasa Rao Satti
2022	J	`jnl`	Approximating Dynamic Weighted Vertex Cover with Soft Capacities. Algorithmica Hao-Ting Wei, Wing-Kai Hon, Paul Horn, Chung-Shou Liao, Kunihiko Sadakane
2022	B	`conf`	Bi-Directional r-Indexes. CPM Yuma Arakawa, Gonzalo Navarro, Kunihiko Sadakane
2022	J	`jnl`	Efficient Computation of Betweenness Centrality by Graph Decompositions and Their Applications to Real-World Networks. IEICE Trans. Inf. Syst. Tatsuya Inoha, Kunihiko Sadakane, Yushi Uno, Yuma Yonebayashi
2022	B	`conf`	FM-Indexing Grammars Induced by Suffix Sorting for Long Patterns. DCC Jin Jie Deng, Wing-Kai Hon, Dominik Köppl, Kunihiko Sadakane
2022	—	`conf`	Space-Efficient Data Structure for Posets with Applications. SWAT Tatsuya Yanagita, Sankardeep Chakraborty, Kunihiko Sadakane, Srinivasa Rao Satti
2022	B	`conf`	Succinct Data Structure for Path Graphs. DCC Girish Balakrishnan, N. S. Narayanaswamy, Sankardeep Chakraborty, Kunihiko Sadakane
2022	B	`conf`	Succinct Representations of Graphs (Invited Talk). ISAAC Kunihiko Sadakane
2022	J	`jnl`	Succinct navigational oracles for families of intersection graphs on a circle. Theor. Comput. Sci. Hüseyin Acan, Sankardeep Chakraborty, Seungbum Jo, Kei Nakashima, Kunihiko Sadakane, Srinivasa Rao Satti
2021	B	`ed.`	32nd International Symposium on Algorithms and Computation, ISAAC 2021, Fukuoka, Japan, December 6-8, 2021 ISAAC Hee-Kap Ahn, Kunihiko Sadakane
2021	J	`jnl`	A framework for designing space-efficient dictionaries for parameterized and order-preserving matching. Theor. Comput. Sci. Arnab Ganguly, Wing-Kai Hon, Kunihiko Sadakane, Rahul Shah, Sharma V. Thankachan, Yilin Yang
2021	J	`jnl`	Approximating the Canadian Traveller Problem with Online Randomization. Algorithmica Erik D. Demaine, Yamming Huang, Chung-Shou Liao, Kunihiko Sadakane
2021	J	`jnl`	FM-Indexing Grammars Induced by Suffix Sorting for Long Patterns. CoRR Jin Jie Deng, Wing-Kai Hon, Dominik Köppl, Kunihiko Sadakane
2021	J	`jnl`	Guest editors' foreword. J. Graph Algorithms Appl. M. Sohel Rahman, Kunihiko Sadakane, Wing-Kin Sung
2021	J	`jnl`	Storing Set Families More Compactly with Top ZDDs. Algorithms Kotaro Matsuda, Shuhei Denzumi, Kunihiko Sadakane
2021	J	`jnl`	Succinct Data Structure for Path Graphs. CoRR Girish Balakrishnan, Sankardeep Chakraborty, N. S. Narayanaswamy, Kunihiko Sadakane
2021	C	`conf`	Succinct Data Structures for Series-Parallel, Block-Cactus and 3-Leaf Power Graphs. COCOA Sankardeep Chakraborty, Seungbum Jo, Kunihiko Sadakane, Srinivasa Rao Satti
2021	J	`jnl`	Succinct Data Structures for Series-Parallel, Block-Cactus and 3-Leaf Power Graphs. CoRR Sankardeep Chakraborty, Seungbum Jo, Kunihiko Sadakane, Srinivasa Rao Satti
2021	B	`conf`	Succinct Data Structures for Small Clique-Width Graphs. DCC Sankardeep Chakraborty, Seungbum Jo, Kunihiko Sadakane, Srinivasa Rao Satti
2021	C	`conf`	Succinct Representations for (Non)Deterministic Finite Automata. LATA Sankardeep Chakraborty, Roberto Grossi, Kunihiko Sadakane, Srinivasa Rao Satti
2021	B	`conf`	Succinct representations of Intersection Graphs on a Circle. DCC Hüseyin Acan, Sankardeep Chakraborty, Seungbum Jo, Kei Nakashima, Kunihiko Sadakane, Srinivasa Rao Satti
2020	J	`jnl`	A linear-space data structure for range-LCP queries in poly-logarithmic time. Theor. Comput. Sci. Paniz Abedin, Arnab Ganguly, Wing-Kai Hon, Kotaro Matsuda, Yakov Nekrich, Kunihiko Sadakane, Rahul Shah, Sharma V. Thankachan
2020	J	`jnl`	Compact and succinct data structures for multidimensional orthogonal range searching. Inf. Comput. Kazuki Ishiyama, Kunihiko Sadakane
2020	B	`conf`	Compressed Orthogonal Search on Suffix Arrays with Applications to Range LCP. CPM Kotaro Matsuda, Kunihiko Sadakane, Tatiana Starikovskaya, Masakazu Tateshita
2020	J	`jnl`	Efficient query autocompletion with edit distance-based error tolerance. VLDB J. Jianbin Qin, Chuan Xiao, Sheng Hu, Jie Zhang, Wei Wang, Yoshiharu Ishikawa, Koji Tsuda, Kunihiko Sadakane
2020	B	`conf`	Enumerating Range Modes. ISAAC Kentaro Sumigawa, Sankardeep Chakraborty, Kunihiko Sadakane, Srinivasa Rao Satti
2020	C	`conf`	Optimal In-place Algorithms for Basic Graph Problems. IWOCA Sankardeep Chakraborty, Kunihiko Sadakane, Srinivasa Rao Satti
2020	B	`conf`	Storing Set Families More Compactly with Top ZDDs. SEA Kotaro Matsuda, Shuhei Denzumi, Kunihiko Sadakane
2020	J	`jnl`	Storing Set Families More Compactly with Top ZDDs. CoRR Kotaro Matsuda, Shuhei Denzumi, Kunihiko Sadakane
2020	J	`jnl`	Succinct Navigational Oracles for Families of Intersection Graphs on a Circle. CoRR Hüseyin Acan, Sankardeep Chakraborty, Seungbum Jo, Kei Nakashima, Kunihiko Sadakane, Srinivasa Rao Satti
2020	B	`ed.`	WALCOM: Algorithms and Computation - 14th International Conference, WALCOM 2020, Singapore, March 31 - April 2, 2020, Proceedings WALCOM M. Sohel Rahman, Kunihiko Sadakane, Wing-Kin Sung
2019	J	`jnl`	Enumerating Range Modes. CoRR Kentaro Sumigawa, Sankardeep Chakraborty, Kunihiko Sadakane, Srinivasa Rao Satti
2019	J	`jnl`	Faster algorithms for shortest path and network flow based on graph decomposition. J. Graph Algorithms Appl. Manas Jyoti Kashyop, Tsunehiko Nagayama, Kunihiko Sadakane
2019	J	`jnl`	Foreword. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. Kunihiko Sadakane
2019	B	`conf`	Indexing Graph Search Trees and Applications. MFCS Sankardeep Chakraborty, Kunihiko Sadakane
2019	J	`jnl`	Indexing Graph Search Trees and Applications. CoRR Sankardeep Chakraborty, Kunihiko Sadakane
2019	J	`jnl`	Optimal In-place Algorithms for Basic Graph Problems. CoRR Sankardeep Chakraborty, Kunihiko Sadakane, Srinivasa Rao Satti
2019	J	`jnl`	Space-Efficient Fully Dynamic DFS in Undirected Graphs. Algorithms Kengo Nakamura, Kunihiko Sadakane
2019	J	`jnl`	Storing Partitions of Integers in Sublinear Space. Rev. Socionetwork Strateg. Kentaro Sumigawa, Kunihiko Sadakane
2019	J	`jnl`	Succinct Representation for (Non)Deterministic Finite Automata. CoRR Sankardeep Chakraborty, Roberto Grossi, Kunihiko Sadakane, Srinivasa Rao Satti
2018	Misc	`conf`	A Linear-Space Data Structure for Range-LCP Queries in Poly-Logarithmic Time. COCOON Paniz Abedin, Arnab Ganguly, Wing-Kai Hon, Yakov Nekrich, Kunihiko Sadakane, Rahul Shah, Sharma V. Thankachan
2018	C	`conf`	An Efficient Representation of Partitions of Integers. IWOCA Kentaro Sumigawa, Kunihiko Sadakane
2018	—	`conf`	An O(1)-Approximation Algorithm for Dynamic Weighted Vertex Cover with Soft Capacity. APPROX-RANDOM Hao-Ting Wei, Wing-Kai Hon, Paul Horn, Chung-Shou Liao, Kunihiko Sadakane
2018	J	`jnl`	An O(1)-Approximation Algorithm for Dynamic Weighted Vertex Cover with Soft Capacity. CoRR Hao-Ting Wei, Wing-Kai Hon, Paul Horn, Chung-Shou Liao, Kunihiko Sadakane
2018	J	`jnl`	DenseZDD: A Compact and Fast Index for Families of Sets. Algorithms Shuhei Denzumi, Jun Kawahara, Koji Tsuda, Hiroki Arimura, Shin-ichi Minato, Kunihiko Sadakane
2018	B	`conf`	Faster Network Algorithms Based on Graph Decomposition. WALCOM Manas Jyoti Kashyop, Tsunehiko Nagayama, Kunihiko Sadakane
2018	J	`jnl`	Lempel-Ziv Factorization Powered by Space Efficient Suffix Trees. Algorithmica Johannes Fischer, Tomohiro I, Dominik Köppl, Kunihiko Sadakane
2018	A*	`conf`	Node Similarity with q -Grams for Real-World Labeled Networks. KDD Alessio Conte, Gaspare Ferraro, Roberto Grossi, Andrea Marino, Kunihiko Sadakane, Takeaki Uno
2017	B	`conf`	A Space-Efficient Algorithm for the Dynamic DFS Problem in Undirected Graphs. WALCOM Kengo Nakamura, Kunihiko Sadakane
2017	B	`conf`	A Succinct Data Structure for Multidimensional Orthogonal Range Searching. DCC Kazuki Ishiyama, Kunihiko Sadakane
2017	B	`conf`	Compression with the tudocomp Framework. SEA Patrick Dinklage, Johannes Fischer, Dominik Köppl, Marvin Löbel, Kunihiko Sadakane
2017	J	`jnl`	Compression with the tudocomp Framework. CoRR Patrick Dinklage, Johannes Fischer, Dominik Köppl, Marvin Löbel, Kunihiko Sadakane
2017	J	`jnl`	Computation over Compressed Structured Data (NII Shonan Meeting 2017-15). NII Shonan Meet. Rep. Kunihiko Sadakane, Gonzalo Navarro
2017	J	`jnl`	Offline/online attribute-based encryption with verifiable outsourced decryption. Concurr. Comput. Pract. Exp. Zechao Liu, Zoe Lin Jiang, Xuan Wang, Xinyi Huang, Siu-Ming Yiu, Kunihiko Sadakane
2017	J	`jnl`	Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. Takuya Takagi, Shunsuke Inenaga, Kunihiko Sadakane, Hiroki Arimura
2017	B	`conf`	Practical Space-Efficient Data Structures for High-Dimensional Orthogonal Range Searching. SISAP Kazuki Ishiyama, Kunihiko Sadakane
2017	B	`conf`	Succinct Quadtrees for Road Data. SISAP Kazuki Ishiyama, Koji Kobayashi, Kunihiko Sadakane
2016	—	`ch.`	Compressed Tree Representations. Encyclopedia of Algorithms Gonzalo Navarro, Kunihiko Sadakane
2016	B	`conf`	Engineering Hybrid DenseZDDs. SEA Taito Lee, Shuhei Denzumi, Kunihiko Sadakane
2016	B	`conf`	Lempel-Ziv Computation in Compressed Space (LZ-CICS). DCC Dominik Köppl, Kunihiko Sadakane
2016	C	`conf`	Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing. IWOCA Takuya Takagi, Shunsuke Inenaga, Kunihiko Sadakane, Hiroki Arimura
2016	J	`jnl`	Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing. CoRR Takuya Takagi, Shunsuke Inenaga, Kunihiko Sadakane, Hiroki Arimura
2016	B	`conf`	Space-Efficient Dictionaries for Parameterized and Order-Preserving Pattern Matching. CPM Arnab Ganguly, Wing-Kai Hon, Kunihiko Sadakane, Rahul Shah, Sharma V. Thankachan, Yilin Yang
2016	C	`ed.`	String Processing and Information Retrieval - 23rd International Symposium, SPIRE 2016, Beppu, Japan, October 18-20, 2016, Proceedings SPIRE Shunsuke Inenaga, Kunihiko Sadakane, Tetsuya Sakai
2015	J	`jnl`	A Novel Computational Model for GPUs with Applications to Efficient Algorithms. Int. J. Netw. Comput. Atsushi Koike, Kunihiko Sadakane
2015	J	`jnl`	An O(m, log m)-Time Algorithm for Detecting Superbubbles. IEEE ACM Trans. Comput. Biol. Bioinform. Wing-Kin Sung, Kunihiko Sadakane, Tetsuo Shibuya, Abha Belorkar, Iana Pyrogova
2015	J	`jnl`	Guest Editors' foreword. Theor. Comput. Sci. Sudebkumar Prasant Pal, Kunihiko Sadakane
2015	J	`jnl`	Lempel Ziv Computation In Compressed Space (LZ-CICS). CoRR Dominik Köppl, Kunihiko Sadakane
2015	J	`jnl`	Linked Dynamic Tries with Applications to LZ-Compression in Sublinear Time and Space. Algorithmica Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung
2015	J	`jnl`	MEGAHIT: an ultra-fast single-node solution for large and complex metagenomics assembly via succinct Bioinform. Dinghua Li, Chi-Man Liu, Ruibang Luo, Kunihiko Sadakane, Tak Wah Lam
2015	J	`jnl`	Random Access to Grammar-Compressed Strings and Trees. SIAM J. Comput. Philip Bille, Gad M. Landau, Rajeev Raman, Kunihiko Sadakane, Srinivasa Rao Satti, Oren Weimann
2015	J	`jnl`	Space-Time Trade-offs for Stack-Based Algorithms. Algorithmica Luis Barba, Matias Korman, Stefan Langerman, Kunihiko Sadakane, Rodrigo I. Silveira
2015	B	`conf`	Variable-Order de Bruijn Graphs. DCC Christina Boucher, Alexander Bowe, Travis Gagie, Simon J. Puglisi, Kunihiko Sadakane
2014	—	`conf`	A Novel Computational Model for GPUs with Application to I/O Optimal Sorting Algorithms. IPDPS Workshops Atsushi Koike, Kunihiko Sadakane
2014	B	`ed.`	Algorithms and Computation - 8th International Workshop, WALCOM 2014, Chennai, India, February 13-15, 2014, Proceedings WALCOM Sudebkumar Prasant Pal, Kunihiko Sadakane
2014	—	`conf`	Canadians Should Travel Randomly. ICALP (1) Erik D. Demaine, Yamming Huang, Chung-Shou Liao, Kunihiko Sadakane
2014	B	`conf`	DenseZDD: A Compact and Fast Index for Families of Sets. SEA Shuhei Denzumi, Jun Kawahara, Koji Tsuda, Hiroki Arimura, Shin-ichi Minato, Kunihiko Sadakane
2014	J	`jnl`	Fast relative Lempel-Ziv self-index for similar sequences. Theor. Comput. Sci. Huy Hoang Do, Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung
2014	J	`jnl`	Fully Functional Static and Dynamic Succinct Trees. ACM Trans. Algorithms Gonzalo Navarro, Kunihiko Sadakane
2014	J	`jnl`	Guest Editors' Foreword. J. Graph Algorithms Appl. Sudebkumar Prasant Pal, Kunihiko Sadakane
2014	J	`jnl`	Variable-Order de Bruijn Graphs. CoRR Christina Boucher, Alexander Bowe, Travis Gagie, Simon J. Puglisi, Kunihiko Sadakane
2013	J	`jnl`	Compact Data structures for Big Data (NII Shonan Meeting 2013-10). NII Shonan Meet. Rep. Kunihiko Sadakane, Wing-Kin Sung
2013	B	`conf`	Compressed Persistent Index for Efficient Rank/Select Queries. WADS Wing-Kai Hon, Lap-Kei Lee, Kunihiko Sadakane, Konstantinos Tsakalidis
2013	C	`conf`	Detecting Superbubbles in Assembly Graphs. WABI Taku Onodera, Kunihiko Sadakane, Tetsuo Shibuya
2013	J	`jnl`	Detecting Superbubbles in Assembly Graphs. CoRR Taku Onodera, Kunihiko Sadakane, Tetsuo Shibuya
2013	J	`jnl`	Efficient Error-tolerant Query Autocompletion. Proc. VLDB Endow. Chuan Xiao, Jianbin Qin, Wei Wang, Yoshiharu Ishikawa, Koji Tsuda, Kunihiko Sadakane
2013	C	`conf`	Fully-Online Grammar Compression. SPIRE Shirou Maruyama, Yasuo Tabei, Hiroshi Sakamoto, Kunihiko Sadakane
2013	—	`conf`	Reconstructing ISBRA Hoa Vu, Francis Y. L. Chin, Wing-Kai Hon, Henry C. M. Leung, Kunihiko Sadakane, Ken Wing-Kin Sung, Siu-Ming Yiu
2013	A	`conf`	Space-Time Trade-offs for Stack-Based Algorithms. STACS Luis Barba, Matias Korman, Stefan Langerman, Rodrigo I. Silveira, Kunihiko Sadakane
2012	J	`jnl`	An Efficient Alignment Algorithm for Searching Simple Pseudoknots over Long Genomic Sequence. IEEE ACM Trans. Comput. Biol. Bioinform. Christopher Ma, Thomas K. F. Wong, Tak Wah Lam, Wing-Kai Hon, Kunihiko Sadakane, Siu-Ming Yiu
2012	—	`conf`	CRAM: Compressed Random Access Memory. ICALP (1) Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung
2012	—	`conf`	Fast Relative Lempel-Ziv Self-index for Similar Sequences. FAW-AAIM Huy Hoang Do, Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung
2012	J	`jnl`	Faster computation of the Robinson-Foulds distance between phylogenetic networks. Inf. Sci. Tetsuo Asano, Jesper Jansson, Kunihiko Sadakane, Ryuhei Uehara, Gabriel Valiente
2012	J	`jnl`	Inferring a graph from path frequency. Discret. Appl. Math. Tatsuya Akutsu, Daiji Fukagawa, Jesper Jansson, Kunihiko Sadakane
2012	J	`jnl`	More efficient periodic traversal in anonymous undirected graphs. Theor. Comput. Sci. Jurek Czyzowicz, Stefan Dobrev, Leszek Gasieniec, David Ilcinkas, Jesper Jansson, Ralf Klasing, Ioannis Lignos, Russell Martin, Kunihiko Sadakane, Wing-Kin Sung
2012	J	`jnl`	Space-Time Trade-offs for Stack-Based Algorithms CoRR Luis Barba, Matias Korman, Stefan Langerman, Kunihiko Sadakane, Rodrigo I. Silveira
2012	J	`jnl`	Stronger Lempel-Ziv Based Compressed Text Indexing. Algorithmica Diego Arroyuelo, Gonzalo Navarro, Kunihiko Sadakane
2012	C	`conf`	Succinct de Bruijn Graphs. WABI Alexander Bowe, Taku Onodera, Kunihiko Sadakane, Tetsuo Shibuya
2012	J	`jnl`	Ultra-succinct representation of ordered trees with applications. J. Comput. Syst. Sci. Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung
2011	A*	`conf`	Random Access to grammar-Compressed Strings. SODA Philip Bille, Gad M. Landau, Rajeev Raman, Kunihiko Sadakane, Srinivasa Rao Satti, Oren Weimann
2011	J	`jnl`	Succinct data structures for Searchable Partial Sums with optimal worst-case performance. Theor. Comput. Sci. Wing-Kai Hon, Kunihiko Sadakane, Wing-Kin Sung
2010	J	`jnl`	Compressed random access memory CoRR Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung
2010	B	`conf`	Faster Computation of the Robinson-Foulds Distance between Phylogenetic Networks. CPM Tetsuo Asano, Jesper Jansson, Kunihiko Sadakane, Ryuhei Uehara, Gabriel Valiente
2010	A*	`conf`	Fully-Functional Succinct Trees. SODA Kunihiko Sadakane, Gonzalo Navarro
2010	J	`jnl`	Linear-time protein 3-D structure searching with insertions and deletions. Algorithms Mol. Biol. Tetsuo Shibuya, Jesper Jansson, Kunihiko Sadakane
2010	A	`conf`	Succinct Trees in Practice. ALENEX Diego Arroyuelo, Rodrigo Cánovas, Gonzalo Navarro, Kunihiko Sadakane
2010	J	`jnl`	The Space Complexity of Leader Election in Anonymous Networks. Int. J. Found. Comput. Sci. Ei Ando, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita
2010	J	`jnl`	The hitting and cover times of Metropolis walks. Theor. Comput. Sci. Yoshiaki Nonaka, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita
2009	C	`conf`	A Linear-Time Burrows-Wheeler Transform Using Induced Sorting. SPIRE Daisuke Okanohara, Kunihiko Sadakane
2009	J	`jnl`	Breaking a Time-and-Space Barrier in Constructing Full-Text Indices. SIAM J. Comput. Wing-Kai Hon, Kunihiko Sadakane, Wing-Kin Sung
2009	C	`conf`	Computing the Exact Distribution Function of the Stochastic Longest Path Length in a DAG. TAMC Ei Ando, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita
2009	J	`jnl`	Fully-Functional Static and Dynamic Succinct Trees CoRR Kunihiko Sadakane, Gonzalo Navarro
2009	—	`conf`	How to Design a Linear Cover Time Random Walk on a Finite Graph. SAGA Yoshiaki Nonaka, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita
2009	C	`conf`	Linear-Time Protein 3-D Structure Searching with Insertions and Deletions. WABI Tetsuo Shibuya, Jesper Jansson, Kunihiko Sadakane
2009	B	`conf`	More Efficient Periodic Traversal in Anonymous Undirected Graphs. SIROCCO Jurek Czyzowicz, Stefan Dobrev, Leszek Gasieniec, David Ilcinkas, Jesper Jansson, Ralf Klasing, Ioannis Lignos, Russell A. Martin, Kunihiko Sadakane, Wing-Kin Sung
2009	J	`jnl`	More efficient periodic traversal in anonymous undirected graphs CoRR Jurek Czyzowicz, Stefan Dobrev, Leszek Gasieniec, David Ilcinkas, Jesper Jansson, Ralf Klasing, Yannis Lignos, Russell A. Martin, Kunihiko Sadakane, Wing-Kin Sung
2008	A	`conf`	An Online Algorithm for Finding the Longest Previous Factors. ESA Daisuke Okanohara, Kunihiko Sadakane
2008	B	`conf`	Speeding Up Local-Search Type Algorithms for Designing DNA Sequences under Thermodynamical Constraints. DNA Suguru Kawashimo, Yen Kaow Ng, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita
2008	B	`conf`	The Balanced Edge Cover Problem. ISAAC Yuta Harada, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita
2008	A	`conf`	The space complexity of the leader election in anonymous networks. IPDPS Ei Ando, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita
2007	J	`jnl`	A Space and Time Efficient Algorithm for Constructing Compressed Suffix Arrays. Algorithmica Wing-Kai Hon, Tak Wah Lam, Kunihiko Sadakane, Wing-Kin Sung, Siu-Ming Yiu
2007	—	`conf`	Compressed Dynamic Tries with Applications to LZ-Compression in Sublinear Time and Space. FSTTCS Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung
2007	J	`jnl`	Compressed Suffix Trees with Full Functionality. Theory Comput. Syst. Kunihiko Sadakane
2007	J	`jnl`	Compressed indexes for dynamic text collections. ACM Trans. Algorithms Ho-Leung Chan, Wing-Kai Hon, Tak Wah Lam, Kunihiko Sadakane
2007	B	`conf`	Dynamic Neighborhood Searches for Thermodynamically Designing DNA Sequence. DNA Suguru Kawashimo, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita
2007	J	`jnl`	Faster suffix sorting. Theor. Comput. Sci. N. Jesper Larsson, Kunihiko Sadakane
2007	J	`jnl`	Optimal Balanced Semi-Matchings for Weighted Bipartite Graphs. Inf. Media Technol. Yuta Harada, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita
2007	A	`conf`	Practical Entropy-Compressed Rank/Select Dictionary. ALENEX Daisuke Okanohara, Kunihiko Sadakane
2007	J	`jnl`	Succinct data structures for flexible text retrieval systems. J. Discrete Algorithms Kunihiko Sadakane
2007	A*	`conf`	Ultra-succinct representation of ordered trees. SODA Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung
2006	B	`conf`	A Probabilistic Model of the DNA Conformational Change. DNA Masashi Shiozaki, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita
2006	—	`conf`	A generic search strategy for large-scale real-world networks. Infoscale Yuichi Kurumida, Tsukasa Ogata, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita
2006	B	`conf`	DNA Sequence Design by Dynamic Neighborhood Searches. DNA Suguru Kawashimo, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita
2006	J	`jnl`	Efficient Algorithms for Constructing a Pyramid from a Terrain. IEICE Trans. Inf. Syst. Jinhee Chun, Kunihiko Sadakane, Takeshi Tokuyama
2006	C	`conf`	Forest Search: A Paradigm for Faster Exploration of Scale-Free Networks. ISPA Yuichi Kurumida, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita
2006	J	`jnl`	Linear Time Algorithm for Approximating a Curve by a Single-Peaked Curve. Algorithmica Jinhee Chun, Kunihiko Sadakane, Takeshi Tokuyama
2006	J	`jnl`	Practical Entropy-Compressed Rank/Select Dictionary CoRR Daisuke Okanohara, Kunihiko Sadakane
2006	B	`conf`	Reducing the Space Requirement of LZ-Index. CPM Diego Arroyuelo, Gonzalo Navarro, Kunihiko Sadakane
2006	A*	`conf`	Squeezing succinct data structures into entropy bounds. SODA Kunihiko Sadakane, Roberto Grossi
2005	J	`jnl`	A Fast, Accurate, and Simple Method for Pricing European-Asian and Saving-Asian Options. Algorithmica Kenichiro Ohta, Kunihiko Sadakane, Akiyoshi Shioura, Takeshi Tokuyama
2005	B	`conf`	A Local Search Based Barrier Height Estimation Algorithm for DNA Molecular Transitions. DNA Tsutomu Takeda, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita
2005	J	`jnl`	Combinatorics and algorithms for low-discrepancy roundings of a real sequence. Theor. Comput. Sci. Kunihiko Sadakane, Nadia Takki-Chebihi, Takeshi Tokuyama
2005	J	`jnl`	Computing the maximum agreement of phylogenetic networks. Theor. Comput. Sci. Charles Choy, Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung
2005	A*	`conf`	Dynamic dictionary matching and compressed suffix trees. SODA Ho-Leung Chan, Wing-Kai Hon, Tak Wah Lam, Kunihiko Sadakane
2005	—	`conf`	Energy-Optimal Online Algorithms for Broadcasting in Wireless Networks. WONS Shay Kutten, Hirotaka Ono, David Peleg, Kunihiko Sadakane, Masafumi Yamashita
2005	B	`conf`	Finding Short Right-Hand-on-the-Wall Walks in Graphs. SIROCCO Stefan Dobrev, Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung
2005	J	`jnl`	Rooted Maximum Agreement Supertrees. Algorithmica Jesper Jansson, Joseph H.-K. Ng, Kunihiko Sadakane, Wing-Kin Sung
2004	B	`conf`	A Web Page Scoring Method for Local Web Search Engines. DASFAA Yohei Ikawa, Kunihiko Sadakane
2004	B	`conf`	Advantages of Backward Searching - Efficient Secondary Memory and Distributed Implementation of Compressed Suffix Arrays. ISAAC Veli Mäkinen, Gonzalo Navarro, Kunihiko Sadakane
2004	B	`conf`	Compressed Index for Dynamic Text. Data Compression Conference Wing-Kai Hon, Tak Wah Lam, Kunihiko Sadakane, Wing-Kin Sung, Siu-Ming Yiu
2004	—	`conf`	Computing the Maximum Agreement of Phylogenetic Networks. CATS Charles Choy, Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung
2004	—	`conf`	Neighborhood Composition: A Parallelization of Local Search Algorithms. PVM/MPI Yuichi Handa, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita
2004	B	`conf`	Rooted Maximum Agreement Supertrees. LATIN Jesper Jansson, Joseph H.-K. Ng, Kunihiko Sadakane, Wing-Kin Sung
2003	A*	`conf`	Breaking a Time-and-Space Barrier in Constructing Full-Text Indices. FOCS Wing-Kai Hon, Kunihiko Sadakane, Wing-Kin Sung
2003	B	`conf`	Constructing Compressed Suffix Arrays with Large Alphabets. ISAAC Wing-Kai Hon, Tak Wah Lam, Kunihiko Sadakane, Wing-Kin Sung
2003	B	`conf`	Linear Time Algorithm for Approximating a Curve by a Single-Peaked Curve. ISAAC Jinhee Chun, Kunihiko Sadakane, Takeshi Tokuyama
2003	J	`jnl`	New text indexing functionalities of the compressed suffix arrays. J. Algorithms Kunihiko Sadakane
2003	J	`jnl`	On-line scheduling with tight deadlines. Theor. Comput. Sci. Chiu-Yuen Koo, Tak Wah Lam, Tsuen-Wan Ngan, Kunihiko Sadakane, Kar-Keung To
2003	J	`jnl`	Quantum Algorithms for Intersection and Proximity Problems. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. Kunihiko Sadakane, Norito Sugawara, Takeshi Tokuyama
2003	B	`conf`	Succinct Data Structures for Searchable Partial Sums. ISAAC Wing-Kai Hon, Kunihiko Sadakane, Wing-Kin Sung
2002	A	`conf`	A Fast, Accurate and Simple Method for Pricing European-Asian and Saving-Asian Options. ESA Kenichiro Ohta, Kunihiko Sadakane, Akiyoshi Shioura, Takeshi Tokuyama
2002	Misc	`conf`	A Space and Time Efficient Algorithm for Constructing Compressed Suffix Arrays. COCOON Tak Wah Lam, Kunihiko Sadakane, Wing-Kin Sung, Siu-Ming Yiu
2002	—	`conf`	Data Compression Method Combining Properties of PPM and CTW. Progress in Discovery Science Takumi Okazaki, Kunihiko Sadakane, Hiroshi Imai
2002	—	`conf`	Discrepancy-Based Digital Halftoning: Automatic Evaluation and Optimization. Theoretical Foundations of Computer Vision Kunihiko Sadakane, Nadia Takki-Chebihi, Takeshi Tokuyama
2002	—	`conf`	Efficient Algorithms for Constructing a Pyramid from a Terrain. JCDCG Jinhee Chun, Kunihiko Sadakane, Takeshi Tokuyama
2002	B	`conf`	Space-Economical Algorithms for Finding Maximal Unique Matches. CPM Wing-Kai Hon, Kunihiko Sadakane
2002	B	`conf`	Space-Efficient Data Structures for Flexible Text Retrieval Systems. ISAAC Kunihiko Sadakane
2002	A*	`conf`	Succinct representations of lcp information and improvements in the compressed suffix arrays. SODA Kunihiko Sadakane
2001	A*	`conf`	Combinatorics and Algorithms on Low-Discrepancy Roundings of a Real Sequence. ICALP Kunihiko Sadakane, Nadia Takki-Chebihi, Takeshi Tokuyama
2001	B	`conf`	Quantum Algorithms for Intersection and Proximity Problems. ISAAC Kunihiko Sadakane, Norito Sugawara, Takeshi Tokuyama
2000	B	`conf`	Compressed Text Databases with Efficient Query Algorithms Based on the Compressed Suffix Array. ISAAC Kunihiko Sadakane
2000	B	`conf`	Implementing the Context Tree Weighting Method for Text Compression. Data Compression Conference Kunihiko Sadakane, Takumi Okazaki, Hiroshi Imai
1999	B	`conf`	A Modified Burrows-Wheeler Transformation for Case-Insensitive Search with Application to Suffix Array Compression. Data Compression Conference Kunihiko Sadakane
1999	B	`conf`	Finding Meaningful Regions Containing Given Keywords from Large Text Collections. Discovery Science Kunihiko Sadakane, Hiroshi Imai
1999	—	`conf`	Text Retrieval by Using k-word Proximity Search. DANTE Kunihiko Sadakane, Hiroshi Imai
1998	—	`conf`	A Cooperative Distributed Text Database Management Method Unifying Search and Compression Based on the Burrows-Wheeler Transformation. ER Workshops Kunihiko Sadakane, Hiroshi Imai
1998	B	`conf`	A Fast Algorithms for Making Suffix Arrays and for Burrows-Wheeler Transformation. Data Compression Conference Kunihiko Sadakane
1998	B	`conf`	On Optimality of Varients of the Block Sorting Compression. Data Compression Conference Kunihiko Sadakane
1998	—	`conf`	Voronoi Diagrams by Divergences with Additive Weights. SCG Kunihiko Sadakane, Hiroshi Imai, Kensuke Onishi, Mary Inaba, Fumihiko Takeuchi, Keiko Imai
1997	—	`conf`	Text compression using recency rank with context and relation to context sorting, block sorting and PPM SEQUENCES Kunihiko Sadakane
1995	Misc	`conf`	Output-size Sensitiveness of OBDD Construction Through Maximal Independent Set Problem. COCOON Kazuyoshi Hayase, Kunihiko Sadakane, Seiichiro Tani