Michael Langberg

CoRR, 2024

2023

Multiple Key-cast over Networks.

[BibT_eX]

[DOI]

CoRR, 2023

Computationally Efficient Codes for Adversarial Binary-Erasure Channels.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2023

Competitive Channel-Capacity.

[BibT_eX]

[DOI]

Oron Sabag

Proceedings of the IEEE International Symposium on Information Theory, 2023

Perfect vs. Independent Feedback in the Multiple-Access Channel.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2023

2022

Latency and Alphabet Size in the Context of Multicast Network Coding.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2022

Network Coding Multicast Key-Capacity.

[BibT_eX]

[DOI]

Proceedings of the IEEE Information Theory Workshop, 2022

The Capacity of Causal Adversarial Channels.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2022

On the Benefit of Cooperation in Relay Networks.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2022

Group Testing on General Set-Systems.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2022

2021

Reduced-Rank L1-Norm Principal-Component Analysis With Performance Guarantees.

[BibT_eX]

[DOI]

Hossein Kamrani

Alireza Zolghadr-E-Asli

IEEE Trans. Signal Process., 2021

Negligible Cooperation: Contrasting the Maximal- and Average-Error Cases.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2021

The Birthday Problem and Zero-Error List Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2021

Beyond Capacity: The Joint Time-Rate Region.

[BibT_eX]

[DOI]

CoRR, 2021

Edge removal in undirected networks.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2021

Every Bit Counts: Second-Order Analysis of Cooperation in the Multiple-Access Channel.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2021

Minimizing the Alphabet Size in Codes with Restricted Error Sets.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2021

2020

The Edge-Removal Problem's Connections to the Zero-Error and $\delta$ -Dependence Problems in Network Coding.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2020

Towards an Operational Definition of Group Network Codes.

[BibT_eX]

[DOI]

Fei Wei

CoRR, 2020

Minimizing the alphabet size of erasure codes with restricted decoding sets.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2020

Symmetrizability for Myopic AVCs.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2020

2019

Sufficiently Myopic Adversaries Are Blind.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2019

The Capacity of Online (Causal) $q$ -Ary Error-Erasure Channels.

[BibT_eX]

[DOI]

Zitan Chen

IEEE Trans. Inf. Theory, 2019

H-wise Independence.

[BibT_eX]

[DOI]

Ishay Haviv

Chic. J. Theor. Comput. Sci., 2019

Topology Dependent Bounds For FAQs.

[BibT_eX]

[DOI]

Sai Vikneshwar Mani Jayaraman

Shi Li

Atri Rudra

Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2019

A Local Perspective on the Edge Removal Problem.

[BibT_eX]

[DOI]

Fei Wei

Proceedings of the IEEE International Symposium on Information Theory, 2019

The Interplay of Causality and Myopia in Adversarial Channel Models.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2019

Secure Network Coding in the Setting in Which a Non-Source Node May Generate Random Keys.

[BibT_eX]

[DOI]

Debaditya Chaudhuri

Proceedings of the IEEE International Symposium on Information Theory, 2019

2018

Can Negligible Rate Increase Network Reliability?

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2018

The Unbounded Benefit of Encoder Cooperation for the $k$ -User MAC.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2018

Single-Unicast Secure Network Coding and Network Error Correction are as Hard as Multiple-Unicast Network Coding.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2018

Can Negligible Cooperation Increase Network Capacity? The Average-Error Case.

[BibT_eX]

[DOI]

CoRR, 2018

Can Negligihle Cooperation Increase Capacity? The Average-Error Case.

[BibT_eX]

[DOI]

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

Quadratically Constrained Channels with Causal Adversaries.

[BibT_eX]

[DOI]

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

Trade-offs between Rate and Security in Linear Multicast Network Coding.

[BibT_eX]

[DOI]

Debaditya Chaudhuri

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

2017

Coding for the ℓ∞-Limited Permutation Channel.

[BibT_eX]

[DOI]

Moshe Schwartz

Eitan Yaakobi

IEEE Trans. Inf. Theory, 2017

A code equivalence between streaming network coding and streaming index coding.

[BibT_eX]

[DOI]

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

The benefit of encoder cooperation in the presence of state information.

[BibT_eX]

[DOI]

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

Two-way interference channels with jammers.

[BibT_eX]

[DOI]

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

Non-linear cyclic codes that attain the Gilbert-Varshamov bound.

[BibT_eX]

[DOI]

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

The effect of removing a network communication edge: Group network codes.

