Tadao Takaoka
Tadao Takaoka
Professor Emeritus of Computer Science, University of Canterbury
Η διεύθυνση ηλεκτρονικού ταχυδρομείου έχει επαληθευτεί στον τομέα cosc.canterbury.ac.nz - Αρχική σελίδα
Τίτλος
Παρατίθεται από
Παρατίθεται από
Έτος
A new upper bound on the complexity of the all pairs shortest path problem
T Takaoka
Information Processing Letters 43 (4), 195-199, 1992
1621992
Efficient algorithms for the maximum subarray problem by distance matrix multiplication
T Takaoka
Electronic Notes in Theoretical Computer Science 61, 191-200, 2002
982002
A technique for two-dimensional pattern matching
RF Zhu, T Takaoka
Communications of the ACM 32 (9), 1110-1120, 1989
801989
An All Pairs Shortest Path Algorithm with Expected Time O(n^2\logn)
A Moffat, T Takaoka
SIAM Journal on Computing 16 (6), 1023-1031, 1987
801987
On improving the average case of the Boyer-Moore string matching algorithm
ZR Feng, T Takaoka
Journal of Information Processing 10 (3), 173-177, 1987
751987
Subcubic cost algorithms for the all pairs shortest path problem
T Takaoka
Algorithmica 20 (3), 309-318, 1998
631998
Approximate pattern matching with samples
T Takaoka
International Symposium on Algorithms and Computation, 234-242, 1994
621994
Algorithms for the problem of k maximum sums and a VLSI algorithm for the k maximum subarrays problem
SE Bae, T Takaoka
7th International Symposium on Parallel Architectures, Algorithms and …, 2004
562004
A faster algorithm for the all-pairs shortest path problem and its application
T Takaoka
International Computing and Combinatorics Conference, 278-289, 2004
532004
An O(n 3 loglogn/log2 n) Time Algorithm for All Pairs Shortest Paths
Y Han, T Takaoka
Scandinavian Workshop on Algorithm Theory, 131-141, 2012
522012
An O(n 3 loglogn/log2 n) Time Algorithm for All Pairs Shortest Paths
Y Han, T Takaoka
Scandinavian Workshop on Algorithm Theory, 131-141, 2012
492012
An O (n3loglogn/logn) time algorithm for the all-pairs shortest path problem
T Takaoka
Information Processing Letters 96 (5), 155-161, 2005
412005
O (1) time algorithms for combinatorial generation by tree traversal
T Takaoka
The Computer Journal 42 (5), 400-408, 1999
361999
Improved Algorithms for the K-Maximum Subarray Problem: Reviewers who have agreed to review between 1 January 2005 and 31 December 2005 for The Computer Journal
SE Bae, T Takaoka
The Computer Journal 49 (3), 358-374, 2006
342006
An O(1) Time Algorithm for Generating Multiset Permutations
T Takaoka
International symposium on algorithms and computation, 237-246, 1999
341999
Shortest path algorithms for nearly acyclic directed graphs
T Takaoka
Theoretical Computer Science 203 (1), 143-150, 1998
301998
Scalable attack representation model using logic reduction techniques
JB Hong, DS Kim, T Takaoka
2013 12th IEEE International Conference on Trust, Security and Privacy in …, 2013
282013
Improved Algorithms for the K-Maximum Subarray Problem for Small K
SE Bae, T Takaoka
International Computing and Combinatorics Conference, 621-631, 2005
282005
Shortest path algorithms for nearly acyclic directed graphs
T Takaoka
Theoretical Computer Science 203 (1), 143-150, 1998
281998
Theory of 2–3 heaps
T Takaoka
Discrete Applied Mathematics 126 (1), 115-128, 2003
272003
Δεν είναι δυνατή η εκτέλεση της ενέργειας από το σύστημα αυτή τη στιγμή. Προσπαθήστε ξανά αργότερα.
Άρθρα 1–20