
The Stationary Prophet Inequality Problem
We study a continuous and infinite time horizon counterpart to the class...
read it

Beating the Folklore Algorithm for Dynamic Matching
The maximum matching problem in dynamic graphs subject to edge updates (...
read it

The Greedy Algorithm is not Optimal for OnLine Edge Coloring
Nearly three decades ago, BarNoy, Motwani and Naor showed that no onlin...
read it

UniversallyOptimal Distributed Algorithms for Known Topologies
Many distributed optimization algorithms achieve existentiallyoptimal r...
read it

Online Stochastic MaxWeight Bipartite Matching: Beyond Prophet Inequalities
The rich literature on online Bayesian selection problems has long focus...
read it

Online Edge Coloring Algorithms via the Nibble Method
Nearly thirty years ago, BarNoy, Motwani and Naor [IPL'92] conjectured ...
read it

Streaming Submodular Matching Meets the PrimalDual Method
We study streaming submodular maximization subject to matching/bmatchin...
read it

NearOptimal Schedules for Simultaneous Multicasts
We study the storeandforward packet routing problem for simultaneous m...
read it

Rounding Dynamic Matchings Against an Adaptive Adversary
We present a new dynamic matching sparsification scheme. From this schem...
read it

Network Coding Gaps for Completion Times of Multiple Unicasts
Arguably the most common network communication problem is multipleunica...
read it

Stochastic Online Metric Matching
We study the minimumcost metric perfect matching problem under online i...
read it

Tight Bounds for Online Edge Coloring
Vizing's celebrated theorem asserts that any graph of maximum degree Δ a...
read it

Online Matching with General Arrivals
The online matching problem was introduced by Karp, Vazirani and Vaziran...
read it

Round and MessageOptimal Distributed Graph Algorithms
Distributed graph algorithms that separately optimize for either the num...
read it

Round and MessageOptimal Distributed PartWise Aggregation
Distributed graph algorithms that separately optimize for either the num...
read it

Dynamic Matching: Reducing Integral Algorithms to ApproximatelyMaximal Fractional Algorithms
We present a simple randomized reduction from fullydynamic integral mat...
read it

FullyDynamic Bin Packing with Limited Repacking
We consider the bin packing problem in a fullydynamic setting, where ne...
read it
David Wajc
is this you? claim profile