[BibT_eX]

[DOI]

Fei Wei

Proceedings of the 55th Annual Allerton Conference on Communication, 2017

2016

Graph Coloring.

[BibT_eX]

[DOI]

Chandra Chekuri

Encyclopedia of Algorithms, 2016

Communication Efficient Secret Sharing.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2016

Asymmetric Error Correction and Flash-Memory Rewriting Using Polar Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2016

Tight Network Topology Dependent Bounds on Rounds of Communication.

[BibT_eX]

[DOI]

Arkadev Chattopadhyay

Shi Li

Atri Rudra

Electron. Colloquium Comput. Complex., 2016

The Unbounded Benefit of Encoder Cooperation for the $k$-User MAC (Extended Version).

[BibT_eX]

[DOI]

CoRR, 2016

Can Negligible Cooperation Increase Network Reliability? (Extended Version).

[BibT_eX]

[DOI]

CoRR, 2016

The benefit of a 1-bit jump-start, and the necessity of stochastic encoding, in jamming channels.

[BibT_eX]

[DOI]

CoRR, 2016

On tightness of an entropic region outer bound for network coding and the edge removal property.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2016

Can negligible cooperation increase network reliability?

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2016

A characterization of the capacity region for network coding with dependent sources.

[BibT_eX]

[DOI]

Woong Kim

Proceedings of the IEEE International Symposium on Information Theory, 2016

A bit of delay is sufficient and stochastic encoding is necessary to overcome online adversarial erasures.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2016

On the Capacity Advantage of a Single Bit.

[BibT_eX]

[DOI]

Proceedings of the 2016 IEEE Globecom Workshops, Washington, DC, USA, December 4-8, 2016, 2016

2015

A Characterization of the Number of Subsequences Obtained via the Deletion Channel.

[BibT_eX]

[DOI]

Yuvalal Liron

IEEE Trans. Inf. Theory, 2015

Coded Cooperative Data Exchange Problem for General Topologies.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2015

An Equivalence Between Network Coding and Index Coding.

[BibT_eX]

[DOI]

Salim Y. El Rouayheb

IEEE Trans. Inf. Theory, 2015

The Multivariate Covering Lemma and its Converse.

[BibT_eX]

[DOI]

CoRR, 2015

On the Cost and Benefit of Cooperation (Extended Version).

[BibT_eX]

[DOI]

CoRR, 2015

A Characterization of the Capacity of Online (causal) Binary Channels.

[BibT_eX]

[DOI]

Zitan Chen

Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015

On the fundamental limits of caching in combination networks.

[BibT_eX]

[DOI]

Proceedings of the 16th IEEE International Workshop on Signal Processing Advances in Wireless Communications, 2015

On an equivalence of the reduction of k-unicast to 2-unicast capacity and the edge removal property.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2015

On the cost and benefit of cooperation.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2015

Coding for the ℓ∞-limited permutation channel.

[BibT_eX]

[DOI]

Moshe Schwartz

Eitan Yaakobi

Proceedings of the IEEE International Symposium on Information Theory, 2015

Connecting multiple-unicast and network error correction: Reduction and unachievability.

[BibT_eX]

[DOI]

Wentao Huang

Jörg Kliewer

Proceedings of the IEEE International Symposium on Information Theory, 2015

2014

Network Codes Resilient to Jamming and Eavesdropping.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 2014

On the Power of Cooperation: Can a Little Help a Lot? (Extended Version).

[BibT_eX]

[DOI]

CoRR, 2014

Is there a canonical network for network information theory?

[BibT_eX]

[DOI]

Proceedings of the 2014 IEEE Information Theory Workshop, 2014

Linear capacity equivalence between multiple multicast and multiple unicast.

[BibT_eX]

[DOI]

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

Graph theory versus minimum rank for index coding.

[BibT_eX]

[DOI]

Karthikeyan Shanmugam

Alexandros G. Dimakis

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

On the power of cooperation: Can a little help a lot?

[BibT_eX]

[DOI]

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

Reverse edge cut-set bounds for secure network coding.

[BibT_eX]

[DOI]

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

Polar coding for noisy write-once memories.

[BibT_eX]

[DOI]

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

Single-source/sink network error correction is as hard as multiple-unicast.

[BibT_eX]

[DOI]

Proceedings of the 52nd Annual Allerton Conference on Communication, 2014

2013

Trajectory Codes for Flash Memory.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2013

