activity
20112015
most citedOptimal Deterministic Polynomial-Time Data Exchange for Omniscience

11 citations · 21 across the 5 of their papers we have counts for

collaborators
Showing cs.ITShow all

5 papers · 1 filter

cs.IT2015★ 4 cited

Efficient Algorithms for the Data Exchange Problem

Nebojsa Milosavljevic, Sameer Pawar, Salim El Rouayheb +2

In this paper we study the data exchange problem where a set of users is interested in gaining access to a common file, but where each has only partial knowledge about it as side-i…

cs.IT2012★ 4 cited

Minimum Cost Multicast with Decentralized Sources

Nebojsa Milosavljevic, Sameer Pawar, Salim El Rouayheb +2

In this paper we study the multisource multicast problem where every sink in a given directed acyclic graph is a client and is interested in a common file. We consider the case whe…

cs.IT2012★ 1 cited

Data Exchange Problem with Helpers

Nebojsa Milosavljevic, Sameer Pawar, Salim El Rouayheb +2

In this paper we construct a deterministic polynomial time algorithm for the problem where a set of users is interested in gaining access to a common file, but where each has only…

cs.IT2011★ 11 cited

Optimal Deterministic Polynomial-Time Data Exchange for Omniscience

Nebojsa Milosavljevic, Sameer Pawar, Salim El Rouayheb +2

We study the problem of constructing a deterministic polynomial time algorithm that achieves omniscience, in a rate-optimal manner, among a set of users that are interested in a co…

cs.IT2011★ 1 cited

A Compressed Sensing Wire-Tap Channel

Galen Reeves, Naveen Goela, Nebojsa Milosavljevic +1

A multiplicative Gaussian wire-tap channel inspired by compressed sensing is studied. Lower and upper bounds on the secrecy capacity are derived, and shown to be relatively tight i…