default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKevin Cattell
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2001
[j9]Michael J. Dinneen, Kevin Cattell, Michael R. Fellows
:
Forbidden minors to graphs with small feedback sets. Discret. Math. 230(1-3): 215-252 (2001)- 2000
- [j8]Kevin Cattell, Frank Ruskey, Joe Sawada, Micaela Serra, C. Robert Miers:
Fast Algorithms to Generate Necklaces, Unlabeled Necklaces, and Irreducible Polynomials over GF(2). J. Algorithms 37(2): 267-282 (2000) - [j7]Kevin Cattell, Michael J. Dinneen, Rodney G. Downey, Michael R. Fellows, Michael A. Langston:
On computing graph minor obstruction sets. Theor. Comput. Sci. 233(1-2): 107-127 (2000)
1990 – 1999
- 1999
- [j6]Kevin Cattell, Shujian Zhang, Micaela Serra, Jon C. Muzio:
2-by-n Hybrid Cellular Automata with Regular Configuration: Theory and Application. IEEE Trans. Computers 48(3): 285-295 (1999) - 1997
- [j5]Kevin Cattell, Jon C. Muzio:
Partial Symmetry in Cellular Automata Rule Vectors. J. Electron. Test. 11(2): 187-190 (1997) - 1996
- [j4]Kevin Cattell, Michael J. Dinneen, Michael R. Fellows:
A Simple Linear-Time Algorithm for Finding Path-Decompositions of Small Width. Inf. Process. Lett. 57(4): 197-203 (1996) - [j3]Kevin Cattell, Jon C. Muzio:
Analysis of One-Dimensional Linear Hybrid Cellular Automata over GF(q). IEEE Trans. Computers 45(7): 782-792 (1996) - [j2]Kevin Cattell, Jon C. Muzio:
Synthesis of one-dimensional linear hybrid cellular automata. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 15(3): 325-335 (1996) - 1995
- [b1]Kevin Cattell:
Characteristic polynomials of one-dimensional linear hybrid cellular automata. University of Victoria, Canada, 1995 - [j1]Kevin Cattell, Shujian Zhang:
Minimal cost one-dimensional linear hybrid cellular automata of degree through 500. J. Electron. Test. 6(2): 255-258 (1995) - [c3]Kevin Cattell, Michael J. Dinneen, Michael R. Fellows:
Obstructions to Within a Few Vertices or Edges of Acyclic. WADS 1995: 415-427 - 1994
- [c2]Kevin Cattell, Michael J. Dinneen:
A Characterization of Graphs with Vertex Cover up to Five. ORDAL 1994: 86-99 - 1990
- [c1]Kevin Cattell, Micaela Serra:
The Analysis of One Dimensional Multiple-Valued Linear Cellular Automata. ISMVL 1990: 402-409
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:17 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:
