Ilan Shomorony

CoRR, 2021

2020

Bandit-PAM: Almost Linear Time k-Medoids Clustering via Multi-Armed Bandits.

[BibT_eX]

[DOI]

CoRR, 2020

DNA-Based Storage: Models and Fundamental Limits.

[BibT_eX]

[DOI]

Reinhard Heckel

CoRR, 2020

Spectral Jaccard Similarity: A New Approach to Estimating Pairwise Sequence Alignments.

[BibT_eX]

[DOI]

Proceedings of the Research in Computational Molecular Biology, 2020

BanditPAM: Almost Linear Time k-Medoids Clustering via Multi-Armed Bandits.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Adaptive Learning of Rank-One Models for Efficient Pairwise Sequence Alignment.

[BibT_eX]

[DOI]

Govinda M. Kamath

Tavor Z. Baharav

Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Capacity of the Erasure Shuffling Channel.

[BibT_eX]

[DOI]

Seiyun Shin

Reinhard Heckel

Proceedings of the 2020 IEEE International Conference on Acoustics, 2020

Communicating over the Torn-Paper Channel.

[BibT_eX]

[DOI]

Alireza Vahid

Proceedings of the IEEE Global Communications Conference, 2020

2019

The Metagenomic Binning Problem: Clustering Markov Sequences.

[BibT_eX]

[DOI]

Grant Greenberg

Proceedings of the 2019 IEEE Information Theory Workshop, 2019

Capacity Results for the Noisy Shuffling Channel.

[BibT_eX]

[DOI]

Reinhard Heckel

Proceedings of the IEEE International Symposium on Information Theory, 2019

2017

Fundamental limits of DNA storage systems.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

2016

Fundamental Limits of Genome Assembly Under an Adversarial Erasure Model.

[BibT_eX]

[DOI]

Thomas A. Courtade

David Tse

IEEE Trans. Mol. Biol. Multi Scale Commun., 2016

Information-optimal genome assembly via sparse read-overlap graphs.

[BibT_eX]

[DOI]

Bioinform., 2016

Partial DNA assembly: A rate-distortion perspective.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2016

Overlap-based genome assembly from variable-length reads.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2016

2015

Network Compression: Worst Case Analysis.

[BibT_eX]

[DOI]

Himanshu Asnani

Tsachy Weissman

IEEE Trans. Inf. Theory, 2015

Do read errors matter for genome assembly?

[BibT_eX]

[DOI]

Thomas A. Courtade

David N. C. Tse

Proceedings of the IEEE International Symposium on Information Theory, 2015

Informational bottlenecks in two-unicast wireless networks with delayed CSIT.

[BibT_eX]

[DOI]

Alireza Vahid

A. Robert Calderbank

Proceedings of the 53rd Annual Allerton Conference on Communication, 2015

2014

Diamond Networks With Bursty Traffic: Bounds on the Minimum Energy-Per-Bit.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2014

Degrees of Freedom of Two-Hop Wireless Networks: Everyone Gets the Entire Cake.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2014

Computing Half-Duplex Schedules in Gaussian Relay Networks via Min-Cut Approximations.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2014

Multihop Wireless Networks: A Unified Approach to Relaying and Interference Management.

[BibT_eX]

[DOI]

Salman Avestimehr

Found. Trends Netw., 2014

A generalized cut-set bound for deterministic multi-flow networks and its applications.

[BibT_eX]

[DOI]

Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Sampling large data on graphs.

[BibT_eX]

[DOI]

Proceedings of the 2014 IEEE Global Conference on Signal and Information Processing, 2014

2013

Worst-Case Additive Noise in Wireless Networks.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2013

Two-Unicast Wireless Networks: Characterizing the Degrees of Freedom.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2013

On Min-Cut Algorithms for Half-Duplex Relay Networks

[BibT_eX]

[DOI]

CoRR, 2013

On computing half-duplex relaying capacity in networks with orthogonal channels.

[BibT_eX]

[DOI]

Proceedings of the Iran Workshop on Communication and Information Theory, 2013

Operational extremality of Gaussianity in network compression, communication, and coding.

[BibT_eX]

[DOI]

Himanshu Asnani

Tsachy Weissman

Proceedings of the 2013 IEEE Information Theory Workshop, 2013

On efficient min-cut approximations in half-duplex relay networks.

[BibT_eX]

[DOI]

Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

2012

Worst-case source for distributed compression with quadratic distortion.

[BibT_eX]

[DOI]

Himanshu Asnani

Tsachy Weissman

Proceedings of the 2012 IEEE Information Theory Workshop, 2012

On the role of deterministic models in K × K × K wireless networks.

[BibT_eX]

[DOI]

Proceedings of the 2012 IEEE Information Theory Workshop, 2012

Bounds on the minimum energy-per-bit for bursty traffic in diamond networks.

[BibT_eX]

[DOI]

Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

Is Gaussian noise the worst-case additive noise in wireless networks?

[BibT_eX]

[DOI]

Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

2011

Two-Unicast Wireless Networks: Characterizing the Sum Degrees of Freedom

[BibT_eX]

[DOI]

CoRR, 2011

Sum degrees-of-freedom of two-unicast wireless networks.

[BibT_eX]

[DOI]