Tadao Takaoka

Tadao Takaoka: A simplified algorithm for the all pairs shortest path problem with O(n 2logn) expected time. J. Comb. Optim. 25(2): 326-337 (2013)

Mohammed Thaher, Tadao Takaoka: Improved algorithms for the K overlapping maximum convex sum problem. Procedia CS 9: 754-763 (2012)

Tadao Takaoka: Efficient Algorithms for the All Pairs Shortest Path Problem with Limited Edge Costs. CATS 2012: 21-26

Yijie Han, Tadao Takaoka: An O(n 3 loglogn/log2 n) Time Algorithm for All Pairs Shortest Paths. SWAT 2012: 131-141

Mohammed Thaher, Tadao Takaoka: An efficient algorithm for computing the K-overlapping maximum convex sum problem. Procedia CS 4: 1288-1295 (2011)

Tadao Takaoka, Mashitoh Hashim: Sharing Information in All Pairs Shortest Path Algorithms. CATS 2011: 131-136

Tadao Takaoka, Yuji Nakagawa: Entropy as Computational Complexity. JIP 18: 227-241 (2010)

Mohammed Thaher, Tadao Takaoka: An efficient algorithm for the k maximum convex sums. Procedia CS 1(1): 1475-1483 (2010)

Tadao Takaoka, Mashitoh Hashim: A Simpler Algorithm for the All Pairs Shortest Path Problem with O(n²logn) Expected Time. COCOA (2) 2010: 195-206

Tadao Takaoka: Efficient Algorithms for the 2-Center Problems. ICCSA (2) 2010: 519-532

Tadao Takaoka: Partial Solution and Entropy. MFCS 2009: 700-711

Tadao Takaoka: All Pairs Shortest Paths via Matrix Multiplication. Encyclopedia of Algorithms 2008

Tadao Takaoka, Stephen Violich: Fusing Loopless Algorithms for Combinatorial Generation. Int. J. Found. Comput. Sci. 18(2): 263-293 (2007)

Sung Eun Bae, Tadao Takaoka: Algorithms for k-Disjoint Maximum Subarrays. Int. J. Found. Comput. Sci. 18(2): 319-339 (2007)

Shane Saunders, Tadao Takaoka: Solving shortest paths efficiently on nearly acyclic directed graphs. Theor. Comput. Sci. 370(1-3): 94-109 (2007)

Lin Tian, Tadao Takaoka: Improved Shortest Path Algorithms For Nearly Acyclic Directed Graphs. ACSC 2007: 15-24

Sung Eun Bae, Tadao Takaoka: A Sub-cubic Time Algorithm for the k -Maximum Subarray Problem. ISAAC 2007: 751-762

Sung Eun Bae, Tadao Takaoka: Improved Algorithms for the K-Maximum Subarray Problem. Comput. J. 49(3): 358-374 (2006)

Tadao Takaoka, Stephen Violich: Combinatorial Generation by Fusing Loopless Algorithms. CATS 2006: 69-77

Sung Eun Bae, Tadao Takaoka: Algorithm for K Disjoint Maximum Subarrays. International Conference on Computational Science (1) 2006: 595-602

Akito Kiriyama, Yuji Nakagawa, Tadao Takaoka, Zhiqi Tu: A New Public-Key Cryptosystem and its Applications. ICEIS (3) 2006: 524-529

Tadao Takaoka: An O(n³loglogn/logn) time algorithm for the all-pairs shortest path problem. Inf. Process. Lett. 96(5): 155-161 (2005)

Shane Saunders, Tadao Takaoka: Efficient Algorithms for Solving Shortest Paths on Nearly Acyclic Directed Graphs. CATS 2005: 127-131

Sung Eun Bae, Tadao Takaoka: Improved Algorithms for the K-Maximum Subarray Problem for Small K. COCOON 2005: 621-631

Tadao Takaoka: A Faster Algorithm for the All-Pairs Shortest Path Problem and Its Application. COCOON 2004: 278-289

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: 247-253

Tadao Takaoka: Foreword. Algorithmica 38(2): 269-270 (2003)

Tadao Takaoka: Theory of 2-3 Heaps. Discrete Applied Mathematics 126(1): 115-128 (2003)

Tadao Takaoka: The Reverse Problem of Range Query. Electr. Notes Theor. Comput. Sci. 78: 281-292 (2003)

Shane Saunders, Tadao Takaoka: Improved shortest path algorithms for nearly acyclic graphs. Theor. Comput. Sci. 293(3): 535-556 (2003)

Tadao Takaoka: Efficient Algorithms for the Maximum Subarray Problem by Distance Matrix Multiplication. Electr. Notes Theor. Comput. Sci. 61: 191-200 (2002)

