The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Tadao Takaoka: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Alistair Moffat, Tadao Takaoka
    An All Pairs Shortest Path Algorithm with Expected Running Time O(n^2 log n) [Citation Graph (1, 0)][DBLP]
    FOCS, 1985, pp:101-105 [Conf]
  2. Rui Feng Zhu, Tadao Takaoka
    A Technique for Two-Dimensional Pattern Matching. [Citation Graph (1, 0)][DBLP]
    Commun. ACM, 1989, v:32, n:9, pp:1110-1120 [Journal]
  3. Barrett R. Bryant, Balanjaninath Edupuganty, K. R. Sundararaghavan, Tadao Takaoka
    Two-level grammar: data flow English for functional and logic programming. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Computer Science, 1988, pp:469-474 [Conf]
  4. Shane Saunders, Tadao Takaoka
    Efficient Algorithms for Solving Shortest Paths on Nearly Acyclic Directed Graphs. [Citation Graph (0, 0)][DBLP]
    CATS, 2005, pp:127-131 [Conf]
  5. Sung Eun Bae, Tadao Takaoka
    Improved Algorithms for the K-Maximum Subarray Problem for Small K. [Citation Graph (0, 0)][DBLP]
    COCOON, 2005, pp:621-631 [Conf]
  6. Tadao Takaoka
    Theory of Trinomial Heaps. [Citation Graph (0, 0)][DBLP]
    COCOON, 2000, pp:362-372 [Conf]
  7. Tadao Takaoka
    A Faster Algorithm for the All-Pairs Shortest Path Problem and Its Application. [Citation Graph (0, 0)][DBLP]
    COCOON, 2004, pp:278-289 [Conf]
  8. Tadao Takaoka
    Theory of 2-3 Heaps. [Citation Graph (0, 0)][DBLP]
    COCOON, 1999, pp:41-50 [Conf]
  9. Sung Eun Bae, Tadao Takaoka
    Algorithm for K Disjoint Maximum Subarrays. [Citation Graph (0, 0)][DBLP]
    International Conference on Computational Science (1), 2006, pp:595-602 [Conf]
  10. Akito Kiriyama, Yuji Nakagawa, Tadao Takaoka, Zhiqi Tu
    A New Public-Key Cryptosystem and its Applications. [Citation Graph (0, 0)][DBLP]
    ICEIS (3), 2006, pp:524-529 [Conf]
  11. Tadao Takaoka
    Approximate Pattern Matching with Samples. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1994, pp:234-242 [Conf]
  12. Tadao Takaoka
    An O(1) Time Algorithm for Generating Multiset Permutations. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1999, pp:237-246 [Conf]
  13. Sung Eun Bae, Tadao Takaoka
    Algorithms for the Problem of K Maximum Sums and a VLSI Algorithm for the K Maximum Subarrays Problem. [Citation Graph (0, 0)][DBLP]
    ISPAN, 2004, pp:247-253 [Conf]
  14. Tadao Takaoka, Alistair Moffat
    An O(n² log log log n) Expected Time Algorithm for the all Shortest Distance Problem. [Citation Graph (0, 0)][DBLP]
    MFCS, 1980, pp:643-655 [Conf]
  15. Tadao Takaoka
    Parallel program verification with directed graphs. [Citation Graph (0, 0)][DBLP]
    SAC, 1994, pp:462-466 [Conf]
  16. Tadao Takaoka
    An Efficient Parallel Algorithm for the All Pairs Shortest Path Problem. [Citation Graph (0, 0)][DBLP]
    WG, 1988, pp:276-287 [Conf]
  17. Tadao Takaoka
    A New Upper Bound on the Complexity of the All Pairs Shortest Path Problem. [Citation Graph (0, 0)][DBLP]
    WG, 1991, pp:209-213 [Conf]
  18. Tadao Takaoka
    Sub-Cubic Cost Algorithms for the All Pairs Shortest Path Problem. [Citation Graph (0, 0)][DBLP]
    WG, 1995, pp:323-343 [Conf]
  19. Tadao Takaoka
    Shortest Path Algorithms for Nearly Acyclic Directed Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 1996, pp:367-374 [Conf]
  20. Tadao Takaoka
    Foreword. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2003, v:38, n:2, pp:269-270 [Journal]
  21. Tadao Takaoka
    Subcubic Cost Algorithms for the All Pairs Shortest Path Problem. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1998, v:20, n:3, pp:309-318 [Journal]
  22. Tadao Takaoka
    The Semantics of New While Loop. [Citation Graph (0, 0)][DBLP]
    Comput. J., 1986, v:29, n:1, pp:33-35 [Journal]
  23. Tadao Takaoka
    A Left-to-Right Preprocessing Computation for the Boyer-Moore String Matching Algorithm. [Citation Graph (0, 0)][DBLP]
    Comput. J., 1996, v:39, n:5, pp:413-416 [Journal]
  24. Tadao Takaoka
    O(1) Time Algorithms for Combinatorial Generation by Tree Traversal. [Citation Graph (0, 0)][DBLP]
    Comput. J., 1999, v:42, n:5, pp:400-408 [Journal]
  25. Sung Eun Bae, Tadao Takaoka
    Improved Algorithms for the K-Maximum Subarray Problem. [Citation Graph (0, 0)][DBLP]
    Comput. J., 2006, v:49, n:3, pp:358-374 [Journal]
  26. Tadao Takaoka
    Theory of 2-3 Heaps. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:126, n:1, pp:115-128 [Journal]
  27. Tadao Takaoka
    Efficient Algorithms for the Maximum Subarray Problem by Distance Matrix Multiplication. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2002, v:61, n:, pp:- [Journal]
  28. Tadao Takaoka
    The Reverse Problem of Range Query. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2003, v:78, n:, pp:- [Journal]
  29. Tadao Takaoka, Toshihide Ibaraki
    Fail-Safe Realization of Sequential Machines [Citation Graph (0, 0)][DBLP]
    Information and Control, 1973, v:22, n:1, pp:31-55 [Journal]
  30. Alan P. Sprague, Tadao Takaoka
    O(1) Query Time Algorithm for all Pairs Shortest Distances on Interval Graphs. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1999, v:10, n:4, pp:465-472 [Journal]
  31. Pradip Dey, Barrett R. Bryant, Tadao Takaoka
    Lexical Ambiguity in Tree Adjoining Grammars. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1990, v:34, n:2, pp:65-69 [Journal]
  32. Alistair Moffat, Tadao Takaoka
    A Priority Queue for the All Pairs Shortest Path Problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1984, v:18, n:4, pp:189-193 [Journal]
  33. Tadao Takaoka
    An O(n3loglogn/logn) time algorithm for the all-pairs shortest path problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2005, v:96, n:5, pp:155-161 [Journal]
  34. Tadao Takaoka
    A Note on the Ambiguity of Context-Free Grammars. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1974, v:3, n:2, pp:35-36 [Journal]
  35. Tadao Takaoka
    An On-Line Pattern Matching Algorithm. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1986, v:22, n:6, pp:329-330 [Journal]
  36. Tadao Takaoka
    A Decomposition Rule for the Hoare Logic. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1987, v:26, n:4, pp:205-208 [Journal]
  37. Tadao Takaoka
    A New Upper Bound on the Complexity of the All Pairs Shortest Path Problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:43, n:4, pp:195-199 [Journal]
  38. Tadao Takaoka
    A Definition of Measures over Language Space. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1978, v:17, n:3, pp:376-387 [Journal]
  39. Tadao Takaoka, Kiyomi Umehara
    An Efficient VLSI Algorithms for the All Pairs Shortest Path Problem. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1992, v:16, n:3, pp:265-270 [Journal]
  40. Qian-Ping Gu, Tadao Takaoka
    A sharper analysis of a parallel algorithm for the all pairs shortest path problem. [Citation Graph (0, 0)][DBLP]
    Parallel Computing, 1990, v:16, n:1, pp:61-67 [Journal]
  41. Alistair Moffat, Tadao Takaoka
    An All Pairs Shortest Path Algorithm with Expected Time O(n² log n). [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1987, v:16, n:6, pp:1023-1031 [Journal]
  42. Shane Saunders, Tadao Takaoka
    Improved Shortest Path Algorithms for Nearly Acyclic Graphs. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2001, v:42, n:, pp:- [Journal]
  43. Shane Saunders, Tadao Takaoka
    Improved shortest path algorithms for nearly acyclic graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:293, n:3, pp:535-556 [Journal]
  44. Tadao Takaoka
    Shortest Path Algorithms for Nearly Acyclic Directed Graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:203, n:1, pp:143-150 [Journal]
  45. Shane Saunders, Tadao Takaoka
    Solving shortest paths efficiently on nearly acyclic directed graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:370, n:1-3, pp:94-109 [Journal]

  46. Improved Shortest Path Algorithms For Nearly Acyclic Directed Graphs. [Citation Graph (, )][DBLP]


  47. Combinatorial Generation by Fusing Loopless Algorithms. [Citation Graph (, )][DBLP]


  48. A New Measure of Disorder in Sorting - Entropy. [Citation Graph (, )][DBLP]


  49. Efficient Algorithms for the 2-Center Problems. [Citation Graph (, )][DBLP]


  50. A Sub-cubic Time Algorithm for the k -Maximum Subarray Problem. [Citation Graph (, )][DBLP]


  51. Partial Solution and Entropy. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.005secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002