arXiv Open Access 2010

Real-Time Sorting of Binary Numbers on One-Dimensional CA

Thomas Worsch Hidenosuke Nishio

Lihat Sumber

Abstrak

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.

Topik & Kata Kunci

nlin.CG cs.DS

Penulis (2)

Thomas Worsch

Hidenosuke Nishio

Format Sitasi

APA MLA BibTeX

Worsch, T., Nishio, H. (2010). Real-Time Sorting of Binary Numbers on One-Dimensional CA. https://arxiv.org/abs/1012.0674

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2010
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