Search the dblp DataBase
M. Kaykobad: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- Suman Kumar Nath, Rezaul Alam Chowdhury, M. Kaykobad
Min-Max Fine Heaps [Citation Graph (0, 0)][DBLP]
CoRR, 2000, v:0, n:, pp:- [Journal] - Mustaq Ahmed, M. Kaykobad, Rezaul Alam Chowdhury
A New String Matching Algorithm. [Citation Graph (0, 0)][DBLP]
Int. J. Comput. Math., 2003, v:80, n:7, pp:825-834 [Journal] - M. Ziaur Rahman, Rezaul Alam Chowdhury, M. Kaykobad
Improvements in double ended priority queues. [Citation Graph (0, 0)][DBLP]
Int. J. Comput. Math., 2003, v:80, n:9, pp:1121-1129 [Journal] - Tarique Mesbaul Islam, M. Kaykobad
Worst-case analysis of generalized heapsort algorithm revisited. [Citation Graph (0, 0)][DBLP]
Int. J. Comput. Math., 2006, v:83, n:1, pp:59-67 [Journal] - Rezaul Alam Chowdhury, M. Kaykobad, Irwin King
An efficient decoding technique for Huffman codes. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 2002, v:81, n:6, pp:305-308 [Journal] - M. Manzur Murshed, M. Kaykobad
Seek Distances in Two-Headed Disk Systems. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 1996, v:57, n:4, pp:205-209 [Journal] - Suman Kumar Nath, Rezaul Alam Chowdhury, M. Kaykobad
On Average Edge Length of Minimum Spanning Trees. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 1999, v:70, n:5, pp:241-243 [Journal]
Search in 0.001secs, Finished in 0.002secs
| NOTICE1 |
|---|
| System may not be available sometimes or not working properly, since it is still in development with continuous upgrades |
| NOTICE2 |
|---|
| The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002