On totalistic systolic networks

DOI10.1016/0020-0190(88)90145-7zbMath0654.68058OpenAlexW1983501217MaRDI QIDQ1108796

Juhani Karhumäki, Karel II Culik

Publication date: 1988

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(88)90145-7

zbMATH Keywords

graph coloringcellular automatonsystolic networktotalistic network

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Cellular automata (computational aspects) (68Q80) Coloring of graphs and hypergraphs (05C15) Applications of graph theory to circuits and networks (94C15)

Related Items

Complexity of reachability problems for finite discrete dynamical systems ⋮ Synthesis, structure and power of systolic computations ⋮ Predecessor existence problems for finite discrete dynamical systems ⋮ Computation theoretic aspects of cellular automata

Cites Work

• Topological transformations as a tool in the design of systolic networks
• Computation theory of cellular automata
• On the computational power of totalistic cellular automata
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item