| |
      |
                                          |
Note: Links lead to the DBLP on the Web. Kunihiko Sadakane Stefan Dobrev , Jesper Jansson , Kunihiko Sadakane, Wing-Kin Sung : Finding Short Right-Hand-on-the-Wall Walks in Graphs. SIROCCO 2005 : 127-139 Shay Kutten , Hirotaka Ono , David Peleg , Kunihiko Sadakane, Masafumi Yamashita : Energy-Optimal Online Algorithms for Broadcasting in Wireless Networks. WONS 2005 : 125-130 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) 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) Charles Choy , Jesper Jansson , Kunihiko Sadakane, Wing-Kin Sung : Computing the maximum agreement of phylogenetic networks. Theor. Comput. Sci. 335 (1): 93-107 (2005) Yohei Ikawa , Kunihiko Sadakane: A Web Page Scoring Method for Local Web Search Engines. DASFAA 2004 : 606-617 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 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 Jesper Jansson , Joseph H.-K. Ng , Kunihiko Sadakane, Wing-Kin Sung : Rooted Maximum Agreement Supertrees. LATIN 2004 : 499-508 Yuichi Handa , Hirotaka Ono , Kunihiko Sadakane, Masafumi Yamashita : Neighborhood Composition: A Parallelization of Local Search Algorithms. PVM/MPI 2004 : 155-163 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) Wing-Kai Hon , Kunihiko Sadakane, Wing-Kin Sung : Breaking a Time-and-Space Barrier in Constructing Full-Text Indices. FOCS 2003 : 251-260 Wing-Kai Hon , Tak Wah Lam , Kunihiko Sadakane, Wing-Kin Sung : Constructing Compressed Suffix Arrays with Large Alphabets. ISAAC 2003 : 240-249 Wing-Kai Hon , Kunihiko Sadakane, Wing-Kin Sung : Succinct Data Structures for Searchable Partial Sums. ISAAC 2003 : 505-516 Jinhee Chun , Kunihiko Sadakane, Takeshi Tokuyama : Linear Time Algorithm for Approximating a Curve by a Single-Peaked Curve. ISAAC 2003 : 6-15 Kunihiko Sadakane: New text indexing functionalities of the compressed suffix arrays. J. Algorithms 48 (2): 294-313 (2003) Chiu-Yuen Koo , Tak Wah Lam , Tsuen-Wan Ngan , Kunihiko Sadakane, Kar-Keung To : On-line scheduling with tight deadlines. Theor. Comput. Sci. 1-3 : 251-261 (2003) 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 Wing-Kai Hon , Kunihiko Sadakane: Space-Economical Algorithms for Finding Maximal Unique Matches. CPM 2002 : 144-152 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 Kunihiko Sadakane: Space-Efficient Data Structures for Flexible Text Retrieval Systems. ISAAC 2002 : 14-24 Jinhee Chun , Kunihiko Sadakane, Takeshi Tokuyama : Efficient Algorithms for Constructing a Pyramid from a Terrain. JCDCG 2002 : 108-117 Takumi Okazaki , Kunihiko Sadakane, Hiroshi Imai : Data Compression Method Combining Properties of PPM and CTW. Progress in Discovery Science 2002 : 268-283 Kunihiko Sadakane: Succinct representations of lcp information and improvements in the compressed suffix arrays. SODA 2002 : 225-232 Kunihiko Sadakane, Nadia Takki-Chebihi , Takeshi Tokuyama : Discrepancy-Based Digital Halftoning: Automatic Evaluation and Optimization. Theoretical Foundations of Computer Vision 2002 : 301-319 Kunihiko Sadakane, Nadia Takki-Chebihi , Takeshi Tokuyama : Combinatorics and Algorithms on Low-Discrepancy Roundings of a Real Sequence. ICALP 2001 : 166-177 Kunihiko Sadakane, Norito Sugawara , Takeshi Tokuyama : Quantum Algorithms for Intersection and Proximity Problems. ISAAC 2001 : 148-159 Kunihiko Sadakane, Takumi Okazaki , Hiroshi Imai : Implementing the Context Tree Weighting Method for Text Compression. Data Compression Conference 2000 : 123-132 Kunihiko Sadakane: Compressed Text Databases with Efficient Query Algorithms Based on the Compressed Suffix Array. ISAAC 2000 : 410-421 Kunihiko Sadakane, Hiroshi Imai : Text Retrieval by Using k-word Proximity Search. DANTE 1999 : 183-188 Kunihiko Sadakane: A Modified Burrows-Wheeler Transformation for Case-Insensitive Search with Application to Suffix Array Compression. Data Compression Conference 1999 : 548 Kunihiko Sadakane, Hiroshi Imai : Finding Meaningful Regions Containing Given Keywords from Large Text Collections. Discovery Science 1999 : 353-354 Kunihiko Sadakane: A Fast Algorithms for Making Suffix Arrays and for Burrows-Wheeler Transformation. Data Compression Conference 1998 : 129-138 Kunihiko Sadakane: On Optimality of Varients of the Block Sorting Compression. Data Compression Conference 1998 : 570 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 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 Kazuyoshi Hayase , Kunihiko Sadakane, Seiichiro Tani : Output-size Sensitiveness of OBDD Construction Through Maximal Independent Set Problem. COCOON 1995 : 229-234 1 [ 27 ] [ 33 ] 2 [ 16 ] [ 23 ] 3 [ 37 ] 4 [ 28 ] 5 [ 1 ] 6 [ 19 ] [ 24 ] [ 25 ] [ 26 ] [ 31 ] 7 [ 32 ] 8 [ 2 ] [ 3 ] [ 6 ] [ 8 ] [ 10 ] [ 15 ] 9 [ 2 ] 10 [ 2 ] 11 [ 27 ] [ 29 ] [ 33 ] [ 37 ] 12 [ 21 ] 13 [ 36 ] 14 [ 20 ] [ 21 ] [ 25 ] [ 31 ] 15 [ 30 ] 16 [ 30 ] 17 [ 29 ] 18 [ 21 ] 19 [ 18 ] [ 35 ] 20 [ 10 ] [ 15 ] 21 [ 2 ] 22 [ 28 ] [ 36 ] 23 [ 36 ] 24 [ 18 ] [ 35 ] 25 [ 11 ] 26 [ 20 ] [ 24 ] [ 25 ] [ 26 ] [ 27 ] [ 29 ] [ 31 ] [ 33 ] [ 37 ] 27 [ 2 ] 28 [ 12 ] [ 13 ] [ 34 ] 29 [ 1 ] 30 [ 21 ] 31 [ 11 ] [ 12 ] [ 13 ] [ 16 ] [ 18 ] [ 23 ] [ 34 ] [ 35 ] 32 [ 28 ] [ 36 ] 33 [ 20 ] [ 31 ]  ©2005 Association for Computing Machinery |
