Key-Cast Over Networks - Michael Langberg; Michelle Effros (IEEE Trans. Inf. Theory, 2025)

Bounds on Box Codes - Michael Langberg; Moshe Schwartz; Itzhak Tamo (CoRR, 2025)

On Subset Retrieval and Group Testing Problems with Differential Privacy Constraints - Mira Gonen; Michael Langberg; Alex Sprintson (CoRR, 2025)

Switched Feedback for the Multiple-Access Channel - Oliver Kosut; Michael Langberg; Michelle Effros (CoRR, 2025)

Sliding Window Adversarial Channels - Bikash Kumar Dey; Sidharth Jaggi; Michael Langberg; Anand D. Sarwate; Yihan Zhang (CoRR, 2025)

Codes for Adversaries: Between Worst-Case and Average-Case Jamming - Bikash Kumar Dey; Sidharth Jaggi; Michael Langberg; Anand D. Sarwate; Yihan Zhang (Found. Trends Commun. Inf. Theory, 2024)

Minimizing the Alphabet Size in Codes With Restricted Error Sets - Mira Gonen; Ishay Haviv; Michael Langberg; Alex Sprintson (IEEE Trans. Inf. Theory, 2024)

Competitive Channel-Capacity - Michael Langberg; Oron Sabag (IEEE Trans. Inf. Theory, 2024)

Competitive Analysis of Arbitrary Varying Channels - Michael Langberg; Oron Sabag (IEEE International Symposium on Information Theory, ISIT 2024, Athens, Greece, July 7-12, 2024, 2024)

Characterizing positive-rate secure multicast network coding with eavesdropping nodes - Michael Langberg; Michelle Effros (IEEE International Symposium on Information Theory, ISIT 2024, Athens, Greece, July 7-12, 2024, 2024)

Computationally Efficient Codes for Strongly Dobrushin-Stambler Nonsymmetrizable Oblivious AVCs - Bikash Kumar Dey; Sidharth Jaggi; Michael Langberg; Anand D. Sarwate; Y. Zhang (IEEE International Symposium on Information Theory, ISIT 2024, Athens, Greece, July 7-12, 2024, 2024)

Nobody Expects a Differential Equation: Minimum Energy-Per-Bit for the Gaussian Relay Channel with Rank-1 Linear Relaying - Oliver Kosut; Michelle Effros; Michael Langberg (IEEE International Symposium on Information Theory, ISIT 2024, Athens, Greece, July 7-12, 2024, 2024)

Nobody Expects a Differential Equation: Minimum Energy-Per-Bit for the Gaussian Relay Channel with Rank-1 Linear Relaying - Oliver Kosut; Michelle Effros; Michael Langberg (CoRR, 2024)

Dynamic D2D-Assisted Federated Learning over O-RAN: Performance Analysis, MAC Scheduler, and Asymmetric User Selection - Payam Abdisarabshali; Kwang Taik Kim; Michael Langberg; Weifeng Su; Seyyedali Hosseinalipour (CoRR, 2024)

Characterizing positive-rate key-cast (and multicast network coding) with eavesdropping nodes - Michael Langberg; Michelle Effros (CoRR, 2024)

Competitive Analysis of Arbitrary Varying Channels - Michael Langberg; Oron Sabag (CoRR, 2024)

Computationally Efficient Codes for Adversarial Binary-Erasure Channels - Sijie Li; Prasad Krishnan; Sidharth Jaggi; Michael Langberg; Anand D. Sarwate (IEEE International Symposium on Information Theory, ISIT 2023, Taipei, Taiwan, June 25-30, 2023, 2023)

Competitive Channel-Capacity - Michael Langberg; Oron Sabag (IEEE International Symposium on Information Theory, ISIT 2023, Taipei, Taiwan, June 25-30, 2023, 2023)

Perfect vs. Independent Feedback in the Multiple-Access Channel - Oliver Kosut; Michelle Effros; Michael Langberg (IEEE International Symposium on Information Theory, ISIT 2023, Taipei, Taiwan, June 25-30, 2023, 2023)

Multiple Key-cast over Networks - Michael Langberg; Michelle Effros (CoRR, 2023)

Perfect vs. Independent Feedback in the Multiple-Access Channel - Oliver Kosut; Michelle Effros; Michael Langberg (CoRR, 2023)

Competitive Channel-Capacity - Michael Langberg; Oron Sabag (CoRR, 2023)

Latency and Alphabet Size in the Context of Multicast Network Coding - Mira Gonen; Michael Langberg; Alex Sprintson (IEEE Trans. Inf. Theory, 2022)

Group Testing on General Set-Systems - Mira Gonen; Michael Langberg; Alex Sprintson (IEEE International Symposium on Information Theory, ISIT 2022, Espoo, Finland, June 26 - July 1, 2022, 2022)

On the Benefit of Cooperation in Relay Networks - Oliver Kosut; Michelle Effros; Michael Langberg (IEEE International Symposium on Information Theory, ISIT 2022, Espoo, Finland, June 26 - July 1, 2022, 2022)

The Capacity of Causal Adversarial Channels - Yihan Zhang; Sidharth Jaggi; Michael Langberg; Anand D. Sarwate (IEEE International Symposium on Information Theory, ISIT 2022, Espoo, Finland, June 26 - July 1, 2022, 2022)

Network Coding Multicast Key-Capacity - Michael Langberg; Michelle Effros (IEEE Information Theory Workshop, ITW 2022, Mumbai, India, November 1-9, 2022, 2022)

On the Benefit of Cooperation in Relay Networks - Oliver Kosut; Michelle Effros; Michael Langberg (CoRR, 2022)

Network Coding Multicast Key-Capacity - Michael Langberg; Michelle Effros (CoRR, 2022)

Group Testing on General Set-Systems - Mira Gonen; Michael Langberg; Alex Sprintson (CoRR, 2022)

The Capacity of Causal Adversarial Channels - Yihan Zhang; Sidharth Jaggi; Michael Langberg; Anand D. Sarwate (CoRR, 2022)

