The following pages link to Kevin Cattell (Q175526):
Displaying 10 items.
- A simple linear-time algorithm for finding path-decompositions of small width (Q672094) (← links)
- An explicit similarity transform between cellular automata and LFSR matrices (Q1273726) (← links)
- On computing graph minor obstruction sets (Q1575945) (← links)
- Analysis of one-dimensional linear hybrid cellular automata over GF(q) (Q4420876) (← links)
- (Q4457543) (← links)
- Fast Algorithms to Generate Necklaces, Unlabeled Necklaces, and Irreducible Polynomials over GF(2) (Q4521516) (← links)
- (Q4525262) (← links)
- 2-by-n hybrid cellular automata with regular configuration: theory and application (Q4571394) (← links)
- Obstructions to within a few vertices or edges of acyclic (Q5057453) (← links)
- Forbidden minors to graphs with small feedback sets (Q5931421) (← links)