On the competitive theory and practice of online list accessing algorithms

Bachrach, Ran; El-Yaniv, Ran; Reinstädtler, Martin

Local TagsRelease HistoryDetailsSummary

On the competitive theory and practice of online list accessing algorithms

Bachrach, R., El-Yaniv, R., & Reinstädtler, M. (2002). On the competitive theory and practice of online list accessing algorithms. Algorithmica, 32, 201-246.

Item is Released

show all hide all

Basic

show hide

Item Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-3018-D Version Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-3019-B

Genre: Journal Article

Files

show Files

Locators

show

Creators

show

hide

Creators:
Bachrach, Ran, Author
El-Yaniv, Ran, Author
Reinstädtler, Martin¹, Author

Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019

Content

show

Details

show

hide

Language(s): eng - English

Dates: Modified: 2003-08-29Date issued: 2002

Publication Status: Issued

Pages: -

Publishing info: -

Table of Contents: -

Rev. Type: Peer

Identifiers: eDoc: 202068
Other: Local-ID: C1256428004B93B8-40A8A5EA48179CD1C1256D210029A112-BachrachEl-YanivReinstädtler2002

Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show

hide

Title: Algorithmica

Source Genre: Journal

Creator(s):

Affiliations:

Publ. Info: -

Pages: - Volume / Issue: 32 Sequence Number: - Start / End Page: 201 - 246 Identifier: ISSN: 0178-4617