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

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 with a sequence of requests, where each request is an access operation on an element of the list. A list... Show more