So in my "Advanced algorithms" course, we were taught about the "self-organizing list" data structure. The professor showed the following three heuristic algorithms: Frequency Count, Move to Front and Transpose.
Looking online, I could not find any other "popular", "common" or "used" heuristic algorithms. Are there any other heuristic algorithms that the self-organizing list can implement (without knowing the distribution of the input)? What are their benefits?