Greedy Bipartite Matching in Random Type Poisson Arrival Model
arXiv
A Simple PTAS for the Dual Bin Packing Problem and Advice Complexity of Its Online Version
arXiv
SOSA
On Conceptually Simple Algorithms for Variants of Online Bipartite Matching
arXiv
WAOA
Random CNFs are Hard for Cutting Planes
arXiv
ECCC
Communication Complexity and Information Complexity. (PhD Dissertation)
Local
ProQuest
There are No Zero-Hard Problems in Multiparty Communication Complexity
Local
On the Power of Feedback in Interactive Channels
Local
Direct Sum Questions in Classical Communication Complexity (Master's Thesis)
Local
Variations on the Sensitivity Conjecture
arXiv
TOC
On the Relative Merits of Simple Local Search Methods for the MAXSAT Problem
Local
SAT 2010
Calibree Calibration-free Localization using Relative Distance Estimations
Local
Pervasive 2008