Tadao Takaoka

Jin B. Hong, Dong Seong Kim, Tadao Takaoka, 2013, 2013 12th IEEE International Conference on Trust, Security and Privacy in Computing and Communications.

Efficient Graph Algorithms for Network Analysis pdf

Tadao Takaoka, Tong-Wook Shinn, 2013, ArXiv.

Efficient Algorithms for the 2-Center Problems

Tadao Takaoka, 2010, ICCSA.

A New Upper Bound on the Complexity of the All Pairs Shortest Path Problem

Tadao Takaoka, 1991, WG.

A New Upper Bound on the Complexity of the All Pairs Shortest Path Problem

Tadao Takaoka, T. Takaoka, 1991, Inf. Process. Lett..

A Sub-cubic Time Algorithm for the k -Maximum Subarray Problem

Tadao Takaoka, Sung Eun Bae, T. Takaoka, 2007, ISAAC.

Algebraic Theory on Shortest Paths for All Flows

Tadao Takaoka, 2015, COCOA.

Minimum Weight Polygon Triangulation Problem in Sub-Cubic Time Bound

Tadao Takaoka, Sung Eun Bae, Tong-Wook Shinn, 2016, COCOA.

Efficient Algorithms for Solving Shortest Paths on Nearly Acyclic Directed Graphs

Tadao Takaoka, Shane Saunders, 2005, CATS.

A New Public-Key Cryptosystem and its Applications

Tadao Takaoka, Yuji Nakagawa, Akito Kiriyama, 2006, ICEIS.

O(1) Time Generation of Adjacent Multiset Combinations pdf

Tadao Takaoka, T. Takaoka, 2015, ArXiv.

All Pairs Shortest Paths via Matrix Multiplication

Tadao Takaoka, 2016, Encyclopedia of Algorithms.

Efficient Algorithms for the Maximum Sum Problems

Tadao Takaoka, Sung Eun Bae, Tong-Wook Shinn, 2017, Algorithms.

On improving the average case of the Boyer-Moore string matching algorithm

Tadao Takaoka, Zhu Rui Feng, T. Takaoka, 1988 .

Algorithms and Computation

Tadao Takaoka, Peter Eades, 2001, Lecture Notes in Computer Science.

All Pairs Shortest Paths via Matrix Multiplication

Tadao Takaoka, 2008, Encyclopedia of Algorithms.

Some Extensions of the All Pairs Bottleneck Paths Problem pdf

Tadao Takaoka, Tong-Wook Shinn, 2013, ArXiv.

Maximum subarray algorithms for use in astronomical imaging

Tadao Takaoka, Stephen J. Weddell, Tristan Read, 2013, J. Electronic Imaging.

Maximum subarray algorithms for use in optical and radio astronomy

Tadao Takaoka, Stephen J. Weddell, R. Candy, 2012, Other Conferences.

An all pairs shortest path algorithm with expected running time O(n 2logn)

Alistair Moffat, Tadao Takaoka, 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

Improved shortest path algorithms for nearly acyclic graphs

Tadao Takaoka, Shane Saunders, T. Takaoka, 2003, Theor. Comput. Sci..

Some Extensions of the Bottleneck Paths Problem

Tadao Takaoka, Tong-Wook Shinn, 2014, WALCOM.

An Efficient VLSI Algorithms for the All Pairs Shortest Path Problem

Tadao Takaoka, Kiyomi Umehara, T. Takaoka, 1992, J. Parallel Distributed Comput..

An O(n3log⁡log⁡n/log2⁡n) time algorithm for all pairs shortest paths

Yijie Han, Tadao Takaoka, Yijie Han, 2016, J. Discrete Algorithms.

An O( n ( n 2 / p +log p )) parallel algorithm to compute the all pairs shortest paths and the transitive closure

Tadao Takaoka, M. Jun, 1989 .

Combining All Pairs Shortest Paths and All Pairs Bottleneck Paths Problems pdf

Tadao Takaoka, Tong-Wook Shinn, 2014, LATIN.

The Reverse Problem of Range Query

