activity
20022023
most citedCompetitive Paging Algorithms

462 citations · 469 across the 6 of their papers we have counts for

collaborators

8 papers

cs.NI2023

Enabling immersive experiences in challenging network conditions

Pooja Aggarwal, Michael Luby, Lorenz Minder

Immersive experiences, such as remote collaboration and augmented and virtual reality, require delivery of large volumes of data with consistent ultra-low latency across wireless n…

cs.IT2021★ 1 cited

Distributed storage algorithms with optimal tradeoffs

Michael Luby, Thomas Richardson

One of the primary objectives of a distributed storage system is to reliably store large amounts of source data for long durations using a large number of unreliable storage no…

cs.NI2020★ 1 cited

SOPI design and analysis for LDN

Michael Luby

Liquid Data Networking (LDN) is an ICN architecture that is designed to enable the benefits of erasure-code enabled object delivery. A primary contribution of LDN is the introducti…

cs.IT2020

Repair rate lower bounds for distributed storage

Michael Luby

One of the primary objectives of a distributed storage system is to reliably store a large amount of source data for a long duration using a large number of unreliable…

cs.DC2017

Liquid Cloud Storage

Michael G. Luby, Roberto Padovani, Thomas J. Richardson +2

A liquid system provides durable object storage based on spreading redundantly generated data across a network of hundreds to thousands of potentially unreliable storage nodes. A l…

cs.LG2017★ 2 cited

Learning from partial correction

Sanjoy Dasgupta, Michael Luby

We introduce a new model of interactive learning in which an expert examines the predictions of a learner and partially fixes them if they are wrong. Although this kind of feedback…

cs.IT2016★ 3 cited

Capacity bounds for distributed storage

Michael Luby

One of the primary objectives of a distributed storage system is to reliably store large amounts of source data for long durations using a large number of unreliable storage no…

cs.DS2002★ 462 cited

Competitive Paging Algorithms

Amos Fiat, Richard Karp, Mike Luby +3

The paging problem is that of deciding which pages to keep in a memory of k pages in order to minimize the number of page faults. This paper introduces the marking algorithm, a sim…