The Birthday Problem and Zero-Error List Codes - Parham Noorzad; Michelle Effros; Michael Langberg; Victoria Kostina (IEEE Trans. Inf. Theory, 2021)

Negligible Cooperation: Contrasting the Maximal- and Average-Error Cases - Parham Noorzad; Michael Langberg; Michelle Effros (IEEE Trans. Inf. Theory, 2021)

Reduced-Rank L1-Norm Principal-Component Analysis With Performance Guarantees - Hossein Kamrani; Alireza Zolghadr-E-Asli; Panos P. Markopoulos; Michael Langberg; Dimitris A. Pados; George N. Karystinos (IEEE Trans. Signal Process., 2021)

Minimizing the Alphabet Size in Codes with Restricted Error Sets - Mira Gonen; Michael Langberg; Alex Sprintson (IEEE International Symposium on Information Theory, ISIT 2021, Melbourne, Australia, July 12-20, 2021, 2021)

Edge removal in undirected networks - Michael Langberg; Michelle Effros (IEEE International Symposium on Information Theory, ISIT 2021, Melbourne, Australia, July 12-20, 2021, 2021)

Every Bit Counts: Second-Order Analysis of Cooperation in the Multiple-Access Channel - Oliver Kosut; Michelle Effros; Michael Langberg (IEEE International Symposium on Information Theory, ISIT 2021, Melbourne, Australia, July 12-20, 2021, 2021)

Beyond Capacity: The Joint Time-Rate Region - Michael Langberg; Michelle Effros (CoRR, 2021)

Every Bit Counts: Second-Order Analysis of Cooperation in the Multiple-Access Channel - Oliver Kosut; Michelle Effros; Michael Langberg (CoRR, 2021)

Minimizing the alphabet size in codes with restricted error sets - Mira Gonen; Michael Langberg; Alex Sprintson (CoRR, 2021)

The Edge-Removal Problem's Connections to the Zero-Error and \delta -Dependence Problems in Network Coding - Michael Langberg; Michelle Effros (IEEE Trans. Inf. Theory, 2020)

Minimizing the alphabet size of erasure codes with restricted decoding sets - Mira Gonen; Ishay Haviv; Michael Langberg; Alex Sprintson (IEEE International Symposium on Information Theory, ISIT 2020, Los Angeles, CA, USA, June 21-26, 2020, 2020)

Symmetrizability for Myopic AVCs - Amitalok J. Budkuley; Bikash Kumar Dey; Sidharth Jaggi; Michael Langberg; Anand D. Sarwate; Carol Wang (IEEE International Symposium on Information Theory, ISIT 2020, Los Angeles, CA, USA, June 21-26, 2020, 2020)

Towards an Operational Definition of Group Network Codes - Fei Wei; Michael Langberg; Michelle Effros (CoRR, 2020)

Topology Dependent Bounds For FAQs - Michael Langberg; Shi Li; Sai Vikneshwar Mani Jayaraman; Atri Rudra (CoRR, 2020)

Minimizing the alphabet size of erasure codes with restricted decoding sets - Mira Gonen; Ishay Haviv; Michael Langberg; Alex Sprintson (CoRR, 2020)

Edge removal in undirected networks - Michael Langberg; Michelle Effros (CoRR, 2020)

H-wise Independence - Ishay Haviv; Michael Langberg (Chic. J. Theor. Comput. Sci., 2019)

The Capacity of Online (Causal) q -Ary Error-Erasure Channels - Zitan Chen; Sidharth Jaggi; Michael Langberg (IEEE Trans. Inf. Theory, 2019)

Sufficiently Myopic Adversaries Are Blind - Bikash Kumar Dey; Sidharth Jaggi; Michael Langberg (IEEE Trans. Inf. Theory, 2019)

A Local Perspective on the Edge Removal Problem - Fei Wei; Michael Langberg; Michelle Effros (IEEE International Symposium on Information Theory, ISIT 2019, Paris, France, July 7-12, 2019, 2019)

The Interplay of Causality and Myopia in Adversarial Channel Models - Bikash Kumar Dey; Sidharth Jaggi; Michael Langberg; Anand D. Sarwate; Carol Wang (IEEE International Symposium on Information Theory, ISIT 2019, Paris, France, July 7-12, 2019, 2019)

Secure Network Coding in the Setting in Which a Non-Source Node May Generate Random Keys - Debaditya Chaudhuri; Michael Langberg; Michelle Effros (IEEE International Symposium on Information Theory, ISIT 2019, Paris, France, July 7-12, 2019, 2019)

Topology Dependent Bounds For FAQs - Michael Langberg; Shi Li; Sai Vikneshwar Mani Jayaraman; Atri Rudra (Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, PODS 2019, Amsterdam, The Netherlands, June 30 - July 5, 2019, 2019)

A Local Perspective on the Edge Removal Problem - Fei Wei; Michael Langberg; Michelle Effros (CoRR, 2019)

Secure Network Coding in the Setting in Which a Non-Source Node May Generate Random Keys - Debaditya Chaudhuri; Michael Langberg; Michelle Effros (CoRR, 2019)

Negligible Cooperation: Contrasting the Maximal- and Average-Error Cases - Parham Noorzad; Michael Langberg; Michelle Effros (CoRR, 2019)

The Unbounded Benefit of Encoder Cooperation for the k -User MAC - Parham Noorzad; Michelle Effros; Michael Langberg (IEEE Trans. Inf. Theory, 2018)

Can Negligible Rate Increase Network Reliability? - Parham Noorzad; Michelle Effros; Michael Langberg (IEEE Trans. Inf. Theory, 2018)

Single-Unicast Secure Network Coding and Network Error Correction are as Hard as Multiple-Unicast Network Coding - Wentao Huang; Tracey Ho; Michael Langberg; Jörg Kliewer (IEEE Trans. Inf. Theory, 2018)

Latency and Alphabet Size in the Context of Multicast Network Coding - Mira Gonen; Michael Langberg; Alex Sprintson (56th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2018, Monticello, IL, USA, October 2-5, 2018, 2018)