Shane Saunders, Tadao Takaoka: Improved Shortest Path Algorithms for Nearly Acyclic Graphs. Electr. Notes Theor. Comput. Sci. 42: 232-248 (2001)

Peter Eades, Tadao Takaoka (Eds.): Algorithms and Computation, 12th International Symposium, ISAAC 2001, Christchurch, New Zealand, December 19-21, 2001, Proceedings. Lecture Notes in Computer Science 2223, Springer 2001, isbn 3-540-42985-9

Tadao Takaoka: Theory of Trinomial Heaps. COCOON 2000: 362-372

Tadao Takaoka: O(1) Time Algorithms for Combinatorial Generation by Tree Traversal. Comput. J. 42(5): 400-408 (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): 465-472 (1999)

Tadao Takaoka: Theory of 2-3 Heaps. COCOON 1999: 41-50

Tadao Takaoka: An O(1) Time Algorithm for Generating Multiset Permutations. ISAAC 1999: 237-246

Tadao Takaoka: Subcubic Cost Algorithms for the All Pairs Shortest Path Problem. Algorithmica 20(3): 309-318 (1998)

Tadao Takaoka: Shortest Path Algorithms for Nearly Acyclic Directed Graphs. Theor. Comput. Sci. 203(1): 143-150 (1998)

Tadao Takaoka: A New Measure of Disorder in Sorting - Entropy. CATS 1998: 77-86

Tadao Takaoka: A Left-to-Right Preprocessing Computation for the Boyer-Moore String Matching Algorithm. Comput. J. 39(5): 413-416 (1996)

Tadao Takaoka: Shortest Path Algorithms for Nearly Acyclic Directed Graphs. WG 1996: 367-374

Tadao Takaoka: Sub-Cubic Cost Algorithms for the All Pairs Shortest Path Problem. WG 1995: 323-343

Tadao Takaoka: Approximate Pattern Matching with Samples. ISAAC 1994: 234-242

Tadao Takaoka: Parallel program verification with directed graphs. SAC 1994: 462-466

Tadao Takaoka: A New Upper Bound on the Complexity of the All Pairs Shortest Path Problem. Inf. Process. Lett. 43(4): 195-199 (1992)

Tadao Takaoka, Kiyomi Umehara: An Efficient VLSI Algorithms for the All Pairs Shortest Path Problem. J. Parallel Distrib. Comput. 16(3): 265-270 (1992)

Tadao Takaoka: A New Upper Bound on the Complexity of the All Pairs Shortest Path Problem. WG 1991: 209-213

Pradip Dey, Barrett R. Bryant, Tadao Takaoka: Lexical Ambiguity in Tree Adjoining Grammars. Inf. Process. Lett. 34(2): 65-69 (1990)

Qian-Ping Gu, Tadao Takaoka: A sharper analysis of a parallel algorithm for the all pairs shortest path problem. Parallel Computing 16(1): 61-67 (1990)

Rui Feng Zhu, Tadao Takaoka: A Technique for Two-Dimensional Pattern Matching. Commun. ACM 32(9): 1110-1120 (1989)

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: 469-474

Tadao Takaoka: An Efficient Parallel Algorithm for the All Pairs Shortest Path Problem. WG 1988: 276-287

Tadao Takaoka: A Decomposition Rule for the Hoare Logic. Inf. Process. Lett. 26(4): 205-208 (1987)

Alistair Moffat, Tadao Takaoka: An All Pairs Shortest Path Algorithm with Expected Time O(n² log n). SIAM J. Comput. 16(6): 1023-1031 (1987)

Tadao Takaoka: The Semantics of New While Loop. Comput. J. 29(1): 33-35 (1986)

Tadao Takaoka: An On-Line Pattern Matching Algorithm. Inf. Process. Lett. 22(6): 329-330 (1986)

Alistair Moffat, Tadao Takaoka: An All Pairs Shortest Path Algorithm with Expected Running Time O(n^2 log n). FOCS 1985: 101-105

Alistair Moffat, Tadao Takaoka: A Priority Queue for the All Pairs Shortest Path Problem. Inf. Process. Lett. 18(4): 189-193 (1984)

Tadao Takaoka, Alistair Moffat: An O(n² log log log n) Expected Time Algorithm for the all Shortest Distance Problem. MFCS 1980: 643-655

Tadao Takaoka: A Definition of Measures over Language Space. J. Comput. Syst. Sci. 17(3): 376-387 (1978)

Tadao Takaoka: A Note on the Ambiguity of Context-Free Grammars. Inf. Process. Lett. 3(2): 35-36 (1974)

Tadao Takaoka, Toshihide Ibaraki: Fail-Safe Realization of Sequential Machines. Information and Control 22(1): 31-55 (1973)