Mohammad Kaykobad

Affiliations:
  • Bangladesh University of Engineering and Technology, Dhaka, Bangladesch


According to our database1, Mohammad Kaykobad authored at least 41 papers between 1995 and 2021.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Multidimensional segment trees can do range updates in poly-logarithmic time.
Theor. Comput. Sci., 2021

Majority Spanning Trees, Cotrees and Their Applications.
Proceedings of the WALCOM: Algorithms and Computation, 2021

2019
Antigenic: An improved prediction model of protective antigens.
Artif. Intell. Medicine, 2019

HEliOS: huffman coding based lightweight encryption scheme for data transmission.
Proceedings of the MobiQuitous 2019, 2019

2018
Using Adaptive Heartbeat Rate on Long-Lived TCP Connections.
IEEE/ACM Trans. Netw., 2018

Preface.
Theor. Comput. Sci., 2018

Multidimensional segment trees can do range queries and updates in logarithmic time.
CoRR, 2018

isGPT: An optimized model to identify sub-Golgi protein types using SVM and Random Forest based feature selection.
Artif. Intell. Medicine, 2018

A New Approach for Selecting Aggregated Multicast Trees to Reduce Forwarding States.
Proceedings of the 5th International Conference on Networking, Systems and Security, 2018

2017
Guest Editors' Foreword.
J. Graph Algorithms Appl., 2017

2016
Using adaptive heartbeat rate on long-lived TCP connections.
Proceedings of the International Conference on Networking Systems and Security, 2016

2015
Solving the multi-objective Vehicle Routing Problem with Soft Time Windows with the help of bees.
Swarm Evol. Comput., 2015

2013
Bipartite Graphs, Hamiltonicity and Z graphs.
Electron. Notes Discret. Math., 2013

2011
Guest Editorial.
J. Softw., 2011

An in-place heapsort algorithm requiring <i>n</i>log<i>n</i>+<i>n</i>log*<i>n</i>-0.546871<i>n</i> comparisons.
Int. J. Comput. Math., 2011

2010
A comprehensive analysis of degree based condition for Hamiltonian cycles.
Theor. Comput. Sci., 2010

Some fascinating series and their sums
CoRR, 2010

2008
An improved MST algorithm for ranking players of a round-robin tournament.
Int. J. Comput. Math., 2008

2007
An improved degree based condition for Hamiltonian cycles.
Inf. Process. Lett., 2007

A New Data Structure for Heapsort with Improved Number of Comparisons.
Proceedings of the Workshop on Algorithms and Computation 2007, 2007

DiskTrie: An Efficient Data Structure using Flash Memory for Mobile Devices.
Proceedings of the Workshop on Algorithms and Computation 2007, 2007

2006
Worst-case analysis of generalized heapsort algorithm revisited.
Int. J. Comput. Math., 2006

Solving the Multidimensional Multiple-choice Knapsack Problem by constructing convex hulls.
Comput. Oper. Res., 2006

Drawing lines by uniform packing.
Comput. Graph., 2006

2005
Complexities of some interesting problems on spanning trees.
Inf. Process. Lett., 2005

On Hamiltonian cycles and Hamiltonian paths.
Inf. Process. Lett., 2005

A New Sufficient Condition for the Existence of Hamiltonian Paths.
Proceedings of the 20th International Conference on Computers and Their Applications, 2005

Optimal Server Selection for Content Routing.
Proceedings of the 20th International Conference on Computers and Their Applications, 2005

2003
Improvements in double ended priority queues.
Int. J. Comput. Math., 2003

A New String Matching Algorithm.
Int. J. Comput. Math., 2003

2002
An efficient decoding technique for Huffman codes.
Inf. Process. Lett., 2002

2001
Sorting using heap structure.
Int. J. Comput. Math., 2001

2000
A simplified complexity analysis of mcdiarmid and reed's variant of bottom-up-heapsort.
Int. J. Comput. Math., 2000

Calculating the square root with arbitrary order of convergence.
Int. J. Comput. Math., 2000

Min-Max Fine Heaps
CoRR, 2000

1999
On Average Edge Length of Minimum Spanning Trees.
Inf. Process. Lett., 1999

1998
Mode-finding algorithms revisited.
Int. J. Comput. Math., 1998

1997
An efficient preprocessor for solving systems of linear equations.
Int. J. Comput. Math., 1997

1996
Seek Distances in Two-Headed Disk Systems.
Inf. Process. Lett., 1996

1995
A recursive algorithm for the multi-peg tower of hanoi problem.
Int. J. Comput. Math., 1995

A new algorithm for ranking players of a round-robin tournament.
Comput. Oper. Res., 1995


  Loading...