Generalized Gray Codes for Local Rank Modulation.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2013

Upper Bounds on the Capacity of Binary Channels With Causal Adversaries.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2013

Codes Against Online Adversaries: Large Alphabets.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2013

Communicating the Sum of Sources Over a Network.

[BibT_eX]

[DOI]

Aditya Ramamoorthy

IEEE J. Sel. Areas Commun., 2013

Routing for Security in Networks with Adversarial Nodes

[BibT_eX]

[DOI]

CoRR, 2013

Zero vs. epsilon Error in Interference Channels.

[BibT_eX]

[DOI]

CoRR, 2013

On secure network coding with uniform wiretap sets.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Network Coding, 2013

Routing for security in networks with adversarial nodes.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Network Coding, 2013

Zero vs. ε error in interference channels.

[BibT_eX]

[DOI]

Proceedings of the 2013 IEEE Information Theory Workshop, 2013

Outer bounds and a functional study of the edge removal problem.

[BibT_eX]

[DOI]

Eun Jee Lee

Proceedings of the 2013 IEEE Information Theory Workshop, 2013

Error correcting code for flash memories.

[BibT_eX]

[DOI]

Proceedings of the 2013 Information Theory and Applications Workshop, 2013

Sequence reconstruction for Grassmann graphs and permutations.

[BibT_eX]

[DOI]

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

Information-theoretic study of voting systems.

[BibT_eX]

[DOI]

Eitan Yaakobi

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

On a capacity equivalence between network and index coding and the edge removal problem.

[BibT_eX]

[DOI]

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

Local graph coloring and index coding.

[BibT_eX]

[DOI]

Karthikeyan Shanmugam

Alexandros G. Dimakis

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

Joint rewriting and error correction in write-once memories.

[BibT_eX]

[DOI]

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

On a capacity equivalence between multiple multicast and multiple unicast.

[BibT_eX]

[DOI]

Proceedings of the 51st Annual Allerton Conference on Communication, 2013

2012

Edge distribution in generalized graph products

[BibT_eX]

[DOI]

Dan Vilenchik

CoRR, 2012

f-Sensitivity Distance Oracles and Routing Schemes.

[BibT_eX]

[DOI]

Algorithmica, 2012

Source coding for dependent sources.

[BibT_eX]

[DOI]

Proceedings of the 2012 IEEE Information Theory Workshop, 2012

On linear index coding for random graphs.

[BibT_eX]

[DOI]

Ishay Haviv

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

Improved upper bounds on the capacity of binary channels with causal adversaries.

[BibT_eX]

[DOI]

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

2011

On the Hardness of Approximating the Network Coding Capacity.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2011

Constant-Weight Gray Codes for Local Rank Modulation.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2011

A unified framework for approximating and clustering data.

[BibT_eX]

[DOI]

Dan Feldman

Proceedings of the 43rd ACM Symposium on Theory of Computing, 2011

Beating the Gilbert-Varshamov bound for online channels.

[BibT_eX]

[DOI]

Ishay Haviv

Mohammad Asad R. Chaudhry

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

On the complementary Index Coding problem.

[BibT_eX]

[DOI]

Zakia Asad

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

Index coding with outerplanar side information.

[BibT_eX]

[DOI]

Yossi Berliner

Mohammad Asad R. Chaudhry

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

Finding Sparse Solutions for the Index Coding Problem.

[BibT_eX]

[DOI]

Zakia Asad

Proceedings of the Global Communications Conference, 2011

Network coding: Is zero error always possible?

[BibT_eX]

[DOI]

Proceedings of the 49th Annual Allerton Conference on Communication, 2011

2010

Clustering lines in high-dimensional space: Classification of incomplete data.

[BibT_eX]

[DOI]

Jie Gao

ACM Trans. Algorithms, 2010

Approximating Maximum Subgraphs without Short Cycles.

[BibT_eX]

[DOI]

Guy Kortsarz

Zeev Nutov

SIAM J. Discret. Math., 2010

Fault Tolerant Spanners for General Graphs.

[BibT_eX]

[DOI]

SIAM J. Comput., 2010

Realtime Classification for Encrypted Traffic.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms, 9th International Symposium, 2010

Universal epsilon-approximators for Integrals.

[BibT_eX]

[DOI]

Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Communicating the sum of sources in a 3-sources/3-terminals network; revisited.

[BibT_eX]

[DOI]

Aditya Ramamoorthy

Proceedings of the IEEE International Symposium on Information Theory, 2010

