Skip to main content
Conference ProceedingsOPEN ACCESS

Periodic correction networks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2000) 1900 471-478
DOI: 10.1007/3-540-44520-x_62
5Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We present a comparator network that sorts sequences obtained by changing a limited number of keys in a sorted sequence. The network that we present is periodic and has a depth 8. The time required by this algorithm is O(log n+k) with a small constant hidden by “Oh” notation (n is the total number of keys, k is the number of changed keys).

Cite

CITATION STYLE

APA

Kik, M. (2000). Periodic correction networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1900, pp. 471–478). Springer Verlag. https://doi.org/10.1007/3-540-44520-x_62

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free