Tadao Takaoka - RankMe

92 papers A* 1B 12C 3Misc 11Journal 45Unranked 18

Year	Rank	Type	Title / Venue / Authors
2019	J	`jnl`	Algebraic theory on shortest paths for all flows. Theor. Comput. Sci. Tadao Takaoka
2017	J	`jnl`	Efficient Algorithms for the Maximum Sum Problems. Algorithms Sung Eun Bae, Tong-Wook Shinn, Tadao Takaoka
2016	—	`ch.`	All Pairs Shortest Paths via Matrix Multiplication. Encyclopedia of Algorithms Tadao Takaoka
2016	J	`jnl`	An O(n J. Discrete Algorithms Yijie Han, Tadao Takaoka
2016	—	`conf`	An efficient parallel algorithm for the maximum convex sum problem. ACSW Sung Eun Bae, Tong-Wook Shinn, Tadao Takaoka
2016	C	`conf`	Minimum Weight Polygon Triangulation Problem in Sub-Cubic Time Bound. COCOA Sung Eun Bae, Tong-Wook Shinn, Tadao Takaoka
2015	C	`conf`	Algebraic Theory on Shortest Paths for All Flows. COCOA Tadao Takaoka
2015	J	`jnl`	Multi-level Loop-less Algorithm for Multi-set Permutations. CoRR Tadao Takaoka
2015	J	`jnl`	O(1) Time Generation of Adjacent Multiset Combinations. CoRR Tadao Takaoka
2015	C	`conf`	Single Source Shortest Paths for All Flows with Integer Costs. ATMOS Tadao Takaoka
2015	J	`jnl`	Variations on the bottleneck paths problem. Theor. Comput. Sci. Tong-Wook Shinn, Tadao Takaoka
2014	Misc	`conf`	A Faster Parallel Algorithm for Matrix Multiplication on a Mesh Array. ICCS Sung Eun Bae, Tong-Wook Shinn, Tadao Takaoka
2014	B	`conf`	Combining All Pairs Shortest Paths and All Pairs Bottleneck Paths Problems. LATIN Tong-Wook Shinn, Tadao Takaoka
2014	—	`conf`	Combining the Shortest Paths and the Bottleneck Paths Problems. ACSC Tong-Wook Shinn, Tadao Takaoka
2014	J	`jnl`	Sharing information for the all pairs shortest path problem. Theor. Comput. Sci. Tadao Takaoka
2014	B	`conf`	Some Extensions of the Bottleneck Paths Problem. WALCOM Tong-Wook Shinn, Tadao Takaoka
2013	J	`jnl`	A simplified algorithm for the all pairs shortest path problem with O(n 2logn) expected time. J. Comb. Optim. Tadao Takaoka
2013	Misc	`conf`	Application of the Maximum Convex Sum Algorithm in Determining Environmental Variables That Affect Nigerian Highland Stream Benthic Communities. ICCS Mohammed Thaher, Danladi Umar, Tadao Takaoka, Jon Harding
2013	J	`jnl`	Combining All Pairs Shortest Paths and All Pairs Bottleneck Paths Problems. CoRR Tong-Wook Shinn, Tadao Takaoka
2013	J	`jnl`	Combining the Shortest Paths and the Bottleneck Paths Problems. CoRR Tong-Wook Shinn, Tadao Takaoka
2013	J	`jnl`	Efficient Graph Algorithms for Network Analysis. CoRR Tong-Wook Shinn, Tadao Takaoka
2013	J	`jnl`	Maximum subarray algorithms for use in astronomical imaging. J. Electronic Imaging Stephen John Weddell, Tristan Read, Mohammed Thaher, Tadao Takaoka
2013	—	`conf`	Scalable Attack Representation Model Using Logic Reduction Techniques. TrustCom/ISPA/IUCC Jin Bum Hong, Dong Seong Kim, Tadao Takaoka
2013	J	`jnl`	Some Extensions of the All Pairs Bottleneck Paths Problem. CoRR Tong-Wook Shinn, Tadao Takaoka
2012	—	`conf`	An O(n 3 loglogn/log2 n) Time Algorithm for All Pairs Shortest Paths. SWAT Yijie Han, Tadao Takaoka
2012	—	`conf`	Efficient Algorithms for the All Pairs Shortest Path Problem with Limited Edge Costs. CATS Tadao Takaoka
2012	Misc	`conf`	Improved algorithms for the K overlapping maximum convex sum problem. ICCS Mohammed Thaher, Tadao Takaoka
2011	Misc	`conf`	An efficient algorithm for computing the K-overlapping maximum convex sum problem. ICCS Mohammed Thaher, Tadao Takaoka
2011	—	`conf`	Sharing Information in All Pairs Shortest Path Algorithms. CATS Tadao Takaoka, Mashitoh Hashim
2010	—	`conf`	A Simpler Algorithm for the All Pairs Shortest Path Problem with COCOA (2) Tadao Takaoka, Mashitoh Hashim
2010	Misc	`conf`	An efficient algorithm for the k maximum convex sums. ICCS Mohammed Thaher, Tadao Takaoka
2010	—	`conf`	Efficient Algorithms for the 2-Center Problems. ICCSA (2) Tadao Takaoka
2010	J	`jnl`	Entropy as Computational Complexity. Inf. Media Technol. Tadao Takaoka, Yuji Nakagawa
2010	J	`jnl`	Entropy as Computational Complexity. J. Inf. Process. Tadao Takaoka, Yuji Nakagawa
2009	B	`conf`	Partial Solution and Entropy. MFCS Tadao Takaoka
2008	—	`ch.`	All Pairs Shortest Paths via Matrix Multiplication. Encyclopedia of Algorithms Tadao Takaoka
2007	B	`conf`	A Sub-cubic Time Algorithm for the ISAAC Sung Eun Bae, Tadao Takaoka
2007	J	`jnl`	Algorithms for k-Disjoint Maximum Subarrays. Int. J. Found. Comput. Sci. Sung Eun Bae, Tadao Takaoka
2007	J	`jnl`	Fusing Loopless Algorithms for Combinatorial Generation. Int. J. Found. Comput. Sci. Tadao Takaoka, Stephen Violich
2007	—	`conf`	Improved Shortest Path Algorithms For Nearly Acyclic Directed Graphs. ACSC Lin Tian, Tadao Takaoka
2007	J	`jnl`	Solving shortest paths efficiently on nearly acyclic directed graphs. Theor. Comput. Sci. Shane Saunders, Tadao Takaoka
2006	—	`conf`	A New Public-Key Cryptosystem and its Applications. ICEIS (3) Akito Kiriyama, Yuji Nakagawa, Tadao Takaoka, Zhiqi Tu
2006	Misc	`conf`	Algorithm for International Conference on Computational Science (1) Sung Eun Bae, Tadao Takaoka
2006	—	`conf`	Combinatorial Generation by Fusing Loopless Algorithms. CATS Tadao Takaoka, Stephen Violich
2006	J	`jnl`	Improved Algorithms for the Comput. J. Sung Eun Bae, Tadao Takaoka
2005	J	`jnl`	An O( Inf. Process. Lett. Tadao Takaoka
2005	—	`conf`	Efficient Algorithms for Solving Shortest Paths on Nearly Acyclic Directed Graphs. CATS Shane Saunders, Tadao Takaoka
2005	Misc	`conf`	Improved Algorithms for the COCOON Sung Eun Bae, Tadao Takaoka
2004	Misc	`conf`	A Faster Algorithm for the All-Pairs Shortest Path Problem and Its Application. COCOON Tadao Takaoka
2004	—	`conf`	Algorithms for the Problem of K Maximum Sums and a VLSI Algorithm for the K Maximum Subarrays Problem. ISPAN Sung Eun Bae, Tadao Takaoka
2004	J	`jnl`	Foreword. Algorithmica Tadao Takaoka
2003	J	`jnl`	Improved shortest path algorithms for nearly acyclic graphs. Theor. Comput. Sci. Shane Saunders, Tadao Takaoka
2003	—	`conf`	The Reverse Problem of Range Query. CATS Tadao Takaoka
2003	J	`jnl`	Theory of 2-3 Heaps. Discret. Appl. Math. Tadao Takaoka
2002	—	`conf`	Efficient Algorithms for the Maximum Subarray Problem by Distance Matrix Multiplication. CATS Tadao Takaoka
2001	B	`ed.`	Algorithms and Computation, 12th International Symposium, ISAAC 2001, Christchurch, New Zealand, December 19-21, 2001, Proceedings ISAAC Peter Eades, Tadao Takaoka
2001	—	`conf`	Improved Shortest Path Algorithms for Nearly Acyclic Graphs. CATS Shane Saunders, Tadao Takaoka
2000	Misc	`conf`	Theory of Trinomial Heaps. COCOON Tadao Takaoka
1999	B	`conf`	An O(1) Time Algorithm for Generating Multiset Permutations. ISAAC Tadao Takaoka
1999	J	`jnl`	O(1) Query Time Algorithm for all Pairs Shortest Distances on Interval Graphs. Int. J. Found. Comput. Sci. Alan P. Sprague, Tadao Takaoka
1999	J	`jnl`	O(1) Time Algorithms for Combinatorial Generation by Tree Traversal. Comput. J. Tadao Takaoka
1999	Misc	`conf`	Theory of 2-3 Heaps. COCOON Tadao Takaoka
1998	—	`conf`	A New Measure of Disorder in Sorting - Entropy. CATS Tadao Takaoka
1998	J	`jnl`	Shortest Path Algorithms for Nearly Acyclic Directed Graphs. Theor. Comput. Sci. Tadao Takaoka
1998	J	`jnl`	Subcubic Cost Algorithms for the All Pairs Shortest Path Problem. Algorithmica Tadao Takaoka
1996	J	`jnl`	A Left-to-Right Preprocessing Computation for the Boyer-Moore String Matching Algorithm. Comput. J. Tadao Takaoka
1996	B	`conf`	Shortest Path Algorithms for Nearly Acyclic Directed Graphs. WG Tadao Takaoka
1995	B	`conf`	Sub-Cubic Cost Algorithms for the All Pairs Shortest Path Problem. WG Tadao Takaoka
1994	B	`conf`	Approximate Pattern Matching with Samples. ISAAC Tadao Takaoka
1994	Misc	`conf`	Parallel program verification with directed graphs. SAC Tadao Takaoka
1992	J	`jnl`	A New Upper Bound on the Complexity of the All Pairs Shortest Path Problem. Inf. Process. Lett. Tadao Takaoka
1992	J	`jnl`	An Efficient VLSI Algorithms for the All Pairs Shortest Path Problem. J. Parallel Distributed Comput. Tadao Takaoka, Kiyomi Umehara
1991	B	`conf`	A New Upper Bound on the Complexity of the All Pairs Shortest Path Problem. WG Tadao Takaoka
1990	J	`jnl`	A sharper analysis of a parallel algorithm for the all pairs shortest path problem. Parallel Comput. Qian-Ping Gu, Tadao Takaoka
1990	J	`jnl`	Lexical Ambiguity in Tree Adjoining Grammars. Inf. Process. Lett. Pradip Dey, Barrett R. Bryant, Tadao Takaoka
1989	J	`jnl`	A Technique for Two-Dimensional Pattern Matching. Commun. ACM Rui Feng Zhu, Tadao Takaoka
1988	B	`conf`	An Efficient Parallel Algorithm for the All Pairs Shortest Path Problem. WG Tadao Takaoka
1988	—	`conf`	Two-level grammar: data flow English for functional and logic programming. ACM Conference on Computer Science Barrett R. Bryant, Balanjaninath Edupuganty, K. R. Sundararaghavan, Tadao Takaoka
1987	J	`jnl`	A Decomposition Rule for the Hoare Logic. Inf. Process. Lett. Tadao Takaoka
1987	J	`jnl`	A prime factor FFT algorithm implementation using a program generation technique. IEEE Trans. Acoust. Speech Signal Process. F. Perez, Tadao Takaoka
1987	J	`jnl`	An All Pairs Shortest Path Algorithm with Expected Time O(n² log n). SIAM J. Comput. Alistair Moffat, Tadao Takaoka
1986	J	`jnl`	An On-Line Pattern Matching Algorithm. Inf. Process. Lett. Tadao Takaoka
1986	J	`jnl`	The Semantics of New While Loop. Comput. J. Tadao Takaoka
1985	A*	`conf`	An All Pairs Shortest Path Algorithm with Expected Running Time O(n^2 log n) FOCS Alistair Moffat, Tadao Takaoka
1984	J	`jnl`	A Priority Queue for the All Pairs Shortest Path Problem. Inf. Process. Lett. Alistair Moffat, Tadao Takaoka
1980	B	`conf`	An O(n² log log log n) Expected Time Algorithm for the all Shortest Distance Problem. MFCS Tadao Takaoka, Alistair Moffat
1980	J	`jnl`	Introduction of history to variables. ACM SIGPLAN Notices Tadao Takaoka
1978	J	`jnl`	A Definition of Measures over Language Space. J. Comput. Syst. Sci. Tadao Takaoka
1974	J	`jnl`	A Note on the Ambiguity of Context-Free Grammars. Inf. Process. Lett. Tadao Takaoka
1973	J	`jnl`	Fail-Safe Realization of Sequential Machines Inf. Control. Tadao Takaoka, Toshihide Ibaraki
1972	J	`jnl`	N-Fail-Safe Sequential Machines. IEEE Trans. Computers Tadao Takaoka, Toshihide Ibaraki
1971	J	`jnl`	N-Fail-Safe Logical Systems. IEEE Trans. Computers Tadao Takaoka, Hisashi Mine