default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSam M. Kim
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
1990 – 1999
- 1997
[j11]Sam M. Kim:
Computational Modeling for Genetic Splicing Systems. SIAM J. Comput. 26(5): 1284-1309 (1997)- [c7]Sam M. Kim:
An Algorithm for Identifying Spliced Languages. COCOON 1997: 403-411 - 1995
- [c6]Sam M. Kim, Robert McNaughton:
An Efficient Algorithm for Local Testability Problem of Finite State Automata. COCOON 1995: 597-606 - 1994
- [j10]Sam M. Kim, Robert McNaughton:
Computing the Order of a Locally Testable Automaton. SIAM J. Comput. 23(6): 1193-1215 (1994) - 1991
- [j9]Sam M. Kim, Robert McNaughton, Robert McCloskey:
A Polynomial Time Algorithm for the Local Testability Problem of Deterministic Finite Automata. IEEE Trans. Computers 40(10): 1087-1093 (1991) - [c5]Sam M. Kim, Robert McNaughton:
Computing the Order of a Locally Testable Automaton. FSTTCS 1991: 186-211
1980 – 1989
- 1989
- [c4]Sam M. Kim, Robert McNaughton, Robert McCloskey:
An Upper Bound on the Order of Locally Testable Deterministic Finite Automata. Optimal Algorithms 1989: 48-65 - [c3]Sam M. Kim, Robert McNaughton, Robert McCloskey:
A Polynomial Time Algorithm for the Local Testability Problem of Deterministic Finite Automata. WADS 1989: 420-436 - 1986
- [j8]Oscar H. Ibarra, Sam M. Kim, Michael A. Palis:
Designing Systolic Algorithms Using Sequential Machines. IEEE Trans. Computers 35(6): 531-542 (1986) - 1985
- [j7]Oscar H. Ibarra, Sam M. Kim, Louis E. Rosier:
Some Characterizations of Multihead Finite Automata. Inf. Control. 67(1-3): 114-125 (1985) - [j6]Oscar H. Ibarra, Sam M. Kim, Louis E. Rosier:
On Space and Time Efficient TM Simulations of Some Restricted Classes of PDA's. Inf. Control. 67(1-3): 126-143 (1985) - [j5]Oscar H. Ibarra, Michael A. Palis, Sam M. Kim:
Some results concerning linear iterative (systolic) arrays. J. Parallel Distributed Comput. 2(2): 182-218 (1985) - [j4]Oscar H. Ibarra, Sam M. Kim, Shlomo Moran:
Sequential Machine Characterizations of Trellis and Cellular Automata and Applications. SIAM J. Comput. 14(2): 426-447 (1985) - [j3]Oscar H. Ibarra, Michael A. Palis, Sam M. Kim:
Fast Parallel Language Recognition by Cellular Automata. Theor. Comput. Sci. 41: 231-246 (1985) - 1984
- [j2]Oscar H. Ibarra, Sam M. Kim:
A Characterization of Systolic Binary Tree Automata and Applications. Acta Informatica 21: 193-207 (1984) - [j1]Oscar H. Ibarra, Sam M. Kim:
Characterizations and Computational Complexity of Systolic Trellis Automata. Theor. Comput. Sci. 29: 123-153 (1984) - [c2]Oscar H. Ibarra, Michael A. Palis, Sam M. Kim:
Designing Systolic Algorithms Using Sequential Machines. FOCS 1984: 46-55 - [c1]Oscar H. Ibarra, Sam M. Kim, Louis E. Rosier:
Space and Time Efficient Simulations and Characterizations of Some Restricted Classes of PDAs. ICALP 1984: 247-259
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:13 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
