activity
20082026
most citedNetwork coding meets TCP

250 citations · 1.1k across the 76 of their papers we have counts for

collaborators
Showing 2019Show all

6 papers · 1 filter

cs.DS2019★ 2 cited

Prophets, Secretaries, and Maximizing the Probability of Choosing the Best

Hossein Esfandiari, MohammadTaghi HajiAghayi, Brendan Lucier +1

Suppose a customer is faced with a sequence of fluctuating prices, such as for airfare or a product sold by a large online retailer. Given distributional information about what pri…

cs.DS2019

Optimal Learning of Joint Alignments with a Faulty Oracle

Kasper Green Larsen, Michael Mitzenmacher, Charalampos E. Tsourakakis

We consider the following problem, which is useful in applications such as joint image and shape alignment. The goal is to recover discrete variables $g_i \in \{0, \ldots, k-1\…

cs.PF2019★ 9 cited

The Supermarket Model with Known and Predicted Service Times

Michael Mitzenmacher, Matteo Dell'Amico

The supermarket model refers to a system with a large number of queues, where new customers choose d queues at random and join the one with the fewest customers. This model demonst…

cs.DS2019★ 28 cited

Scheduling with Predictions and the Price of Misprediction

Michael Mitzenmacher

In many traditional job scheduling settings, it is assumed that one knows the time it will take for a job to complete service. In such cases, strategies such as shortest job first…

cs.DS2019★ 1 cited

Online Pandora's Boxes and Bandits

Hossein Esfandiari, MohammadTaghi Hajiaghayi, Brendan Lucier +1

We consider online variations of the Pandora's box problem (Weitzman. 1979), a standard model for understanding issues related to the cost of acquiring information for decision-mak…

cs.LG2019★ 63 cited

A Model for Learned Bloom Filters, and Optimizing by Sandwiching

Michael Mitzenmacher

Recent work has suggested enhancing Bloom filters by using a pre-filter, based on applying machine learning to determine a function that models the data set the Bloom filter is mea…