Quadratically Constrained Channels with Causal Adversaries - Tongxin Li; Bikash Kumar Dey; Sidharth Jaggi; Michael Langberg; Anand D. Sarwate (2018 IEEE International Symposium on Information Theory, ISIT 2018, Vail, CO, USA, June 17-22, 2018, 2018)

Trade-offs between Rate and Security in Linear Multicast Network Coding - Debaditya Chaudhuri; Michael Langberg (2018 IEEE International Symposium on Information Theory, ISIT 2018, Vail, CO, USA, June 17-22, 2018, 2018)

Can Negligihle Cooperation Increase Capacity? The Average-Error Case - Parham Noorzad; Michelle Effros; Michael Langberg (2018 IEEE International Symposium on Information Theory, ISIT 2018, Vail, CO, USA, June 17-22, 2018, 2018)

Can Negligible Cooperation Increase Network Capacity? The Average-Error Case - Parham Noorzad; Michelle Effros; Michael Langberg (CoRR, 2018)

The Birthday Problem and Zero-Error List Codes - Parham Noorzad; Michelle Effros; Michael Langberg; Victoria Kostina (CoRR, 2018)

Quadratically Constrained Channels with Causal Adversaries - Tongxin Li; Bikash Kumar Dey; Sidharth Jaggi; Michael Langberg; Anand D. Sarwate (CoRR, 2018)

Coding for the \(l\)\(_\(∞\)\)-Limited Permutation Channel - Michael Langberg; Moshe Schwartz; Eitan Yaakobi (IEEE Trans. Inf. Theory, 2017)

The effect of removing a network communication edge: Group network codes - Fei Wei; Michael Langberg (55th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2017, Monticello, IL, USA, October 3-6, 2017, 2017)

The benefit of encoder cooperation in the presence of state information - Parham Noorzad; Michelle Effros; Michael Langberg (2017 IEEE International Symposium on Information Theory, ISIT 2017, Aachen, Germany, June 25-30, 2017, 2017)

Two-way interference channels with jammers - Sidharth Jaggi; Michael Langberg (2017 IEEE International Symposium on Information Theory, ISIT 2017, Aachen, Germany, June 25-30, 2017, 2017)

Non-linear cyclic codes that attain the Gilbert-Varshamov bound - Ishay Haviv; Michael Langberg; Moshe Schwartz; Eitan Yaakobi (2017 IEEE International Symposium on Information Theory, ISIT 2017, Aachen, Germany, June 25-30, 2017, 2017)

A code equivalence between streaming network coding and streaming index coding - Ming Fai Wong; Michelle Effros; Michael Langberg (2017 IEEE International Symposium on Information Theory, ISIT 2017, Aachen, Germany, June 25-30, 2017, 2017)

The birthday problem and zero-error list codes - Parham Noorzad; Michelle Effros; Michael Langberg; Victoria Kostina (2017 IEEE International Symposium on Information Theory, ISIT 2017, Aachen, Germany, June 25-30, 2017, 2017)

Tight Network Topology Dependent Bounds on Rounds of Communication - Arkadev Chattopadhyay; Michael Langberg; Shi Li; Atri Rudra (Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017, Barcelona, Spain, Hotel Porta Fira, January 16-19, 2017)

Non-linear Cyclic Codes that Attain the Gilbert-Varshamov Bound - Ishay Haviv; Michael Langberg; Moshe Schwartz; Eitan Yaakobi (CoRR, 2017)

The Benefit of Encoder Cooperation in the Presence of State Information - Parham Noorzad; Michelle Effros; Michael Langberg (CoRR, 2017)

Asymmetric Error Correction and Flash-Memory Rewriting Using Polar Codes - Eyal En Gad; Yue Li; Jörg Kliewer; Michael Langberg; Anxiao Andrew Jiang; Jehoshua Bruck (IEEE Trans. Inf. Theory, 2016)

Communication Efficient Secret Sharing - Wentao Huang; Michael Langberg; Jörg Kliewer; Jehoshua Bruck (IEEE Trans. Inf. Theory, 2016)

On the Capacity Advantage of a Single Bit - Michael Langberg; Michelle Effros (2016 IEEE Globecom Workshops, Washington, DC, USA, December 4-8, 2016, 2016)

The unbounded benefit of encoder cooperation for the k-user MAC - Parham Noorzad; Michelle Effros; Michael Langberg (IEEE International Symposium on Information Theory, ISIT 2016, Barcelona, Spain, July 10-15, 2016, 2016)

A bit of delay is sufficient and stochastic encoding is necessary to overcome online adversarial erasures - Bikash Kumar Dey; Sidharth Jaggi; Michael Langberg; Anand D. Sarwate (IEEE International Symposium on Information Theory, ISIT 2016, Barcelona, Spain, July 10-15, 2016, 2016)

The capacity of online (causal) q-ary error-erasure channels - Zitan Chen; Sidharth Jaggi; Michael Langberg (IEEE International Symposium on Information Theory, ISIT 2016, Barcelona, Spain, July 10-15, 2016, 2016)

A characterization of the capacity region for network coding with dependent sources - Woong Kim; Michael Langberg; Michelle Effros (IEEE International Symposium on Information Theory, ISIT 2016, Barcelona, Spain, July 10-15, 2016, 2016)

On tightness of an entropic region outer bound for network coding and the edge removal property - Ming Fai Wong; Michelle Effros; Michael Langberg (IEEE International Symposium on Information Theory, ISIT 2016, Barcelona, Spain, July 10-15, 2016, 2016)

Can negligible cooperation increase network reliability? - Parham Noorzad; Michelle Effros; Michael Langberg (IEEE International Symposium on Information Theory, ISIT 2016, Barcelona, Spain, July 10-15, 2016, 2016)

Graph Coloring - Michael Langberg; Chandra Chekuri (Encyclopedia of Algorithms, 2016)

Can Negligible Cooperation Increase Network Reliability? (Extended Version) - Parham Noorzad; Michelle Effros; Michael Langberg (CoRR, 2016)

