Tadao Takaoka

Comput. J., 2006

A New Public-Key Cryptosystem and its Applications.

[BibT_eX]

Proceedings of the ICEIS 2006, 2006

Algorithm for K Disjoint Maximum Subarrays.

[BibT_eX]

[DOI]

Proceedings of the Computational Science, 2006

Combinatorial Generation by Fusing Loopless Algorithms.

[BibT_eX]

[DOI]

Stephen Violich

Proceedings of the Theory of Computing 2006, 2006

2005

An O(n3loglogn/logn) time algorithm for the all-pairs shortest path problem.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2005

Improved Algorithms for the K-Maximum Subarray Problem for Small K.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

Efficient Algorithms for Solving Shortest Paths on Nearly Acyclic Directed Graphs.

[BibT_eX]

[DOI]

Shane Saunders

Proceedings of the Theory of Computing 2005, 2005

2004

Foreword.

[BibT_eX]

[DOI]

Algorithmica, 2004

Algorithms for the Problem of K Maximum Sums and a VLSI Algorithm for the K Maximum Subarrays Problem.

[BibT_eX]

[DOI]

Proceedings of the 7th International Symposium on Parallel Architectures, 2004

A Faster Algorithm for the All-Pairs Shortest Path Problem and Its Application.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 10th Annual International Conference, 2004

2003

The Reverse Problem of Range Query.

[BibT_eX]

[DOI]

Proceedings of the Computing: the Australasian Theory Symposiumm, 2003

Theory of 2-3 Heaps.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2003

2002

Efficient Algorithms for the Maximum Subarray Problem by Distance Matrix Multiplication.

[BibT_eX]

[DOI]

Proceedings of the Computing: the Australasian Theory Symposium, 2002

2001

Improved Shortest Path Algorithms for Nearly Acyclic Graphs.

[BibT_eX]

[DOI]

Shane Saunders

Proceedings of the Computing: The Australasian Theory Symposium, 2001

2000

Theory of Trinomial Heaps.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 6th Annual International Conference, 2000

1999

O(1) Query Time Algorithm for all Pairs Shortest Distances on Interval Graphs.

[BibT_eX]

[DOI]

Alan P. Sprague

Int. J. Found. Comput. Sci., 1999

O(1) Time Algorithms for Combinatorial Generation by Tree Traversal.

[BibT_eX]

[DOI]

Comput. J., 1999

An O(1) Time Algorithm for Generating Multiset Permutations.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 10th International Symposium, 1999

1998

Shortest Path Algorithms for Nearly Acyclic Directed Graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1998

Subcubic Cost Algorithms for the All Pairs Shortest Path Problem.

[BibT_eX]

[DOI]

Algorithmica, 1998

A New Measure of Disorder in Sorting - Entropy.

[BibT_eX]

Proceedings of Computing: The Fourth Australasian Theory Symposium (CATS'98), 1998

1996

A Left-to-Right Preprocessing Computation for the Boyer-Moore String Matching Algorithm.

[BibT_eX]

[DOI]

Comput. J., 1996

1995

Sub-Cubic Cost Algorithms for the All Pairs Shortest Path Problem.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1995

1994

Parallel program verification with directed graphs.

[BibT_eX]

[DOI]

Proceedings of the 1994 ACM Symposium on Applied Computing, 1994

Approximate Pattern Matching with Samples.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 5th International Symposium, 1994

1992

An Efficient VLSI Algorithms for the All Pairs Shortest Path Problem.

[BibT_eX]

[DOI]

Kiyomi Umehara

J. Parallel Distributed Comput., 1992

A New Upper Bound on the Complexity of the All Pairs Shortest Path Problem.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1992

1990

A sharper analysis of a parallel algorithm for the all pairs shortest path problem.

[BibT_eX]

[DOI]

Qian-Ping Gu

Parallel Comput., 1990

Lexical Ambiguity in Tree Adjoining Grammars.

[BibT_eX]

[DOI]

Pradip Dey

Barrett R. Bryant

Inf. Process. Lett., 1990

1989

A Technique for Two-Dimensional Pattern Matching.

[BibT_eX]

[DOI]

Rui Feng Zhu

Commun. ACM, 1989

1988

An Efficient Parallel Algorithm for the All Pairs Shortest Path Problem.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1988

Two-level grammar: data flow English for functional and logic programming.

[BibT_eX]

[DOI]

Barrett R. Bryant

Balanjaninath Edupuganty

K. R. Sundararaghavan

Proceedings of the Sixteenth ACM Annual Conference on Computer Science, 1988

1987

A prime factor FFT algorithm implementation using a program generation technique.

[BibT_eX]

[DOI]

F. Perez

IEEE Trans. Acoust. Speech Signal Process., 1987

An All Pairs Shortest Path Algorithm with Expected Time O(n² log n).

[BibT_eX]

[DOI]

SIAM J. Comput., 1987

A Decomposition Rule for the Hoare Logic.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1987

1986

An On-Line Pattern Matching Algorithm.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1986

The Semantics of New While Loop.

[BibT_eX]

[DOI]

Comput. J., 1986

1985

An All Pairs Shortest Path Algorithm with Expected Running Time O(n^2 log n)

[BibT_eX]

[DOI]

Proceedings of the 26th Annual Symposium on Foundations of Computer Science, 1985

1984

A Priority Queue for the All Pairs Shortest Path Problem.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1984

1980

Introduction of history to variables.

[BibT_eX]

[DOI]

ACM SIGPLAN Notices, 1980

An O(n² log log log n) Expected Time Algorithm for the all Shortest Distance Problem.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1980 (MFCS'80), 1980

1978

A Definition of Measures over Language Space.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1978

1974

A Note on the Ambiguity of Context-Free Grammars.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1974

1973

Fail-Safe Realization of Sequential Machines

[BibT_eX]

[DOI]

Toshihide Ibaraki

Inf. Control., February, 1973

1972

N-Fail-Safe Sequential Machines.

[BibT_eX]

[DOI]

Toshihide Ibaraki

IEEE Trans. Computers, 1972

1971

N-Fail-Safe Logical Systems.

[BibT_eX]

[DOI]