On totalistic systolic networks

DOI10.1016/0020-0190(88)90145-7zbMATH Open0654.68058OpenAlexW1983501217MaRDI QIDQ1108796FDOQ1108796

Authors: Karel II Culik, Juhani Karhumäki 

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

Recommendations

• Topological transformations as a tool in the design of systolic networks
• Publication:4728253
• scientific article; zbMATH DE number 4060727
• Synthesis, structure and power of systolic computations
• scientific article; zbMATH DE number 3952010

zbMATH Keywords

graph coloringcellular automatonsystolic networktotalistic network

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Computation theory of cellular automata
• On the computational power of totalistic cellular automata
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Topological transformations as a tool in the design of systolic networks

Cited In (5)

• Synthesis, structure and power of systolic computations
• Predecessor existence problems for finite discrete dynamical systems
• Complexity of reachability problems for finite discrete dynamical systems
• Computation theoretic aspects of cellular automata
• Topological transformations as a tool in the design of systolic networks

This page was built for publication: On totalistic systolic networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1108796)