Graduate School of Computer Science and Systems Engineering Kyushu Institute of Technology Hiroshi SAKAMOTO Lab.

  • TOP
  • JAPANESE

Achievement

Jounal paper

  • "Scalable Detection of Frequent Substrings  by Grammar-Based Compression",
    M.Nakahara, S.Maruyama, T.Kuboyama, H.Sakamoto,
    IEICE Trans. on Information and Systems, E96-D(3):457-464 (2013).
  • "ESP-Index: A Compressed Index Based on Edit-Sensitive Parsing",
    S.Maruyama, M.Nakahara, N.Kishiue, H.Sakamoto,
    Journal of Discrete Algorithms 18:100-112 (2013), Elsevier.
  • "An Online Algorithm for Lightweight Grammar-Based Compression",
    S. Maruyama, H. Sakamoto, M. Takeda,
    Algorithms 5(2):214-235 (2012-4).
  • "Extracting research communities by improved maximum flow algorithm",
    Y.Nakamura, T.Horiike, T.Kuboyama, H.Sakamoto,
    KES Journal 16(1): 25-34 (2012), IOS Press.
  • "Context-sensitive grammar transform: compression and pattern matching",
    S.Maruyama, Y.Tanaka, H.Sakamoto, M.Takeda,
    IEICE Trans. on Information and Systems, E93-D(2):219-226(2010-2).
  • "A space-saving approximation algorithm for grammar-based compression",
    H.Sakamoto, S.Maruyama, T.Kida, S.Shimozono,
    IEICE Trans. on Information and Systems E92-D(2):158-165(2009-2).
  • "A fully linear-time approximation algorithm for grammar-based compression",
    H.Sakamoto,
    Journal of Discrete Algorithms 3:416-430(2005-6).
  • "Efficient substructure discovery from large semi-structured data",
    T.Asai, K.Abe, S.Kawasoe, H.Sakamoto, H.Arimura, S.Arikawa,
    IEICE Trans. on Information and Systems E87-D(12):2754-2763(2004-12).
  • "Learning elementary formal systems with queries",
    H.Sakamoto, K.Hirata, H.Arimura,
    Theoretical Computer Science 298:21-50(2003-4).
  • "Intractability of decision problems for finite-memory automata",
    H.Sakamoto, D.Ikeda,
    Theoretical Computer Science 231(2):297-308(2000-1).
  • "The learnability of simple deterministic finite-memory automata via queries",
    H.Sakamoto,
    Bulletin of Informatics and Cybernetics 30:93-108(1998-3).