A function for evaluating the computing time of a bubbling system

DOI10.1016/0304-3975(87)90136-8zbMath0641.68090OpenAlexW2003642622MaRDI QIDQ1100909

Yoshihide Igarashi, Kazuhiro Sado

Publication date: 1987

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(87)90136-8

zbMATH Keywords

dynamical systemcellular automatonbubbling systemparallel bubble sort

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Cellular automata (computational aspects) (68Q80)

Related Items (1)

The complexity of finding tangles

Cites Work

• Unnamed Item
• Computation theory of cellular automata
• Completeness problem of one-dimensional binary scope-3 tessellation automata
• A completeness property of one-dimensional tessellation automata
• Systolic Sorting on a Mesh-Connected Network

This page was built for publication: A function for evaluating the computing time of a bubbling system