Tadao Takaoka

Publication Activity (10 Years)

Years Active: 1971-2019
Publications (10 Years): 5

Top Topics

Medial Axis Transform

Parallel Algorithm

Top Venues

Theor. Comput. Sci.

Publications

Tadao Takaoka
Algebraic theory on shortest paths for all flows. Theor. Comput. Sci. 774 (2019)
Sung Eun Bae, Tong-Wook Shinn, Tadao Takaoka
Efficient Algorithms for the Maximum Sum Problems. Algorithms 10 (1) (2017)
Yijie Han, Tadao Takaoka
⁡n) time algorithm for all pairs shortest paths. J. Discrete Algorithms (2016)
Sung Eun Bae, Tong-Wook Shinn, Tadao Takaoka
An efficient parallel algorithm for the maximum convex sum problem. ACSW (2016)
Sung Eun Bae, Tong-Wook Shinn, Tadao Takaoka
Minimum Weight Polygon Triangulation Problem in Sub-Cubic Time Bound. COCOA (2016)
Tadao Takaoka
Multi-level Loop-less Algorithm for Multi-set Permutations. CoRR (2015)
Tadao Takaoka
Algebraic Theory on Shortest Paths for All Flows. COCOA (2015)
Tong-Wook Shinn, Tadao Takaoka
Variations on the bottleneck paths problem. Theor. Comput. Sci. 575 (2015)
Tadao Takaoka
Single Source Shortest Paths for All Flows with Integer Costs. ATMOS (2015)
Tadao Takaoka
O(1) Time Generation of Adjacent Multiset Combinations. CoRR (2015)
Tadao Takaoka
Sharing information for the all pairs shortest path problem. Theor. Comput. Sci. 520 (2014)
Sung Eun Bae, Tong-Wook Shinn, Tadao Takaoka
A Faster Parallel Algorithm for Matrix Multiplication on a Mesh Array. ICCS (2014)
Tong-Wook Shinn, Tadao Takaoka
Some Extensions of the Bottleneck Paths Problem. WALCOM (2014)
Tong-Wook Shinn, Tadao Takaoka
Combining the Shortest Paths and the Bottleneck Paths Problems. ACSC (2014)
Tong-Wook Shinn, Tadao Takaoka
Combining All Pairs Shortest Paths and All Pairs Bottleneck Paths Problems. LATIN (2014)
Tong-Wook Shinn, Tadao Takaoka
Efficient Graph Algorithms for Network Analysis. CoRR (2013)
Stephen John Weddell, Tristan Read, Mohammed Thaher, Tadao Takaoka
Maximum subarray algorithms for use in astronomical imaging. J. Electronic Imaging 22 (4) (2013)
Mohammed Thaher, Danladi Umar, Tadao Takaoka, Jon Harding
Application of the Maximum Convex Sum Algorithm in Determining Environmental Variables That Affect Nigerian Highland Stream Benthic Communities. ICCS (2013)
Tong-Wook Shinn, Tadao Takaoka
Combining All Pairs Shortest Paths and All Pairs Bottleneck Paths Problems. CoRR (2013)
Tong-Wook Shinn, Tadao Takaoka
Some Extensions of the All Pairs Bottleneck Paths Problem. CoRR (2013)
Tadao Takaoka
A simplified algorithm for the all pairs shortest path problem with O(n 2logn) expected time. J. Comb. Optim. 25 (2) (2013)
Tong-Wook Shinn, Tadao Takaoka
Combining the Shortest Paths and the Bottleneck Paths Problems. CoRR (2013)
Jin Bum Hong, Dong Seong Kim, Tadao Takaoka
Scalable Attack Representation Model Using Logic Reduction Techniques. TrustCom/ISPA/IUCC (2013)
Mohammed Thaher, Tadao Takaoka
Improved algorithms for the K overlapping maximum convex sum problem. ICCS (2012)
Yijie Han, Tadao Takaoka
An O(n 3 loglogn/log2 n) Time Algorithm for All Pairs Shortest Paths. SWAT (2012)
Tadao Takaoka
Efficient Algorithms for the All Pairs Shortest Path Problem with Limited Edge Costs. CATS (2012)
Tadao Takaoka, Mashitoh Hashim
Sharing Information in All Pairs Shortest Path Algorithms. CATS (2011)
Mohammed Thaher, Tadao Takaoka
An efficient algorithm for computing the K-overlapping maximum convex sum problem. ICCS (2011)
Tadao Takaoka
Efficient Algorithms for the 2-Center Problems. ICCSA (2) (2010)
Tadao Takaoka, Mashitoh Hashim
) Expected Time. COCOA (2) (2010)
Mohammed Thaher, Tadao Takaoka
An efficient algorithm for the k maximum convex sums. ICCS (1) (2010)
Tadao Takaoka, Yuji Nakagawa
Entropy as Computational Complexity. J. Inf. Process. 18 (2010)
Tadao Takaoka
Partial Solution and Entropy. MFCS (2009)
Sung Eun Bae, Tadao Takaoka
Algorithms for k-Disjoint Maximum Subarrays. Int. J. Found. Comput. Sci. 18 (2) (2007)
Sung Eun Bae, Tadao Takaoka
-Maximum Subarray Problem. ISAAC (2007)
Shane Saunders, Tadao Takaoka
Solving shortest paths efficiently on nearly acyclic directed graphs. Theor. Comput. Sci. 370 (1-3) (2007)
Lin Tian, Tadao Takaoka
Improved Shortest Path Algorithms For Nearly Acyclic Directed Graphs. ACSC (2007)
Tadao Takaoka, Stephen Violich
Fusing Loopless Algorithms for Combinatorial Generation. Int. J. Found. Comput. Sci. 18 (2) (2007)
Sung Eun Bae, Tadao Takaoka
-Maximum Subarray Problem. Comput. J. 49 (3) (2006)
Tadao Takaoka, Stephen Violich
Combinatorial Generation by Fusing Loopless Algorithms. CATS (2006)
Akito Kiriyama, Yuji Nakagawa, Tadao Takaoka, Zhiqi Tu
A New Public-Key Cryptosystem and its Applications. ICEIS (3) (2006)
Sung Eun Bae, Tadao Takaoka
Disjoint Maximum Subarrays. International Conference on Computational Science (1) (2006)
Sung Eun Bae, Tadao Takaoka
. COCOON (2005)
Shane Saunders, Tadao Takaoka
Efficient Algorithms for Solving Shortest Paths on Nearly Acyclic Directed Graphs. CATS (2005)
Tadao Takaoka
) time algorithm for the all-pairs shortest path problem. Inf. Process. Lett. 96 (5) (2005)
Sung Eun Bae, Tadao Takaoka
Algorithms for the Problem of K Maximum Sums and a VLSI Algorithm for the K Maximum Subarrays Problem. ISPAN (2004)
Tadao Takaoka
A Faster Algorithm for the All-Pairs Shortest Path Problem and Its Application. COCOON (2004)
Tadao Takaoka
Foreword. Algorithmica 38 (2) (2004)
Tadao Takaoka
Theory of 2-3 Heaps. Discret. Appl. Math. 126 (1) (2003)
Shane Saunders, Tadao Takaoka
Improved shortest path algorithms for nearly acyclic graphs. Theor. Comput. Sci. 293 (3) (2003)
Tadao Takaoka
The Reverse Problem of Range Query. Electron. Notes Theor. Comput. Sci. 78 (2003)
Tadao Takaoka
Efficient Algorithms for the Maximum Subarray Problem by Distance Matrix Multiplication. Electron. Notes Theor. Comput. Sci. 61 (2002)
Shane Saunders, Tadao Takaoka
Improved Shortest Path Algorithms for Nearly Acyclic Graphs. Electron. Notes Theor. Comput. Sci. 42 (2001)
Tadao Takaoka
Theory of Trinomial Heaps. COCOON (2000)
Tadao Takaoka
Theory of 2-3 Heaps. COCOON (1999)
Tadao Takaoka
O(1) Time Algorithms for Combinatorial Generation by Tree Traversal. Comput. J. 42 (5) (1999)
Tadao Takaoka
An O(1) Time Algorithm for Generating Multiset Permutations. ISAAC (1999)
Alan P. Sprague, Tadao Takaoka
O(1) Query Time Algorithm for all Pairs Shortest Distances on Interval Graphs. Int. J. Found. Comput. Sci. 10 (4) (1999)
Tadao Takaoka
Shortest Path Algorithms for Nearly Acyclic Directed Graphs. Theor. Comput. Sci. 203 (1) (1998)
Tadao Takaoka
Subcubic Cost Algorithms for the All Pairs Shortest Path Problem. Algorithmica 20 (3) (1998)
Tadao Takaoka
A New Measure of Disorder in Sorting - Entropy. CATS (1998)
Tadao Takaoka
A Left-to-Right Preprocessing Computation for the Boyer-Moore String Matching Algorithm. Comput. J. 39 (5) (1996)
Tadao Takaoka
Shortest Path Algorithms for Nearly Acyclic Directed Graphs. WG (1996)
Tadao Takaoka
Sub-Cubic Cost Algorithms for the All Pairs Shortest Path Problem. WG (1995)
Tadao Takaoka
Parallel program verification with directed graphs. SAC (1994)
Tadao Takaoka
Approximate Pattern Matching with Samples. ISAAC (1994)
Tadao Takaoka
A New Upper Bound on the Complexity of the All Pairs Shortest Path Problem. Inf. Process. Lett. 43 (4) (1992)
Tadao Takaoka, Kiyomi Umehara
An Efficient VLSI Algorithms for the All Pairs Shortest Path Problem. J. Parallel Distributed Comput. 16 (3) (1992)
Tadao Takaoka
A New Upper Bound on the Complexity of the All Pairs Shortest Path Problem. WG (1991)
Pradip Dey, Barrett R. Bryant, Tadao Takaoka
Lexical Ambiguity in Tree Adjoining Grammars. Inf. Process. Lett. 34 (2) (1990)
Qian-Ping Gu, Tadao Takaoka
A sharper analysis of a parallel algorithm for the all pairs shortest path problem. Parallel Comput. 16 (1) (1990)
Rui Feng Zhu, Tadao Takaoka
A Technique for Two-Dimensional Pattern Matching. Commun. ACM 32 (9) (1989)
Tadao Takaoka
An Efficient Parallel Algorithm for the All Pairs Shortest Path Problem. WG (1988)
Barrett R. Bryant, Balanjaninath Edupuganty, K. R. Sundararaghavan, Tadao Takaoka
Two-level grammar: data flow English for functional and logic programming. ACM Conference on Computer Science (1988)
Alistair Moffat, Tadao Takaoka
An All Pairs Shortest Path Algorithm with Expected Time O(n² log n). SIAM J. Comput. 16 (6) (1987)
Tadao Takaoka
A Decomposition Rule for the Hoare Logic. Inf. Process. Lett. 26 (4) (1987)
F. Perez, Tadao Takaoka
A prime factor FFT algorithm implementation using a program generation technique. IEEE Trans. Acoust. Speech Signal Process. 35 (8) (1987)
Tadao Takaoka
The Semantics of New While Loop. Comput. J. 29 (1) (1986)
Tadao Takaoka
An On-Line Pattern Matching Algorithm. Inf. Process. Lett. 22 (6) (1986)
Alistair Moffat, Tadao Takaoka
An All Pairs Shortest Path Algorithm with Expected Running Time O(n^2 log n) FOCS (1985)
Alistair Moffat, Tadao Takaoka
A Priority Queue for the All Pairs Shortest Path Problem. Inf. Process. Lett. 18 (4) (1984)
Tadao Takaoka, Alistair Moffat
An O(n² log log log n) Expected Time Algorithm for the all Shortest Distance Problem. MFCS (1980)
Tadao Takaoka
Introduction of history to variables. ACM SIGPLAN Notices 15 (9) (1980)
Tadao Takaoka
A Definition of Measures over Language Space. J. Comput. Syst. Sci. 17 (3) (1978)
Tadao Takaoka
A Note on the Ambiguity of Context-Free Grammars. Inf. Process. Lett. 3 (2) (1974)
Tadao Takaoka, Toshihide Ibaraki
Fail-Safe Realization of Sequential Machines Inf. Control. 22 (1) (1973)
Tadao Takaoka, Toshihide Ibaraki
N-Fail-Safe Sequential Machines. IEEE Trans. Computers 21 (11) (1972)
Tadao Takaoka, Hisashi Mine
N-Fail-Safe Logical Systems. IEEE Trans. Computers 20 (5) (1971)