Sorting within distance bound on a mesh-connected processor array

Bogdan S. Chlebus

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

An algorithm is developed which sorts random sequences of keys on the n × n square mesh in the expected time 2n. The algorithm is shown to be optimal, that is, the matching Ω(2n) lower bound on the expected-time of algorithms sorting randomly ordered inputs is proved.

Original languageEnglish (US)
Title of host publicationOptimal Algorithms - International Symposium, Proceedings
EditorsHristo Djidjev
PublisherSpringer Verlag
Pages232-238
Number of pages7
ISBN (Print)9783540518594
DOIs
StatePublished - Jan 1 1989
Externally publishedYes
Event2nd International Symposium on Optimal Algorithms, 1989 - Varna, Bulgaria
Duration: May 29 1989Jun 2 1989

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume401 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference2nd International Symposium on Optimal Algorithms, 1989
CountryBulgaria
CityVarna
Period5/29/896/2/89

Fingerprint

Parallel processing systems
Sorting
Mesh
Sorting algorithm
Random Sequence
Sort
Lower bound

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Chlebus, B. S. (1989). Sorting within distance bound on a mesh-connected processor array. In H. Djidjev (Ed.), Optimal Algorithms - International Symposium, Proceedings (pp. 232-238). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 401 LNCS). Springer Verlag. https://doi.org/10.1007/3-540-51859-2_18

Sorting within distance bound on a mesh-connected processor array. / Chlebus, Bogdan S.

Optimal Algorithms - International Symposium, Proceedings. ed. / Hristo Djidjev. Springer Verlag, 1989. p. 232-238 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 401 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Chlebus, BS 1989, Sorting within distance bound on a mesh-connected processor array. in H Djidjev (ed.), Optimal Algorithms - International Symposium, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 401 LNCS, Springer Verlag, pp. 232-238, 2nd International Symposium on Optimal Algorithms, 1989, Varna, Bulgaria, 5/29/89. https://doi.org/10.1007/3-540-51859-2_18
Chlebus BS. Sorting within distance bound on a mesh-connected processor array. In Djidjev H, editor, Optimal Algorithms - International Symposium, Proceedings. Springer Verlag. 1989. p. 232-238. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/3-540-51859-2_18
Chlebus, Bogdan S. / Sorting within distance bound on a mesh-connected processor array. Optimal Algorithms - International Symposium, Proceedings. editor / Hristo Djidjev. Springer Verlag, 1989. pp. 232-238 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{6402f99de1fd4c359d29b3266978c4d9,
title = "Sorting within distance bound on a mesh-connected processor array",
abstract = "An algorithm is developed which sorts random sequences of keys on the n × n square mesh in the expected time 2n. The algorithm is shown to be optimal, that is, the matching Ω(2n) lower bound on the expected-time of algorithms sorting randomly ordered inputs is proved.",
author = "Chlebus, {Bogdan S.}",
year = "1989",
month = "1",
day = "1",
doi = "10.1007/3-540-51859-2_18",
language = "English (US)",
isbn = "9783540518594",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "232--238",
editor = "Hristo Djidjev",
booktitle = "Optimal Algorithms - International Symposium, Proceedings",

}

TY - GEN

T1 - Sorting within distance bound on a mesh-connected processor array

AU - Chlebus, Bogdan S.

PY - 1989/1/1

Y1 - 1989/1/1

N2 - An algorithm is developed which sorts random sequences of keys on the n × n square mesh in the expected time 2n. The algorithm is shown to be optimal, that is, the matching Ω(2n) lower bound on the expected-time of algorithms sorting randomly ordered inputs is proved.

AB - An algorithm is developed which sorts random sequences of keys on the n × n square mesh in the expected time 2n. The algorithm is shown to be optimal, that is, the matching Ω(2n) lower bound on the expected-time of algorithms sorting randomly ordered inputs is proved.

UR - http://www.scopus.com/inward/record.url?scp=84941529229&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84941529229&partnerID=8YFLogxK

U2 - 10.1007/3-540-51859-2_18

DO - 10.1007/3-540-51859-2_18

M3 - Conference contribution

AN - SCOPUS:84941529229

SN - 9783540518594

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 232

EP - 238

BT - Optimal Algorithms - International Symposium, Proceedings

A2 - Djidjev, Hristo

PB - Springer Verlag

ER -