| 2025 | ACNS | Oblivious Suffix Sorting: A Multi-Party Computation Scheme for Secure and Efficient Suffix Sorting. | Kota Isayama, Koki Jimbo, Naohiro Okamoto, Kunihiko Sadakane, Kazunari Tozawa |
| 2025 | CCS | Surpassing the Word Size Limitation of TFHE with Noise Calibration. | Takumi Nishimura, Kazunari Tozawa, Kunihiko Sadakane |
| 2024 | CCS | Secure Parallel Computation with Oblivious State Transitions. | Nuttapong Attrapadung, Kota Isayama, Kunihiko Sadakane, Kazunari Tozawa |
| 2024 | DCC | Succinct Data Structure for Graphs with d-Dimensional t-Representation. | Girish Balakrishnan, Sankardeep Chakraborty, Seungbum Jo, N. S. Narayanaswamy, Kunihiko Sadakane |
| 2024 | DCC | τλ-Index: Locating Rare Patterns in Similar Strings. | Long-Qi Chen, Che-Wei Tsao, Jin Jie Deng, Wing-Kai Hon, Kunihiko Sadakane |
| 2024 | ESA | A Simple Representation of Tree Covering Utilizing Balanced Parentheses and Efficient Implementation of Average-Case Optimal RMQs. | Kou Hamada, Sankardeep Chakraborty, Seungbum Jo, Takuto Koriyama, Kunihiko Sadakane, Srinivasa Rao Satti |
| 2024 | ISAAC | Succinct Data Structures for Baxter Permutation and Related Families. | Sankardeep Chakraborty, Seungbum Jo, Geunho Kim, Kunihiko Sadakane |
| 2024 | ISAAC | Enhancing Generalized Compressed Suffix Trees, with Applications. | Sankardeep Chakraborty, Kunihiko Sadakane, Wiktor Zuba |
| 2023 | DCC | Practical Implementations of Compressed RAM. | Seungbum Jo, Wooyoung Park, Kunihiko Sadakane, Srinivasa Rao Satti |
| 2023 | ISAAC | Shortest Beer Path Queries Based on Graph Decomposition. | Tesshu Hanaka, Hirotaka Ono, Kunihiko Sadakane, Kosuke Sugiyama |
| 2022 | CPM | Bi-Directional r-Indexes. | Yuma Arakawa, Gonzalo Navarro, Kunihiko Sadakane |
| 2022 | DCC | Succinct Data Structure for Path Graphs. | Girish Balakrishnan, N. S. Narayanaswamy, Sankardeep Chakraborty, Kunihiko Sadakane |
| 2022 | DCC | FM-Indexing Grammars Induced by Suffix Sorting for Long Patterns. | Jin Jie Deng, Wing-Kai Hon, Dominik Kppl, Kunihiko Sadakane |
| 2022 | ISAAC | Succinct Representations of Graphs (Invited Talk). | Kunihiko Sadakane |
| 2021 | COCOA | Succinct Data Structures for Series-Parallel, Block-Cactus and 3-Leaf Power Graphs. | Sankardeep Chakraborty, Seungbum Jo, Kunihiko Sadakane, Srinivasa Rao Satti |
| 2021 | DCC | Succinct representations of Intersection Graphs on a Circle. | Hseyin Acan, Sankardeep Chakraborty, Seungbum Jo, Kei Nakashima, Kunihiko Sadakane, Srinivasa Rao Satti |
| 2021 | DCC | Succinct Data Structures for Small Clique-Width Graphs. | Sankardeep Chakraborty, Seungbum Jo, Kunihiko Sadakane, Srinivasa Rao Satti |
| 2021 | LATA | Succinct Representations for (Non)Deterministic Finite Automata. | Sankardeep Chakraborty, Roberto Grossi, Kunihiko Sadakane, Srinivasa Rao Satti |
| 2020 | CPM | Compressed Orthogonal Search on Suffix Arrays with Applications to Range LCP. | Kotaro Matsuda, Kunihiko Sadakane, Tatiana Starikovskaya, Masakazu Tateshita |
| 2020 | ISAAC | Enumerating Range Modes. | Kentaro Sumigawa, Sankardeep Chakraborty, Kunihiko Sadakane, Srinivasa Rao Satti |
| 2020 | IWOCA | Optimal In-place Algorithms for Basic Graph Problems. | Sankardeep Chakraborty, Kunihiko Sadakane, Srinivasa Rao Satti |
| 2019 | MFCS | Indexing Graph Search Trees and Applications. | Sankardeep Chakraborty, Kunihiko Sadakane |
| 2018 | COCOON | A Linear-Space Data Structure for Range-LCP Queries in Poly-Logarithmic Time. | Paniz Abedin, Arnab Ganguly, Wing-Kai Hon, Yakov Nekrich, Kunihiko Sadakane, Rahul Shah, Sharma V. Thankachan |
| 2018 | IWOCA | An Efficient Representation of Partitions of Integers. | Kentaro Sumigawa, Kunihiko Sadakane |
| 2018 | KDD | Node Similarity with q -Grams for Real-World Labeled Networks. | Alessio Conte, Gaspare Ferraro, Roberto Grossi, Andrea Marino, Kunihiko Sadakane, Takeaki Uno |
| 2018 | WALCOM | Faster Network Algorithms Based on Graph Decomposition. | Manas Jyoti Kashyop, Tsunehiko Nagayama, Kunihiko Sadakane |
| 2017 | DCC | A Succinct Data Structure for Multidimensional Orthogonal Range Searching. | Kazuki Ishiyama, Kunihiko Sadakane |
| 2017 | SISAP | Succinct Quadtrees for Road Data. | Kazuki Ishiyama, Koji Kobayashi, Kunihiko Sadakane |
| 2017 | SISAP | Practical Space-Efficient Data Structures for High-Dimensional Orthogonal Range Searching. | Kazuki Ishiyama, Kunihiko Sadakane |
| 2017 | WALCOM | A Space-Efficient Algorithm for the Dynamic DFS Problem in Undirected Graphs. | Kengo Nakamura, Kunihiko Sadakane |
| 2016 | CPM | Space-Efficient Dictionaries for Parameterized and Order-Preserving Pattern Matching. | Arnab Ganguly, Wing-Kai Hon, Kunihiko Sadakane, Rahul Shah, Sharma V. Thankachan, Yilin Yang |
| 2016 | DCC | Lempel-Ziv Computation in Compressed Space (LZ-CICS). | Dominik Kppl, Kunihiko Sadakane |
| 2016 | IWOCA | Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing. | Takuya Takagi, Shunsuke Inenaga, Kunihiko Sadakane, Hiroki Arimura |
| 2015 | DCC | Variable-Order de Bruijn Graphs. | Christina Boucher, Alexander Bowe, Travis Gagie, Simon J. Puglisi, Kunihiko Sadakane |
| 2014 | ICALP | Canadians Should Travel Randomly. | Erik D. Demaine, Yamming Huang, Chung-Shou Liao, Kunihiko Sadakane |
| 2013 | STACS | Space-Time Trade-offs for Stack-Based Algorithms. | Luis Barba, Matias Korman, Stefan Langerman, Rodrigo I. Silveira, Kunihiko Sadakane |
| 2013 | SPIRE | Fully-Online Grammar Compression. | Shirou Maruyama, Yasuo Tabei, Hiroshi Sakamoto, Kunihiko Sadakane |
| 2013 | WABI | Detecting Superbubbles in Assembly Graphs. | Taku Onodera, Kunihiko Sadakane, Tetsuo Shibuya |
| 2013 | WADS | Compressed Persistent Index for Efficient Rank/Select Queries. | Wing-Kai Hon, Lap-Kei Lee, Kunihiko Sadakane, Konstantinos Tsakalidis |
| 2012 | AAIM | Fast Relative Lempel-Ziv Self-index for Similar Sequences. | Huy Hoang Do, Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung |
| 2012 | ICALP | CRAM: Compressed Random Access Memory. | Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung |
| 2012 | WABI | Succinct de Bruijn Graphs. | Alexander Bowe, Taku Onodera, Kunihiko Sadakane, Tetsuo Shibuya |
| 2011 | SODA | Random Access to grammar-Compressed Strings. | Philip Bille, Gad M. Landau, Rajeev Raman, Kunihiko Sadakane, Srinivasa Rao Satti, Oren Weimann |
| 2010 | ALENEX | Succinct Trees in Practice. | Diego Arroyuelo, Rodrigo Cnovas, Gonzalo Navarro, Kunihiko Sadakane |
| 2010 | CPM | Faster Computation of the Robinson-Foulds Distance between Phylogenetic Networks. | Tetsuo Asano, Jesper Jansson, Kunihiko Sadakane, Ryuhei Uehara, Gabriel Valiente |
| 2010 | SODA | Fully-Functional Succinct Trees. | Kunihiko Sadakane, Gonzalo Navarro |
| 2009 | SIROCCO | More Efficient Periodic Traversal in Anonymous Undirected Graphs. | Jurek Czyzowicz, Stefan Dobrev, Leszek Gasieniec, David Ilcinkas, Jesper Jansson, Ralf Klasing, Ioannis Lignos, Russell A. Martin, Kunihiko Sadakane, Wing-Kin Sung |
| 2009 | SPIRE | A Linear-Time Burrows-Wheeler Transform Using Induced Sorting. | Daisuke Okanohara, Kunihiko Sadakane |
| 2009 | TAMC | Computing the Exact Distribution Function of the Stochastic Longest Path Length in a DAG. | Ei Ando, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita |
| 2009 | WABI | Linear-Time Protein 3-D Structure Searching with Insertions and Deletions. | Tetsuo Shibuya, Jesper Jansson, Kunihiko Sadakane |
| 2008 | DNA | Speeding Up Local-Search Type Algorithms for Designing DNA Sequences under Thermodynamical Constraints. | Suguru Kawashimo, Yen Kaow Ng, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita |
| 2008 | ESA | An Online Algorithm for Finding the Longest Previous Factors. | Daisuke Okanohara, Kunihiko Sadakane |
| 2008 | ISAAC | The Balanced Edge Cover Problem. | Yuta Harada, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita |
| 2007 | ALENEX | Practical Entropy-Compressed Rank/Select Dictionary. | Daisuke Okanohara, Kunihiko Sadakane |
| 2007 | DNA | Dynamic Neighborhood Searches for Thermodynamically Designing DNA Sequence. | Suguru Kawashimo, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita |
| 2007 | SODA | Ultra-succinct representation of ordered trees. | Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung |
| 2006 | CPM | Reducing the Space Requirement of LZ-Index. | Diego Arroyuelo, Gonzalo Navarro, Kunihiko Sadakane |
| 2006 | DNA | DNA Sequence Design by Dynamic Neighborhood Searches. | Suguru Kawashimo, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita |
| 2006 | DNA | A Probabilistic Model of the DNA Conformational Change. | Masashi Shiozaki, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita |
| 2006 | ISPA | Forest Search: A Paradigm for Faster Exploration of Scale-Free Networks. | Yuichi Kurumida, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita |
| 2006 | SODA | Squeezing succinct data structures into entropy bounds. | Kunihiko Sadakane, Roberto Grossi |
| 2005 | DNA | A Local Search Based Barrier Height Estimation Algorithm for DNA Molecular Transitions. | Tsutomu Takeda, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita |
| 2005 | SODA | Dynamic dictionary matching and compressed suffix trees. | Ho-Leung Chan, Wing-Kai Hon, Tak Wah Lam, Kunihiko Sadakane |
| 2005 | SIROCCO | Finding Short Right-Hand-on-the-Wall Walks in Graphs. | Stefan Dobrev, Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung |
| 2004 | DASFAA | A Web Page Scoring Method for Local Web Search Engines. | Yohei Ikawa, Kunihiko Sadakane |
| 2004 | DCC | Compressed Index for Dynamic Text. | Wing-Kai Hon, Tak Wah Lam, Kunihiko Sadakane, Wing-Kin Sung, Siu-Ming Yiu |
| 2004 | ISAAC | Advantages of Backward Searching - Efficient Secondary Memory and Distributed Implementation of Compressed Suffix Arrays. | Veli Mkinen, Gonzalo Navarro, Kunihiko Sadakane |
| 2004 | LATIN | Rooted Maximum Agreement Supertrees. | Jesper Jansson, Joseph H.-K. Ng, Kunihiko Sadakane, Wing-Kin Sung |
| 2003 | FOCS | Breaking a Time-and-Space Barrier in Constructing Full-Text Indices. | Wing-Kai Hon, Kunihiko Sadakane, Wing-Kin Sung |
| 2003 | ISAAC | Linear Time Algorithm for Approximating a Curve by a Single-Peaked Curve. | Jinhee Chun, Kunihiko Sadakane, Takeshi Tokuyama |
| 2003 | ISAAC | Constructing Compressed Suffix Arrays with Large Alphabets. | Wing-Kai Hon, Tak Wah Lam, Kunihiko Sadakane, Wing-Kin Sung |
| 2003 | ISAAC | Succinct Data Structures for Searchable Partial Sums. | Wing-Kai Hon, Kunihiko Sadakane, Wing-Kin Sung |
| 2002 | COCOON | A Space and Time Efficient Algorithm for Constructing Compressed Suffix Arrays. | Tak Wah Lam, Kunihiko Sadakane, Wing-Kin Sung, Siu-Ming Yiu |
| 2002 | CPM | Space-Economical Algorithms for Finding Maximal Unique Matches. | Wing-Kai Hon, Kunihiko Sadakane |
| 2002 | ESA | A Fast, Accurate and Simple Method for Pricing European-Asian and Saving-Asian Options. | Kenichiro Ohta, Kunihiko Sadakane, Akiyoshi Shioura, Takeshi Tokuyama |
| 2002 | ISAAC | Space-Efficient Data Structures for Flexible Text Retrieval Systems. | Kunihiko Sadakane |
| 2002 | SODA | Succinct representations of lcp information and improvements in the compressed suffix arrays. | Kunihiko Sadakane |
| 2001 | ICALP | Combinatorics and Algorithms on Low-Discrepancy Roundings of a Real Sequence. | Kunihiko Sadakane, Nadia Takki-Chebihi, Takeshi Tokuyama |
| 2001 | ISAAC | Quantum Algorithms for Intersection and Proximity Problems. | Kunihiko Sadakane, Norito Sugawara, Takeshi Tokuyama |
| 2000 | DCC | Implementing the Context Tree Weighting Method for Text Compression. | Kunihiko Sadakane, Takumi Okazaki, Hiroshi Imai |
| 2000 | ISAAC | Compressed Text Databases with Efficient Query Algorithms Based on the Compressed Suffix Array. | Kunihiko Sadakane |
| 1999 | DCC | A Modified Burrows-Wheeler Transformation for Case-Insensitive Search with Application to Suffix Array Compression. | Kunihiko Sadakane |
| 1999 | DIS | Finding Meaningful Regions Containing Given Keywords from Large Text Collections. | Kunihiko Sadakane, Hiroshi Imai |
| 1998 | DCC | A Fast Algorithms for Making Suffix Arrays and for Burrows-Wheeler Transformation. | Kunihiko Sadakane |
| 1998 | DCC | On Optimality of Varients of the Block Sorting Compression. | Kunihiko Sadakane |
| 1998 | ER | A Cooperative Distributed Text Database Management Method Unifying Search and Compression Based on the Burrows-Wheeler Transformation. | Kunihiko Sadakane, Hiroshi Imai |
| 1995 | COCOON | Output-size Sensitiveness of OBDD Construction Through Maximal Independent Set Problem. | Kazuyoshi Hayase, Kunihiko Sadakane, Seiichiro Tani |