Skip to main navigation Skip to search Skip to main content

Approximate and on-line algorithms for list update problem

  • Indian Institute of Technology Kanpur
  • University of Texas at Arlington

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Original languageEnglish
Title of host publicationProceedings - 22nd International Conference of the Chilean Computer Science Society, SCCC 2002
PublisherIEEE Computer Society
Pages14-23
Number of pages10
ISBN (Electronic)0769518672
DOIs
StatePublished - 2002
Externally publishedYes
Event22nd International Conference of the Chilean Computer Science Society, SCCC 2002 - Copiapo, Atacama, Chile
Duration: Nov 6 2002 → Nov 8 2002

Publication series

NameProceedings - International Conference of the Chilean Computer Science Society, SCCC
Volume2002-January
ISSN (Print)1522-4902

Conference

Conference22nd International Conference of the Chilean Computer Science Society, SCCC 2002
Country/TerritoryChile
CityCopiapo, Atacama
Period11/6/02 → 11/8/02

ASJC Scopus Subject Areas

  • General Engineering
  • General Computer Science

Keywords

  • Approximation algorithms
  • Cost function
  • Data compression
  • Data structures
  • Dictionaries
  • Polynomials

Fingerprint

Dive into the research topics of 'Approximate and on-line algorithms for list update problem'. Together they form a unique fingerprint.

Cite this