#### Filter Results:

- Full text PDF available (6)

#### Publication Year

2009

2016

- This year (0)
- Last 5 years (2)
- Last 10 years (12)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Nebojsa Milosavljevic, Sameer Pawar, Salim Y. El Rouayheb, Michael Gastpar, Kannan Ramchandran
- 2011 IEEE International Symposium on Information…
- 2011

In this paper we study the problem of data exchange, where each node in the system has a number of linear combinations of the data packets. Communicating over a public channel, the goal is for all… (More)

- Nebojsa Milosavljevic, Sameer Pawar, Salim Y. El Rouayheb, Michael Gastpar, Kannan Ramchandran
- IEEE Transactions on Information Theory
- 2016

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-information.… (More)

- Nebojsa Milosavljevic, Sameer Pawar, Michael Gastpar, Kannan Ramchandran
- 2012 50th Annual Allerton Conference on…
- 2012

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-information. Given… (More)

- Galen Reeves, Naveen Goela, Nebojsa Milosavljevic, Michael Gastpar
- 2011 IEEE Information Theory Workshop
- 2011

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 in the large system… (More)

In this paper we study the problem of data exchange, where each node in the system has a number of linear combinations of the data packets. Communicating over a public channel, the goal is for all… (More)

Data Exchange Problems: Algorithms and Complexity by Nebojsa Milosavljevic Doctor of Philosophy in Engineering-Electrical Engineering & Computer Sciences University of California, Berkeley Professor… (More)

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 common file but each… (More)

- Nebojsa Milosavljevic, Sameer Pawar, Salim Y. El Rouayheb, Michael Gastpar, Kannan Ramchandran
- 2012 IEEE International Symposium on Information…
- 2012

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 partial knowledge… (More)

- Nebojsa Milosavljevic, Michael Gastpar, Kannan Ramchandran
- 2009 IEEE International Symposium on Information…
- 2009

Confidential communication aided by a relay without security clearance is studied. General strategies and outer bounds are derived for the problem of secret communication and secret key generation… (More)

- Vesna Lopičić, Biljana Mišić Ilić, +10 authors Jovana Dimitrijević

In his introduction to the book Intervention Architecture: Building for Change published in 2007, Homi Bhabha stresses the omnipresent need to change: "We live in the midst of difficult transitions… (More)