Sorting within distance bound on a mesh-connected processor array

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

5 Scopus citations

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
Publication statusPublished - 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

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