98 citations · 444 across the 80 of their papers we have counts for
7 papers · 1 filter
Part II: A Practical Approach for Successive Omniscience
Ni Ding, Parastoo Sadeghi, Thierry Rakotoarivelo
In Part I, we studied the communication for omniscience (CO) problem and proposed a parametric (PAR) algorithm to determine the minimum sum-rate at which a set of users indexed by…
Part I: Improving Computational Efficiency of Communication for Omniscience
Ni Ding, Parastoo Sadeghi, Thierry Rakotoarivelo
Communication for omniscience (CO) refers to the problem where the users in a finite set observe a discrete multiple random source and want to exchange data over broadcast chan…
Improved Lower Bounds for Pliable Index Coding using Absent Receivers
Lawrence Ong, Badri N. Vellambi, Jörg Kliewer +1
This paper studies pliable index coding, in which a sender broadcasts information to multiple receivers through a shared broadcast medium, and the receivers each have some message…
Improving Computational Efficiency of Communication for Omniscience and Successive Omniscience
Ni Ding, Parastoo Sadeghi, Thierry Rakotoarivelo
For a group of users in where everyone observes a component of a discrete multiple random source, the process that users exchange data so as to reach omniscience, the state whe…
A Submodularity-based Agglomerative Clustering Algorithm for the Privacy Funnel
Ni Ding, Parastoo Sadeghi
For the privacy funnel (PF) problem, we propose an efficient iterative agglomerative clustering algorithm based on the minimization of the difference of submodular functions (IAC-M…
Attaining Fairness in Communication for Omniscience
Ni Ding, Parastoo Sadeghi, David Smith +1
This paper studies how to attain fairness in communication for omniscience, where a set of users exchange their observations of a discrete multiple random source to attain omniscie…