50 citations · 61 across the 5 of their papers we have counts for
Showing 2016Show all
3 papers · 1 filter
cs.CC2016
Multi-Party Protocols, Information Complexity and Privacy
Iordanis Kerenidis, Adi Rosén, Florent Urrutia
We introduce a new information theoretic measure that we call Public Information Complexity (PIC), as a tool for the study of multi-party computation protocols, and of quantities s…
cs.DS2016
A Constant Approximation Algorithm for Scheduling Packets on Line Networks
Guy Even, Moti Medina, Adi Rosén
In this paper we improve the approximation ratio for the problem of scheduling packets on line networks with bounded buffers, where the aim is that of maximizing the throughput. Ea…
cs.DS2016
Sublinear Random Access Generators for Preferential Attachment Graphs
Guy Even, Reut Levi, Moti Medina +1
We consider the problem of sampling from a distribution on graphs, specifically when the distribution is defined by an evolving graph model, and consider the time, space and random…