 | 2009 |
|---|
| 54 |       | Tadao Takaoka:
Partial Solution and Entropy.
MFCS 2009: 700-711 |
| 2008 |
|---|
| 53 | | Tadao Takaoka:
All Pairs Shortest Paths via Matrix Multiplication.
Encyclopedia of Algorithms 2008 |
| 2007 |
|---|
| 52 | | Lin Tian,
Tadao Takaoka:
Improved Shortest Path Algorithms For Nearly Acyclic Directed Graphs.
ACSC 2007: 15-24 |
| 51 | | Sung Eun Bae,
Tadao Takaoka:
A Sub-cubic Time Algorithm for the k -Maximum Subarray Problem.
ISAAC 2007: 751-762 |
| 50 | | Tadao Takaoka,
Stephen Violich:
Fusing Loopless Algorithms for Combinatorial Generation.
Int. J. Found. Comput. Sci. 18(2): 263-293 (2007) |
| 49 | | Sung Eun Bae,
Tadao Takaoka:
Algorithms for k-Disjoint Maximum Subarrays.
Int. J. Found. Comput. Sci. 18(2): 319-339 (2007) |
| 48 | | Shane Saunders,
Tadao Takaoka:
Solving shortest paths efficiently on nearly acyclic directed graphs.
Theor. Comput. Sci. 370(1-3): 94-109 (2007) |
| 2006 |
|---|
| 47 | | Tadao Takaoka,
Stephen Violich:
Combinatorial Generation by Fusing Loopless Algorithms.
CATS 2006: 69-77 |
| 46 |  | Akito Kiriyama,
Yuji Nakagawa,
Tadao Takaoka,
Zhiqi Tu:
A New Public-Key Cryptosystem and its Applications.
ICEIS (3) 2006: 524-529 |
| 45 | | Sung Eun Bae,
Tadao Takaoka:
Algorithm for K Disjoint Maximum Subarrays.
International Conference on Computational Science (1) 2006: 595-602 |
| 44 | | Sung Eun Bae,
Tadao Takaoka:
Improved Algorithms for the K-Maximum Subarray Problem.
Comput. J. 49(3): 358-374 (2006) |
| 2005 |
|---|
| 43 | | Shane Saunders,
Tadao Takaoka:
Efficient Algorithms for Solving Shortest Paths on Nearly Acyclic Directed Graphs.
CATS 2005: 127-131 |
| 42 | | Sung Eun Bae,
Tadao Takaoka:
Improved Algorithms for the K-Maximum Subarray Problem for Small K.
COCOON 2005: 621-631 |
| 41 | | Tadao Takaoka:
An O(n3loglogn/logn) time algorithm for the all-pairs shortest path problem.
Inf. Process. Lett. 96(5): 155-161 (2005) |
| 2004 |
|---|
| 40 | | Tadao Takaoka:
A Faster Algorithm for the All-Pairs Shortest Path Problem and Its Application.
COCOON 2004: 278-289 |
| 39 | | 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 |
|---|
| 38 | | Tadao Takaoka:
Foreword.
Algorithmica 38(2): 269-270 (2003) |
| 37 | | Tadao Takaoka:
Theory of 2-3 Heaps.
Discrete Applied Mathematics 126(1): 115-128 (2003) |
| 36 | | Tadao Takaoka:
The Reverse Problem of Range Query.
Electr. Notes Theor. Comput. Sci. 78: (2003) |
| 35 | | Shane Saunders,
Tadao Takaoka:
Improved shortest path algorithms for nearly acyclic graphs.
Theor. Comput. Sci. 293(3): 535-556 (2003) |
| 2002 |
|---|
| 34 | | Tadao Takaoka:
Efficient Algorithms for the Maximum Subarray Problem by Distance Matrix Multiplication.
Electr. Notes Theor. Comput. Sci. 61: (2002) |
| 2001 |
|---|
| 33 | | Peter Eades,
Tadao Takaoka:
Algorithms and Computation, 12th International Symposium, ISAAC 2001, Christchurch, New Zealand, December 19-21, 2001, Proceedings
Springer 2001 |
| 32 | | Shane Saunders,
Tadao Takaoka:
Improved Shortest Path Algorithms for Nearly Acyclic Graphs.
Electr. Notes Theor. Comput. Sci. 42: (2001) |
| 2000 |
|---|
| 31 | | Tadao Takaoka:
Theory of Trinomial Heaps.
COCOON 2000: 362-372 |
| 1999 |
|---|
| 30 | | Tadao Takaoka:
Theory of 2-3 Heaps.
COCOON 1999: 41-50 |
| 29 | | Tadao Takaoka:
An O(1) Time Algorithm for Generating Multiset Permutations.
ISAAC 1999: 237-246 |
| 28 | | Tadao Takaoka:
O(1) Time Algorithms for Combinatorial Generation by Tree Traversal.
Comput. J. 42(5): 400-408 (1999) |
| 27 | | 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 |
|---|
| 26 | | Tadao Takaoka:
A New Measure of Disorder in Sorting - Entropy.
CATS 1998: 77-86 |
| 25 | | Tadao Takaoka:
Subcubic Cost Algorithms for the All Pairs Shortest Path Problem.
Algorithmica 20(3): 309-318 (1998) |
| 24 | | Tadao Takaoka:
Shortest Path Algorithms for Nearly Acyclic Directed Graphs.
Theor. Comput. Sci. 203(1): 143-150 (1998) |
| 1996 |
|---|
| 23 | | Tadao Takaoka:
Shortest Path Algorithms for Nearly Acyclic Directed Graphs.
WG 1996: 367-374 |
| 22 | | Tadao Takaoka:
A Left-to-Right Preprocessing Computation for the Boyer-Moore String Matching Algorithm.
Comput. J. 39(5): 413-416 (1996) |
| 1995 |
|---|
| 21 | | Tadao Takaoka:
Sub-Cubic Cost Algorithms for the All Pairs Shortest Path Problem.
WG 1995: 323-343 |
| 1994 |
|---|
| 20 | | Tadao Takaoka:
Approximate Pattern Matching with Samples.
ISAAC 1994: 234-242 |
| 19 | | Tadao Takaoka:
Parallel program verification with directed graphs.
SAC 1994: 462-466 |
| 1992 |
|---|
| 18 | | Tadao Takaoka:
A New Upper Bound on the Complexity of the All Pairs Shortest Path Problem.
Inf. Process. Lett. 43(4): 195-199 (1992) |
| 17 | | Tadao Takaoka,
Kiyomi Umehara:
An Efficient VLSI Algorithms for the All Pairs Shortest Path Problem.
J. Parallel Distrib. Comput. 16(3): 265-270 (1992) |
| 1991 |
|---|
| 16 | | Tadao Takaoka:
A New Upper Bound on the Complexity of the All Pairs Shortest Path Problem.
WG 1991: 209-213 |
| 1990 |
|---|
| 15 | | Pradip Dey,
Barrett R. Bryant,
Tadao Takaoka:
Lexical Ambiguity in Tree Adjoining Grammars.
Inf. Process. Lett. 34(2): 65-69 (1990) |
| 14 | | 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) |
| 1989 |
|---|
| 13 | | Rui Feng Zhu,
Tadao Takaoka:
A Technique for Two-Dimensional Pattern Matching.
Commun. ACM 32(9): 1110-1120 (1989) |
| 1988 |
|---|
| 12 | | 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 |
| 11 | | Tadao Takaoka:
An Efficient Parallel Algorithm for the All Pairs Shortest Path Problem.
WG 1988: 276-287 |
| 1987 |
|---|
| 10 | | Tadao Takaoka:
A Decomposition Rule for the Hoare Logic.
Inf. Process. Lett. 26(4): 205-208 (1987) |
| 9 | | 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) |
| 1986 |
|---|
| 8 | | Tadao Takaoka:
The Semantics of New While Loop.
Comput. J. 29(1): 33-35 (1986) |
| 7 | | Tadao Takaoka:
An On-Line Pattern Matching Algorithm.
Inf. Process. Lett. 22(6): 329-330 (1986) |
| 1985 |
|---|
| 6 | | Alistair Moffat,
Tadao Takaoka:
An All Pairs Shortest Path Algorithm with Expected Running Time O(n^2 log n)
FOCS 1985: 101-105 |
| 1984 |
|---|
| 5 | | Alistair Moffat,
Tadao Takaoka:
A Priority Queue for the All Pairs Shortest Path Problem.
Inf. Process. Lett. 18(4): 189-193 (1984) |
| 1980 |
|---|
| 4 | | Tadao Takaoka,
Alistair Moffat:
An O(n² log log log n) Expected Time Algorithm for the all Shortest Distance Problem.
MFCS 1980: 643-655 |
| 1978 |
|---|
| 3 | | Tadao Takaoka:
A Definition of Measures over Language Space.
J. Comput. Syst. Sci. 17(3): 376-387 (1978) |
| 1974 |
|---|
| 2 | | Tadao Takaoka:
A Note on the Ambiguity of Context-Free Grammars.
Inf. Process. Lett. 3(2): 35-36 (1974) |
| 1973 |
|---|
| 1 | | Tadao Takaoka,
Toshihide Ibaraki:
Fail-Safe Realization of Sequential Machines
Information and Control 22(1): 31-55 (1973) |
