21 citations · 21 across the 1 of their papers we have counts for
3 papers
cs.CC2019
A New Approach to Multi-Party Peer-to-Peer Communication Complexity
Adi Rosén, Florent Urrutia
We introduce new models and new information theoretic measures for the study of communication complexity in the natural peer-to-peer, multi-party, number-in-hand setting. We prove…
cs.DS2017★ 21 cited
Improved Rectangular Matrix Multiplication using Powers of the Coppersmith-Winograd Tensor
François Le Gall, Florent Urrutia
In the past few years, successive improvements of the asymptotic complexity of square matrix multiplication have been obtained by developing novel methods to analyze the powers of…
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…