Data movement and aggregation in flash memories.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2010

Coding against delayed adversaries.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2010

One-shot capacity of discrete channels.

[BibT_eX]

[DOI]

Rui A. Costa

João Barros

Proceedings of the IEEE International Symposium on Information Theory, 2010

f-Sensitivity Distance Oracles and Routing Schemes.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2010

2009

Network Coding: A Computational Perspective.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2009

Contraction and Expansion of Convex Sets.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2009

The Dense k Subgraph problem

[BibT_eX]

[DOI]

Doron Goldstein

CoRR, 2009

Communicating the sum of sources in a 3-sources/3-terminals network.

[BibT_eX]

[DOI]

Aditya Ramamoorthy

Proceedings of the IEEE International Symposium on Information Theory, 2009

Binary causal-adversary channels.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2009

Universal rewriting in constrained memories.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2009

On the multiple unicast network coding, conjecture.

[BibT_eX]

[DOI]

Muriel Médard

Proceedings of the 47th Annual Allerton Conference on Communication, 2009

Data movement in flash memories.

[BibT_eX]

[DOI]

Proceedings of the 47th Annual Allerton Conference on Communication, 2009

Codes against online adversaries.

[BibT_eX]

[DOI]

Proceedings of the 47th Annual Allerton Conference on Communication, 2009

2008

Graph Coloring.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Optimal Universal Schedules for Discrete Broadcast.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2008

Oblivious Communication Channels and Their Capacity.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2008

Resilient Network Coding in the Presence of Byzantine Adversaries.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2008

Analysis of Incomplete Data and an Intrinsic-Dimension Helly Theorem.

[BibT_eX]

[DOI]

Jie Gao

Discret. Comput. Geom., 2008

"Real" Slepian-Wolf Codes

[BibT_eX]

[DOI]

CoRR, 2008

"Real" Slepian-Wolf codes.

[BibT_eX]

[DOI]

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

Adversarial models and resilient schemes for network coding.

[BibT_eX]

[DOI]

Leah Nutman

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

2007

The multi-multiway cut problem.

[BibT_eX]

[DOI]

Adi Avidor

Theor. Comput. Sci., 2007

Distributed broadcasting and mapping protocols in directed anonymous networks.

[BibT_eX]

[DOI]

Moshe Schwartz

Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, 2007

Resilient network codes in the presence of eavesdropping Byzantine adversaries.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2007

Resilient Network Coding in the Presence of Byzantine Adversaries.

[BibT_eX]

[DOI]

Proceedings of the INFOCOM 2007. 26th IEEE International Conference on Computer Communications, 2007

2006

The encoding complexity of network coding.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2006

The RPR2 rounding technique for semidefinite programs.

[BibT_eX]

[DOI]

J. Algorithms, 2006

Oblivious channels.

[BibT_eX]

[DOI]

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

Approximation Algorithms for Graph Homomorphism Problems.

[BibT_eX]

[DOI]

Yuval Rabani

Chaitanya Swamy

Proceedings of the Approximation, 2006

2005

Staleness vs. waiting time in universal discrete broadcast.

[BibT_eX]

[DOI]

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

Correction of adversarial errors in networks.

[BibT_eX]

[DOI]

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

2004

Graphs with Tiny Vector Chromatic Numbers and Huge Chromatic Numbers.

[BibT_eX]

[DOI]

Gideon Schechtman

SIAM J. Comput., 2004

Private Codes or Succinct Random Codes That Are (Almost) Perfect.

[BibT_eX]

[DOI]

Proceedings of the 45th Symposium on Foundations of Computer Science (FOCS 2004), 2004

2003

Testing the independence number of hypergraphs

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2003

The ROBDD Size of Simple CNF Formulas.

[BibT_eX]

[DOI]

Amir Pnueli

Yoav Rodeh

Proceedings of the Correct Hardware Design and Verification Methods, 2003

2001

Approximation Algorithms for Maximization Problems Arising in Graph Partitioning.

[BibT_eX]

[DOI]

J. Algorithms, 2001

A note on approximating Max-Bisection on regular graphs.

[BibT_eX]

[DOI]

Marek Karpinski

Inf. Process. Lett., 2001

2000

Improved Approximation of MAX-CUT on Graphs of Bounded Degree

[BibT_eX]

[DOI]

Marek Karpinski

Electron. Colloquium Comput. Complex., 2000

On the hardness of approximating N P witnesses.

[BibT_eX]

[DOI]