Tadao Takaoka

According to our database1, Tadao Takaoka authored at least 82 papers between 1971 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
Algebraic theory on shortest paths for all flows.
Theor. Comput. Sci., 2019

2017
Efficient Algorithms for the Maximum Sum Problems.
Algorithms, 2017

2016
All Pairs Shortest Paths via Matrix Multiplication.
Encyclopedia of Algorithms, 2016

An O(n3log⁡log⁡n/log2⁡n) time algorithm for all pairs shortest paths.
J. Discrete Algorithms, 2016

Minimum Weight Polygon Triangulation Problem in Sub-Cubic Time Bound.
Proceedings of the Combinatorial Optimization and Applications, 2016

An efficient parallel algorithm for the maximum convex sum problem.
Proceedings of the Australasian Computer Science Week Multiconference, 2016

2015
Variations on the bottleneck paths problem.
Theor. Comput. Sci., 2015

O(1) Time Generation of Adjacent Multiset Combinations.
CoRR, 2015

Multi-level Loop-less Algorithm for Multi-set Permutations.
CoRR, 2015

Single Source Shortest Paths for All Flows with Integer Costs.
Proceedings of the 15th Workshop on Algorithmic Approaches for Transportation Modelling, 2015

2014
Sharing information for the all pairs shortest path problem.
Theor. Comput. Sci., 2014

Some Extensions of the Bottleneck Paths Problem.
Proceedings of the Algorithms and Computation - 8th International Workshop, 2014

Combining All Pairs Shortest Paths and All Pairs Bottleneck Paths Problems.
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.
Proceedings of the International Conference on Computational Science, 2014

Combining the Shortest Paths and the Bottleneck Paths Problems.
Proceedings of the Thirty-Seventh Australasian Computer Science Conference, 2014

2013
Maximum subarray algorithms for use in astronomical imaging.
J. Electronic Imaging, 2013

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

Efficient Graph Algorithms for Network Analysis.
CoRR, 2013

Some Extensions of the All Pairs Bottleneck Paths Problem.
CoRR, 2013

Scalable Attack Representation Model Using Logic Reduction Techniques.
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.
Proceedings of the International Conference on Computational Science, 2013

2012
Improved algorithms for the K overlapping maximum convex sum problem.
Proceedings of the International Conference on Computational Science, 2012

An O(n 3 loglogn/log2 n) Time Algorithm for All Pairs Shortest Paths.
Proceedings of the Algorithm Theory - SWAT 2012, 2012

Efficient Algorithms for the All Pairs Shortest Path Problem with Limited Edge Costs.
Proceedings of the Eighteenth Computing: The Australasian Theory Symposium, 2012

2011
An efficient algorithm for computing the K-overlapping maximum convex sum problem.
Proceedings of the International Conference on Computational Science, 2011

Sharing Information in All Pairs Shortest Path Algorithms.
Proceedings of the Seventeenth Computing: The Australasian Theory Symposium, 2011

2010
An efficient algorithm for the k maximum convex sums.
Proceedings of the International Conference on Computational Science, 2010

Entropy as Computational Complexity.
JIP, 2010

Efficient Algorithms for the 2-Center Problems.
Proceedings of the Computational Science and Its Applications, 2010

A Simpler Algorithm for the All Pairs Shortest Path Problem with O(n2logn) Expected Time.
Proceedings of the Combinatorial Optimization and Applications, 2010

2009
Partial Solution and Entropy.
Proceedings of the Mathematical Foundations of Computer Science 2009, 2009

2008
All Pairs Shortest Paths via Matrix Multiplication.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

2007
Solving shortest paths efficiently on nearly acyclic directed graphs.
Theor. Comput. Sci., 2007

Fusing Loopless Algorithms for Combinatorial Generation.
Int. J. Found. Comput. Sci., 2007

Algorithms for k-Disjoint Maximum Subarrays.
Int. J. Found. Comput. Sci., 2007

A Sub-cubic Time Algorithm for the k -Maximum Subarray Problem.
Proceedings of the Algorithms and Computation, 18th International Symposium, 2007

Improved Shortest Path Algorithms For Nearly Acyclic Directed Graphs.
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 K-Maximum Subarray Problem.
Comput. J., 2006

A New Public-Key Cryptosystem and its Applications.
Proceedings of the ICEIS 2006, 2006

Algorithm for K Disjoint Maximum Subarrays.
Proceedings of the Computational Science, 2006

Combinatorial Generation by Fusing Loopless Algorithms.
Proceedings of the Theory of Computing 2006, 2006

