13 citations · 35 across the 9 of their papers we have counts for
11 papers
Succinct Navigational Oracles for Families of Intersection Graphs on a Circle
Hüseyin Acan, Sankardeep Chakraborty, Seungbum Jo +3
We consider the problem of designing succinct navigational oracles, i.e., succinct data structures supporting basic navigational queries such as degree, adjacency, and neighborhood…
Space Efficient Algorithms for Breadth-Depth Search
Sankardeep Chakraborty, Anish Mukherjee, Srinivasa Rao Satti
Continuing the recent trend, in this article we design several space-efficient algorithms for two well-known graph search methods. Both these search methods share the same name {\i…
Frameworks for Designing In-place Graph Algorithms
Sankardeep Chakraborty, Anish Mukherjee, Venkatesh Raman +1
Read-only memory model is a classical model of computation to study time-space tradeoffs of algorithms. One of the classical results on the ROM model is that any sorting algorithm…
Selection from read-only memory with limited workspace
Amr Elmasry, Daniel Dahl Juhl, Jyrki Katajainen +1
Given an unordered array of elements drawn from a totally ordered set and an integer in the range from to , in the classic selection problem the task is to find the…
Encoding Range Minimum Queries
Pooya Davoodi, Gonzalo Navarro, Rajeev Raman +1
We consider the problem of encoding range minimum queries (RMQs): given an array A[1..n] of distinct totally ordered values, to pre-process A and create a data structure that can a…
Near-Optimal Online Multiselection in Internal and External Memory
Jérémy Barbay, Ankur Gupta, S. Srinivasa Rao +1
We introduce an online version of the multiselection problem, in which q selection queries are requested on an unsorted array of n elements. We provide the first online algorithm t…