Tadao Takaoka

A new upper bound on the complexity of the all pairs shortest path problem

Tadao Takaoka · Information Processing Letters · 1992 · 116 citations

Mathematical Programming, Computational Complexity Theory, Engineering +11

Efficient Algorithms for the Maximum Subarray Problem by Distance Matrix Multiplication

Tadao Takaoka · Electronic Notes in Theoretical Computer Science · 2002 · 77 citations · Full text

Mathematical Programming, Engineering, Computational Complexity +17

A technique for two-dimensional pattern matching

Rui Zhu, Tadao Takaoka · Communications of the ACM · 1989 · 63 citations · Full text

Two-dimensional Pattern, Engineering, Biometrics +16

An All Pairs Shortest Path Algorithm with Expected Time $O(n^2 \log n)$

Alistair Moffat, Tadao Takaoka · SIAM Journal on Computing · 1987 · 61 citations

Directed Graph, Engineering, Pathfinding +22

Algorithms for the problem of K maximum sums and a VLSI algorithm for the K maximum subarrays problem

Sung Eun Bae, Tadao Takaoka · 2004 · 44 citations

Mathematical Programming, Engineering, Analysis Of Algorithm +19