Narao Nakatsu

According to our database1, Narao Nakatsu
  • authored at least 5 papers between 1979 and 1991.
  • has a "Dijkstra number"2 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

1991
Bounds on the redundancy of binary alphabetical codes.
IEEE Trans. Information Theory, 1991

1985
An Optimal TRIE Construction Algorithm for Partial-Match Queries.
FODO, 1985

1982
A Longest Common Subsequence Algorithm Suitable for Similar Text Strings.
Acta Inf., 1982

1981
Data compression procedures utilizing the similarity of data.
Proceedings of the American Federation of Information Processing Societies: 1981 National Computer Conference, 1981

1979
Hierarchical string pattern matching using dynamic pattern matching machines.
Proceedings of the IEEE Computer Society's Third International Computer Software and Applications Conference, 1979


  Loading...