The Unbounded Benefit of Encoder Cooperation for the k-User MAC (Extended Version) - Parham Noorzad; Michelle Effros; Michael Langberg (CoRR, 2016)

The Capacity of Online (Causal) q-ary Error-Erasure Channels - Zitan Chen; Sidharth Jaggi; Michael Langberg (CoRR, 2016)

The benefit of a 1-bit jump-start, and the necessity of stochastic encoding, in jamming channels - Bikash Kumar Dey; Sidharth Jaggi; Michael Langberg; Anand D. Sarwate (CoRR, 2016)

On the Capacity Advantage of a Single Bit - Michael Langberg; Michelle Effros (CoRR, 2016)

Tight Network Topology Dependent Bounds on Rounds of Communication - Arkadev Chattopadhyay; Michael Langberg; Shi Li; Atri Rudra (CoRR, 2016)

Sufficiently Myopic Adversaries are Blind - Bikash Kumar Dey; Sidharth Jaggi; Michael Langberg (CoRR, 2016)

Tight Network Topology Dependent Bounds on Rounds of Communication - Arkadev Chattopadhyay; Michael Langberg; Shi Li; Atri Rudra (Electron. Colloquium Comput. Complex., 2016)

A Characterization of the Number of Subsequences Obtained via the Deletion Channel - Yuvalal Liron; Michael Langberg (IEEE Trans. Inf. Theory, 2015)

An Equivalence Between Network Coding and Index Coding - Michelle Effros; Salim Y. El Rouayheb; Michael Langberg (IEEE Trans. Inf. Theory, 2015)

Coded Cooperative Data Exchange Problem for General Topologies - Mira Gonen; Michael Langberg (IEEE Trans. Inf. Theory, 2015)

On the cost and benefit of cooperation - Parham Noorzad; Michelle Effros; Michael Langberg (IEEE International Symposium on Information Theory, ISIT 2015, Hong Kong, China, June 14-19, 2015, 2015)

Connecting multiple-unicast and network error correction: Reduction and unachievability - Wentao Huang; Michael Langberg; Jörg Kliewer (IEEE International Symposium on Information Theory, ISIT 2015, Hong Kong, China, June 14-19, 2015, 2015)

On an equivalence of the reduction of k-unicast to 2-unicast capacity and the edge removal property - Ming Fai Wong; Michelle Effros; Michael Langberg (IEEE International Symposium on Information Theory, ISIT 2015, Hong Kong, China, June 14-19, 2015, 2015)

Sufficiently myopic adversaries are blind - Bikash Kumar Dey; Sidharth Jaggi; Michael Langberg (IEEE International Symposium on Information Theory, ISIT 2015, Hong Kong, China, June 14-19, 2015, 2015)

Coding for the \(l\)\(∞\)-limited permutation channel - Michael Langberg; Moshe Schwartz; Eitan Yaakobi (IEEE International Symposium on Information Theory, ISIT 2015, Hong Kong, China, June 14-19, 2015, 2015)

On the fundamental limits of caching in combination networks - Mingyue Ji; Ming Fai Wong; Antonia M. Tulino; Jaime Llorca; Giuseppe Caire; Michelle Effros; Michael Langberg (16th IEEE International Workshop on Signal Processing Advances in Wireless Communications, SPAWC 2015, Stockholm, Sweden, June 28 - July 1, 2015, 2015)

A Characterization of the Capacity of Online (causal) Binary Channels - Zitan Chen; Sidharth Jaggi; Michael Langberg (Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, STOC 2015, Portland, OR, USA, June 14-17, 2015, 2015)

On the Cost and Benefit of Cooperation (Extended Version) - Parham Noorzad; Michelle Effros; Michael Langberg (CoRR, 2015)

Connecting Multiple-unicast and Network Error Correction: Reduction and Unachievability - Wentao Huang; Michael Langberg; Jörg Kliewer (CoRR, 2015)

Communication Efficient Secret Sharing - Wentao Huang; Michael Langberg; Jörg Kliewer; Jehoshua Bruck (CoRR, 2015)

The Multivariate Covering Lemma and its Converse - Parham Noorzad; Michelle Effros; Michael Langberg (CoRR, 2015)

Network Codes Resilient to Jamming and Eavesdropping - Hongyi Yao; Danilo Silva; Sidharth Jaggi; Michael Langberg (IEEE/ACM Trans. Netw., 2014)

Single-source/sink network error correction is as hard as multiple-unicast - Wentao Huang; Tracey Ho; Michael Langberg; Jörg Kliewer (52nd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2014, Allerton Park & Retreat Center, Monticello, IL, USA, September 30 - October 3, 2014, 2014)

Reverse edge cut-set bounds for secure network coding - Wentao Huang; Tracey Ho; Michael Langberg; Jörg Kliewer (2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29 - July 4, 2014, 2014)

Graph theory versus minimum rank for index coding - Karthikeyan Shanmugam; Alexandros G. Dimakis; Michael Langberg (2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29 - July 4, 2014, 2014)

Polar coding for noisy write-once memories - Eyal En Gad; Yue Li; Jörg Kliewer; Michael Langberg; Anxiao Jiang; Jehoshua Bruck (2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29 - July 4, 2014, 2014)

Linear capacity equivalence between multiple multicast and multiple unicast - Ming Fai Wong; Michael Langberg; Michelle Effros (2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29 - July 4, 2014, 2014)

On the power of cooperation: Can a little help a lot? - Parham Noorzad; Michelle Effros; Michael Langberg; Tracey Ho (2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29 - July 4, 2014, 2014)

Is there a canonical network for network information theory? - Michelle Effros; Michael Langberg (2014 IEEE Information Theory Workshop, ITW 2014, Hobart, Tasmania, Australia, November 2-5, 2014, 2014)

On the Power of Cooperation: Can a Little Help a Lot? (Extended Version) - Parham Noorzad; Michelle Effros; Michael Langberg; Tracey Ho (CoRR, 2014)

Reverse Edge Cut-Set Bounds for Secure Network Coding - Wentao Huang; Tracey Ho; Michael Langberg; Jörg Kliewer (CoRR, 2014)