2005
An O(n3loglogn/logn) time algorithm for the all-pairs shortest path problem.
Inf. Process. Lett., 2005

Improved Algorithms for the K-Maximum Subarray Problem for Small K.
Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

Efficient Algorithms for Solving Shortest Paths on Nearly Acyclic Directed Graphs.
Proceedings of the Theory of Computing 2005, 2005

2004
Foreword.
Algorithmica, 2004

Algorithms for the Problem of K Maximum Sums and a VLSI Algorithm for the K Maximum Subarrays Problem.
Proceedings of the 7th International Symposium on Parallel Architectures, 2004

A Faster Algorithm for the All-Pairs Shortest Path Problem and Its Application.
Proceedings of the Computing and Combinatorics, 10th Annual International Conference, 2004

2003
The Reverse Problem of Range Query.
Electr. Notes Theor. Comput. Sci., 2003

Theory of 2-3 Heaps.
Discrete Applied Mathematics, 2003

2002
Efficient Algorithms for the Maximum Subarray Problem by Distance Matrix Multiplication.
Electr. Notes Theor. Comput. Sci., 2002

2001
Improved Shortest Path Algorithms for Nearly Acyclic Graphs.
Electr. Notes Theor. Comput. Sci., 2001

2000
Theory of Trinomial Heaps.
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.
Int. J. Found. Comput. Sci., 1999

O(1) Time Algorithms for Combinatorial Generation by Tree Traversal.
Comput. J., 1999

An O(1) Time Algorithm for Generating Multiset Permutations.
Proceedings of the Algorithms and Computation, 10th International Symposium, 1999

1998
Shortest Path Algorithms for Nearly Acyclic Directed Graphs.
Theor. Comput. Sci., 1998

Subcubic Cost Algorithms for the All Pairs Shortest Path Problem.
Algorithmica, 1998

A New Measure of Disorder in Sorting - Entropy.
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.
Comput. J., 1996

1995
Sub-Cubic Cost Algorithms for the All Pairs Shortest Path Problem.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1995

1994
Parallel program verification with directed graphs.
Proceedings of the 1994 ACM Symposium on Applied Computing, 1994

Approximate Pattern Matching with Samples.
Proceedings of the Algorithms and Computation, 5th International Symposium, 1994

1992
An Efficient VLSI Algorithms for the All Pairs Shortest Path Problem.
J. Parallel Distrib. Comput., 1992

A New Upper Bound on the Complexity of the All Pairs Shortest Path Problem.
Inf. Process. Lett., 1992

1990
A sharper analysis of a parallel algorithm for the all pairs shortest path problem.
Parallel Computing, 1990

Lexical Ambiguity in Tree Adjoining Grammars.
Inf. Process. Lett., 1990

1989
A Technique for Two-Dimensional Pattern Matching.
Commun. ACM, 1989

1988
An Efficient Parallel Algorithm for the All Pairs Shortest Path Problem.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1988

Two-level grammar: data flow English for functional and logic programming.
Proceedings of the Sixteenth ACM Annual Conference on Computer Science, 1988

1987
A prime factor FFT algorithm implementation using a program generation technique.
IEEE Trans. Acoustics, Speech, and Signal Processing, 1987

An All Pairs Shortest Path Algorithm with Expected Time O(n² log n).
SIAM J. Comput., 1987

A Decomposition Rule for the Hoare Logic.
Inf. Process. Lett., 1987

1986
An On-Line Pattern Matching Algorithm.
Inf. Process. Lett., 1986

The Semantics of New While Loop.
Comput. J., 1986

1985
An All Pairs Shortest Path Algorithm with Expected Running Time O(n^2 log n)
Proceedings of the 26th Annual Symposium on Foundations of Computer Science, 1985

1984
A Priority Queue for the All Pairs Shortest Path Problem.
Inf. Process. Lett., 1984

1980
An O(n² log log log n) Expected Time Algorithm for the all Shortest Distance Problem.
Proceedings of the Mathematical Foundations of Computer Science 1980 (MFCS'80), 1980

1978
A Definition of Measures over Language Space.
J. Comput. Syst. Sci., 1978

1974
A Note on the Ambiguity of Context-Free Grammars.
Inf. Process. Lett., 1974

1973
Fail-Safe Realization of Sequential Machines
Information and Control, February, 1973

1972
N-Fail-Safe Sequential Machines.
IEEE Trans. Computers, 1972

1971
N-Fail-Safe Logical Systems.
IEEE Trans. Computers, 1971


  Loading...