Author of the publication

On the Power of Laconic Advice in Communication Complexity.

, and . SOFSEM, volume 9587 of Lecture Notes in Computer Science, page 161-170. Springer, (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

No persons found for author name Barhum, Kfir
add a person with the name Barhum, Kfir
 

Other publications of authors with the same name

UOWHFs from OWFs: Trading Regularity for Efficiency., and . LATINCRYPT, volume 7533 of Lecture Notes in Computer Science, page 234-253. Springer, (2012)Tradeoffs Between Computational Complexity and Information Content.. ETH Zurich, Zürich, Switzerland, (2015)base-search.net (ftethz:oai:www.research-collection.ethz.ch:20.500.11850/155178).On the Power of Laconic Advice in Communication Complexity., and . SOFSEM, volume 9587 of Lecture Notes in Computer Science, page 161-170. Springer, (2016)Tight Bounds for the Advice Complexity of the Online Minimum Steiner Tree Problem.. SOFSEM, volume 8327 of Lecture Notes in Computer Science, page 77-88. Springer, (2014)On Approximating the Average Distance Between Points., , and . APPROX-RANDOM, volume 4627 of Lecture Notes in Computer Science, page 296-310. Springer, (2007)