We look into the problem of estimating the average of quantities relating to combinatorial
and geometrical objects. In all the cases we study it is possible to get the exact average of …

In this dissertation, we study trade-offs between computational complexity and information
content of problems arising in different facets of theoretical computer science. In the first part of …

In the disjoint path allocation problem, we consider a path of L + 1 vertices, representing the
nodes in a communication network. Requests for an unbounded-time communication …

In this work, we study the advice complexity of the online minimum Steiner tree problem ( ST
). Given a (known) graph G = (V,E) endowed with a weight function on the edges, a set of N …

A universal one-way hash function (UOWHF) is a shrinking function for which finding a
second preimage is infeasible. A UOWHF, a fundamental cryptographic primitive from which …

We consider the problem of approximating the average distance between pairs of points in
a high-dimensional Euclidean space, and more generally in any metric space. We consider …

We present a new framework for proving fully black-box separations and lower bounds. We
prove a general theorem that facilitates the proofs of fully black-box lower bounds from a one-…

We continue the study of a recently introduced model of communication complexity with
advice, focusing on the power of advice in the context of equality of bitstrings and divisibility of …

… This holds particularly true for Kfir Barhum, for my long-time roommates Luka Cuderman
and Matias Thalmann, and for Claudia Jann, Loris Lago, Mia Meng, Fabrizio Pedrun, and …

… Gautham Sekar Pouyan Sepehrdad Yannick Seurin Hovav Shacham Siamak Fayyaz
Shahandashti Emily Shen Barhum Kfir Shlomo Adam Smith Boyeon Song Paul Stankovski Peter …