Sorting with one-dimensional cellular automata using odd-even transposition

dc.contributor.authorde Carvalho C.E.
dc.contributor.authorde Oliveira P.P.
dc.date.accessioned2024-03-13T00:59:30Z
dc.date.available2024-03-13T00:59:30Z
dc.date.issued2015
dc.description.abstract© Springer International Publishing Switzerland 2015.Cellular automata are both discrete complex and fully distributed computational systems, with arbitrarily simple local processing. One of the computations that can be performed using cellular automata is the sorting of numerical sequences. Sorting is a relevant topic and occurs widely as a fundamental computing problem. This paper presents the development of improved sorting algorithms based upon one-dimensional cellular automata. Two new versions with radii of 1 and 3 are proposed, inspired by the characteristics of the existing methods. These algorithms are presented and their advantages and performance with respect to the existing approaches are discussed.
dc.description.firstpage523
dc.description.volume353
dc.identifier.doi10.1007/978-3-319-16486-1_51
dc.identifier.issn2194-5357
dc.identifier.urihttps://dspace.mackenzie.br/handle/10899/36328
dc.relation.ispartofAdvances in Intelligent Systems and Computing
dc.rightsAcesso Restrito
dc.subject.otherlanguage532
dc.subject.otherlanguageCellular automata
dc.subject.otherlanguageOdd-even transposition sort
dc.subject.otherlanguageOne-dimensional
dc.subject.otherlanguageSorting
dc.titleSorting with one-dimensional cellular automata using odd-even transposition
dc.typeArtigo de evento
local.scopus.citations0
local.scopus.eid2-s2.0-84926340376
local.scopus.subject532
local.scopus.subjectComputational system
local.scopus.subjectDiscrete complexes
local.scopus.subjectLocal processing
local.scopus.subjectNumerical sequence
local.scopus.subjectSorting algorithm
local.scopus.updated2024-05-01
local.scopus.urlhttps://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84926340376&origin=inward
Arquivos