Showing papers by "Rezaul Chowdhury published in 2002"
TL;DR: A new data structure for Huffman coding is presented in which in addition to sending symbols in order of their appearance in the Huffman tree one needs to send codes of all circular leaf nodes (nodes with two adjacent external nodes), the number of which is always bounded above by half theNumber of symbols.
20 citations
21 Nov 2002
TL;DR: This work considers the problem of preprocessing an edge-weighted directed graph to answer queries that ask for the shortest path from any given vertex to another avoiding a failed link and presents two algorithms that improve on earlier results.
Abstract: We consider the problem of preprocessing an edge-weighted directed graph to answer queries that ask for the shortest path from any given vertex to another avoiding a failed link. We present two algorithms that improve on earlier results for this problem. Our first algorithm, which is a modification of an earlier method, improves the query time to a constant while maintaining the earlier bounds for preprocessing time andspace. Our second result is a new algorithm whose preprocessing time is considerably faster than earlier results and whose query time and space are worse by no more than a logarithmic factor.
6 citations
TL;DR: It has been shown that the construction of a min-max pair heap with n elements requires at least 2.07 n element comparisons, and a new algorithm has been devised that lowers the upper bound to 2.43 n.
Abstract: In this paper, lower and upper bounds for min-max pair heap construction has been presented. It has been shown that the construction of a min-max pair heap with n elements requires at least 2.07 n element comparisons. A new algorithm for creating min-max pair heap has been devised that lowers the upper bound to 2.43 n .
2 citations