An AT2 Optimal Reconfigurable Mesh Algorithm for The Constrained Off-line Competitive Deletion Problem


The KIPS Transactions:PartA, Vol. 9, No. 2, pp. 225-230, Jun. 2002
10.3745/KIPSTA.2002.9.2.225,   PDF Download:

Abstract

The constrained off-line competitive deletion problem is a simple form of the set manipulation operations problem. It excludes the insertion operation from the off-line competitive deletion problem. An optimal sequential algorithm and a CREW PRAM algorithm which runs O(log 2 nloglogn) time using O(n/loglogn) processors were already presented in the literature. In this paper, we present a reconfigurable mesh algorithm for the constrained off-line competitive deletion problem. The proposed algorithm is executed in a constant time on an n×n reconfigurable mesh, and the result is AT 2 optimal.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
K. E. Lee, "An AT2 Optimal Reconfigurable Mesh Algorithm for The Constrained Off-line Competitive Deletion Problem," The KIPS Transactions:PartA, vol. 9, no. 2, pp. 225-230, 2002. DOI: 10.3745/KIPSTA.2002.9.2.225.

[ACM Style]
Kwang Eui Lee. 2002. An AT2 Optimal Reconfigurable Mesh Algorithm for The Constrained Off-line Competitive Deletion Problem. The KIPS Transactions:PartA, 9, 2, (2002), 225-230. DOI: 10.3745/KIPSTA.2002.9.2.225.