#### Filter Results:

- Full text PDF available (9)

#### Publication Year

2009

2017

- This year (4)
- Last 5 years (18)
- Last 10 years (21)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Daniel Cullina, Negar Kiyavash
- SIGMETRICS
- 2016

We consider the problem of perfectly recovering the vertex correspondence between two correlated Erdos-Renyi (ER) graphs. For a pair of correlated graphs on the same vertex set, the correspondenceâ€¦ (More)

- Daniel Cullina, Alexandros G. Dimakis, Tracey Ho
- ArXiv
- 2009

Regenerating codes allow distributed storage systems to recover from the loss of a storage node while transmitting the minimum possible amount of data across the network. We present a systematicâ€¦ (More)

- Arjun Nitin Bhagoji, Daniel Cullina, Prateek Mittal
- ArXiv
- 2017

- Daniel Cullina, Negar Kiyavash
- IEEE Transactions on Information Theory
- 2013

We consider deletion correcting codes over a q-ary alphabet. It is well known that any code capable of correcting s deletions can also correct any combination of s total insertions and deletions. Toâ€¦ (More)

- Daniel Cullina, Ankur A. Kulkarni, Negar Kiyavash
- 2012 IEEE International Symposium on Informationâ€¦
- 2012

We take a graph theoretic view of deletion correcting codes. The problem of finding an n-bit s-deletion correcting code is equivalent to finding an independent set in a particular graph. We discussâ€¦ (More)

- Daniel Cullina, Negar Kiyavash, Ankur A. Kulkarni
- IEEE Transactions on Information Theory
- 2016

We investigate deletion correcting codes and restricted composition codes in particular. Restricted composition codes generalize codes on permutations and multipermutations. We use graph theoreticâ€¦ (More)

- Daniel Cullina, Negar Kiyavash
- IEEE Transactions on Information Theory
- 2016

Many of the classic problems of the coding theory are highly symmetric, which makes it easy to derive the sphere-packing upper bounds on the size of codes. We discuss the generalizations of theâ€¦ (More)

- Daniel Cullina, Negar Kiyavash
- 2014 IEEE International Symposium on Informationâ€¦
- 2014

A code for a combinatorial channel is a feasible point in an integer linear program derived from that channel. Sphere-packing upper bounds are closely related to the fractional relaxation of thisâ€¦ (More)

We propose the use of data transformations as a defense against evasion attacks on ML classifiers. We present and investigate strategies for incorporating a variety of data transformations includingâ€¦ (More)

- Daniel Cullina, Kushagra Singhal, Negar Kiyavash, Prateek Mittal
- ArXiv
- 2016

We consider the problem of performing community detection on a network, while maintaining privacy, assuming that the adversary has access to an auxiliary correlated network. We ask the question â€œDoesâ€¦ (More)