Tadao Takaoka

Tad Takaoka

Professor Emeritus

Qualifications & Memberships

Research Interests

Research interests include algorithms, approximate pattern matching, shortest paths. The main purpose of the research is to design efficient algorithms for the above mentioned problems.

Recent Publications

  • Shinn TW. and Takaoka T. (2014) Combining all pairs shortest paths and all pairs bottleneck paths problems. In Lecture Notes in Computer Science 8392 LNCS: 226-237. http://dx.doi.org/10.1007/978-3-642-54423-1_20.
  • Shinn TW. and Takaoka T. (2014) Combining the shortest paths and the bottleneck paths problems.
  • Shinn TW. and Takaoka T. (2014) Some extensions of the bottleneck paths problem. In Lecture Notes in Computer Science 8344 LNCS: 176-187. http://dx.doi.org/10.1007/978-3-319-04657-0_18.
  • Takaoka T. (2014) Efficient parallel algorithms for the maximum subarray problem.
  • Takaoka T. (2014) Sharing information for the all pairs shortest path problem. In Theoretical Computer Science 520: 43-50. http://dx.doi.org/10.1016/j.tcs.2013.09.006.