Graph Theory versus Minimum Rank for Index Coding - Karthikeyan Shanmugam; Alexandros G. Dimakis; Michael Langberg (CoRR, 2014)

Single-Source/Sink Network Error Correction Is as Hard as Multiple-Unicast - Wentao Huang; Tracey Ho; Michael Langberg; Jörg Kliewer (CoRR, 2014)

Asymmetric Error Correction and Flash-Memory Rewriting using Polar Codes - Eyal En Gad; Yue Li; Jörg Kliewer; Michael Langberg; Anxiao Jiang; Jehoshua Bruck (CoRR, 2014)

A characterization of the capacity of online (causal) binary channels - Zitan Chen; Sidharth Jaggi; Michael Langberg (CoRR, 2014)

Communicating the Sum of Sources Over a Network - Aditya Ramamoorthy; Michael Langberg (IEEE J. Sel. Areas Commun., 2013)

Codes Against Online Adversaries: Large Alphabets - Bikash Kumar Dey; Sidharth Jaggi; Michael Langberg (IEEE Trans. Inf. Theory, 2013)

Upper Bounds on the Capacity of Binary Channels With Causal Adversaries - Bikash Kumar Dey; Sidharth Jaggi; Michael Langberg; Anand D. Sarwate (IEEE Trans. Inf. Theory, 2013)

Trajectory Codes for Flash Memory - Anxiao Jiang; Michael Langberg; Moshe Schwartz; Jehoshua Bruck (IEEE Trans. Inf. Theory, 2013)

Generalized Gray Codes for Local Rank Modulation - Eyal En Gad; Michael Langberg; Moshe Schwartz; Jehoshua Bruck (IEEE Trans. Inf. Theory, 2013)

On a capacity equivalence between multiple multicast and multiple unicast - Ming Fai Wong; Michael Langberg; Michelle Effros (51st Annual Allerton Conference on Communication, Control, and Computing, Allerton 2013, Allerton Park & Retreat Center, Monticello, IL, USA, October 2-4, 2013, 2013)

