Tadao Takaoka

According to our database, Tadao Takaoka authored at least 83 papers between 1971 and 2017.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2017

Efficient Algorithms for the Maximum Sum Problems.

Sung Eun Bae, Tong-Wook Shinn, Tadao Takaoka

Algorithms, 2017

2016

All Pairs Shortest Paths via Matrix Multiplication.

Tadao Takaoka

Encyclopedia of Algorithms, 2016

An O(n³log⁡log⁡n/log²⁡n) time algorithm for all pairs shortest paths.

Yijie Han, Tadao Takaoka

J. Discrete Algorithms, 2016

Minimum Weight Polygon Triangulation Problem in Sub-Cubic Time Bound.

Sung Eun Bae, Tong-Wook Shinn, Tadao Takaoka

Proceedings of the Combinatorial Optimization and Applications, 2016

An efficient parallel algorithm for the maximum convex sum problem.

Sung Eun Bae, Tong-Wook Shinn, Tadao Takaoka

Proceedings of the Australasian Computer Science Week Multiconference, 2016

2015

Variations on the bottleneck paths problem.

Tong-Wook Shinn, Tadao Takaoka

Theor. Comput. Sci., 2015

O(1) Time Generation of Adjacent Multiset Combinations.

Tadao Takaoka

CoRR, 2015

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

Tadao Takaoka

CoRR, 2015

Algebraic Theory on Shortest Paths for All Flows.

Tadao Takaoka

Proceedings of the Combinatorial Optimization and Applications, 2015

Single Source Shortest Paths for All Flows with Integer Costs.

Tadao Takaoka

Proceedings of the 15th Workshop on Algorithmic Approaches for Transportation Modelling, 2015

2014

Sharing information for the all pairs shortest path problem.

Tadao Takaoka

Theor. Comput. Sci., 2014

Some Extensions of the Bottleneck Paths Problem.

Tong-Wook Shinn, Tadao Takaoka

Proceedings of the Algorithms and Computation - 8th International Workshop, 2014

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

Tong-Wook Shinn, Tadao Takaoka

Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

A Faster Parallel Algorithm for Matrix Multiplication on a Mesh Array.

Sung Eun Bae, Tong-Wook Shinn, Tadao Takaoka

Proceedings of the International Conference on Computational Science, 2014

Combining the Shortest Paths and the Bottleneck Paths Problems.

Tong-Wook Shinn, Tadao Takaoka

Proceedings of the Thirty-Seventh Australasian Computer Science Conference, 2014

2013

Maximum subarray algorithms for use in astronomical imaging.

Stephen John Weddell, Tristan Read, Mohammed Thaher, Tadao Takaoka

J. Electronic Imaging, 2013

A simplified algorithm for the all pairs shortest path problem with O(n 2logn) expected time.

Tadao Takaoka

J. Comb. Optim., 2013

Efficient Graph Algorithms for Network Analysis.

Tong-Wook Shinn, Tadao Takaoka

CoRR, 2013

Some Extensions of the All Pairs Bottleneck Paths Problem.

Tong-Wook Shinn, Tadao Takaoka

CoRR, 2013

Scalable Attack Representation Model Using Logic Reduction Techniques.

Jin Bum Hong, Dong Seong Kim, Tadao Takaoka

Proceedings of the 12th IEEE International Conference on Trust, 2013

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

Mohammed Thaher, Danladi Umar, Tadao Takaoka, Jon Harding

Proceedings of the International Conference on Computational Science, 2013

2012

Improved algorithms for the K overlapping maximum convex sum problem.

Mohammed Thaher, Tadao Takaoka

Proceedings of the International Conference on Computational Science, 2012

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

Yijie Han, Tadao Takaoka

Proceedings of the Algorithm Theory - SWAT 2012, 2012

Efficient Algorithms for the All Pairs Shortest Path Problem with Limited Edge Costs.

Tadao Takaoka

Proceedings of the Eighteenth Computing: The Australasian Theory Symposium, 2012

2011

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

Mohammed Thaher, Tadao Takaoka

Proceedings of the International Conference on Computational Science, 2011

Sharing Information in All Pairs Shortest Path Algorithms.

Tadao Takaoka, Mashitoh Hashim

Proceedings of the Seventeenth Computing: The Australasian Theory Symposium, 2011

