On Approximating the Average Distance Between Points. - Kfir Barhum; Oded Goldreich 001; Adi Shraibman (APPROX-RANDOM, 2007)

UOWHFs from OWFs: Trading Regularity for Efficiency. - Kfir Barhum; Ueli Maurer (LATINCRYPT, 2012)

A Cookbook for Black-Box Separations and a Recipe for UOWHFs. - Kfir Barhum; Thomas Holenstein (Electron. Colloquium Comput. Complex., 2012)

Tight Bounds for the Advice Complexity of the Online Minimum Steiner Tree Problem. - Kfir Barhum (SOFSEM, 2014)

On the Power of Advice and Randomization for the Disjoint Path Allocation Problem. - Kfir Barhum; Hans-Joachim Böckenhauer; Michal Forisek; Heidi Gebauer; Juraj Hromkovic; Sacha Krug; Jasmin Smula; Björn Steffen (SOFSEM, 2014)

Tradeoffs Between Computational Complexity and Information Content. - Kfir Barhum (2015)

On the Power of Laconic Advice in Communication Complexity. - Kfir Barhum; Juraj Hromkovic (SOFSEM, 2016)