Sam M. Kim

According to our database1, Sam M. Kim
  • authored at least 18 papers between 1984 and 1997.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

1997
Computational Modeling for Genetic Splicing Systems.
SIAM J. Comput., 1997

An Algorithm for Identifying Spliced Languages.
Proceedings of the Computing and Combinatorics, Third Annual International Conference, 1997

1995
An Efficient Algorithm for Local Testability Problem of Finite State Automata.
Proceedings of the Computing and Combinatorics, First Annual International Conference, 1995

1994
Computing the Order of a Locally Testable Automaton.
SIAM J. Comput., 1994

1991
A Polynomial Time Algorithm for the Local Testability Problem of Deterministic Finite Automata.
IEEE Trans. Computers, 1991

Computing the Order of a Locally Testable Automaton.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1991

1989
A Polynomial Time Algorithm for the Local Testability Problem of Deterministic Finite Automata.
Proceedings of the Algorithms and Data Structures, 1989

An Upper Bound on the Order of Locally Testable Deterministic Finite Automata.
Proceedings of the Optimal Algorithms, International Symposium, Varna, Bulgaria, May 29, 1989

1986
Designing Systolic Algorithms Using Sequential Machines.
IEEE Trans. Computers, 1986

1985
Fast Parallel Language Recognition by Cellular Automata.
Theor. Comput. Sci., 1985

Sequential Machine Characterizations of Trellis and Cellular Automata and Applications.
SIAM J. Comput., 1985

Some results concerning linear iterative (systolic) arrays.
J. Parallel Distrib. Comput., 1985

On Space and Time Efficient TM Simulations of Some Restricted Classes of PDA's
Information and Control, 1985

Some Characterizations of Multihead Finite Automata
Information and Control, 1985

1984
Characterizations and Computational Complexity of Systolic Trellis Automata.
Theor. Comput. Sci., 1984

A Characterization of Systolic Binary Tree Automata and Applications.
Acta Inf., 1984

Space and Time Efficient Simulations and Characterizations of Some Restricted Classes of PDAs.
Proceedings of the Automata, 1984

Designing Systolic Algorithms Using Sequential Machines
Proceedings of the 25th Annual Symposium on Foundations of Computer Science, 1984


  Loading...