| 2009 | ||
|---|---|---|
| 69 | 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 | |
| 68 | Daisuke Okanohara, Kunihiko Sadakane: A Linear-Time Burrows-Wheeler Transform Using Induced Sorting. SPIRE 2009: 90-101 | |
| 67 | 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 | |
| 66 | Tetsuo Shibuya, Jesper Jansson, Kunihiko Sadakane: Linear-Time Protein 3-D Structure Searching with Insertions and Deletions. WABI 2009: 310-320 | |
| 65 | Kunihiko Sadakane, Gonzalo Navarro: Fully-Functional Static and Dynamic Succinct Trees CoRR abs/0905.0768: (2009) | |
| 64 | Jurek Czyzowicz, Stefan Dobrev, Leszek Gasieniec, David Ilcinkas, Jesper Jansson, Ralf Klasing, Yannis Lignos, R. Martin, Kunihiko Sadakane, W.-K. Sung: More efficient periodic traversal in anonymous undirected graphs CoRR abs/0905.1737: (2009) | |
| 63 | 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) | |
| 2008 | ||
| 62 | 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 | |
| 61 | Daisuke Okanohara, Kunihiko Sadakane: An Online Algorithm for Finding the Longest Previous Factors. ESA 2008: 696-707 | |
| 60 | Ei Ando, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita: The space complexity of the leader election in anonymous networks. IPDPS 2008: 1-8 | |
| 59 | Yuta Harada, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita: The Balanced Edge Cover Problem. ISAAC 2008: 246-257 | |
| 2007 | ||
| 58 | Daisuke Okanohara, Kunihiko Sadakane: Practical Entropy-Compressed Rank/Select Dictionary. ALENEX 2007 | |
| 57 | Suguru Kawashimo, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita: Dynamic Neighborhood Searches for Thermodynamically Designing DNA Sequence. DNA 2007: 130-139 | |
| 56 | Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung: Compressed Dynamic Tries with Applications to LZ-Compression in Sublinear Time and Space. FSTTCS 2007: 424-435 | |
| 55 | Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung: Ultra-succinct representation of ordered trees. SODA 2007: 575-584 | |
| 54 | Ho-Leung Chan, Wing-Kai Hon, Tak Wah Lam, Kunihiko Sadakane: Compressed indexes for dynamic text collections. ACM Transactions on Algorithms 3(2): (2007) | |
| 53 | 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) | |
| 52 | Kunihiko Sadakane: Succinct data structures for flexible text retrieval systems. J. Discrete Algorithms 5(1): 12-22 (2007) | |
| 51 | N. Jesper Larsson, Kunihiko Sadakane: Faster suffix sorting. Theor. Comput. Sci. 387(3): 258-272 (2007) | |
| 50 | Kunihiko Sadakane: Compressed Suffix Trees with Full Functionality. Theory Comput. Syst. 41(4): 589-607 (2007) | |
| 2006 | ||
| 49 | Diego Arroyuelo, Gonzalo Navarro, Kunihiko Sadakane: Reducing the Space Requirement of LZ-Index. CPM 2006: 318-329 | |
| 48 | Suguru Kawashimo, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita: DNA Sequence Design by Dynamic Neighborhood Searches. DNA 2006: 157-171 | |
| 47 | Masashi Shiozaki, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita: A Probabilistic Model of the DNA Conformational Change. DNA 2006: 274-285 | |
| 46 | Yuichi Kurumida, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita: Forest Search: A Paradigm for Faster Exploration of Scale-Free Networks. ISPA 2006: 39-50 | |
| 45 | Yuichi Kurumida, Tsukasa Ogata, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita: A generic search strategy for large-scale real-world networks. Infoscale 2006: 2 | |
| 44 | Kunihiko Sadakane, Roberto Grossi: Squeezing succinct data structures into entropy bounds. SODA 2006: 1230-1239 | |
| 43 | Jinhee Chun, Kunihiko Sadakane, Takeshi Tokuyama: Linear Time Algorithm for Approximating a Curve by a Single-Peaked Curve. Algorithmica 44(2): 103-115 (2006) | |
| 42 | Daisuke Okanohara, Kunihiko Sadakane: Practical Entropy-Compressed Rank/Select Dictionary CoRR abs/cs/0610001: (2006) | |
| 41 | Jinhee Chun, Kunihiko Sadakane, Takeshi Tokuyama: Efficient Algorithms for Constructing a Pyramid from a Terrain. IEICE Transactions 89-D(2): 783-788 (2006) | |
| 2005 | ||
| 40 | Tsutomu Takeda, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita: A Local Search Based Barrier Height Estimation Algorithm for DNA Molecular Transitions. DNA 2005: 359-370 | |
| 39 | Stefan Dobrev, Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung: Finding Short Right-Hand-on-the-Wall Walks in Graphs. SIROCCO 2005: 127-139 | |
| 38 | Ho-Leung Chan, Wing-Kai Hon, Tak Wah Lam, Kunihiko Sadakane: Dynamic dictionary matching and compressed suffix trees. SODA 2005: 13-22 | |
| 37 | Shay Kutten, Hirotaka Ono, David Peleg, Kunihiko Sadakane, Masafumi Yamashita: Energy-Optimal Online Algorithms for Broadcasting in Wireless Networks. WONS 2005: 125-130 | |
| 36 | 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) | |
| 35 | Jesper Jansson, Joseph H.-K. Ng, Kunihiko Sadakane, Wing-Kin Sung: Rooted Maximum Agreement Supertrees. Algorithmica 43(4): 293-307 (2005) | |
| 34 | 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) | |
| 33 | Charles Choy, Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung: Computing the maximum agreement of phylogenetic networks. Theor. Comput. Sci. 335(1): 93-107 (2005) | |
| 2004 | ||
| 32 | Yohei Ikawa, Kunihiko Sadakane: A Web Page Scoring Method for Local Web Search Engines. DASFAA 2004: 606-617 | |
| 31 | 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 | |
| 30 | 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 | |
| 29 | Jesper Jansson, Joseph H.-K. Ng, Kunihiko Sadakane, Wing-Kin Sung: Rooted Maximum Agreement Supertrees. LATIN 2004: 499-508 | |
| 28 | Yuichi Handa, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita: Neighborhood Composition: A Parallelization of Local Search Algorithms. PVM/MPI 2004: 155-163 | |
| 27 | Charles Choy, Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung: Computing the Maximum Agreement of Phylogenetic Networks. Electr. Notes Theor. Comput. Sci. 91: 134-147 (2004) | |
| 2003 | ||
| 26 | Wing-Kai Hon, Kunihiko Sadakane, Wing-Kin Sung: Breaking a Time-and-Space Barrier in Constructing Full-Text Indices. FOCS 2003: 251-260 | |
| 25 | Wing-Kai Hon, Tak Wah Lam, Kunihiko Sadakane, Wing-Kin Sung: Constructing Compressed Suffix Arrays with Large Alphabets. ISAAC 2003: 240-249 | |
| 24 | Wing-Kai Hon, Kunihiko Sadakane, Wing-Kin Sung: Succinct Data Structures for Searchable Partial Sums. ISAAC 2003: 505-516 | |
| 23 | Jinhee Chun, Kunihiko Sadakane, Takeshi Tokuyama: Linear Time Algorithm for Approximating a Curve by a Single-Peaked Curve. ISAAC 2003: 6-15 | |
| 22 | Kunihiko Sadakane: New text indexing functionalities of the compressed suffix arrays. J. Algorithms 48(2): 294-313 (2003) | |
| 21 | 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) | |
| 2002 | ||
| 20 | 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 | |
| 19 | Wing-Kai Hon, Kunihiko Sadakane: Space-Economical Algorithms for Finding Maximal Unique Matches. CPM 2002: 144-152 | |
| 18 | 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 | |
| 17 | Kunihiko Sadakane: Space-Efficient Data Structures for Flexible Text Retrieval Systems. ISAAC 2002: 14-24 | |
| 16 | Jinhee Chun, Kunihiko Sadakane, Takeshi Tokuyama: Efficient Algorithms for Constructing a Pyramid from a Terrain. JCDCG 2002: 108-117 | |
| 15 | Takumi Okazaki, Kunihiko Sadakane, Hiroshi Imai: Data Compression Method Combining Properties of PPM and CTW. Progress in Discovery Science 2002: 268-283 | |
| 14 | Kunihiko Sadakane: Succinct representations of lcp information and improvements in the compressed suffix arrays. SODA 2002: 225-232 | |
| 13 | Kunihiko Sadakane, Nadia Takki-Chebihi, Takeshi Tokuyama: Discrepancy-Based Digital Halftoning: Automatic Evaluation and Optimization. Theoretical Foundations of Computer Vision 2002: 301-319 | |
| 2001 | ||
| 12 | Kunihiko Sadakane, Nadia Takki-Chebihi, Takeshi Tokuyama: Combinatorics and Algorithms on Low-Discrepancy Roundings of a Real Sequence. ICALP 2001: 166-177 | |
| 11 | Kunihiko Sadakane, Norito Sugawara, Takeshi Tokuyama: Quantum Algorithms for Intersection and Proximity Problems. ISAAC 2001: 148-159 | |
| 2000 | ||
| 10 | Kunihiko Sadakane, Takumi Okazaki, Hiroshi Imai: Implementing the Context Tree Weighting Method for Text Compression. Data Compression Conference 2000: 123-132 | |
| 9 | Kunihiko Sadakane: Compressed Text Databases with Efficient Query Algorithms Based on the Compressed Suffix Array. ISAAC 2000: 410-421 | |
| 1999 | ||
| 8 | Kunihiko Sadakane, Hiroshi Imai: Text Retrieval by Using k-word Proximity Search. DANTE 1999: 183-188 | |
| 7 | Kunihiko Sadakane: A Modified Burrows-Wheeler Transformation for Case-Insensitive Search with Application to Suffix Array Compression. Data Compression Conference 1999: 548 | |
| 6 | Kunihiko Sadakane, Hiroshi Imai: Finding Meaningful Regions Containing Given Keywords from Large Text Collections. Discovery Science 1999: 353-354 | |
| 1998 | ||
| 5 | Kunihiko Sadakane: A Fast Algorithms for Making Suffix Arrays and for Burrows-Wheeler Transformation. Data Compression Conference 1998: 129-138 | |
| 4 | Kunihiko Sadakane: On Optimality of Varients of the Block Sorting Compression. Data Compression Conference 1998: 570 | |
| 3 | 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 | |
| 2 | Kunihiko Sadakane, Hiroshi Imai, Kensuke Onishi, Mary Inaba, Fumihiko Takeuchi, Keiko Imai: Voronoi Diagrams by Divergences with Additive Weights. Symposium on Computational Geometry 1998: 403-404 | |
| 1995 | ||
| 1 | Kazuyoshi Hayase, Kunihiko Sadakane, Seiichiro Tani: Output-size Sensitiveness of OBDD Construction Through Maximal Independent Set Problem. COCOON 1995: 229-234 | |