SIGACT News Online Algorithms Column 2 Marek Chrobak From the editor: This issue s column contains an article by Wolf Bein and Larry Larmore with a gentle introduction to the concepts of trackless and limited-bookmark online algorithms for paging and for the k-server problem. Many online algorithms for these problems studied in the literature need to keep track, in essence, of the whole computation history. It is natural then to ask whether good competitive constants can be achieved with simpler algorithms. The distinction between simple and non-simple algorithms has proven to be rather di cult to capture mathematically. The elegant notion of tracklessness is in my view a very promising step in this direction. Thanks to Wolf and Larry for agreeing to contribute this article (on a very short notice.) I would also like to take this opportunity to invite more contributions: surveys, technical articles, reviews, opinions, conference reports anything related to online algorithms and competitive analysis. The column also contains an announcement of the OLA 04 workshop in Denmark. The report from the workshop is expected to appear in the September 04 issue. Trackless and Limited-Bookmark Algorithms for Paging Wolfgang W.
/lp/association-for-computing-machinery/sigact-news-online-algorithms-column-2-l8eh2bOk00