2010

An efficient algorithm for the k maximum convex sums.

Mohammed Thaher, Tadao Takaoka

Proceedings of the International Conference on Computational Science, 2010

Entropy as Computational Complexity.

Tadao Takaoka, Yuji Nakagawa

Inf. Media Technol., 2010

Efficient Algorithms for the 2-Center Problems.

Tadao Takaoka

Proceedings of the Computational Science and Its Applications, 2010

A Simpler Algorithm for the All Pairs Shortest Path Problem with <i>O</i>(<i>n</i>²log<i>n</i>) Expected Time.

Tadao Takaoka, Mashitoh Hashim

Proceedings of the Combinatorial Optimization and Applications, 2010

2009

Partial Solution and Entropy.

Tadao Takaoka

Proceedings of the Mathematical Foundations of Computer Science 2009, 2009

2008

All Pairs Shortest Paths via Matrix Multiplication.

Tadao Takaoka

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

2007

Solving shortest paths efficiently on nearly acyclic directed graphs.

Shane Saunders, Tadao Takaoka

Theor. Comput. Sci., 2007

Fusing Loopless Algorithms for Combinatorial Generation.

Tadao Takaoka, Stephen Violich

Int. J. Found. Comput. Sci., 2007

Algorithms for k-Disjoint Maximum Subarrays.

Sung Eun Bae, Tadao Takaoka

Int. J. Found. Comput. Sci., 2007

A Sub-cubic Time Algorithm for the <i>k</i> -Maximum Subarray Problem.

Sung Eun Bae, Tadao Takaoka

Proceedings of the Algorithms and Computation, 18th International Symposium, 2007

Improved Shortest Path Algorithms For Nearly Acyclic Directed Graphs.

Lin Tian, Tadao Takaoka

Proceedings of the Computer Science 2007. Proceedings of the Thirtieth Australasian Computer Science Conference (ACSC2007). Ballarat, Victoria, Australia, January 30, 2007

2006

Improved Algorithms for the <i>K</i>-Maximum Subarray Problem.

Sung Eun Bae, Tadao Takaoka

Comput. J., 2006

A New Public-Key Cryptosystem and its Applications.

Akito Kiriyama, Yuji Nakagawa, Tadao Takaoka, Zhiqi Tu

Proceedings of the ICEIS 2006, 2006

Algorithm for <i>K</i> Disjoint Maximum Subarrays.

Sung Eun Bae, Tadao Takaoka

Proceedings of the Computational Science, 2006

Combinatorial Generation by Fusing Loopless Algorithms.

Tadao Takaoka, Stephen Violich

Proceedings of the Theory of Computing 2006, 2006

2005

An O(<i>n</i>³loglog<i>n</i>/log<i>n</i>) time algorithm for the all-pairs shortest path problem.

Tadao Takaoka

Inf. Process. Lett., 2005

Improved Algorithms for the <i>K</i>-Maximum Subarray Problem for Small <i>K</i>.

Sung Eun Bae, Tadao Takaoka

Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

Efficient Algorithms for Solving Shortest Paths on Nearly Acyclic Directed Graphs.

Shane Saunders, Tadao Takaoka

Proceedings of the Theory of Computing 2005, 2005

2004

Foreword.

Tadao Takaoka

Algorithmica, 2004

Algorithms for the Problem of K Maximum Sums and a VLSI Algorithm for the K Maximum Subarrays Problem.

Sung Eun Bae, Tadao Takaoka

Proceedings of the 7th International Symposium on Parallel Architectures, 2004

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

Tadao Takaoka

Proceedings of the Computing and Combinatorics, 10th Annual International Conference, 2004

2003

The Reverse Problem of Range Query.

Tadao Takaoka

Proceedings of the Computing: the Australasian Theory Symposiumm, 2003

2002

Efficient Algorithms for the Maximum Subarray Problem by Distance Matrix Multiplication.

Tadao Takaoka

Proceedings of the Computing: the Australasian Theory Symposium, 2002

2001

Improved Shortest Path Algorithms for Nearly Acyclic Graphs.

Shane Saunders, Tadao Takaoka

Proceedings of the Computing: The Australasian Theory Symposium, 2001

2000

Theory of Trinomial Heaps.

Tadao Takaoka

