A new upper bound on the complexity of the all pairs shortest path problem T Takaoka Information Processing Letters 43 (4), 195-199, 1992 | 175 | 1992 |

Efficient algorithms for the maximum subarray problem by distance matrix multiplication T Takaoka Electronic Notes in Theoretical Computer Science 61, 191-200, 2002 | 118 | 2002 |

On improving the average case of the Boyer-Moore string matching algorithm T ZhuRuiFeng Journal of Information Processing 10 (3), 173-177, 1987 | 84 | 1987 |

A technique for two-dimensional pattern matching RF Zhu, T Takaoka Communications of the ACM 32 (9), 1110-1120, 1989 | 81 | 1989 |

An All Pairs Shortest Path Algorithm with Expected Time O(n^2\logn) A Moffat, T Takaoka SIAM Journal on Computing 16 (6), 1023-1031, 1987 | 79 | 1987 |

Subcubic cost algorithms for the all pairs shortest path problem T Takaoka Algorithmica 20, 309-318, 1998 | 74 | 1998 |

An O (n3log log n/log2 n) time algorithm for all pairs shortest paths Y Han, T Takaoka Journal of Discrete Algorithms 38, 9-19, 2016 | 70 | 2016 |

Approximate pattern matching with samples T Takaoka International Symposium on Algorithms and Computation, 234-242, 1994 | 65 | 1994 |

A faster algorithm for the all-pairs shortest path problem and its application T Takaoka Computing and Combinatorics: 10th Annual International Conference, COCOON …, 2004 | 60 | 2004 |

Algorithms for the problem of k maximum sums and a VLSI algorithm for the k maximum subarrays problem SE Bae, T Takaoka 7th International Symposium on Parallel Architectures, Algorithms and …, 2004 | 55 | 2004 |

An O (n3loglogn/logn) time algorithm for the all-pairs shortest path problem T Takaoka Information Processing Letters 96 (5), 155-161, 2005 | 49 | 2005 |

Scalable attack representation model using logic reduction techniques JB Hong, DS Kim, T Takaoka 2013 12th IEEE International Conference on Trust, Security and Privacy in …, 2013 | 42 | 2013 |

An *O*(1) Time Algorithm for Generating Multiset PermutationsA Aggarwal, CP Rangan, T Takaoka Algorithms and Computation: 10th International Symposium, ISAAC’99 Chennai …, 1999 | 39 | 1999 |

O (1) time algorithms for combinatorial generation by tree traversal T Takaoka The Computer Journal 42 (5), 400-408, 1999 | 39 | 1999 |

Shortest path algorithms for nearly acyclic directed graphs T Takaoka Theoretical Computer Science 203 (1), 143-150, 1998 | 32 | 1998 |

Theory of 2–3 heaps T Takaoka Discrete Applied Mathematics 126 (1), 115-128, 2003 | 31 | 2003 |

Improved Algorithms for the K-Maximum Subarray Problem: Reviewers who have agreed to review between 1 January 2005 and 31 December 2005 for The Computer Journal SE Bae, T Takaoka The Computer Journal 49 (3), 358-374, 2006 | 30 | 2006 |

Improved Algorithms for the *K*-Maximum Subarray Problem for Small *K*SE Bae, T Takaoka International Computing and Combinatorics Conference, 621-631, 2005 | 29 | 2005 |

Theory of 2-3 heaps T Takaoka International Computing and Combinatorics Conference, 41-50, 1999 | 27 | 1999 |

Improved shortest path algorithms for nearly acyclic graphs S Saunders, T Takaoka Theoretical Computer Science 293 (3), 535-556, 2003 | 20 | 2003 |