activity
20112024
most citedSome Novel Results From Analysis of Move To Front (MTF) List Accessing Algorithm

4 citations · 8 across the 5 of their papers we have counts for

collaborators

5 papers

cs.DS2024

A Note On Lookahead In Real Life And Computing

Burle Sharma, Rakesh Mohanty, Sucheta Panda

Past, Present and Future are considered to be three temporal and logical concepts which are well defined by human beings for their existence and growth. We, as human beings, have t…

cs.DS2013

TRANS outperforms MTF for two special types of request sequences without locality of reference

Rakesh Mohanty, Sangita Patel, Shiba Prasad Dash +1

Various list accessing algorithms have been proposed in the literature and their performances have been analyzed theoretically and experimentally. Move-To-Front (MTF) and Transpose…

cs.DS2012★ 4 cited

Some Novel Results From Analysis of Move To Front (MTF) List Accessing Algorithm

Rakesh Mohanty, Sangita Patel, Shiba Prasad Dash +1

List accessing problem has been studied as a problem of significant theoretical and practical interest in the context of linear search. Various list accessing algorithms have been…

cs.DS2012

Performance Evaluation of A Proposed Variant of Frequency Count (VFC) List Accessing Algorithm

Rakesh Mohanty, Shiba Prasad Dash, Burle Sharma +1

Frequency Count (FC) algorithm is considered as the static optimal algorithm for the list accessing problem. In this paper, we have made a study of FC algorithm and explore its lim…

cs.DS2011★ 4 cited

Characterization of Request Sequences for List Accessing Problem and New Theoretical Results for MTF Algorithm

Rakesh Mohanty, Burle Sharma, Sasmita Tripathy

List Accessing Problem is a well studied research problem in the context of linear search. Input to the list accessing problem is an unsorted linear list of distinct elements along…