Tadao Takaoka, 2003, Electron. Notes Theor. Comput. Sci..

Fail-Safe Realization of Sequential Machines

Toshihide Ibaraki, Tadao Takaoka, T. Ibaraki, 1973, Inf. Control..

Algebraic theory on shortest paths for all flows

Tadao Takaoka, 2019, Theor. Comput. Sci..

An O(1) Time Algorithm for Generating Multiset Permutations

Tadao Takaoka, T. Takaoka, 1999, ISAAC.

An On-Line Pattern Matching Algorithm

Tadao Takaoka, T. Takaoka, 1986, Inf. Process. Lett..

Shortest Path Algorithms for Nearly Acyclic Directed Graphs

Tadao Takaoka, 1996, WG.

A sharper analysis of a parallel algorithm for the all pairs shortest path problem

Tadao Takaoka, Qian-Ping Gu, 1990, Parallel Comput..

Variations on the bottleneck paths problem

Tadao Takaoka, Tong-Wook Shinn, 2015, Theor. Comput. Sci..

An All Pairs Shortest Path Algorithm with Expected Time O(n² log n)

Alistair Moffat, Tadao Takaoka, T. Takaoka, 1987, SIAM J. Comput..

A Left-to-Right Preprocessing Computation for the Boyer-Moore String Matching Algorithm

Tadao Takaoka, 1996, Comput. J..

A technique for two-dimensional pattern matching

Tadao Takaoka, Rui Feng Zhu, 1989, CACM.

Theory of 2-3 Heaps

Tadao Takaoka, 2003, Discret. Appl. Math..

Proceedings of the 12th International Symposium on Algorithms and Computation

Tadao Takaoka, Peter Eades, 1995 .

Application of the Maximum Convex Sum Algorithm in Determining Environmental Variables That Affect Nigerian Highland Stream Benthic Communities

Tadao Takaoka, Mohammed Thaher, Jon Harding, 2013, ICCS.

O(1) Query Time Algorithm for all Pairs Shortest Distances on Interval Graphs

Tadao Takaoka, Alan P. Sprague, 1999, Int. J. Found. Comput. Sci..

Theory of Trinomial Heaps

Tadao Takaoka, 2000, COCOON.

Combining the Shortest Paths and the Bottleneck Paths Problems

Tadao Takaoka, Tong-Wook Shinn, 2014, ACSC.

A Faster Algorithm for the All-Pairs Shortest Path Problem and Its Application

Tadao Takaoka, 2004, COCOON.

An O(n² log log log n) Expected Time Algorithm for the all Shortest Distance Problem

Alistair Moffat, Tadao Takaoka, 1980, MFCS.

O(1) Time Algorithms for Combinatorial Generation by Tree Traversal

Tadao Takaoka, 1999, Comput. J..

A Priority Queue for the All Pairs Shortest Path Problem

Alistair Moffat, Tadao Takaoka, T. Takaoka, 1984, Inf. Process. Lett..

Single Source Shortest Paths for All Flows with Integer Costs

Tadao Takaoka, 2015, ATMOS.

Sub-Cubic Cost Algorithms for the All Pairs Shortest Path Problem

Tadao Takaoka, 1995, WG.

A Simpler Algorithm for the All Pairs Shortest Path Problem with O(n2logn) Expected Time

Tadao Takaoka, Mashitoh Hashim, 2010, COCOA.

An efficient algorithm for computing the K-overlapping maximum convex sum problem

Tadao Takaoka, Mohammed Thaher, 2011, ICCS.

A prime factor FFT algorithm implementation using a program generation technique

Tadao Takaoka, F. Perez, 1987, IEEE Trans. Acoust. Speech Signal Process..

An O(n 3 loglogn/log2 n) Time Algorithm for All Pairs Shortest Paths

Yijie Han, Tadao Takaoka, Yijie Han, 2012, SWAT.

Efficient Algorithms for the Maximum Subarray Problem by Distance Matrix Multiplication

Tadao Takaoka, T. Takaoka, 2002, CATS.

Sharing information for the all pairs shortest path problem

