Kevin Cattell

According to our database1, Kevin Cattell authored at least 13 papers between 1990 and 2001.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2001
Forbidden minors to graphs with small feedback sets.
Discret. Math., 2001

2000
On computing graph minor obstruction sets.
Theor. Comput. Sci., 2000

Fast Algorithms to Generate Necklaces, Unlabeled Necklaces, and Irreducible Polynomials over GF(2).
J. Algorithms, 2000

1999
2-by-n Hybrid Cellular Automata with Regular Configuration: Theory and Application.
IEEE Trans. Computers, 1999

1997
Partial Symmetry in Cellular Automata Rule Vectors.
J. Electron. Test., 1997

1996
Synthesis of one-dimensional linear hybrid cellular automata.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1996

Analysis of One-Dimensional Linear Hybrid Cellular Automata over GF(q).
IEEE Trans. Computers, 1996

A Simple Linear-Time Algorithm for Finding Path-Decompositions of Small Width.
Inf. Process. Lett., 1996

1995
Characteristic polynomials of one-dimensional linear hybrid cellular automata.
PhD thesis, 1995

Minimal cost one-dimensional linear hybrid cellular automata of degree through 500.
J. Electron. Test., 1995

Obstructions to Within a Few Vertices or Edges of Acyclic.
Proceedings of the Algorithms and Data Structures, 4th International Workshop, 1995

1994
A Characterization of Graphs with Vertex Cover up to Five.
Proceedings of the Orders, 1994

1990
The Analysis of One Dimensional Multiple-Valued Linear Cellular Automata.
Proceedings of the 20th International Symposium on Multiple-Valued Logic, 1990


  Loading...