The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Kunihiko Sadakane: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Kunihiko Sadakane
    A Fast Algorithms for Making Suffix Arrays and for Burrows-Wheeler Transformation. [Citation Graph (1, 0)][DBLP]
    Data Compression Conference, 1998, pp:129-138 [Conf]
  2. Kazuyoshi Hayase, Kunihiko Sadakane, Seiichiro Tani
    Output-size Sensitiveness of OBDD Construction Through Maximal Independent Set Problem. [Citation Graph (0, 0)][DBLP]
    COCOON, 1995, pp:229-234 [Conf]
  3. Tak Wah Lam, Kunihiko Sadakane, Wing-Kin Sung, Siu-Ming Yiu
    A Space and Time Efficient Algorithm for Constructing Compressed Suffix Arrays. [Citation Graph (0, 0)][DBLP]
    COCOON, 2002, pp:401-410 [Conf]
  4. Kunihiko Sadakane, Hiroshi Imai, Kensuke Onishi, Mary Inaba, Fumihiko Takeuchi, Keiko Imai
    Voronoi Diagrams by Divergences with Additive Weights. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1998, pp:403-404 [Conf]
  5. Diego Arroyuelo, Gonzalo Navarro, Kunihiko Sadakane
    Reducing the Space Requirement of LZ-Index. [Citation Graph (0, 0)][DBLP]
    CPM, 2006, pp:318-329 [Conf]
  6. Wing-Kai Hon, Kunihiko Sadakane
    Space-Economical Algorithms for Finding Maximal Unique Matches. [Citation Graph (0, 0)][DBLP]
    CPM, 2002, pp:144-152 [Conf]
  7. Kunihiko Sadakane, Hiroshi Imai
    Text Retrieval by Using k-word Proximity Search. [Citation Graph (0, 0)][DBLP]
    DANTE, 1999, pp:183-188 [Conf]
  8. Yohei Ikawa, Kunihiko Sadakane
    A Web Page Scoring Method for Local Web Search Engines. [Citation Graph (0, 0)][DBLP]
    DASFAA, 2004, pp:606-617 [Conf]
  9. Wing-Kai Hon, Tak Wah Lam, Kunihiko Sadakane, Wing-Kin Sung, Siu-Ming Yiu
    Compressed Index for Dynamic Text. [Citation Graph (0, 0)][DBLP]
    Data Compression Conference, 2004, pp:102-111 [Conf]
  10. Kunihiko Sadakane
    On Optimality of Varients of the Block Sorting Compression. [Citation Graph (0, 0)][DBLP]
    Data Compression Conference, 1998, pp:570- [Conf]
  11. Kunihiko Sadakane
    A Modified Burrows-Wheeler Transformation for Case-Insensitive Search with Application to Suffix Array Compression. [Citation Graph (0, 0)][DBLP]
    Data Compression Conference, 1999, pp:548- [Conf]
  12. Kunihiko Sadakane, Takumi Okazaki, Hiroshi Imai
    Implementing the Context Tree Weighting Method for Text Compression. [Citation Graph (0, 0)][DBLP]
    Data Compression Conference, 2000, pp:123-132 [Conf]
  13. Kunihiko Sadakane, Hiroshi Imai
    Finding Meaningful Regions Containing Given Keywords from Large Text Collections. [Citation Graph (0, 0)][DBLP]
    Discovery Science, 1999, pp:353-354 [Conf]
  14. Suguru Kawashimo, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita
    DNA Sequence Design by Dynamic Neighborhood Searches. [Citation Graph (0, 0)][DBLP]
    DNA, 2006, pp:157-171 [Conf]
  15. Masashi Shiozaki, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita
    A Probabilistic Model of the DNA Conformational Change. [Citation Graph (0, 0)][DBLP]
    DNA, 2006, pp:274-285 [Conf]
  16. Tsutomu Takeda, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita
    A Local Search Based Barrier Height Estimation Algorithm for DNA Molecular Transitions. [Citation Graph (0, 0)][DBLP]
    DNA, 2005, pp:359-370 [Conf]
  17. Takumi Okazaki, Kunihiko Sadakane, Hiroshi Imai
    Data Compression Method Combining Properties of PPM and CTW. [Citation Graph (0, 0)][DBLP]
    Progress in Discovery Science, 2002, pp:268-283 [Conf]
  18. Kunihiko Sadakane, Hiroshi Imai
    A Cooperative Distributed Text Database Management Method Unifying Search and Compression Based on the Burrows-Wheeler Transformation. [Citation Graph (0, 3)][DBLP]
    ER Workshops, 1998, pp:434-445 [Conf]
  19. Kenichiro Ohta, Kunihiko Sadakane, Akiyoshi Shioura, Takeshi Tokuyama
    A Fast, Accurate and Simple Method for Pricing European-Asian and Saving-Asian Options. [Citation Graph (0, 0)][DBLP]
    ESA, 2002, pp:772-784 [Conf]
  20. Wing-Kai Hon, Kunihiko Sadakane, Wing-Kin Sung
    Breaking a Time-and-Space Barrier in Constructing Full-Text Indices. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:251-260 [Conf]
  21. Kunihiko Sadakane, Nadia Takki-Chebihi, Takeshi Tokuyama
    Combinatorics and Algorithms on Low-Discrepancy Roundings of a Real Sequence. [Citation Graph (0, 0)][DBLP]
    ICALP, 2001, pp:166-177 [Conf]
  22. Jinhee Chun, Kunihiko Sadakane, Takeshi Tokuyama
    Linear Time Algorithm for Approximating a Curve by a Single-Peaked Curve. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2003, pp:6-15 [Conf]
  23. Wing-Kai Hon, Tak Wah Lam, Kunihiko Sadakane, Wing-Kin Sung
    Constructing Compressed Suffix Arrays with Large Alphabets. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2003, pp:240-249 [Conf]
  24. Wing-Kai Hon, Kunihiko Sadakane, Wing-Kin Sung
    Succinct Data Structures for Searchable Partial Sums. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2003, pp:505-516 [Conf]
  25. Veli Mäkinen, Gonzalo Navarro, Kunihiko Sadakane
    Advantages of Backward Searching - Efficient Secondary Memory and Distributed Implementation of Compressed Suffix Arrays. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:681-692 [Conf]
  26. Kunihiko Sadakane
    Compressed Text Databases with Efficient Query Algorithms Based on the Compressed Suffix Array. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2000, pp:410-421 [Conf]
  27. Kunihiko Sadakane
    Space-Efficient Data Structures for Flexible Text Retrieval Systems. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2002, pp:14-24 [Conf]
  28. Kunihiko Sadakane, Norito Sugawara, Takeshi Tokuyama
    Quantum Algorithms for Intersection and Proximity Problems. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2001, pp:148-159 [Conf]
  29. Yuichi Kurumida, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita
    Forest Search: A Paradigm for Faster Exploration of Scale-Free Networks. [Citation Graph (0, 0)][DBLP]
    ISPA, 2006, pp:39-50 [Conf]
  30. Jinhee Chun, Kunihiko Sadakane, Takeshi Tokuyama
    Efficient Algorithms for Constructing a Pyramid from a Terrain. [Citation Graph (0, 0)][DBLP]
    JCDCG, 2002, pp:108-117 [Conf]
  31. Jesper Jansson, Joseph H.-K. Ng, Kunihiko Sadakane, Wing-Kin Sung
    Rooted Maximum Agreement Supertrees. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:499-508 [Conf]
  32. Yuichi Handa, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita
    Neighborhood Composition: A Parallelization of Local Search Algorithms. [Citation Graph (0, 0)][DBLP]
    PVM/MPI, 2004, pp:155-163 [Conf]
  33. Shlomi Dobrev, Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung
    Finding Short Right-Hand-on-the-Wall Walks in Graphs. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2005, pp:127-139 [Conf]
  34. Ho-Leung Chan, Wing-Kai Hon, Tak Wah Lam, Kunihiko Sadakane
    Dynamic dictionary matching and compressed suffix trees. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:13-22 [Conf]
  35. Kunihiko Sadakane
    Succinct representations of lcp information and improvements in the compressed suffix arrays. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:225-232 [Conf]
  36. Kunihiko Sadakane, Roberto Grossi
    Squeezing succinct data structures into entropy bounds. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:1230-1239 [Conf]
  37. Kunihiko Sadakane, Nadia Takki-Chebihi, Takeshi Tokuyama
    Discrepancy-Based Digital Halftoning: Automatic Evaluation and Optimization. [Citation Graph (0, 0)][DBLP]
    Theoretical Foundations of Computer Vision, 2002, pp:301-319 [Conf]
  38. Shay Kutten, Hirotaka Ono, David Peleg, Kunihiko Sadakane, Masafumi Yamashita
    Energy-Optimal Online Algorithms for Broadcasting in Wireless Networks. [Citation Graph (0, 0)][DBLP]
    WONS, 2005, pp:125-130 [Conf]
  39. Jinhee Chun, Kunihiko Sadakane, Takeshi Tokuyama
    Linear Time Algorithm for Approximating a Curve by a Single-Peaked Curve. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2006, v:44, n:2, pp:103-115 [Journal]
  40. Jesper Jansson, Joseph H.-K. Ng, Kunihiko Sadakane, Wing-Kin Sung
    Rooted Maximum Agreement Supertrees. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2005, v:43, n:4, pp:293-307 [Journal]
  41. Kenichiro Ohta, Kunihiko Sadakane, Akiyoshi Shioura, Takeshi Tokuyama
    A Fast, Accurate, and Simple Method for Pricing European-Asian and Saving-Asian Options. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2005, v:42, n:2, pp:141-158 [Journal]
  42. Charles Choy, Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung
    Computing the Maximum Agreement of Phylogenetic Networks. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2004, v:91, n:, pp:134-147 [Journal]
  43. Kunihiko Sadakane
    New text indexing functionalities of the compressed suffix arrays. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2003, v:48, n:2, pp:294-313 [Journal]
  44. Kunihiko Sadakane
    Succinct data structures for flexible text retrieval systems. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2007, v:5, n:1, pp:12-22 [Journal]
  45. Charles Choy, Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung
    Computing the maximum agreement of phylogenetic networks. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:335, n:1, pp:93-107 [Journal]
  46. Chiu-Yuen Koo, Tak Wah Lam, Tsuen-Wan Ngan, Kunihiko Sadakane, Kar-Keung To
    On-line scheduling with tight deadlines. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:, pp:251-261 [Journal]
  47. Kunihiko Sadakane, Nadia Takki-Chebihi, Takeshi Tokuyama
    Combinatorics and algorithms for low-discrepancy roundings of a real sequence. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:331, n:1, pp:23-36 [Journal]
  48. Daisuke Okanohara, Kunihiko Sadakane
    Practical Entropy-Compressed Rank/Select Dictionary. [Citation Graph (0, 0)][DBLP]
    ALENEX, 2007, pp:- [Conf]
  49. Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung
    Ultra-succinct representation of ordered trees. [Citation Graph (0, 0)][DBLP]
    SODA, 2007, pp:575-584 [Conf]
  50. 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. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2007, v:48, n:1, pp:23-36 [Journal]
  51. Daisuke Okanohara, Kunihiko Sadakane
    Practical Entropy-Compressed Rank/Select Dictionary [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  52. Ho-Leung Chan, Wing-Kai Hon, Tak Wah Lam, Kunihiko Sadakane
    Compressed indexes for dynamic text collections. [Citation Graph (0, 0)][DBLP]
    ACM Transactions on Algorithms, 2007, v:3, n:2, pp:- [Journal]

  53. Succinct Trees in Practice. [Citation Graph (, )][DBLP]


  54. Faster Computation of the Robinson-Foulds Distance between Phylogenetic Networks. [Citation Graph (, )][DBLP]


  55. Speeding Up Local-Search Type Algorithms for Designing DNA Sequences under Thermodynamical Constraints. [Citation Graph (, )][DBLP]


  56. Dynamic Neighborhood Searches for Thermodynamically Designing DNA Sequence. [Citation Graph (, )][DBLP]


  57. An Online Algorithm for Finding the Longest Previous Factors. [Citation Graph (, )][DBLP]


  58. Compressed Dynamic Tries with Applications to LZ-Compression in Sublinear Time and Space. [Citation Graph (, )][DBLP]


  59. The space complexity of the leader election in anonymous networks. [Citation Graph (, )][DBLP]


  60. The Balanced Edge Cover Problem. [Citation Graph (, )][DBLP]


  61. How to Design a Linear Cover Time Random Walk on a Finite Graph. [Citation Graph (, )][DBLP]


  62. More Efficient Periodic Traversal in Anonymous Undirected Graphs. [Citation Graph (, )][DBLP]


  63. Fully-Functional Succinct Trees. [Citation Graph (, )][DBLP]


  64. A Linear-Time Burrows-Wheeler Transform Using Induced Sorting. [Citation Graph (, )][DBLP]


  65. Computing the Exact Distribution Function of the Stochastic Longest Path Length in a DAG. [Citation Graph (, )][DBLP]


  66. Linear-Time Protein 3-D Structure Searching with Insertions and Deletions. [Citation Graph (, )][DBLP]


  67. A generic search strategy for large-scale real-world networks. [Citation Graph (, )][DBLP]


  68. Fully-Functional Static and Dynamic Succinct Trees [Citation Graph (, )][DBLP]


  69. More efficient periodic traversal in anonymous undirected graphs [Citation Graph (, )][DBLP]


Search in 0.090secs, Finished in 0.093secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002