6 citations · 8 across the 3 of their papers we have counts for
3 papers
Multidimensional segment trees can do range updates in poly-logarithmic time
Nabil Ibtehaz, M. Kaykobad, M. Sohel Rahman
Updating and querying on a range is a classical algorithmic problem with a multitude of applications. The Segment Tree data structure is particularly notable in handling the range…
Some fascinating series and their sums
Md Enamul Azim, Md Mostofa Akbar, M Kaykobad
In this paper we present some interesting results involving summation of series in particular trigonometric ones. We failed to locate these results in existing literature or in the…
Min-Max Fine Heaps
Suman Kumar Nath, Rezaul Alam Chowdhury, M. Kaykobad
In this paper we present a new data structure for double ended priority queue, called min-max fine heap, which combines the techniques used in fine heap and traditional min-max hea…