Real-Time Sorting of Binary Numbers on One-Dimensional CA
Cellular Automata and Lattice Gases
2010-12-06 v1 Data Structures and Algorithms
Abstract
A new fast (real time) sorter of binary numbers by one-dimensional cellular automata is proposed. It sorts a list of n numbers represented by k-bits each in exactly nk steps. This is only one step more than a lower bound.
Cite
@article{arxiv.1012.0674,
title = {Real-Time Sorting of Binary Numbers on One-Dimensional CA},
author = {Thomas Worsch and Hidenosuke Nishio},
journal= {arXiv preprint arXiv:1012.0674},
year = {2010}
}
Comments
Journ\'ees Automates Cellulaires 2010, Turku : Finland (2010)