2013
91Reconstructing k-Reticulated Phylogenetic Network from a Set of Gene Trees. Hoa Vu, Francis Y. L. Chin, Wing-Kai Hon, Henry C. M. Leung, Kunihiko Sadakane, Ken Wing-Kin Sung, Siu-Ming Yiu. ISBRA 2013, 112-124. Web SearchBibTeXDownload
90Space-Time Trade-offs for Stack-Based Algorithms. Luis Barba, Matias Korman, Stefan Langerman, Rodrigo I. Silveira, Rodrigo I. Silveira. STACS 2013, 281-292. Web SearchBibTeXDownload
2012
89Stronger Lempel-Ziv Based Compressed Text Indexing. Diego Arroyuelo, Gonzalo Navarro, Kunihiko Sadakane. Algorithmica (62): 54-101 (2012). Web SearchBibTeXDownload
88Space-Time Trade-offs for Stack-Based Algorithms. Luis Barba, Matias Korman, Stefan Langerman, Rodrigo I. Silveira, Rodrigo I. Silveira. CoRR (abs/1208.3663) (2012). Web SearchBibTeXDownload
87Inferring a graph from path frequency. Tatsuya Akutsu, Daiji Fukagawa, Jesper Jansson, Kunihiko Sadakane. Discrete Applied Mathematics (160): 1416-1428 (2012). Web SearchBibTeXDownload
86Fast Relative Lempel-Ziv Self-index for Similar Sequences. Huy Hoang Do, Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung. FAW-AAIM 2012, 291-302. Web SearchBibTeXDownload
85CRAM: Compressed Random Access Memory. Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung. ICALP (1) 2012, 510-521. Web SearchBibTeXDownload
84An Efficient Alignment Algorithm for Searching Simple Pseudoknots over Long Genomic Sequence. Christopher Ma, Thomas K. F. Wong, Tak Wah Lam, Wing-Kai Hon, Kunihiko Sadakane, Siu-Ming Yiu. IEEE/ACM Trans. Comput. Biology Bioinform. (9): 1629-1638 (2012). Web SearchBibTeXDownload
83Faster computation of the Robinson-Foulds distance between phylogenetic networks. Tetsuo Asano, Jesper Jansson, Kunihiko Sadakane, Ryuhei Uehara, Gabriel Valiente. Inf. Sci. (197): 77-90 (2012). Web SearchBibTeXDownload
82Ultra-succinct representation of ordered trees with applications. Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung. J. Comput. Syst. Sci. (78): 619-631 (2012). Web SearchBibTeXDownload
81More 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, W.-K. Sung. Theor. Comput. Sci. (444): 60-76 (2012). Web SearchBibTeXDownload
80Succinct de Bruijn Graphs. Alexander Bowe, Taku Onodera, Kunihiko Sadakane, Tetsuo Shibuya. WABI 2012, 225-235. Web SearchBibTeXDownload
2011
79Random Access to grammar-Compressed Strings. Philip Bille, Gad M. Landau, Rajeev Raman, Kunihiko Sadakane, Srinivasa Rao Satti, Oren Weimann. SODA 2011, 373-389. Web SearchBibTeXDownload
78Succinct data structures for Searchable Partial Sums with optimal worst-case performance. Wing-Kai Hon, Kunihiko Sadakane, Wing-Kin Sung. Theor. Comput. Sci. (412): 5176-5186 (2011). Web SearchBibTeXDownload
2010
77Succinct Trees in Practice. Diego Arroyuelo, Rodrigo Cánovas, Gonzalo Navarro, Kunihiko Sadakane. ALENEX 2010, 84-97. Web SearchBibTeXDownload
76Linear-time protein 3-D structure searching with insertions and deletions. Tetsuo Shibuya, Jesper Jansson, Kunihiko Sadakane. Algorithms for Molecular Biology (5): 7 (2010). Web SearchBibTeXDownload
75Compressed random access memory. Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung. CoRR (abs/1011.1708) (2010). Web SearchBibTeXDownload
74Faster Computation of the Robinson-Foulds Distance between Phylogenetic Networks. Tetsuo Asano, Jesper Jansson, Kunihiko Sadakane, Ryuhei Uehara, Gabriel Valiente. CPM 2010, 190-201. Web SearchBibTeXDownload
73The Space Complexity of Leader Election in Anonymous Networks. Ei Ando, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita. Int. J. Found. Comput. Sci. (21): 427-440 (2010). Web SearchBibTeXDownload
72Fully-Functional Succinct Trees. Kunihiko Sadakane, Gonzalo Navarro. SODA 2010, 134-149. Web SearchBibTeXDownload
71The hitting and cover times of Metropolis walks. Yoshiaki Nonaka, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita. Theor. Comput. Sci. (411): 1889-1894 (2010). Web SearchBibTeXDownload
2009
70More 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, W.-K. Sung. CoRR (abs/0905.1737) (2009). Web SearchBibTeXDownload
69Fully-Functional Static and Dynamic Succinct Trees. Kunihiko Sadakane, Gonzalo Navarro. CoRR (abs/0905.0768) (2009). Web SearchBibTeXDownload
68How to Design a Linear Cover Time Random Walk on a Finite Graph. Yoshiaki Nonaka, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita. SAGA 2009, 104-116. Web SearchBibTeXDownload
67Breaking a Time-and-Space Barrier in Constructing Full-Text Indices. Wing-Kai Hon, Kunihiko Sadakane, Wing-Kin Sung. SIAM J. Comput. (38): 2162-2178 (2009). Web SearchBibTeXDownload
66More 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. SIROCCO 2009, 167-181. Web SearchBibTeXDownload
65A Linear-Time Burrows-Wheeler Transform Using Induced Sorting. Daisuke Okanohara, Kunihiko Sadakane. SPIRE 2009, 90-101. Web SearchBibTeXDownload
64Computing the Exact Distribution Function of the Stochastic Longest Path Length in a DAG. Ei Ando, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita. TAMC 2009, 98-107. Web SearchBibTeXDownload
63Linear-Time Protein 3-D Structure Searching with Insertions and Deletions. Tetsuo Shibuya, Jesper Jansson, Kunihiko Sadakane. WABI 2009, 310-320. Web SearchBibTeXDownload
2008
62Speeding Up Local-Search Type Algorithms for Designing DNA Sequences under Thermodynamical Constraints. Suguru Kawashimo, Yen Kaow Ng, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita. DNA 2008, 168-178. Web SearchBibTeXDownload
61An Online Algorithm for Finding the Longest Previous Factors. Daisuke Okanohara, Kunihiko Sadakane. ESA 2008, 696-707. Web SearchBibTeXDownload
60The space complexity of the leader election in anonymous networks. Ei Ando, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita. IPDPS 2008, 1-8. Web SearchBibTeXDownload
59The Balanced Edge Cover Problem. Yuta Harada, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita. ISAAC 2008, 246-257. Web SearchBibTeXDownload
2007
58Compressed indexes for dynamic text collections. Ho-Leung Chan, Wing-Kai Hon, Tak Wah Lam, Kunihiko Sadakane. ACM Transactions on Algorithms (3) (2007). Web SearchBibTeXDownload
57Practical Entropy-Compressed Rank/Select Dictionary. Daisuke Okanohara, Kunihiko Sadakane. ALENEX 2007. Web SearchBibTeXDownload
56A Space and Time Efficient Algorithm for Constructing Compressed Suffix Arrays. Tak Wah Lam, Tak Wah Lam, Wing-Kin Sung, Wing-Kin Sung, Siu-Ming Yiu. Algorithmica (48): 23-36 (2007). Web SearchBibTeXDownload
55Dynamic Neighborhood Searches for Thermodynamically Designing DNA Sequence. Suguru Kawashimo, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita. DNA 2007, 130-139. Web SearchBibTeXDownload
54Compressed Dynamic Tries with Applications to LZ-Compression in Sublinear Time and Space. Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung. FSTTCS 2007, 424-435. Web SearchBibTeXDownload
53Succinct data structures for flexible text retrieval systems. Kunihiko Sadakane. J. Discrete Algorithms (5): 12-22 (2007). Web SearchBibTeXDownload
52Ultra-succinct representation of ordered trees. Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung. SODA 2007, 575-584. Web SearchBibTeXDownload
51Faster suffix sorting. N. Jesper Larsson, Kunihiko Sadakane. Theor. Comput. Sci. (387): 258-272 (2007). Web SearchBibTeXDownload
50Compressed Suffix Trees with Full Functionality. Kunihiko Sadakane. Theory Comput. Syst. (41): 589-607 (2007). Web SearchBibTeXDownload
2006
49Linear Time Algorithm for Approximating a Curve by a Single-Peaked Curve. Jinhee Chun, Kunihiko Sadakane, Takeshi Tokuyama. Algorithmica (44): 103-115 (2006). Web SearchBibTeXDownload
48Practical Entropy-Compressed Rank/Select Dictionary. Daisuke Okanohara, Kunihiko Sadakane. CoRR (abs/cs/0610001) (2006). Web SearchBibTeXDownload
47Reducing the Space Requirement of LZ-Index. Diego Arroyuelo, Gonzalo Navarro, Kunihiko Sadakane. CPM 2006, 318-329. Web SearchBibTeXDownload
46DNA Sequence Design by Dynamic Neighborhood Searches. Suguru Kawashimo, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita. DNA 2006, 157-171. Web SearchBibTeXDownload
45A Probabilistic Model of the DNA Conformational Change. Masashi Shiozaki, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita. DNA 2006, 274-285. Web SearchBibTeXDownload
44Efficient Algorithms for Constructing a Pyramid from a Terrain. Jinhee Chun, Kunihiko Sadakane, Takeshi Tokuyama. IEICE Transactions (89-D): 783-788 (2006). Web SearchBibTeXDownload
43A generic search strategy for large-scale real-world networks. Yuichi Kurumida, Tsukasa Ogata, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita. Infoscale 2006, 2. Web SearchBibTeXDownload
42Forest Search: A Paradigm for Faster Exploration of Scale-Free Networks. Yuichi Kurumida, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita. ISPA 2006, 39-50. Web SearchBibTeXDownload
41Squeezing succinct data structures into entropy bounds. Kunihiko Sadakane, Roberto Grossi. SODA 2006, 1230-1239. Web SearchBibTeXDownload
2005
40Rooted Maximum Agreement Supertrees. Jesper Jansson, Joseph H.-K. Ng, Kunihiko Sadakane, Wing-Kin Sung. Algorithmica (43): 293-307 (2005). Web SearchBibTeXDownload
39A Fast, Accurate, and Simple Method for Pricing European-Asian and Saving-Asian Options. Kenichiro Ohta, Kunihiko Sadakane, Akiyoshi Shioura, Takeshi Tokuyama. Algorithmica (42): 141-158 (2005). Web SearchBibTeXDownload
38A Local Search Based Barrier Height Estimation Algorithm for DNA Molecular Transitions. Tsutomu Takeda, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita. DNA 2005, 359-370. Web SearchBibTeXDownload
37Finding Short Right-Hand-on-the-Wall Walks in Graphs. Stefan Dobrev, Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung. SIROCCO 2005, 127-139. Web SearchBibTeXDownload
36Dynamic dictionary matching and compressed suffix trees. Ho-Leung Chan, Wing-Kai Hon, Tak Wah Lam, Kunihiko Sadakane. SODA 2005, 13-22. Web SearchBibTeXDownload
35Computing the maximum agreement of phylogenetic networks. Charles Choy, Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung. Theor. Comput. Sci. (335): 93-107 (2005). Web SearchBibTeXDownload
34Combinatorics and algorithms for low-discrepancy roundings of a real sequence. Kunihiko Sadakane, Nadia Takki-Chebihi, Takeshi Tokuyama. Theor. Comput. Sci. (331): 23-36 (2005). Web SearchBibTeXDownload
33Energy-Optimal Online Algorithms for Broadcasting in Wireless Networks. Shay Kutten, Hirotaka Ono, David Peleg, Kunihiko Sadakane, Masafumi Yamashita. WONS 2005, 125-130. Web SearchBibTeXDownload
2004
32A Web Page Scoring Method for Local Web Search Engines. Yohei Ikawa, Kunihiko Sadakane. DASFAA 2004, 606-617. Web SearchBibTeXDownload
31Compressed Index for Dynamic Text. Wing-Kai Hon, Tak Wah Lam, Kunihiko Sadakane, Wing-Kin Sung, Siu-Ming Yiu. Data Compression Conference 2004, 102-111. Web SearchBibTeXDownload
30Computing the Maximum Agreement of Phylogenetic Networks. Charles Choy, Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung. Electr. Notes Theor. Comput. Sci. (91): 134-147 (2004). Web SearchBibTeXDownload
29Advantages of Backward Searching - Efficient Secondary Memory and Distributed Implementation of Compressed Suffix Arrays. Veli Mäkinen, Gonzalo Navarro, Kunihiko Sadakane. ISAAC 2004, 681-692. Web SearchBibTeXDownload
28Rooted Maximum Agreement Supertrees. Jesper Jansson, Joseph H.-K. Ng, Kunihiko Sadakane, Wing-Kin Sung. LATIN 2004, 499-508. Web SearchBibTeXDownload
27Neighborhood Composition: A Parallelization of Local Search Algorithms. Yuichi Handa, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita. PVM/MPI 2004, 155-163. Web SearchBibTeXDownload
2003
26Breaking a Time-and-Space Barrier in Constructing Full-Text Indices. Wing-Kai Hon, Kunihiko Sadakane, Wing-Kin Sung. FOCS 2003, 251-260. Web SearchBibTeXDownload
25Succinct Data Structures for Searchable Partial Sums. Wing-Kai Hon, Kunihiko Sadakane, Wing-Kin Sung. ISAAC 2003, 505-516. Web SearchBibTeXDownload
24Constructing Compressed Suffix Arrays with Large Alphabets. Wing-Kai Hon, Tak Wah Lam, Kunihiko Sadakane, Wing-Kin Sung. ISAAC 2003, 240-249. Web SearchBibTeXDownload
23Linear Time Algorithm for Approximating a Curve by a Single-Peaked Curve. Jinhee Chun, Kunihiko Sadakane, Takeshi Tokuyama. ISAAC 2003, 6-15. Web SearchBibTeXDownload
22New text indexing functionalities of the compressed suffix arrays. Kunihiko Sadakane. J. Algorithms (48): 294-313 (2003). Web SearchBibTeXDownload
21On-line scheduling with tight deadlines. Chiu-Yuen Koo, Tak Wah Lam, Tsuen-Wan Ngan, Kunihiko Sadakane, Kar-Keung To. Theor. Comput. Sci. (295): 251-261 (2003). Web SearchBibTeXDownload
2002
20A Space and Time Efficient Algorithm for Constructing Compressed Suffix Arrays. Tak Wah Lam, Tak Wah Lam, Wing-Kin Sung, Wing-Kin Sung, Siu-Ming Yiu. COCOON 2002, 401-410. Web SearchBibTeXDownload
19Space-Economical Algorithms for Finding Maximal Unique Matches. Wing-Kai Hon, Kunihiko Sadakane. CPM 2002, 144-152. Web SearchBibTeXDownload
18A Fast, Accurate and Simple Method for Pricing European-Asian and Saving-Asian Options. Kenichiro Ohta, Kunihiko Sadakane, Akiyoshi Shioura, Takeshi Tokuyama. ESA 2002, 772-784. Web SearchBibTeXDownload
17Space-Efficient Data Structures for Flexible Text Retrieval Systems. Kunihiko Sadakane. ISAAC 2002, 14-24. Web SearchBibTeXDownload
16Efficient Algorithms for Constructing a Pyramid from a Terrain. Jinhee Chun, Kunihiko Sadakane, Takeshi Tokuyama. JCDCG 2002, 108-117. Web SearchBibTeXDownload
15Data Compression Method Combining Properties of PPM and CTW. Takumi Okazaki, Kunihiko Sadakane, Hiroshi Imai. Progress in Discovery Science 2002, 268-283. Web SearchBibTeXDownload
14Succinct representations of lcp information and improvements in the compressed suffix arrays. Kunihiko Sadakane. SODA 2002, 225-232. Web SearchBibTeXDownload
13Discrepancy-Based Digital Halftoning: Automatic Evaluation and Optimization. Kunihiko Sadakane, Nadia Takki-Chebihi, Takeshi Tokuyama. Theoretical Foundations of Computer Vision 2002, 301-319. Web SearchBibTeXDownload
2001
12Combinatorics and Algorithms on Low-Discrepancy Roundings of a Real Sequence. Kunihiko Sadakane, Nadia Takki-Chebihi, Takeshi Tokuyama. ICALP 2001, 166-177. Web SearchBibTeXDownload
11Quantum Algorithms for Intersection and Proximity Problems. Kunihiko Sadakane, Norito Sugawara, Takeshi Tokuyama. ISAAC 2001, 148-159. Web SearchBibTeXDownload
2000
10Implementing the Context Tree Weighting Method for Text Compression. Kunihiko Sadakane, Takumi Okazaki, Hiroshi Imai. Data Compression Conference 2000, 123-132. Web SearchBibTeXDownload
9Compressed Text Databases with Efficient Query Algorithms Based on the Compressed Suffix Array. Kunihiko Sadakane. ISAAC 2000, 410-421. Web SearchBibTeXDownload
1999
8Text Retrieval by Using k-word Proximity Search. Kunihiko Sadakane, Hiroshi Imai. DANTE 1999, 183-188. Web SearchBibTeXDownload
7A Modified Burrows-Wheeler Transformation for Case-Insensitive Search with Application to Suffix Array Compression. Kunihiko Sadakane. Data Compression Conference 1999, 548. Web SearchBibTeXDownload
6Finding Meaningful Regions Containing Given Keywords from Large Text Collections. Kunihiko Sadakane, Hiroshi Imai. Discovery Science 1999, 353-354. Web SearchBibTeXDownload
1998
5On Optimality of Varients of the Block Sorting Compression. Kunihiko Sadakane. Data Compression Conference 1998, 570. Web SearchBibTeXDownload
4A Fast Algorithms for Making Suffix Arrays and for Burrows-Wheeler Transformation. Kunihiko Sadakane. Data Compression Conference 1998, 129-138. Web SearchBibTeXDownload
3A Cooperative Distributed Text Database Management Method Unifying Search and Compression Based on the Burrows-Wheeler Transformation. Kunihiko Sadakane, Hiroshi Imai. ER Workshops 1998, 434-445. Web SearchBibTeX
2Voronoi Diagrams by Divergences with Additive Weights. Kunihiko Sadakane, Hiroshi Imai, Kensuke Onishi, Mary Inaba, Fumihiko Takeuchi, Keiko Imai. Symposium on Computational Geometry 1998, 403-404. Web SearchBibTeXDownload
1995
1Output-size Sensitiveness of OBDD Construction Through Maximal Independent Set Problem. Kazuyoshi Hayase, Kunihiko Sadakane, Seiichiro Tani. COCOON 1995, 229-234. Web SearchBibTeXDownload
from DBLP and Google Scholar
Developed by the Database Group at the University of Wisconsin and Yahoo! Research