Site hosted by Angelfire.com: Build your free website today!

Dr. M. Kaykobad

 

 

 

International Conference Papers

  1. M. Sohel Rahman, M. Kaykobad, Md. Tanvir Kaykobad, Bipartite Graphs, Hamiltonicity and Z graphs, pp. 307-312, Electronic Notes in Discrete Mathematics, vol. 44 (Nov 5, 2013).

  2. N.M. Mosharaf Kabir Chowdhury, Md Mostofa Akbar and M. Kaykobad, DiskTrie: An Efficient Data Structure Using Flash Memory for Mobile Devices, pp. 76-87, Workshop on Algorithms and Computation (WALCOM 2007), 12 February, 2007, Dhaka.

  3. Md Shahjalal and M Kaykobad, A New Data Structure for Heapsort with Improved Number of Comparisons,pp. 88-96, Workshop on Algorithms and Computation (WALCOM 2007), 12 February, 2007, Dhaka.

  4. M. Sohel Rahman, M Kaykobad and Mohammad Saifur Rahman, A New Sufficient Condition for the Existence of Hamiltonian Paths, pp. 56-59, Gongzhu Hu (Ed.): 20th International Conference on Computers and Their Applications, CATA 2005, March 16-18, 2005, Holiday Inn Downtown-Superdome Hotel, New Orleans, Louisiana, USA, Proceedings. ISCA 2005 ISBN 1-880843-54-4.

  5. Mohammad Sohel Rahman and M Kaykobad, Set Version: A New Notion and Results, Accepted for Publication and Presentation in the Information Society, 2004, 7th Multi-Conference, Sub-conference: Theoretical Computer Science, Slovenija.

  6. T. Imam and M Kaykobad, New Symbolic Substitution Tables and Algorithms for the design of a fast addition unit, Proceedings of 6th International Conference on Computer and Information Technology (ICCIT), 2003, pp. 98-103.

  7. T. Imam and M Kaykobad, A New Symbolic Substitution Based Approach for the conversion of binary numbers to CMSD numbers, Proceedings of 6th International Conference on Computer and Information Technology (ICCIT), 2003, pp. 170-173.

  8. Mohammad Sohel Rahman, M Kaykobad and M M Akbar, Independence Number and Hamiltonicity of Graphs, Proceedings of 6th International Conference on Computer and Information Technology (ICCIT), 2003, pp. 150-152.

  9. SM Niaz Arifin, Lenin Mehedy and M Kaykobad , Segmented Display for Bangla Numerals: Simplicity vs. Accuracy, , Proceedings of 6th International Conference on Computer and Information Technology (ICCIT), 2003,

  10. Mohammad Sohel Rahman and M Kaykobad, On Hamiltonian Cycles and Hamiltonian Paths, Proceedings of 6th International Conference on Computer and Information Technology (ICCIT), 2003, pp. 185-187.

  11. Graceful Labelling of Complete Binary Trees, pp. 32-35, International Conference on Computer and Information Technology, December 27-28, 2002(With Md Mahbubul Amin Majumder, ASM Obaidul Haque)

  12. Use of Phonetic Similarity Property for Bangla Spell Checker, pp. 182-185, International Conference on Computer and Information Technology, December 27-28, 2002(With Md Tamjidul Hoque)

  13. Coding System for Bangla Spell Checker, pp. 186-190, International Conference on Computer and Information Technology, December 27-28, 2002(With Md Tamjidul Hoque)

  14. On Calculation of Optimal Paths in Locally Restorable Bandwidth Constrained Routing in MPLS Networks, pp. 327-331, ,International Conference on Computer and Information Technology, December 27-28, 2002(With Ragib Hasan)

  15. On Average Length of Cycle in a Complete Graph, pp. 47-49, International Conference on Computer and Information Technology, December 27-28, 2002(With Asif-ul Haque, Mohammad Saifur Rahman, Mohammad Sohel Rahman)

  16. On Spanning Trees with restricted Number of Leaves, pp. 53-54, International Conference on Computer and Information Technology, December 27-28, 2002(With Mohammad Sohel Rahman)

  17. An Improvement to MST Algorithm for Round-Robin Tournament Ranking, pp.281-283, International Conference on Electrical and Computer Engineering, December 26-28, 2002(With P Prometheus Mitra and I. King)

  18. On the expected number of probes in AVL trees, pp.281-283, International Conference on Electrical and Computer Engineering, January 5-6, 2001(With RA Chowdhury, MZ Rahman, N Mahmood)

  19. Isomorphism of regular graphs, pp. 290-296 International Conference on Electrical and Computer Engineering, January 5-6, 2001(With R Ahmed, MA Hossain)

  20. On partitioning of consecutive integers, pp297-299, International Conference on Electrical and Computer Engineering, January 5-6, 2001 (With M Ahmed, RA Chowdhury)

  21. An efficient decoding technique for Huffman codes, pp. 300-301, International Conference on Electrical and Computer Engineering, January 5-6, 2001 (With RA Chowdhury, I. King)

  22. The minimum connection time problem, pp. 302-306, International Conference on Electrical and Computer Engineering, January 5-6, 2001 (With SK Nath, FJM Salzborn)

  23. Stirling Numbers and Two Inversion Formulas Adib Hassan Manob and M. Kaykobad, ICCIT2001, pp 6-8, 2001.

  24. On Linear Time Algorithm for SSP Problem Pradipta Prometheus Mitra, Ragib Hasan and M. Kaykobad, ICCIT2001, pp 9-12, 2001.

  25. Searching Objects on Lines and Rays, Mushfiqur Rouf and M. Kaykobad, ICCIT2001, pp. 13-15, 2001.

  26. A Storage Efficient Header for Huffman Coding Mohammad Abdul Mannan, Rezaul Alam Chowdhury and M. Kaykobad, ICCIT2001, pp 57-59, 2001.

  27. On Optimal Huffman Compression M. Abdul Mannan and M. Kaykobad, ICCIT2001, pp. 60-61, 2001.

  28. Query Optimization by Decomposition of BCNF/3NF Relations Abul Kashem Md. Shirin and M. Kaykobad, ICCIT2001, pp. 179-184, 2001.

  29. Compression using Huffman Coding Techniques, Sawsan Eskander, Mustaq Ahmed and M Kaykobad, ICCIT2001, pp. 278-282, 2001.

  30. On optimal keyboard layout, pp. 21-25, Proceedings of the International Conference on Computer and Information Technology, 2000 held during 25-26 January, 2001(With Shahriar Manzoor, Munirul Abedin).

  31. Fault tolerance of distributed multimedia system using quality adaptation, pp. 55-59, Proceedings of International Conference on Computer and Information Technology, 2000 held during 25-26 January, 2001(With MM Akbar, S. Hadian)

  32. Block Huffman coding, pp. 60-64, Proceedings of International Conference on Computer and Information Technology, 2000 held during 25-26 January, 2001(With MA Mannan)

  33. A linear time algorithm for single source shortest path problem, pp. 41-43, Proceedings of International Conference on Computer and Information Technology, 2000 held during 25-26 January, 2001(With PP Mitra, R. Hasan)

  34. A simple linear time algorithm for triangulation of a simple polygon, pp. 17-20, Proceedings of International Conference on Computer and Information Technology, 2000 held during 25-26 January, 2001(With SK Nath)

  35. Sorting using heap structure, pp. 26-30, Proceedings of International Conference on Computer and Information Technology, 2000 held during 25-26 January, 2001(With RA Chowdhury)

  36. Quicksort Using Higher Degree Comparators, IASTED Conference on Simulation and Modeling, 1999, Philadelphia, May 5-8, 1999.(with Md. Mostofa Akbar and M. Mamunul Islam)

  37. A linguistically Sortable Coding System and Its Applications in Spell Checking: A Case Study of Multilingual Applications, Proceedings of the 24th AMSE Annual Conference, Oct. 30, 1999, Best Western Hotel, Leesburg, Virginia, USA(With M.M. Murshed, Syed M. Rahman and S.M. Rahman)

  38. Improvements in double ended priority queues, pp. 1-5, Proceedings of International Conference on Computer and Information Technology, 1999 (With M. Ziaur Rahman, Rezaul Alam Chowdhury)

  39. Min-Max Fine Heaps, pp. 6-10, Proceedings of International Conference on Computer and Information Technology, 1999 (With Suman Kumar Nath, Rezaul Alam Chowdhury)

  40. On some issues related To LP Problem, pp. 15-18, Proceedings of International Conference on Computer and Information Technology, 1999 (With Rezaul Alam Chowdhury, Sumon Kumar Nath)

  41. On Optimal d-Huffman Tree, pp. 23-27, Proceedings of International Conference on Computer and Information Technology, 1999 (With Tarique Mesbaul Islam, Rezaul Alam Chowdhury)

  42. Quick sort using comparators with higher degree, pp. 28-32, Proceedings of International Conference on Computer and Information Technology, 1999 (With Md. Mostafa Akbar, M. Mamunul Islam)

  43. Algorithms for solving systems of linear equations, pp. 33-36, Proceedings of International Conference on Computer and Information Technology, 1999 (With Suman Kumar Nath, Rezaul Alam Chowdhury, Mustaq Ahmed)

  44. On parameters of search trees, pp. 50-53, Proceedings of International Conference on Computer and Information Technology, 1999 (With Rezaul Alam Chowdhury, Tarique Mesbaul Islam, Suman Kumar Nath)

  45. A new exact string matching algorithm, pp. 187-192, Proceedings of International Conference on Computer and Information Technology, 1999 (With Rezaul Alam Chowdhury, Mustaq Ahmed)

  46. A new map method for minimizing Boolean Expression, pp. 193-196, Proceedings of International Conference on Computer and Information Technology, 1999 (With A.K.M. Ashikur Rahman)

  47. A novel hybrid approach to handwritten Bangla character recognition, Proc. International Conference on Computational Linguistics, speech and Document Processing, pp. A5-A10. Calcutta, India, Feb. 18-20, 1998(With A.F.R. Rahman and M.A. Sattar)

  48. An Efficient Line Algorithm, pp. 1280-1282, 39th Midwest Symposium on Circuits and Systems, August 18-21, 1996, Iowa State University, Arnes, Iowa, USA(With ATM Shafiqul Khalid)

  49. Complexity of Max-Cut on Special Graphs, pp. 28-32, An International Conference on Computer and Information Technology, December 18-20, 1998 (With Mostafa Akbar, A.K.M. Azad and F.J.M. Salzborn)

  50. Majority Spanning Trees and Their Applications, pp. 33-36, An International Conference on Computer and Information Technology, December 18-20, 1998 (With Suman Kumar Nath, M. Mamunul Islam, F.J.M. Salzborn and M.M. Murshed)

  51. On Some Classes of Spanning Trees, pp. 42-44, An International Conference on Computer and Information Technology, December 18-20, 1998,(With Suman Kumar Nath and Rezaul Alam Chowdhury)

  52. On Average Edge Length of Minimum Spanning Trees, PP. 52-53, An International Conference on Computer and Information Technology, December 18-20, 1998 (With Suman Kumar Nath and Rezaul Alam Chowdhury)

  53. Minimizing Area Cost of On-Chip Cache Memories, pp. 63-68, An International Conference on Computer and Information Technology, December 18-20, 1998 (With A.K.M. Ashiqur Rahman)

  54. Worst-Case Analysis of Generalized Heapsort Algorithm Revisited, pp. 224-228, An International Conference on Computer and Information Technology, December 18-20, 1998 (With Tarique Mesbaul Islam)

  55. Differential Sort(D-Sort):A Subtraction-Based Sorting Algorithm, pp. 234-238, An International Conference on Computer and Information Technology, December 18-20, 1998 (With A.K.M. Azad)

  56. Geometry in Solving Systems of Linear Equations, presented in the first International Congress on Muslim Youths and Scholars Innovations and Creative Works, held on March 7-9, 1995 at Tehran, Iran.

  57. On discrete optimization, invited lecture, Application of Mathematics, the Proceedings of the First UNESCO Regional Workshop, held at Bahawalpur, Pakistan, (1989) pp. 102-11.

  58. Application of Graph Theory in the Study of Physical Sciences, Book of Abstracts, International Bose Symposium, 1988.(With M.N. Hossain)