Shiba Prasad Dash

Learn More
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 proposed in the literature and their performances have been analyzed theoretically and experimentally. Move-To-Front (MTF), Transpose (TRANS) and Frequency Count (FC) are the(More)
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 (TRANS) are two well known primitive list accessing algorithms. MTF has been proved to be the best performing online algorithm till date in the literature for real life inputs(More)
  • 1