The logic of molecular geneticists for the understanding of genetic information. - Yoshifumi Sakai (ALT, 1991)

Learning k-Term Monotone Boolean Formulae. - Yoshifumi Sakai; Akira Maruoka (ALT, 1992)

Learning Monotone Log-Term DNF Formulas. - Yoshifumi Sakai; Akira Maruoka (COLT, 1994)

Learning Orthogonal F-Horn Formulas. - Akira Miyashiro; Eiji Takimoto; Yoshifumi Sakai; Akira Maruoka (ALT, 1995)

Proper Learning Algorithm for Functions of k Terms Under Smooth Distributions. - Yoshifumi Sakai; Eiji Takimoto; Akira Maruoka (COLT, 1995)

Learnability of Exclusive-Or Expansion Based on Monotone DNF Formulas. - Eiji Takimoto; Yoshifumi Sakai; Akira Maruoka (ALT, 1996)

Learning Orthogonal F-Horn Formulas. - Eiji Takimoto; Akira Miyashiro; Akira Maruoka; Yoshifumi Sakai (Theor. Comput. Sci., 1997)

Proper Learning Algorithm for Functions of k Terms under Smooth Distributions. - Yoshifumi Sakai; Eiji Takimoto; Akira Maruoka (Inf. Comput., 1999)

Learning Monotone Log-Term DNF Formulas under the Uniform Distribution. - Yoshifumi Sakai; Akira Maruoka (Theory Comput. Syst., 2000)

The learnability of exclusive-or expansions based on monotone DNF formulas. - Eiji Takimoto; Yoshifumi Sakai; Akira Maruoka (Theor. Comput. Sci., 2000)

A Distributed Search Engine for Fresh Information Retrieval. - Nobuyoshi Sato; Minoru Uehara; Yoshifumi Sakai; Hideki Mori (DEXA Workshop, 2001)

Distributed Information Retrieval by Using Cooperative Meta Search Engines. - Nobuyoshi Sato; Minoru Uehara; Yoshifumi Sakai; Hideki Mori (ICDCS Workshops, 2001)

Reliable Distributed Search Engine Based on Multiple Meta Servers. - Nobuyoshi Sato; Minoru Udagawa; Minoru Uehara; Yoshifumi Sakai; Hideki Mori (CW, 2002)

Persistent Cache in a Distributed Search Engine. - Nobuyoshi Sato; Minoru Uehara; Yoshifumi Sakai; Hideki Mori (DEXA Workshops, 2002)

Persistent Cache in Cooperative Search Engine. - Nobuyoshi Sato; Minoru Uehara; Yoshifumi Sakai; Hideki Mori (ICDCS Workshops, 2002)

Fresh Information Retrieval Using Cooperative Meta Search Engines. - Nobuyoshi Sato; Minoru Uehara; Yoshifumi Sakai; Hideki Mori (ICOIN (2), 2002)

Scalability and Reliability in a Distributed Search Engine. - Nobuyoshi Sato; Minoru Udagawa; Minoru Uehara; Yoshifumi Sakai; Hideki Mori (ICPADS, 2002)

On Updating in Very Short Time by Distributed Search Engines. - Nobuyoshi Sato; Minoru Uehara; Yoshifumi Sakai; Hideki Mori (SAINT, 2002)

Redundancy of Meta Search Servers in a Distributed Search Engine. - Nobuyoshi Sato; Minoru Udagawa; Minoru Uehara; Yoshifumi Sakai; Hideki Mori (AINA, 2003)

Temporal Information Retrieval in Cooperative Search Engine. - Nobuyoshi Sato; Minoru Uehara; Yoshifumi Sakai (DEXA Workshops, 2003)

A Scalable Distributed Search Engine for Fresh Information Retrieval. - Nobuyoshi Sato; Minoru Uehara; Yoshifumi Sakai (ICWI, 2003)

Query Based Site Selection for Distributed Search Engines. - Nobuyoshi Sato; Minoru Udagawa; Minoru Uehara; Yoshifumi Sakai; Hideki Mori (ICDCS Workshops, 2003)

A Scalable Distributed Search Engine for Intranet Information Retrieval. - Nobuyoshi Sato; Minoru Udagawa; Minoru Uehara; Yoshifumi Sakai; Hideki Mori (ICEIS (1), 2003)

Temporal ranking for fresh information retrieval. - Nobuyoshi Sato; Minoru Uehara; Yoshifumi Sakai (IRAL, 2003)

Reliability of a Distributed Search Engine for Fresh Information Retrieval in Large-Scale Intranet. - Nobuyoshi Sato; Minoru Udagawa; Minoru Uehara; Yoshifumi Sakai (ISPA, 2003)

FTF · IDF Scoring for Fresh Information Retrieval. - Nobuyoshi Sato; Minoru Uehara; Yoshifumi Sakai (AINA (1), 2004)