Proceedings of the Computing and Combinatorics, 6th Annual International Conference, 2000

1999

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

Alan P. Sprague, Tadao Takaoka

Int. J. Found. Comput. Sci., 1999

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

Tadao Takaoka

Comput. J., 1999

An O(1) Time Algorithm for Generating Multiset Permutations.

Tadao Takaoka

Proceedings of the Algorithms and Computation, 10th International Symposium, 1999

Theory of 2-3 Heaps.

Tadao Takaoka

Proceedings of the Computing and Combinatorics, 5th Annual International Conference, 1999

1998

Subcubic Cost Algorithms for the All Pairs Shortest Path Problem.

Tadao Takaoka

Algorithmica, 1998

A New Measure of Disorder in Sorting - Entropy.

Tadao Takaoka

Proceedings of Computing: The Fourth Australasian Theory Symposium (CATS'98), 1998

1996

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

Tadao Takaoka

Comput. J., 1996

Shortest Path Algorithms for Nearly Acyclic Directed Graphs.

Tadao Takaoka

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1996

1995

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

Tadao Takaoka

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1995

1994

Parallel program verification with directed graphs.

Tadao Takaoka

Proceedings of the 1994 ACM Symposium on Applied Computing, 1994

Approximate Pattern Matching with Samples.

Tadao Takaoka

Proceedings of the Algorithms and Computation, 5th International Symposium, 1994

1992

An Efficient VLSI Algorithms for the All Pairs Shortest Path Problem.

Tadao Takaoka, Kiyomi Umehara

J. Parallel Distributed Comput., 1992

1991

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

Tadao Takaoka

Proceedings of the 17th International Workshop, 1991

1990

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

Qian-Ping Gu, Tadao Takaoka

Parallel Comput., 1990

Lexical Ambiguity in Tree Adjoining Grammars.

Pradip Dey, Barrett R. Bryant, Tadao Takaoka

Inf. Process. Lett., 1990

1989

A Technique for Two-Dimensional Pattern Matching.

Rui Feng Zhu, Tadao Takaoka

Commun. ACM, 1989

1988

An Efficient Parallel Algorithm for the All Pairs Shortest Path Problem.

Tadao Takaoka

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1988

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

Barrett R. Bryant, Balanjaninath Edupuganty, K. R. Sundararaghavan, Tadao Takaoka

Proceedings of the Sixteenth ACM Annual Conference on Computer Science, 1988

1987

A prime factor FFT algorithm implementation using a program generation technique.

F. Perez, Tadao Takaoka

IEEE Trans. Acoust. Speech Signal Process., 1987

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

Alistair Moffat, Tadao Takaoka

SIAM J. Comput., 1987

A Decomposition Rule for the Hoare Logic.

Tadao Takaoka

Inf. Process. Lett., 1987

1986

An On-Line Pattern Matching Algorithm.

Tadao Takaoka

Inf. Process. Lett., 1986

The Semantics of New While Loop.

Tadao Takaoka

Comput. J., 1986

1985

An All Pairs Shortest Path Algorithm with Expected Running Time O(n^2 log n)

Alistair Moffat, Tadao Takaoka

Proceedings of the 26th Annual Symposium on Foundations of Computer Science, 1985

1984

A Priority Queue for the All Pairs Shortest Path Problem.

Alistair Moffat, Tadao Takaoka

Inf. Process. Lett., 1984

1980

Introduction of history to variables.

Tadao Takaoka

ACM SIGPLAN Notices, 1980

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

Tadao Takaoka, Alistair Moffat

Proceedings of the Mathematical Foundations of Computer Science 1980 (MFCS'80), 1980

1978

A Definition of Measures over Language Space.

Tadao Takaoka

J. Comput. Syst. Sci., 1978

1974

A Note on the Ambiguity of Context-Free Grammars.

Tadao Takaoka

Inf. Process. Lett., 1974

1973

Fail-Safe Realization of Sequential Machines

Tadao Takaoka, Toshihide Ibaraki

Inf. Control., February, 1973

1972

N-Fail-Safe Sequential Machines.

Tadao Takaoka, Toshihide Ibaraki

IEEE Trans. Computers, 1972

1971

N-Fail-Safe Logical Systems.

Tadao Takaoka, Hisashi Mine

IEEE Trans. Computers, 1971