Tadao Takaoka

Available identifiers

zbMath Open takaoka.tadaoMaRDI QIDQ350722

List of research outcomes

Publication	Date of Publication	Type
Sub-cubic cost algorithms for the all pairs shortest path problem	2024-02-28	Paper
An efficient parallel algorithm for the all pairs shortest path problem	2024-02-28	Paper
https://portal.mardi4nfdi.de/entity/Q5240196	2019-10-24	Paper
Algebraic theory on shortest paths for all flows	2019-06-25	Paper
Efficient algorithms for the maximum sum problems	2018-08-20	Paper
Minimum Weight Polygon Triangulation Problem in Sub-Cubic Time Bound	2017-02-01	Paper
An \(O(n^3 \log \log n / \log^2 n)\) time algorithm for all pairs shortest paths	2016-12-09	Paper
Algebraic Theory on Shortest Paths for All Flows	2016-02-05	Paper
O(1) QUERY TIME ALGORITHM FOR ALL PAIRS SHORTEST DISTANCES ON INTERVAL GRAPHS	2015-04-29	Paper
Variations on the bottleneck paths problem	2015-04-01	Paper
Combining All Pairs Shortest Paths and All Pairs Bottleneck Paths Problems	2014-03-31	Paper
Some Extensions of the Bottleneck Paths Problem	2014-02-18	Paper
Sharing information for the all pairs shortest path problem	2014-01-13	Paper
https://portal.mardi4nfdi.de/entity/Q2843927	2013-08-27	Paper
Efficient Algorithms for the Maximum Subarray Problem by Distance Matrix Multiplication	2013-07-24	Paper
A simplified algorithm for the all pairs shortest path problem with \(O(n ^{2} \log n)\) expected time	2013-03-25	Paper
An O(n 3 loglogn/log2 n) Time Algorithm for All Pairs Shortest Paths	2012-08-14	Paper
A Simpler Algorithm for the All Pairs Shortest Path Problem with O(n 2logn) Expected Time	2011-01-10	Paper
An \(O(n^{3}\log \log n/\log n)\) time algorithm for the all-pairs shortest path problem	2009-12-18	Paper
Partial Solution and Entropy	2009-10-16	Paper
Algorithm for K Disjoint Maximum Subarrays	2008-12-09	Paper
A Sub-cubic Time Algorithm for the k-Maximum Subarray Problem	2008-05-27	Paper
FUSING LOOPLESS ALGORITHMS FOR COMBINATORIAL GENERATION	2007-04-25	Paper
ALGORITHMS FOR K-DISJOINT MAXIMUM SUBARRAYS	2007-04-25	Paper
Solving shortest paths efficiently on nearly acyclic directed graphs	2007-02-26	Paper
Computing and Combinatorics	2006-01-11	Paper
Computing and Combinatorics	2005-06-15	Paper
Improved shortest path algorithms for nearly acyclic graphs	2003-07-01	Paper
Theory of 2-3 heaps	2003-03-09	Paper
https://portal.mardi4nfdi.de/entity/Q2766845	2002-07-22	Paper
https://portal.mardi4nfdi.de/entity/Q2703756	2001-05-08	Paper
https://portal.mardi4nfdi.de/entity/Q4525706	2001-01-24	Paper
https://portal.mardi4nfdi.de/entity/Q4511229	2000-10-30	Paper
https://portal.mardi4nfdi.de/entity/Q4953347	2000-05-09	Paper
O(1) Time Algorithms for Combinatorial Generation by Tree Traversal	2000-04-10	Paper
Shortest path algorithms for nearly acyclic directed graphs	1999-01-12	Paper
Subcubic cost algorithms for the all pairs shortest path problem	1998-10-19	Paper
https://portal.mardi4nfdi.de/entity/Q4346819	1998-02-18	Paper
https://portal.mardi4nfdi.de/entity/Q4321477	1995-06-12	Paper
https://portal.mardi4nfdi.de/entity/Q4694733	1993-06-29	Paper
A new upper bound on the complexity of the all pairs shortest path problem	1993-01-17	Paper
https://portal.mardi4nfdi.de/entity/Q4008403	1992-09-27	Paper
Lexical ambiguity in tree adjoining grammars	1990-01-01	Paper
A sharper analysis of a prallel algorithm for the all pairs shortest path problem	1990-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3821619	1988-01-01	Paper
A decomposition rule for the Hoare logic	1987-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3782834	1987-01-01	Paper
An All Pairs Shortest Path Algorithm with Expected Time $O(n^2 \log n)$	1987-01-01	Paper
The Semantics of New While Loop	1986-01-01	Paper
A priority queue for the all pairs shortest path problem	1984-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3686746	1984-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3893329	1980-01-01	Paper
A definition of measures over language space	1978-01-01	Paper
A note on the ambiguity of context-free grammars	1974-01-01	Paper
Fail-safe realization of sequential machines	1973-01-01	Paper
N-Fail-Safe Sequential Machines	1972-01-01	Paper
N-Fail-Safe Logical Systems	1971-01-01	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Tadao Takaoka