default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTadao Takaoka
Person information
- affiliation: University of Canterbury, Department of Computer Science and Software Engineering
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2019
[j39]Tadao Takaoka:
Algebraic theory on shortest paths for all flows. Theor. Comput. Sci. 774: 124-132 (2019)- 2017
- [j38]Sung Eun Bae, Tong-Wook Shinn, Tadao Takaoka:
Efficient Algorithms for the Maximum Sum Problems. Algorithms 10(1): 5 (2017) - 2016
- [j37]Yijie Han
, Tadao Takaoka:
An O(n3loglogn/log2n) time algorithm for all pairs shortest paths. J. Discrete Algorithms 38-41: 9-19 (2016) - 2015
- [j36]Tong-Wook Shinn, Tadao Takaoka:
Variations on the bottleneck paths problem. Theor. Comput. Sci. 575: 10-16 (2015) - 2014
- [j35]Tadao Takaoka:
Sharing information for the all pairs shortest path problem. Theor. Comput. Sci. 520: 43-50 (2014) - 2013
- [j34]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) - [j33]Stephen John Weddell, Tristan Read, Mohammed Thaher, Tadao Takaoka:
Maximum subarray algorithms for use in astronomical imaging. J. Electronic Imaging 22(4): 043011 (2013) - 2010
- [j32]Tadao Takaoka, Yuji Nakagawa:
Entropy as Computational Complexity. Inf. Media Technol. 5(4): 1193-1207 (2010) - [j31]Tadao Takaoka, Yuji Nakagawa:
Entropy as Computational Complexity. J. Inf. Process. 18: 227-241 (2010) - 2007
- [j30]Tadao Takaoka, Stephen Violich:
Fusing Loopless Algorithms for Combinatorial Generation. Int. J. Found. Comput. Sci. 18(2): 263-293 (2007) - [j29]Sung Eun Bae, Tadao Takaoka:
Algorithms for k-Disjoint Maximum Subarrays. Int. J. Found. Comput. Sci. 18(2): 319-339 (2007) - [j28]Shane Saunders, Tadao Takaoka:
Solving shortest paths efficiently on nearly acyclic directed graphs. Theor. Comput. Sci. 370(1-3): 94-109 (2007) - 2006
- [j27]Sung Eun Bae, Tadao Takaoka:
Improved Algorithms for the K-Maximum Subarray Problem. Comput. J. 49(3): 358-374 (2006) - 2005
- [j26]Tadao Takaoka:
An O(n3loglogn/logn) time algorithm for the all-pairs shortest path problem. Inf. Process. Lett. 96(5): 155-161 (2005) - 2004
- [j25]Tadao Takaoka:
Foreword. Algorithmica 38(2): 269-270 (2004) - 2003
- [j24]Tadao Takaoka:
Theory of 2-3 Heaps. Discret. Appl. Math. 126(1): 115-128 (2003) - [j23]Shane Saunders, Tadao Takaoka:
Improved shortest path algorithms for nearly acyclic graphs. Theor. Comput. Sci. 293(3): 535-556 (2003) - 1999
- [j22]Tadao Takaoka:
O(1) Time Algorithms for Combinatorial Generation by Tree Traversal. Comput. J. 42(5): 400-408 (1999) - [j21]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) - 1998
- [j20]Tadao Takaoka:
Subcubic Cost Algorithms for the All Pairs Shortest Path Problem. Algorithmica 20(3): 309-318 (1998) - [j19]Tadao Takaoka:
Shortest Path Algorithms for Nearly Acyclic Directed Graphs. Theor. Comput. Sci. 203(1): 143-150 (1998) - 1996
- [j18]Tadao Takaoka:
A Left-to-Right Preprocessing Computation for the Boyer-Moore String Matching Algorithm. Comput. J. 39(5): 413-416 (1996) - 1992
- [j17]Tadao Takaoka:
A New Upper Bound on the Complexity of the All Pairs Shortest Path Problem. Inf. Process. Lett. 43(4): 195-199 (1992) - [j16]Tadao Takaoka, Kiyomi Umehara:
An Efficient VLSI Algorithms for the All Pairs Shortest Path Problem. J. Parallel Distributed Comput. 16(3): 265-270 (1992) - 1990
- [j15]Pradip Dey, Barrett R. Bryant, Tadao Takaoka:
Lexical Ambiguity in Tree Adjoining Grammars. Inf. Process. Lett. 34(2): 65-69 (1990) - [j14]Qian-Ping Gu, Tadao Takaoka:
A sharper analysis of a parallel algorithm for the all pairs shortest path problem. Parallel Comput. 16(1): 61-67 (1990) - 1989
- [j13]Rui Feng Zhu, Tadao Takaoka:
A Technique for Two-Dimensional Pattern Matching. Commun. ACM 32(9): 1110-1120 (1989) - 1987
- [j12]Tadao Takaoka:
A Decomposition Rule for the Hoare Logic. Inf. Process. Lett. 26(4): 205-208 (1987) - [j11]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) - [j10]F. Perez, Tadao Takaoka:
A prime factor FFT algorithm implementation using a program generation technique. IEEE Trans. Acoust. Speech Signal Process. 35(8): 1221-1223 (1987) - 1986
- [j9]Tadao Takaoka:
The Semantics of New While Loop. Comput. J. 29(1): 33-35 (1986) - [j8]Tadao Takaoka:
An On-Line Pattern Matching Algorithm. Inf. Process. Lett. 22(6): 329-330 (1986) - 1984
- [j7]Alistair Moffat, Tadao Takaoka:
A Priority Queue for the All Pairs Shortest Path Problem. Inf. Process. Lett. 18(4): 189-193 (1984) - 1980
- [j6]Tadao Takaoka:
Introduction of history to variables. ACM SIGPLAN Notices 15(9): 61-63 (1980) - 1978
- [j5]Tadao Takaoka:
A Definition of Measures over Language Space. J. Comput. Syst. Sci. 17(3): 376-387 (1978) - 1974
- [j4]Tadao Takaoka:
A Note on the Ambiguity of Context-Free Grammars. Inf. Process. Lett. 3(2): 35-36 (1974) - 1973
- [j3]Tadao Takaoka, Toshihide Ibaraki:
Fail-Safe Realization of Sequential Machines. Inf. Control. 22(1): 31-55 (1973) - 1972
- [j2]Tadao Takaoka, Toshihide Ibaraki:
N-Fail-Safe Sequential Machines. IEEE Trans. Computers 21(11): 1189-1196 (1972) - 1971
- [j1]Tadao Takaoka, Hisashi Mine:
N-Fail-Safe Logical Systems. IEEE Trans. Computers 20(5): 536-542 (1971)
Conference and Workshop Papers
- 2016
- [c44]Sung Eun Bae, Tong-Wook Shinn, Tadao Takaoka:
An efficient parallel algorithm for the maximum convex sum problem. ACSW 2016: 23 - [c43]Sung Eun Bae, Tong-Wook Shinn, Tadao Takaoka:
Minimum Weight Polygon Triangulation Problem in Sub-Cubic Time Bound. COCOA 2016: 326-339 - 2015
- [c42]Tadao Takaoka:
Single Source Shortest Paths for All Flows with Integer Costs. ATMOS 2015: 56-67 - [c41]Tadao Takaoka:
Algebraic Theory on Shortest Paths for All Flows. COCOA 2015: 746-757 - 2014
- [c40]Tong-Wook Shinn, Tadao Takaoka:
Combining the Shortest Paths and the Bottleneck Paths Problems. ACSC 2014: 13-18 - [c39]Sung Eun Bae, Tong-Wook Shinn, Tadao Takaoka:
A Faster Parallel Algorithm for Matrix Multiplication on a Mesh Array. ICCS 2014: 2230-2240 - [c38]Tong-Wook Shinn, Tadao Takaoka:
Combining All Pairs Shortest Paths and All Pairs Bottleneck Paths Problems. LATIN 2014: 226-237 - [c37]Tong-Wook Shinn, Tadao Takaoka:
Some Extensions of the Bottleneck Paths Problem. WALCOM 2014: 176-187 - 2013
- [c36]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: 909-918 - [c35]Jin Bum Hong, Dong Seong Kim, Tadao Takaoka:
Scalable Attack Representation Model Using Logic Reduction Techniques. TrustCom/ISPA/IUCC 2013: 404-411 - 2012
- [c34]Tadao Takaoka:
Efficient Algorithms for the All Pairs Shortest Path Problem with Limited Edge Costs. CATS 2012: 21-26 - [c33]Yijie Han, Tadao Takaoka:
An O(n 3 loglogn/log2 n) Time Algorithm for All Pairs Shortest Paths. SWAT 2012: 131-141 - [c32]Mohammed Thaher, Tadao Takaoka:
Improved algorithms for the K overlapping maximum convex sum problem. ICCS 2012: 754-763 - 2011
- [c31]Tadao Takaoka, Mashitoh Hashim:
Sharing Information in All Pairs Shortest Path Algorithms. CATS 2011: 131-136 - [c30]Mohammed Thaher, Tadao Takaoka:
An efficient algorithm for computing the K-overlapping maximum convex sum problem. ICCS 2011: 1288-1295 - 2010
- [c29]Tadao Takaoka, Mashitoh Hashim:
A Simpler Algorithm for the All Pairs Shortest Path Problem with O(n2logn) Expected Time. COCOA (2) 2010: 195-206 - [c28]Tadao Takaoka:
Efficient Algorithms for the 2-Center Problems. ICCSA (2) 2010: 519-532 - [c27]Mohammed Thaher, Tadao Takaoka:
An efficient algorithm for the k maximum convex sums. ICCS 2010: 1475-1483 - 2009
- [c26]Tadao Takaoka:
Partial Solution and Entropy. MFCS 2009: 700-711 - 2007
- [c25]Lin Tian, Tadao Takaoka:
Improved Shortest Path Algorithms For Nearly Acyclic Directed Graphs. ACSC 2007: 15-24 - [c24]Sung Eun Bae, Tadao Takaoka:
A Sub-cubic Time Algorithm for the k -Maximum Subarray Problem. ISAAC 2007: 751-762 - 2006
- [c23]Tadao Takaoka, Stephen Violich:
Combinatorial Generation by Fusing Loopless Algorithms. CATS 2006: 69-77 - [c22]Sung Eun Bae, Tadao Takaoka:
Algorithm for K Disjoint Maximum Subarrays. International Conference on Computational Science (1) 2006: 595-602 - [c21]Akito Kiriyama, Yuji Nakagawa, Tadao Takaoka, Zhiqi Tu:
A New Public-Key Cryptosystem and its Applications. ICEIS (3) 2006: 524-529 - 2005
- [c20]Shane Saunders, Tadao Takaoka:
Efficient Algorithms for Solving Shortest Paths on Nearly Acyclic Directed Graphs. CATS 2005: 127-131 - [c19]Sung Eun Bae, Tadao Takaoka:
Improved Algorithms for the K-Maximum Subarray Problem for Small K. COCOON 2005: 621-631 - 2004
- [c18]Tadao Takaoka:
A Faster Algorithm for the All-Pairs Shortest Path Problem and Its Application. COCOON 2004: 278-289 - [c17]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 - 2003
- [c16]Tadao Takaoka:
The Reverse Problem of Range Query. CATS 2003: 281-292 - 2002
- [c15]Tadao Takaoka:
Efficient Algorithms for the Maximum Subarray Problem by Distance Matrix Multiplication. CATS 2002: 191-200 - 2001
- [c14]Shane Saunders, Tadao Takaoka:
Improved Shortest Path Algorithms for Nearly Acyclic Graphs. CATS 2001: 232-248 - 2000
- [c13]Tadao Takaoka:
Theory of Trinomial Heaps. COCOON 2000: 362-372 - 1999
- [c12]Tadao Takaoka:
Theory of 2-3 Heaps. COCOON 1999: 41-50 - [c11]Tadao Takaoka:
An O(1) Time Algorithm for Generating Multiset Permutations. ISAAC 1999: 237-246 - 1998
- [c10]Tadao Takaoka:
A New Measure of Disorder in Sorting - Entropy. CATS 1998: 77-86 - 1996
- [c9]Tadao Takaoka:
Shortest Path Algorithms for Nearly Acyclic Directed Graphs. WG 1996: 367-374 - 1995
- [c8]Tadao Takaoka:
Sub-Cubic Cost Algorithms for the All Pairs Shortest Path Problem. WG 1995: 323-343 - 1994
- [c7]Tadao Takaoka:
Approximate Pattern Matching with Samples. ISAAC 1994: 234-242 - [c6]Tadao Takaoka:
Parallel program verification with directed graphs. SAC 1994: 462-466 - 1991
- [c5]Tadao Takaoka:
A New Upper Bound on the Complexity of the All Pairs Shortest Path Problem. WG 1991: 209-213 - 1988
- [c4]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 - [c3]Tadao Takaoka:
An Efficient Parallel Algorithm for the All Pairs Shortest Path Problem. WG 1988: 276-287 - 1985
- [c2]Alistair Moffat, Tadao Takaoka:
An All Pairs Shortest Path Algorithm with Expected Running Time O(n^2 log n). FOCS 1985: 101-105 - 1980
- [c1]Tadao Takaoka, Alistair Moffat:
An O(n² log log log n) Expected Time Algorithm for the all Shortest Distance Problem. MFCS 1980: 643-655
Editorship
- 2001
- [e1]Peter Eades, Tadao Takaoka:
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 [contents]
Reference Works
- 2016
- [r2]Tadao Takaoka:
All Pairs Shortest Paths via Matrix Multiplication. Encyclopedia of Algorithms 2016: 55-59 - 2008
- [r1]Tadao Takaoka:
All Pairs Shortest Paths via Matrix Multiplication. Encyclopedia of Algorithms 2008
Informal and Other Publications
- 2015
- [i6]Tadao Takaoka:
Multi-level Loop-less Algorithm for Multi-set Permutations. CoRR abs/1502.06062 (2015) - [i5]Tadao Takaoka:
O(1) Time Generation of Adjacent Multiset Combinations. CoRR abs/1503.00067 (2015) - 2013
- [i4]Tong-Wook Shinn, Tadao Takaoka:
Some Extensions of the All Pairs Bottleneck Paths Problem. CoRR abs/1306.5815 (2013) - [i3]Tong-Wook Shinn, Tadao Takaoka:
Efficient Graph Algorithms for Network Analysis. CoRR abs/1309.3849 (2013) - [i2]Tong-Wook Shinn, Tadao Takaoka:
Combining All Pairs Shortest Paths and All Pairs Bottleneck Paths Problems. CoRR abs/1309.5687 (2013) - [i1]Tong-Wook Shinn, Tadao Takaoka:
Combining the Shortest Paths and the Bottleneck Paths Problems. CoRR abs/1311.5081 (2013)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:22 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
