Kfir Barhum

According to our database, Kfir Barhum authored at least 7 papers between 2007 and 2016.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2016

On the Power of Laconic Advice in Communication Complexity.

Kfir Barhum, Juraj Hromkovic

Proceedings of the SOFSEM 2016: Theory and Practice of Computer Science, 2016

2015

Tradeoffs Between Computational Complexity and Information Content.

Kfir Barhum

PhD thesis, 2015

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

Proceedings of the SOFSEM 2014: Theory and Practice of Computer Science, 2014

Tight Bounds for the Advice Complexity of the Online Minimum Steiner Tree Problem.

Kfir Barhum

Proceedings of the SOFSEM 2014: Theory and Practice of Computer Science, 2014

2013

A Cookbook for Black-Box Separations and a Recipe for UOWHFs.

Kfir Barhum, Thomas Holenstein

Proceedings of the Theory of Cryptography - 10th Theory of Cryptography Conference, 2013

2012

UOWHFs from OWFs: Trading Regularity for Efficiency.

Kfir Barhum, Ueli Maurer

Proceedings of the Progress in Cryptology - LATINCRYPT 2012, 2012

2007

On Approximating the Average Distance Between Points.

Kfir Barhum, Oded Goldreich, Adi Shraibman

Proceedings of the Approximation, 2007