Simha, R. and A. Majumdar, On Lookahead in the List Update Problem. Information Processing Letters. We study a problem in the area of self-adjusting data structures: algorithms for the singly-linked list for the case in which a sequence of operations is to be performed on the list and the entire sequence is known beforehand. Whereas past approaches assume that the cost of lookahead is zero, we ...