Tadao Takaoka, 2014, Theor. Comput. Sci..

A Note on the Ambiguity of Context-Free Grammars

Tadao Takaoka, T. Takaoka, 1974, Inf. Process. Lett..

Introduction of history to variables

Tadao Takaoka, 1980, SIGP.

An Efficient Parallel Algorithm for the All Pairs Shortest Path Problem

Tadao Takaoka, 1988, WG.

A Faster Parallel Algorithm for Matrix Multiplication on a Mesh Array

Tadao Takaoka, Sung Eun Bae, Tong-Wook Shinn, 2014, ICCS.

Improved Algorithms for the K-Maximum Subarray Problem

Tadao Takaoka, Sung Eun Bae, T. Takaoka, 2006, Comput. J..

A Definition of Measures over Language Space

Tadao Takaoka, T. Takaoka, 1978, J. Comput. Syst. Sci..

Fusing Loopless Algorithms for Combinatorial Generation

Tadao Takaoka, Stephen Violich, 2007, Int. J. Found. Comput. Sci..

A Decomposition Rule for the Hoare Logic

Tadao Takaoka, 1987, Inf. Process. Lett..

Two-level grammar: data flow English for functional and logic programming

Tadao Takaoka, Barrett R. Bryant, Balanjaninath Edupuganty, 1988, CSC '88.

A New Measure of Disorder in Sorting - Entropy

Tadao Takaoka, 1998, CATS.

An O(n3loglogn/logn) time algorithm for the all-pairs shortest path problem

Tadao Takaoka, 2005, Inf. Process. Lett..

Shortest Path Algorithms for Nearly Acyclic Directed Graphs

Tadao Takaoka, T. Takaoka, 1998, Theor. Comput. Sci..

An efficient parallel algorithm for the maximum convex sum problem

Tadao Takaoka, Sung Eun Bae, Tong-Wook Shinn, 2016, ACSW.

Algorithms for k-Disjoint Maximum Subarrays

Tadao Takaoka, Sung Eun Bae, 2007, Int. J. Found. Comput. Sci..

Algorithm for K Disjoint Maximum Subarrays

Tadao Takaoka, Sung Eun Bae, 2006, International Conference on Computational Science.

Entropy as Computational Complexity

Tadao Takaoka, Yuji Nakagawa, 2010, J. Inf. Process..

Improved algorithms for the K overlapping maximum convex sum problem

Tadao Takaoka, Mohammed Thaher, 2012, ICCS.

Combinatorial Generation by Fusing Loopless Algorithms

Tadao Takaoka, Stephen Violich, 2006, CATS.

An efficient algorithm for the k maximum convex sums

Tadao Takaoka, Mohammed Thaher, 2010, ICCS.

N-Fail-Safe Logical Systems

Tadao Takaoka, Hisashi Mine, 1971, IEEE Transactions on Computers.

N-Fail-Safe Sequential Machines

Toshihide Ibaraki, Tadao Takaoka, T. Ibaraki, 1972, IEEE Transactions on Computers.

Multi-level Loop-less Algorithm for Multi-set Permutations pdf

Tadao Takaoka, 2015, ArXiv.

Cascade algorithm revisited.

Tadao Takaoka, Kiyomi Umehara, T. Takaoka, 2014 .

Approximate Pattern Matching with Grey Scale Values

Tadao Takaoka, 2007 .

A Parallel Algorithm for the Longest Path Problem on Acyclic Graphs with Integer Arc Lengths

Tadao Takaoka, GU Qian-Ping, 1996 .

Ranking Cartesian Sums and K-maximum subarrays

Tadao Takaoka, S. E. Bae, 2006 .

Algebraic Theory of Automata and its Application to Fail Safe Systems

Tadao Takaoka, 1971 .

An O ( n 3 log log n / log n ) Time Algorithm for the All-Pairs Shortest Path Problem

Tadao Takaoka, T. Takaoka, 2004 .

Algorithms for data mining

Tadao Takaoka, Nigel Kenneth Pope, Kevin E. Voges, 2006 .