Back to Results
First PageMeta Content
Theoretical computer science / Computer science / List update problem / Self-organizing list / Competitive analysis / Algorithm / Sorting algorithm / Permutation / Randomized algorithm / Analysis of algorithms / Mathematics / Online algorithms


Document Date: 2003-04-14 10:04:24

Open Document

File Size: 100,05 KB

Share Result on Facebook

Company

Cambridge University Press / Siam Journal / /

Country

Germany / /

IndustryTerm

Online Computation / search operation cost / search operation / search requests / offline algorithm / bank / possible algorithm / randomized algorithm / randomized list update algorithms / cache hardware / dynamic optimum algorithm / search cost / randomized on-line algorithms / dynamic optimal algorithm / optimum algorithm / omniscient optimum algorithm / online algorithm / deterministic algorithm / omniscient algorithm / linear search / /

Organization

Cambridge University / /

Person

Allan Borodin / Nick Reingold / Boris Teia / J. Ian Munro / Ilya Shlyakhter / Rob Seater / Patrick Lam / Jeffery Westbrook / Christoph Amb / Erik Demaine / Susanne Albers / Daniel Dominic Sleator / Robert Endre Tarjan / /

Position

model / cost model / /

PublishedMedium

Siam Journal on Computing / Communications of the ACM / Lecture Notes in Computer Science / /

TVStation

KMTF / /

Technology

dynamic optimum algorithm / online algorithm / randomized algorithm / Bit Algorithm / omniscient algorithm / The Move-to-Front algorithm / deterministic algorithm / ESA / paging / randomized list update algorithms / Improved randomized on-line algorithms / optimum algorithm / FC algorithms / ONR algorithm / omniscient optimum algorithm / offline algorithm / /

URL

http /

SocialTag