Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Kunihiko Sadakane
2010 – today
- 2013
[c61]Hoa Vu, Francis Y. L. Chin, Wing-Kai Hon, Henry C. M. Leung, Kunihiko Sadakane, Ken Wing-Kin Sung, Siu-Ming Yiu: Reconstructing k-Reticulated Phylogenetic Network from a Set of Gene Trees. ISBRA 2013: 112-124- [c60]Luis Barba, Matias Korman, Stefan Langerman, Rodrigo I. Silveira, Kunihiko Sadakane: Space-Time Trade-offs for Stack-Based Algorithms. STACS 2013: 281-292
- 2012
- [j25]Diego Arroyuelo, Gonzalo Navarro, Kunihiko Sadakane: Stronger Lempel-Ziv Based Compressed Text Indexing. Algorithmica 62(1-2): 54-101 (2012)
- [j24]Tatsuya Akutsu, Daiji Fukagawa, Jesper Jansson, Kunihiko Sadakane: Inferring a graph from path frequency. Discrete Applied Mathematics 160(10-11): 1416-1428 (2012)
- [j23]Tetsuo Asano, Jesper Jansson, Kunihiko Sadakane, Ryuhei Uehara, Gabriel Valiente: Faster computation of the Robinson-Foulds distance between phylogenetic networks. Inf. Sci. 197: 77-90 (2012)
- [j22]Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung: Ultra-succinct representation of ordered trees with applications. J. Comput. Syst. Sci. 78(2): 619-631 (2012)
- [j21]Christopher Ma, Thomas K. F. Wong, Tak Wah Lam, Wing-Kai Hon, Kunihiko Sadakane, Siu-Ming Yiu: An Efficient Alignment Algorithm for Searching Simple Pseudoknots over Long Genomic Sequence. IEEE/ACM Trans. Comput. Biology Bioinform. 9(6): 1629-1638 (2012)
- [j20]Jurek Czyzowicz, Stefan Dobrev, Leszek Gasieniec, David Ilcinkas, Jesper Jansson, Ralf Klasing, Ioannis Lignos, Russell Martin, Kunihiko Sadakane, Wing-Kin Sung: More efficient periodic traversal in anonymous undirected graphs. Theor. Comput. Sci. 444: 60-76 (2012)
- [c59]Huy Hoang Do, Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung: Fast Relative Lempel-Ziv Self-index for Similar Sequences. FAW-AAIM 2012: 291-302
- [c58]Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung: CRAM: Compressed Random Access Memory. ICALP (1) 2012: 510-521
- [c57]Alexander Bowe, Taku Onodera, Kunihiko Sadakane, Tetsuo Shibuya: Succinct de Bruijn Graphs. WABI 2012: 225-235
- [i5]Luis Barba, Matias Korman, Stefan Langerman, Kunihiko Sadakane, Rodrigo I. Silveira: Space-Time Trade-offs for Stack-Based Algorithms. CoRR abs/1208.3663 (2012)
- 2011
- [j19]Wing-Kai Hon, Kunihiko Sadakane, Wing-Kin Sung: Succinct data structures for Searchable Partial Sums with optimal worst-case performance. Theor. Comput. Sci. 412(39): 5176-5186 (2011)
- [c56]Philip Bille, Gad M. Landau, Rajeev Raman, Kunihiko Sadakane, Srinivasa Rao Satti, Oren Weimann: Random Access to grammar-Compressed Strings. SODA 2011: 373-389
- 2010
- [j18]Tetsuo Shibuya, Jesper Jansson, Kunihiko Sadakane: Linear-time protein 3-D structure searching with insertions and deletions. Algorithms for Molecular Biology 5: 7 (2010)
- [j17]Ei Ando, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita: The Space Complexity of Leader Election in Anonymous Networks. Int. J. Found. Comput. Sci. 21(3): 427-440 (2010)
- [j16]Yoshiaki Nonaka, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita: The hitting and cover times of Metropolis walks. Theor. Comput. Sci. 411(16-18): 1889-1894 (2010)
- [c55]Diego Arroyuelo, Rodrigo Cánovas, Gonzalo Navarro, Kunihiko Sadakane: Succinct Trees in Practice. ALENEX 2010: 84-97
- [c54]Tetsuo Asano, Jesper Jansson, Kunihiko Sadakane, Ryuhei Uehara, Gabriel Valiente: Faster Computation of the Robinson-Foulds Distance between Phylogenetic Networks. CPM 2010: 190-201
- [c53]
- [i4]Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung: Compressed random access memory. CoRR abs/1011.1708 (2010)
2000 – 2009
- 2009
- [j15]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)
- [c52]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
- [c51]Jurek Czyzowicz, Stefan Dobrev, Leszek Gasieniec, David Ilcinkas, Jesper Jansson, Ralf Klasing, Ioannis Lignos, Russell A. Martin, Kunihiko Sadakane, Wing-Kin Sung: More Efficient Periodic Traversal in Anonymous Undirected Graphs. SIROCCO 2009: 167-181
- [c50]Daisuke Okanohara, Kunihiko Sadakane: A Linear-Time Burrows-Wheeler Transform Using Induced Sorting. SPIRE 2009: 90-101
- [c49]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
- [c48]Tetsuo Shibuya, Jesper Jansson, Kunihiko Sadakane: Linear-Time Protein 3-D Structure Searching with Insertions and Deletions. WABI 2009: 310-320
- [i3]Kunihiko Sadakane, Gonzalo Navarro: Fully-Functional Static and Dynamic Succinct Trees. CoRR abs/0905.0768 (2009)
- [i2]Jurek Czyzowicz, Stefan Dobrev, Leszek Gasieniec, David Ilcinkas, Jesper Jansson, Ralf Klasing, Yannis Lignos, Russell A. Martin, Kunihiko Sadakane, Wing-Kin Sung: More efficient periodic traversal in anonymous undirected graphs. CoRR abs/0905.1737 (2009)
- 2008
- [c47]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
- [c46]Daisuke Okanohara, Kunihiko Sadakane: An Online Algorithm for Finding the Longest Previous Factors. ESA 2008: 696-707
- [c45]Ei Ando, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita: The space complexity of the leader election in anonymous networks. IPDPS 2008: 1-8
- [c44]Yuta Harada, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita: The Balanced Edge Cover Problem. ISAAC 2008: 246-257
- 2007
- [j14]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)
- [j13]Kunihiko Sadakane: Succinct data structures for flexible text retrieval systems. J. Discrete Algorithms 5(1): 12-22 (2007)
- [j12]Kunihiko Sadakane: Compressed Suffix Trees with Full Functionality. Theory Comput. Syst. 41(4): 589-607 (2007)
- [j11]Ho-Leung Chan, Wing-Kai Hon, Tak Wah Lam, Kunihiko Sadakane: Compressed indexes for dynamic text collections. ACM Transactions on Algorithms 3(2) (2007)
- [j10]N. Jesper Larsson, Kunihiko Sadakane: Faster suffix sorting. Theor. Comput. Sci. 387(3): 258-272 (2007)
- [c43]Daisuke Okanohara, Kunihiko Sadakane: Practical Entropy-Compressed Rank/Select Dictionary. ALENEX 2007
- [c42]Suguru Kawashimo, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita: Dynamic Neighborhood Searches for Thermodynamically Designing DNA Sequence. DNA 2007: 130-139
- [c41]Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung: Compressed Dynamic Tries with Applications to LZ-Compression in Sublinear Time and Space. FSTTCS 2007: 424-435
- [c40]Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung: Ultra-succinct representation of ordered trees. SODA 2007: 575-584
- 2006
- [j9]Jinhee Chun, Kunihiko Sadakane, Takeshi Tokuyama: Linear Time Algorithm for Approximating a Curve by a Single-Peaked Curve. Algorithmica 44(2): 103-115 (2006)
- [j8]Jinhee Chun, Kunihiko Sadakane, Takeshi Tokuyama: Efficient Algorithms for Constructing a Pyramid from a Terrain. IEICE Transactions 89-D(2): 783-788 (2006)
- [c39]Diego Arroyuelo, Gonzalo Navarro, Kunihiko Sadakane: Reducing the Space Requirement of LZ-Index. CPM 2006: 318-329
- [c38]Suguru Kawashimo, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita: DNA Sequence Design by Dynamic Neighborhood Searches. DNA 2006: 157-171
- [c37]Masashi Shiozaki, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita: A Probabilistic Model of the DNA Conformational Change. DNA 2006: 274-285
- [c36]Yuichi Kurumida, Tsukasa Ogata, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita: A generic search strategy for large-scale real-world networks. Infoscale 2006: 2
- [c35]Yuichi Kurumida, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita: Forest Search: A Paradigm for Faster Exploration of Scale-Free Networks. ISPA 2006: 39-50
- [c34]Kunihiko Sadakane, Roberto Grossi: Squeezing succinct data structures into entropy bounds. SODA 2006: 1230-1239
- [i1]Daisuke Okanohara, Kunihiko Sadakane: Practical Entropy-Compressed Rank/Select Dictionary. CoRR abs/cs/0610001 (2006)
- 2005
- [j7]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)
- [j6]Jesper Jansson, Joseph H.-K. Ng, Kunihiko Sadakane, Wing-Kin Sung: Rooted Maximum Agreement Supertrees. Algorithmica 43(4): 293-307 (2005)
- [j5]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)
- [j4]Charles Choy, Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung: Computing the maximum agreement of phylogenetic networks. Theor. Comput. Sci. 335(1): 93-107 (2005)
- [c33]Tsutomu Takeda, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita: A Local Search Based Barrier Height Estimation Algorithm for DNA Molecular Transitions. DNA 2005: 359-370
- [c32]Stefan Dobrev, Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung: Finding Short Right-Hand-on-the-Wall Walks in Graphs. SIROCCO 2005: 127-139
- [c31]Ho-Leung Chan, Wing-Kai Hon, Tak Wah Lam, Kunihiko Sadakane: Dynamic dictionary matching and compressed suffix trees. SODA 2005: 13-22
- [c30]Shay Kutten, Hirotaka Ono, David Peleg, Kunihiko Sadakane, Masafumi Yamashita: Energy-Optimal Online Algorithms for Broadcasting in Wireless Networks. WONS 2005: 125-130
- 2004
- [j3]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)
- [c29]Yohei Ikawa, Kunihiko Sadakane: A Web Page Scoring Method for Local Web Search Engines. DASFAA 2004: 606-617
- [c28]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
- [c27]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
- [c26]Jesper Jansson, Joseph H.-K. Ng, Kunihiko Sadakane, Wing-Kin Sung: Rooted Maximum Agreement Supertrees. LATIN 2004: 499-508
- [c25]Yuichi Handa, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita: Neighborhood Composition: A Parallelization of Local Search Algorithms. PVM/MPI 2004: 155-163
- 2003
- [j2]Kunihiko Sadakane: New text indexing functionalities of the compressed suffix arrays. J. Algorithms 48(2): 294-313 (2003)
- [j1]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)
- [c24]Wing-Kai Hon, Kunihiko Sadakane, Wing-Kin Sung: Breaking a Time-and-Space Barrier in Constructing Full-Text Indices. FOCS 2003: 251-260
- [c23]Jinhee Chun, Kunihiko Sadakane, Takeshi Tokuyama: Linear Time Algorithm for Approximating a Curve by a Single-Peaked Curve. ISAAC 2003: 6-15
- [c22]Wing-Kai Hon, Tak Wah Lam, Kunihiko Sadakane, Wing-Kin Sung: Constructing Compressed Suffix Arrays with Large Alphabets. ISAAC 2003: 240-249
- [c21]Wing-Kai Hon, Kunihiko Sadakane, Wing-Kin Sung: Succinct Data Structures for Searchable Partial Sums. ISAAC 2003: 505-516
- 2002
- [c20]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
- [c19]Wing-Kai Hon, Kunihiko Sadakane: Space-Economical Algorithms for Finding Maximal Unique Matches. CPM 2002: 144-152
- [c18]Takumi Okazaki, Kunihiko Sadakane, Hiroshi Imai: Data Compression Method Combining Properties of PPM and CTW. Progress in Discovery Science 2002: 268-283
- [c17]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
- [c16]Kunihiko Sadakane: Space-Efficient Data Structures for Flexible Text Retrieval Systems. ISAAC 2002: 14-24
- [c15]Jinhee Chun, Kunihiko Sadakane, Takeshi Tokuyama: Efficient Algorithms for Constructing a Pyramid from a Terrain. JCDCG 2002: 108-117
- [c14]Kunihiko Sadakane: Succinct representations of lcp information and improvements in the compressed suffix arrays. SODA 2002: 225-232
- [c13]Kunihiko Sadakane, Nadia Takki-Chebihi, Takeshi Tokuyama: Discrepancy-Based Digital Halftoning: Automatic Evaluation and Optimization. Theoretical Foundations of Computer Vision 2002: 301-319
- 2001
- [c12]Kunihiko Sadakane, Nadia Takki-Chebihi, Takeshi Tokuyama: Combinatorics and Algorithms on Low-Discrepancy Roundings of a Real Sequence. ICALP 2001: 166-177
- [c11]Kunihiko Sadakane, Norito Sugawara, Takeshi Tokuyama: Quantum Algorithms for Intersection and Proximity Problems. ISAAC 2001: 148-159
- 2000
- [c10]Kunihiko Sadakane, Takumi Okazaki, Hiroshi Imai: Implementing the Context Tree Weighting Method for Text Compression. Data Compression Conference 2000: 123-132
- [c9]Kunihiko Sadakane: Compressed Text Databases with Efficient Query Algorithms Based on the Compressed Suffix Array. ISAAC 2000: 410-421
1990 – 1999
- 1999
- [c8]Kunihiko Sadakane, Hiroshi Imai: Text Retrieval by Using k-word Proximity Search. DANTE 1999: 183-188
- [c7]Kunihiko Sadakane: A Modified Burrows-Wheeler Transformation for Case-Insensitive Search with Application to Suffix Array Compression. Data Compression Conference 1999: 548
- [c6]Kunihiko Sadakane, Hiroshi Imai: Finding Meaningful Regions Containing Given Keywords from Large Text Collections. Discovery Science 1999: 353-354
- 1998
- [c5]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
- [c4]Kunihiko Sadakane: A Fast Algorithms for Making Suffix Arrays and for Burrows-Wheeler Transformation. Data Compression Conference 1998: 129-138
- [c3]Kunihiko Sadakane: On Optimality of Varients of the Block Sorting Compression. Data Compression Conference 1998: 570
- [c2]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
- 1995
- [c1]Kazuyoshi Hayase, Kunihiko Sadakane, Seiichiro Tani: Output-size Sensitiveness of OBDD Construction Through Maximal Independent Set Problem. COCOON 1995: 229-234
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-12 21:35 CEST by the dblp team