Distributed Pipelining Processing for Index Updating Method. - Minoru Udagawa; Nobuyoshi Sato; Minoru Uehara; Yoshifumi Sakai (AINA (2), 2004)

Searching Restricted Documents in a Cooperative Search Engine. - Nobuyoshi Sato; Minoru Udagawa; Minoru Uehara; Yoshifumi Sakai (ICDCS Workshops, 2004)

Distributed Index Updating Method for Intranet Information Retrieval. - Minoru Udagawa; Nobuyoshi Sato; Minoru Uehara; Yoshifumi Sakai (ICDCS Workshops, 2004)

The Evaluations of FTF-IDF Scoring for Fresh Information Retrieval. - Nobuyoshi Sato; Minoru Uehara; Yoshifumi Sakai (AINA, 2005)

Adaptive Calculation of Scores for Fresh Information Retrieval. - Minoru Uehara; Nobuyoshi Sato; Yoshifumi Sakai (ICPADS (1), 2005)

Adaptive Scoring Method based on Freshness for Fresh Information Retrieval. - Minoru Uehara; Nobuyoshi Sato; Yoshifumi Sakai (WIRI, 2005)

Evaluations of Freshness Considering Scoring on Fresh Information Retrieval. - Nobuyoshi Sato; Minoru Uehara; Yoshifumi Sakai (J. Interconnect. Networks, 2005)

A linear space algorithm for computing a longest common increasing subsequence. - Yoshifumi Sakai (Inf. Process. Lett., 2006)

Computing the longest topological common subsequence of a symbol-wise totally ordered directed acyclic graph and a sequence. - Yoshifumi Sakai (Theor. Comput. Sci., 2009)

A New Algorithm for the Characteristic String Problem under Loose Similarity Criteria. - Yoshifumi Sakai (ISAAC, 2011)

A fast algorithm for multiplying min-sum permutations. - Yoshifumi Sakai (Discret. Appl. Math., 2011)

An Almost Quadratic Time Algorithm for Sparse Spliced Alignment. - Yoshifumi Sakai (Theory Comput. Syst., 2011)

Computing the Longest Common Subsequence of Two Run-Length Encoded Strings. - Yoshifumi Sakai (ISAAC, 2012)

A Fast On-Line Algorithm for the Longest Common Subsequence Problem with Constant Alphabet. - Yoshifumi Sakai (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2012)

A Linear-Space Algorithm for the Substring Constrained Alignment Problem. - Yoshifumi Sakai (SPIRE, 2016)

A Maximal Local Maximum-Sum Segment Data Structure. - Yoshifumi Sakai (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2018)

A substring-substring LCS data structure. - Yoshifumi Sakai (Theor. Comput. Sci., 2019)

Maximal common subsequence algorithms. - Yoshifumi Sakai (Theor. Comput. Sci., 2019)

A Reduction of the Dynamic Time Warping Distance to the Longest Increasing Subsequence Length. - Yoshifumi Sakai; Shunsuke Inenaga (ISAAC, 2020)

A Faster Reduction of the Dynamic Time Warping Distance to the Longest Increasing Subsequence Length. - Yoshifumi Sakai; Shunsuke Inenaga (Algorithmica, 2022)

Hibikino-Musashi@Home 2022 Team Description Paper. - Tomoya Shiba; Tomohiro Ono; Shoshi Tokuno; Issei Uchino; Masaya Okamoto; Daiju Kanaoka; Kazutaka Takahashi 006; Kenta Tsukamoto; Yoshiaki Tsutsumi; Yugo Nakamura; Yukiya Fukuda; Yusuke Hoji; et al. (CoRR, 2022)

A data structure for substring-substring LCS length queries. - Yoshifumi Sakai (Theor. Comput. Sci., 2022)

Hibikino-Musashi@Home 2023 Team Description Paper. - Tomoya Shiba; Akinobu Mizutani; Yuga Yano; Tomohiro Ono; Shoshi Tokuno; Daiju Kanaoka; Yukiya Fukuda; Hayato Amano; Mayu Koresawa; Yoshifumi Sakai; Ryogo Takemoto; Katsunori Tamai; et al. (CoRR, 2023)

A Fast Algorithm for Finding a Maximal Common Subsequence of Multiple Strings. - Miyuji Hirota; Yoshifumi Sakai (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2023)

A Data Structure for the Maximum-Sum Segment Problem with Offsets. - Yoshifumi Sakai (CPM, 2024)

Linear-Space LCS Enumeration for Two Strings. - Yoshifumi Sakai (CPM, 2025)

Efficient algorithms for enumerating maximal common subsequences of two strings. - Miyuji Hirota; Yoshifumi Sakai (Theor. Comput. Sci., 2025)

Linear-space LCS enumeration with quadratic-time delay for two strings. - Yoshifumi Sakai (CoRR, 2025)