Average case analyses of list update algorithms, with applications to data compression

Susanne Albers, Michael Mitzenmacher

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

5 Scopus citations

Abstract

We study the performance of the Timestamp(O) (TS(O)) algorithm for self-organizing sequential search on discrete memoryless sources. We demonstrate that TS(O) is better than Move-to-front on such sources, and determine performance ratios for TS(O) against the optimal offline and static adversaries in this situation. Previous work on such sources compared online algorithms only to static adversaries. One practical motivation for our work is the use of the Move-to-front heuristic in various compression algorithms. Our theoretical results suggest that in many cases using TS(O) in place of Move-to-front in schemes that use the latter should improve compression. Tests on a standard corpus of documents demonstrate that TS(O) leads in fact to improved compression.

Original languageEnglish
Title of host publicationAutomata, Languages and Programming - 23rd International Colloquium, ICALP 1996, Proceedings
EditorsFriedhelm Meyer auf der Heide, Burkhard Monien
PublisherSpringer Verlag
Pages514-525
Number of pages12
ISBN (Print)3540614400, 9783540614401
DOIs
StatePublished - 1996
Externally publishedYes
Event23rd International Colloquium on Automata, Languages, and Programming, ICALP 1996 - Paderborn, Germany
Duration: 8 Jul 199612 Jul 1996

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1099
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference23rd International Colloquium on Automata, Languages, and Programming, ICALP 1996
Country/TerritoryGermany
CityPaderborn
Period8/07/9612/07/96

Fingerprint

Dive into the research topics of 'Average case analyses of list update algorithms, with applications to data compression'. Together they form a unique fingerprint.

Cite this