Ilan Shomorony

IEEE Trans. Inf. Theory, August, 2024

Fundamental Limits of Reference-Based Sequence Reordering.

[BibT_eX]

[DOI]

Nir Weinberger

IEEE Trans. Inf. Theory, July, 2024

DNA Merge-Sort: A Family of Nested Varshamov-Tenengolts Reassembly Codes for Out-of-Order Media.

[BibT_eX]

[DOI]

Sajjad Nassirpour

IEEE Trans. Commun., March, 2024

An Information Theory for Out-of-Order Media With Applications in DNA Data Storage.

[BibT_eX]

[DOI]

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

The Metagenomic Binning Problem: Clustering Markov Sequences.

[BibT_eX]

[DOI]

Grant Greenberg

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

Reducing Data Fragmentation in Data Deduplication Systems via Partial Repetition and Coding.

[BibT_eX]

[DOI]

CoRR, 2024

Capacity-Aware Planning and Scheduling in Budget-Constrained Monotonic MDPs: A Meta-RL Approach.

[BibT_eX]

[DOI]

Manav Vora

Melkior Ornik

CoRR, 2024

Recovering a Message from an Incomplete Set of Noisy Fragments.

[BibT_eX]

[DOI]

CoRR, 2024

Capacity of Frequency-based Channels: Encoding Information in Molecular Concentrations.

[BibT_eX]

[DOI]

Yuval Gerzon

Nir Weinberger

Proceedings of the IEEE International Symposium on Information Theory, 2024

Faster Maximum Inner Product Search in High Dimensions.

[BibT_eX]

[DOI]

Proceedings of the Forty-first International Conference on Machine Learning, 2024

An Instance-Based Approach to the Trace Reconstruction Problem.

[BibT_eX]

[DOI]

Proceedings of the 58th Annual Conference on Information Sciences and Systems, 2024

2023

LexicHash: sequence similarity estimation via lexicographic comparison of hashes.

[BibT_eX]

[DOI]

Grant Greenberg

Bioinform., October, 2023

BanditPAM++: Faster k-medoids Clustering.

[BibT_eX]

[DOI]

CoRR, 2023

Utilizing Free Clients in Federated Learning for Focused Model Enhancement.

[BibT_eX]

[DOI]

CoRR, 2023

On Constant-Weight Binary B<sub>2</sub>-Sequences.

[BibT_eX]

[DOI]

CoRR, 2023

BanditPAM++: Faster k-medoids Clustering.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Efficient Learning of Linear Graph Neural Networks via Node Subsampling.

[BibT_eX]

[DOI]

Seiyun Shin

Han Zhao

Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

On Constant-Weight Binary B2-Sequences.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2023

Finding a Burst of Positives via Nonadaptive Semiquantitative Group Testing.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2023

Fundamental Limits of Multiple Sequence Reconstruction from Substrings.

[BibT_eX]

[DOI]

Kel Levick

Proceedings of the IEEE International Symposium on Information Theory, 2023

Adaptive Power Method: Eigenvector Estimation from Sampled Data.

[BibT_eX]

[DOI]

Seiyun Shin

Han Zhao

Proceedings of the International Conference on Algorithmic Learning Theory, 2023

2022

Coded Shotgun Sequencing.

[BibT_eX]

[DOI]

IEEE J. Sel. Areas Inf. Theory, 2022

Information-Theoretic Foundations of DNA Data Storage.

[BibT_eX]

[DOI]

Found. Trends Commun. Inf. Theory, 2022

Faster Maximum Inner Product Search in High Dimensions.

[BibT_eX]

[DOI]

CoRR, 2022

MABSplit: Faster Forest Training Using Multi-Armed Bandits.

[BibT_eX]

[DOI]

CoRR, 2022

Reassembly Codes for the Chop-and-Shuffle Channel.

[BibT_eX]

[DOI]

Sajjad Nassirpour

CoRR, 2022

A Game-Theoretically Optimal Defense Paradigm against Traffic Analysis Attacks using Multipath Routing and Deception.

[BibT_eX]

[DOI]

Proceedings of the SACMAT '22: The 27th ACM Symposium on Access Control Models and Technologies, New York, NY, USA, June 8, 2022

MABSplit: Faster Forest Training Using Multi-Armed Bandits.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

CVQVAE: A representation learning based method for multi-omics single cell data integration.

[BibT_eX]

[DOI]

Tianyu Liu

Grant Greenberg

Proceedings of the Machine Learning in Computational Biology, 21-22 November 2022, Online, 2022

Capacity of the Shotgun Sequencing Channel.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2022

Fundamental Limits of Multi-Sample Flow Graph Decomposition.

[BibT_eX]

[DOI]

Sreeram Kannan

William Stafford Noble

Proceedings of the IEEE International Symposium on Information Theory, 2022

Achieving the Capacity of a DNA Storage Channel with Linear Coding Schemes.

[BibT_eX]

[DOI]

Kel Levick

Proceedings of the 56th Annual Conference on Information Sciences and Systems, 2022

2021

Torn-Paper Coding.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2021

DNA-Based Storage: Models and Fundamental Limits.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2021

A cost-based analysis for risk-averse explore-then-commit finite-time bandits.

[BibT_eX]

[DOI]

IISE Trans., 2021

Sketching and Sequence Alignment: A Rate-Distortion Perspective.

[BibT_eX]

[DOI]

Govinda M. Kamath

Proceedings of the IEEE International Symposium on Information Theory, 2021

Capacity of the Torn Paper Channel with Lost Pieces.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2021

2020

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

[BibT_eX]

[DOI]

Patterns, 2020

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

[BibT_eX]

[DOI]

CoRR, 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

Private DNA Sequencing: Hiding Information in Discrete Noise.

[BibT_eX]

[DOI]

Roy Dong

Proceedings of the IEEE Information Theory Workshop, 2020

Capacity of the Erasure Shuffling Channel.

[BibT_eX]

[DOI]

Seiyun Shin

Proceedings of the 2020 IEEE International Conference on Acoustics, 2020

Communicating over the Torn-Paper Channel.

[BibT_eX]

[DOI]

Proceedings of the IEEE Global Communications Conference, 2020

2019

Capacity Results for the Noisy Shuffling Channel.

[BibT_eX]

[DOI]

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]

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]