Showing papers by "Rezaul Chowdhury published in 2003"
TL;DR: A new exact string-matching algorithm with sub-linear average case complexity has been presented that never performs more than n text character comparisons while working on a text of length n.
Abstract: In this paper a new exact string-matching algorithm with sub-linear average case complexity has been presented. Unlike other sub-linear string-matching algorithms it never performs more than n text character comparisons while working on a text of length n. It requires only O(mþs) extra pre-processing time and space, where m is the length of the pattern and s is the size of the alphabet.
10 citations
TL;DR: Experimental results show that, in the average case, with the exception of creation phase data movement, the algorithm outperforms min-max heap of Strothotte in all other aspects.
Abstract: In this paper, we present improved algorithms for min–max pair heaps introduced by S. Olariu et al. (A Mergeable Double-ended Priority Queue – The Comp. J. 34, 423–427, 1991). We also show that in the worst case, this structure, though slightly costlier to create, is better than min–max heaps of Strothotte (Min–max Heaps and Generalized Priority Queues – CACM, 29(10), 996–1000, Oct, 1986) in respect of deletion, and is equally good for insertion when an improved technique using binary search is applied. Experimental results show that, in the average case, with the exception of creation phase data movement, our algorithm outperforms min–max heap of Strothotte in all other aspects.
3 citations