The following pages link to Kfir Barhum (Q2794354):
Displaying 6 items.
- On the Power of Laconic Advice in Communication Complexity (Q2794355) (← links)
- UOWHFs from OWFs: Trading Regularity for Efficiency (Q2915125) (← links)
- Tight Bounds for the Advice Complexity of the Online Minimum Steiner Tree Problem (Q2938096) (← links)
- On the Power of Advice and Randomization for the Disjoint Path Allocation Problem (Q2938097) (← links)
- On Approximating the Average Distance Between Points (Q3603473) (← links)
- A Cookbook for Black-Box Separations and a Recipe for UOWHFs (Q4910304) (← links)
