Average-case analysis for a simple compression algorithm

DOI10.1007/PL00009242zbMATH Open0914.68084OpenAlexW2068182666MaRDI QIDQ1277385FDOQ1277385

Authors: Donatella Merlini, Renzo Sprugnoli, Maria Cecilia Verri 

Publication date: 2 February 1999

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/pl00009242

Recommendations

• scientific article; zbMATH DE number 1779566
• A simple, fast, and compact static dictionary
• Compressed static functions with applications
• Low redundancy in static dictionaries with constant query time

zbMATH Keywords

static dictionary problemtable compression problem

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Cited In (2)

• Average case analyses of list update algorithms, with applications to data compression
• Title not available (Why is that?)

This page was built for publication: Average-case analysis for a simple compression algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1277385)