H-wise independence - Ishay Haviv; Michael Langberg (Innovations in Theoretical Computer Science, ITCS '13, Berkeley, CA, USA, January 9-12, 2013, 2013)

Sequence reconstruction for Grassmann graphs and permutations - Eitan Yaakobi; Moshe Schwartz; Michael Langberg; Jehoshua Bruck (Proceedings of the 2013 IEEE International Symposium on Information Theory, Istanbul, Turkey, July 7-12, 2013, 2013)

An equivalence between network coding and index coding - Michelle Effros; Salim Y. El Rouayheb; Michael Langberg (Proceedings of the 2013 IEEE International Symposium on Information Theory, Istanbul, Turkey, July 7-12, 2013, 2013)

On a capacity equivalence between network and index coding and the edge removal problem - Ming Fai Wong; Michael Langberg; Michelle Effros (Proceedings of the 2013 IEEE International Symposium on Information Theory, Istanbul, Turkey, July 7-12, 2013, 2013)

Joint rewriting and error correction in write-once memories - Anxiao Andrew Jiang; Yue Li; Eyal En Gad; Michael Langberg; Jehoshua Bruck (Proceedings of the 2013 IEEE International Symposium on Information Theory, Istanbul, Turkey, July 7-12, 2013, 2013)

Information-theoretic study of voting systems - Eitan Yaakobi; Michael Langberg; Jehoshua Bruck (Proceedings of the 2013 IEEE International Symposium on Information Theory, Istanbul, Turkey, July 7-12, 2013, 2013)

Local graph coloring and index coding - Karthikeyan Shanmugam; Alexandros G. Dimakis; Michael Langberg (Proceedings of the 2013 IEEE International Symposium on Information Theory, Istanbul, Turkey, July 7-12, 2013, 2013)

Error correcting code for flash memories - Anxiao Andrew Jiang; Yue Li; Eyal En Gad; Michael Langberg; Jehoshua Bruck (2013 Information Theory and Applications Workshop, ITA 2013, San Diego, CA, USA, February 10-15, 2013, 2013)

Outer bounds and a functional study of the edge removal problem - Eun Jee Lee; Michael Langberg; Michelle Effros (2013 IEEE Information Theory Workshop, ITW 2013, Sevilla, Spain, September 9-13, 2013, 2013)

Zero vs. \(ε\) error in interference channels - Ilia Levi; Dan Vilenchik; Michael Langberg; Michelle Effros (2013 IEEE Information Theory Workshop, ITW 2013, Sevilla, Spain, September 9-13, 2013, 2013)

Routing for security in networks with adversarial nodes - Pak Hou Che; Minghua Chen; Tracey Ho; Sidharth Jaggi; Michael Langberg (International Symposium on Network Coding, NetCod 2013, Calgary, AB, Canada, June 7-9, 2013, 2013)

On secure network coding with uniform wiretap sets - Wentao Huang; Tracey Ho; Michael Langberg; Jörg Kliewer (International Symposium on Network Coding, NetCod 2013, Calgary, AB, Canada, June 7-9, 2013, 2013)

Local Graph Coloring and Index Coding - Karthikeyan Shanmugam; Alexandros G. Dimakis; Michael Langberg (CoRR, 2013)

Routing for Security in Networks with Adversarial Nodes - Pak Hou Che; Minghua Chen; Tracey Ho; Sidharth Jaggi; Michael Langberg (CoRR, 2013)

Zero vs. epsilon Error in Interference Channels - Ilia Levi; Dan Vilenchik; Michael Langberg; Michelle Effros (CoRR, 2013)

f-Sensitivity Distance Oracles and Routing Schemes - Shiri Chechik; Michael Langberg; David Peleg; Liam Roditty (Algorithmica, 2012)

A characterization of the number of subsequences obtained via the deletion channel - Yuvalal Liron; Michael Langberg (Proceedings of the 2012 IEEE International Symposium on Information Theory, ISIT 2012, Cambridge, MA, USA, July 1-6, 2012, 2012)

Improved upper bounds on the capacity of binary channels with causal adversaries - Bikash Kumar Dey; Sidharth Jaggi; Michael Langberg; Anand D. Sarwate (Proceedings of the 2012 IEEE International Symposium on Information Theory, ISIT 2012, Cambridge, MA, USA, July 1-6, 2012, 2012)

On linear index coding for random graphs - Ishay Haviv; Michael Langberg (Proceedings of the 2012 IEEE International Symposium on Information Theory, ISIT 2012, Cambridge, MA, USA, July 1-6, 2012, 2012)

Coded cooperative data exchange problem for general topologies - Mira Gonen; Michael Langberg (Proceedings of the 2012 IEEE International Symposium on Information Theory, ISIT 2012, Cambridge, MA, USA, July 1-6, 2012, 2012)

Source coding for dependent sources - Michael Langberg; Michelle Effros (2012 IEEE Information Theory Workshop, Lausanne, Switzerland, September 3-7, 2012, 2012)

A characterization of the number of subsequences obtained via the deletion channel - Yuvalal Liron; Michael Langberg (CoRR, 2012)

Coded Cooperative Data Exchange Problem for General Topologies - Mira Gonen; Michael Langberg (CoRR, 2012)

Upper Bounds on the Capacity of Binary Channels with Causal Adversaries - Bikash Kumar Dey; Sidharth Jaggi; Michael Langberg; Anand D. Sarwate (CoRR, 2012)

On secure network coding with uniform wiretap sets - Wentao Huang; Tracey Ho; Michael Langberg; Jörg Kliewer (CoRR, 2012)

Edge distribution in generalized graph products - Michael Langberg; Dan Vilenchik (CoRR, 2012)

An Equivalence between Network Coding and Index Coding - Michelle Effros; Salim Y. El Rouayheb; Michael Langberg (CoRR, 2012)

On the Hardness of Approximating the Network Coding Capacity - Michael Langberg; Alexander Sprintson (IEEE Trans. Inf. Theory, 2011)

Constant-Weight Gray Codes for Local Rank Modulation - Eyal En Gad; Michael Langberg; Moshe Schwartz; Jehoshua Bruck (IEEE Trans. Inf. Theory, 2011)

Network coding: Is zero error always possible? - Michael Langberg; Michelle Effros (49th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2011, Allerton Park & Retreat Center, Monticello, IL, USA, 28-30 September, 2011, 2011)

Finding Sparse Solutions for the Index Coding Problem - Mohammad Asad R. Chaudhry; Zakia Asad; Alexander Sprintson; Michael Langberg (Proceedings of the Global Communications Conference, GLOBECOM 2011, 5-9 December 2011, Houston, Texas, USA, 2011)

On the complementary Index Coding problem - Mohammad Asad R. Chaudhry; Zakia Asad; Alex Sprintson; Michael Langberg (2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011, St. Petersburg, Russia, July 31 - August 5, 2011, 2011)

Index coding with outerplanar side information - Yossi Berliner; Michael Langberg (2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011, St. Petersburg, Russia, July 31 - August 5, 2011, 2011)

Generalized Gray codes for local rank modulation - Eyal En Gad; Michael Langberg; Moshe Schwartz; Jehoshua Bruck (2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011, St. Petersburg, Russia, July 31 - August 5, 2011, 2011)

Beating the Gilbert-Varshamov bound for online channels - Ishay Haviv; Michael Langberg (2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011, St. Petersburg, Russia, July 31 - August 5, 2011, 2011)

A unified framework for approximating and clustering data - Dan Feldman; Michael Langberg (Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC 2011, San Jose, CA, USA, 6-8 June 2011, 2011)

Beating the Gilbert-Varshamov Bound for Online Channels - Ishay Haviv; Michael Langberg (CoRR, 2011)

Network Coding: Is zero error always possible? - Michael Langberg; Michelle Effros (CoRR, 2011)

Generalized Gray Codes for Local Rank Modulation - Eyal En Gad; Michael Langberg; Moshe Schwartz; Jehoshua Bruck (CoRR, 2011)

A Unified Framework for Approximating and Clustering Data - Dan Feldman; Michael Langberg (CoRR, 2011)

On Linear Index Coding for Random Graphs - Ishay Haviv; Michael Langberg (CoRR, 2011)

Fault Tolerant Spanners for General Graphs - Shiri Chechik; Michael Langberg; David Peleg; Liam Roditty (SIAM J. Comput., 2010)

Approximating Maximum Subgraphs without Short Cycles - Guy Kortsarz; Michael Langberg; Zeev Nutov (SIAM J. Discret. Math., 2010)

Clustering lines in high-dimensional space: Classification of incomplete data - Jie Gao; Michael Langberg; Leonard J. Schulman (ACM Trans. Algorithms, 2010)

f-Sensitivity Distance Oracles and Routing Schemes - Shiri Chechik; Michael Langberg; David Peleg; Liam Roditty (Algorithms - ESA 2010, 18th Annual European Symposium, Liverpool, UK, September 6-8, 2010. Proceedings, Part I, 2010)

One-shot capacity of discrete channels - Rui A. Costa; Michael Langberg; João Barros (IEEE International Symposium on Information Theory, ISIT 2010, June 13-18, 2010, Austin, Texas, USA, Proceedings, 2010)

Coding against delayed adversaries - Bikash Kumar Dey; Sidharth Jaggi; Michael Langberg; Anand D. Sarwate (IEEE International Symposium on Information Theory, ISIT 2010, June 13-18, 2010, Austin, Texas, USA, Proceedings, 2010)

Communicating the sum of sources in a 3-sources/3-terminals network; revisited - Michael Langberg; Aditya Ramamoorthy (IEEE International Symposium on Information Theory, ISIT 2010, June 13-18, 2010, Austin, Texas, USA, Proceedings, 2010)

Data movement and aggregation in flash memories - Anxiao Jiang; Michael Langberg; Robert Mateescu; Jehoshua Bruck (IEEE International Symposium on Information Theory, ISIT 2010, June 13-18, 2010, Austin, Texas, USA, Proceedings, 2010)

Universal epsilon-approximators for Integrals - Michael Langberg; Leonard J. Schulman (Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2010, Austin, Texas, USA, January 17-19, 2010, 2010)

Realtime Classification for Encrypted Traffic - Roni Bar-Yanai; Michael Langberg; David Peleg; Liam Roditty (Experimental Algorithms, 9th International Symposium, SEA 2010, Ischia Island, Naples, Italy, May 20-22, 2010. Proceedings, 2010)

Network Codes Resilient to Jamming and Eavesdropping - Hongyi Yao; Danilo Silva; Sidharth Jaggi; Michael Langberg (CoRR, 2010)

Communicating the sum of sources over a network - Aditya Ramamoorthy; Michael Langberg (CoRR, 2010)

One-Shot Capacity of Discrete Channels - Rui A. Costa; Michael Langberg; João Barros (CoRR, 2010)

Trajectory Codes for Flash Memory - Anxiao Jiang; Michael Langberg; Moshe Schwartz; Jehoshua Bruck (CoRR, 2010)

Contraction and Expansion of Convex Sets - Michael Langberg; Leonard J. Schulman (Discret. Comput. Geom., 2009)

Network Coding: A Computational Perspective - Michael Langberg; Alexander Sprintson; Jehoshua Bruck (IEEE Trans. Inf. Theory, 2009)

On the multiple unicast network coding, conjecture - Michael Langberg; Muriel Médard (47th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2009, Monticello, IL, USA, September 30 - October 2, 2009, 2009)

Data movement in flash memories - Anxiao Jiang; Michael Langberg; Robert Mateescu; Jehoshua Bruck (47th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2009, Monticello, IL, USA, September 30 - October 2, 2009, 2009)

Codes against online adversaries - Bikash Kumar Dey; Sidharth Jaggi; Michael Langberg (47th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2009, Monticello, IL, USA, September 30 - October 2, 2009, 2009)

Universal rewriting in constrained memories - Anxiao Jiang; Michael Langberg; Moshe Schwartz; Jehoshua Bruck (IEEE International Symposium on Information Theory, ISIT 2009, June 28 - July 3, 2009, Seoul, Korea, Proceedings, 2009)

Communicating the sum of sources in a 3-sources/3-terminals network - Michael Langberg; Aditya Ramamoorthy (IEEE International Symposium on Information Theory, ISIT 2009, June 28 - July 3, 2009, Seoul, Korea, Proceedings, 2009)

Binary causal-adversary channels - Michael Langberg; Sidharth Jaggi; Bikash Kumar Dey (IEEE International Symposium on Information Theory, ISIT 2009, June 28 - July 3, 2009, Seoul, Korea, Proceedings, 2009)

Fault-tolerant spanners for general graphs - Shiri Chechik; Michael Langberg; David Peleg; Liam Roditty (Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA, May 31 - June 2, 2009, 2009)

Binary Causal-Adversary Channels - Michael Langberg; Sidharth Jaggi; Bikash Kumar Dey (CoRR, 2009)

The Dense k Subgraph problem - Doron Goldstein; Michael Langberg (CoRR, 2009)

Analysis of Incomplete Data and an Intrinsic-Dimension Helly Theorem - Jie Gao; Michael Langberg; Leonard J. Schulman (Discret. Comput. Geom., 2008)

Oblivious Communication Channels and Their Capacity - Michael Langberg (IEEE Trans. Inf. Theory, 2008)

Resilient Network Coding in the Presence of Byzantine Adversaries - Sidharth Jaggi; Michael Langberg; Sachin Katti; Tracey Ho; Dina Katabi; Muriel Médard; Michelle Effros (IEEE Trans. Inf. Theory, 2008)

Optimal Universal Schedules for Discrete Broadcast - Michael Langberg; Alexander Sprintson; Jehoshua Bruck (IEEE Trans. Inf. Theory, 2008)

Approximating Maximum Subgraphs without Short Cycles - Guy Kortsarz; Michael Langberg; Zeev Nutov (Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques, 11th International Workshop, APPROX 2008, and 12th International Workshop, RANDOM 2008, Boston, MA, USA, August 25-27, 2008. Proceedings, 2008)

Adversarial models and resilient schemes for network coding - Leah Nutman; Michael Langberg (2008 IEEE International Symposium on Information Theory, ISIT 2008, Toronto, ON, Canada, July 6-11, 2008, 2008)

On the hardness of approximating the network coding capacity - Michael Langberg; Alex Sprintson (2008 IEEE International Symposium on Information Theory, ISIT 2008, Toronto, ON, Canada, July 6-11, 2008, 2008)

"Real" Slepian-Wolf codes - Sagar Shenvi; Bikash Kumar Dey; Sidharth Jaggi; Michael Langberg (2008 IEEE International Symposium on Information Theory, ISIT 2008, Toronto, ON, Canada, July 6-11, 2008, 2008)

Graph Coloring - Michael Langberg (Encyclopedia of Algorithms - 2008 Edition, 2008)

Adversarial Models and Resilient Schemes for Network Coding - Leah Nutman; Michael Langberg (CoRR, 2008)

"Real" Slepian-Wolf Codes - Bikash Kumar Dey; Sidharth Jaggi; Michael Langberg (CoRR, 2008)

Codes against Online Adversaries - Bikash Kumar Dey; Sidharth Jaggi; Michael Langberg (CoRR, 2008)

The multi-multiway cut problem - Adi Avidor; Michael Langberg (Theor. Comput. Sci., 2007)

Contraction and Expansion of Convex Sets - Michael Langberg; Leonard J. Schulman (Proceedings of the 19th Annual Canadian Conference on Computational Geometry, CCCG 2007, August 20-22, 2007, Carleton University, Ottawa, Canada, 2007)

Resilient Network Coding in the Presence of Byzantine Adversaries - Sidharth Jaggi; Michael Langberg; Sachin Katti; Tracey Ho; Dina Katabi; Muriel Médard (INFOCOM 2007. 26th IEEE International Conference on Computer Communications, Joint Conference of the IEEE Computer and Communications Societies, 6-12 May 2007, Anchorage, Alaska, USA, 2007)

Resilient network codes in the presence of eavesdropping Byzantine adversaries - Sidharth Jaggi; Michael Langberg (IEEE International Symposium on Information Theory, ISIT 2007, Nice, France, June 24-29, 2007, 2007)

Distributed broadcasting and mapping protocols in directed anonymous networks - Michael Langberg; Moshe Schwartz; Jehoshua Bruck (Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, PODC 2007, Portland, Oregon, USA, August 12-15, 2007, 2007)

The RPR\(^2\) rounding technique for semidefinite programs - Uriel Feige; Michael Langberg (J. Algorithms, 2006)

The encoding complexity of network coding - Michael Langberg; Alexander Sprintson; Jehoshua Bruck (IEEE Trans. Inf. Theory, 2006)

Approximation Algorithms for Graph Homomorphism Problems - Michael Langberg; Yuval Rabani; Chaitanya Swamy (Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 9th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2006 and 10th International Workshop on Randomization and Computation, RANDOM 2006, Barcelona, Spain, August 28-30 2006, Proceedings, 2006)

Network Coding: A Computational Perspective - Michael Langberg; Alexander Sprintson; Jehoshua Bruck (40th Annual Conference on Information Sciences and Systems, CISS 2006, Princeton, NJ, USA, 22-24 March 2006, 2006)

Oblivious channels - Michael Langberg (Proceedings 2006 IEEE International Symposium on Information Theory, ISIT 2006, The Westin Seattle, Seattle, Washington, USA, July 9-14, 2006, 2006)

Analysis of incomplete data and an intrinsic-dimension Helly theorem - Jie Gao; Michael Langberg; Leonard J. Schulman (Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2006, Miami, Florida, USA, January 22-26, 2006, 2006)

Oblivious channels - Michael Langberg (CoRR, 2006)

Correction of adversarial errors in networks - Sidharth Jaggi; Michael Langberg; Tracey Ho; Michelle Effros (Proceedings of the 2005 IEEE International Symposium on Information Theory, ISIT 2005, Adelaide, South Australia, Australia, 4-9 September 2005, 2005)

The encoding complexity of network coding - Michael Langberg; Alexander Sprintson; Jehoshua Bruck (Proceedings of the 2005 IEEE International Symposium on Information Theory, ISIT 2005, Adelaide, South Australia, Australia, 4-9 September 2005, 2005)

Staleness vs. waiting time in universal discrete broadcast - Michael Langberg; Alexander Sprintson; Jehoshua Bruck (Proceedings of the 2005 IEEE International Symposium on Information Theory, ISIT 2005, Adelaide, South Australia, Australia, 4-9 September 2005, 2005)

Graphs with Tiny Vector Chromatic Numbers and Huge Chromatic Numbers - Uriel Feige; Michael Langberg; Gideon Schechtman (SIAM J. Comput., 2004)

Testing the Independence Number of Hypergraphs - Michael Langberg (Approximation, Randomization, and Combinatorial Optimization, Algorithms and Techniques, 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2004, and 8th International Workshop on Randomization and Computation, RANDOM 2004, Cambridge, MA, USA, August 22-24, 2004, Proceedings, 2004)

Private Codes or Succinct Random Codes That Are (Almost) Perfect - Michael Langberg (45th Symposium on Foundations of Computer Science, FOCS 2004, Rome, Italy, October 17-19, 2004, Proceedings, 2004)

Optimal universal schedules for discrete broadcast - Michael Langberg; Alexander Sprintson; Jehoshua Bruck (Proceedings of the 2004 IEEE International Symposium on Information Theory, ISIT 2004, Chicago Downtown Marriott, Chicago, Illinois, USA, June 27 - July 2, 2004, 2004)

The Multi-multiway Cut Problem - Adi Avidor; Michael Langberg (Algorithm Theory - SWAT 2004, 9th Scandinavian Workshop on Algorithm Theory, Humlebaek, Denmark, July 8-10, 2004, Proceedings, 2004)

The ROBDD Size of Simple CNF Formulas - Michael Langberg; Amir Pnueli; Yoav Rodeh (Correct Hardware Design and Verification Methods, 12th IFIP WG 10.5 Advanced Research Working Conference, CHARME 2003, L'Aquila, Italy, October 21-24, 2003, Proceedings, 2003)

Testing the independence number of hypergraphs - Michael Langberg (Electron. Colloquium Comput. Complex., 2003)

Improved approximation of Max-Cut on graphs of bounded degree - Uriel Feige; Marek Karpinski; Michael Langberg (J. Algorithms, 2002)

Graphs with Tiny Vector Chromatic Numbers and Huge Chromatic Numbers - Uriel Feige; Michael Langberg; Gideon Schechtman (43rd Symposium on Foundations of Computer Science, FOCS 2002, Vancouver, BC, Canada, November 16-19, 2002, Proceedings, 2002)

A note on approximating Max-Bisection on regular graphs - Uriel Feige; Marek Karpinski; Michael Langberg (Inf. Process. Lett., 2001)

Approximation Algorithms for Maximization Problems Arising in Graph Partitioning - Uriel Feige; Michael Langberg (J. Algorithms, 2001)

The RPR\(^2\) Rounding Technique for Semidefinite Programs - Uriel Feige; Michael Langberg (Automata, Languages and Programming, 28th International Colloquium, ICALP 2001, Crete, Greece, July 8-12, 2001, Proceedings, 2001)

On the hardness of approximating N P witnesses - Uriel Feige; Michael Langberg; Kobbi Nissim (Approximation Algorithms for Combinatorial Optimization, Third International Workshop, APPROX 2000, Saarbrücken, Germany, September 5-8, 2000, Proceedings, 2000)

Improved Approximation of MAX-CUT on Graphs of Bounded Degree - Uriel Feige; Marek Karpinski; Michael Langberg (Electron. Colloquium Comput. Complex., 2000)

A Note on Approximating MAX-BISECTION on Regular Graphs - Uriel Feige; Marek Karpinski; Michael Langberg (Electron. Colloquium Comput. Complex., 2000)