| 2025 | ISIT | Sliding Window Adversarial Channels. | Bikash Kumar Dey, Sidharth Jaggi, Michael Langberg, Anand D. Sarwate, Yihan Zhang |
| 2025 | ISIT | Switched Feedback for the Multiple-Access Channel. | Oliver Kosut, Michael Langberg, Michelle Effros |
| 2025 | ISIT | Bounds on Box Codes. | Michael Langberg, Moshe Schwartz, Itzhak Tamo |
| 2025 | ISIT | Zero-Error Superposition Codes. | Chenyu Wang, Ayesha Irfan, Yihan Zhang, Michael Langberg, Sidharth Jaggi |
| 2025 | ITW | Dynamical Linear Reward Systems under Competitive Horizon Criteria. | Mor Nahum, Oron Sabag, Michael Langberg |
| 2024 | ISIT | Computationally Efficient Codes for Strongly Dobrushin-Stambler Nonsymmetrizable Oblivious AVCs. | Bikash Kumar Dey, Sidharth Jaggi, Michael Langberg, Anand D. Sarwate, Y. Zhang |
| 2024 | ISIT | 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 |
| 2024 | ISIT | Characterizing positive-rate secure multicast network coding with eavesdropping nodes. | Michael Langberg, Michelle Effros |
| 2024 | ISIT | Competitive Analysis of Arbitrary Varying Channels. | Michael Langberg, Oron Sabag |
| 2023 | ISIT | Perfect vs. Independent Feedback in the Multiple-Access Channel. | Oliver Kosut, Michelle Effros, Michael Langberg |
| 2023 | ISIT | Competitive Channel-Capacity. | Michael Langberg, Oron Sabag |
| 2023 | ISIT | Computationally Efficient Codes for Adversarial Binary-Erasure Channels. | Sijie Li, Prasad Krishnan, Sidharth Jaggi, Michael Langberg, Anand D. Sarwate |
| 2022 | ISIT | Group Testing on General Set-Systems. | Mira Gonen, Michael Langberg, Alex Sprintson |
| 2022 | ISIT | On the Benefit of Cooperation in Relay Networks. | Oliver Kosut, Michelle Effros, Michael Langberg |
| 2022 | ISIT | The Capacity of Causal Adversarial Channels. | Yihan Zhang, Sidharth Jaggi, Michael Langberg, Anand D. Sarwate |
| 2022 | ITW | Network Coding Multicast Key-Capacity. | Michael Langberg, Michelle Effros |
| 2021 | ISIT | Minimizing the Alphabet Size in Codes with Restricted Error Sets. | Mira Gonen, Michael Langberg, Alex Sprintson |
| 2021 | ISIT | Every Bit Counts: Second-Order Analysis of Cooperation in the Multiple-Access Channel. | Oliver Kosut, Michelle Effros, Michael Langberg |
| 2021 | ISIT | Edge removal in undirected networks. | Michael Langberg, Michelle Effros |
| 2020 | ISIT | Symmetrizability for Myopic AVCs. | Amitalok J. Budkuley, Bikash Kumar Dey, Sidharth Jaggi, Michael Langberg, Anand D. Sarwate, Carol Wang |
| 2020 | ISIT | Minimizing the alphabet size of erasure codes with restricted decoding sets. | Mira Gonen, Ishay Haviv, Michael Langberg, Alex Sprintson |
| 2019 | ISIT | Secure Network Coding in the Setting in Which a Non-Source Node May Generate Random Keys. | Debaditya Chaudhuri, Michael Langberg, Michelle Effros |
| 2019 | ISIT | The Interplay of Causality and Myopia in Adversarial Channel Models. | Bikash Kumar Dey, Sidharth Jaggi, Michael Langberg, Anand D. Sarwate, Carol Wang |
| 2019 | ISIT | A Local Perspective on the Edge Removal Problem. | Fei Wei, Michael Langberg, Michelle Effros |
| 2019 | PODS | Topology Dependent Bounds For FAQs. | Michael Langberg, Shi Li, Sai Vikneshwar Mani Jayaraman, Atri Rudra |
| 2018 | ISIT | Trade-offs between Rate and Security in Linear Multicast Network Coding. | Debaditya Chaudhuri, Michael Langberg |
| 2018 | ISIT | Quadratically Constrained Channels with Causal Adversaries. | Tongxin Li, Bikash Kumar Dey, Sidharth Jaggi, Michael Langberg, Anand D. Sarwate |
| 2018 | ISIT | Can Negligihle Cooperation Increase Capacity? The Average-Error Case. | Parham Noorzad, Michelle Effros, Michael Langberg |
| 2017 | ISIT | Non-linear cyclic codes that attain the Gilbert-Varshamov bound. | Ishay Haviv, Michael Langberg, Moshe Schwartz, Eitan Yaakobi |
| 2017 | ISIT | Two-way interference channels with jammers. | Sidharth Jaggi, Michael Langberg |
| 2017 | ISIT | The benefit of encoder cooperation in the presence of state information. | Parham Noorzad, Michelle Effros, Michael Langberg |
| 2017 | ISIT | The birthday problem and zero-error list codes. | Parham Noorzad, Michelle Effros, Michael Langberg, Victoria Kostina |
| 2017 | ISIT | A code equivalence between streaming network coding and streaming index coding. | Ming Fai Wong, Michelle Effros, Michael Langberg |
| 2017 | SODA | Tight Network Topology Dependent Bounds on Rounds of Communication. | Arkadev Chattopadhyay, Michael Langberg, Shi Li, Atri Rudra |
| 2016 | GLOBECOM | On the Capacity Advantage of a Single Bit. | Michael Langberg, Michelle Effros |
| 2016 | ISIT | The capacity of online (causal) q-ary error-erasure channels. | Zitan Chen, Sidharth Jaggi, Michael Langberg |
| 2016 | ISIT | 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 |
| 2016 | ISIT | A characterization of the capacity region for network coding with dependent sources. | Woong Kim, Michael Langberg, Michelle Effros |
| 2016 | ISIT | The unbounded benefit of encoder cooperation for the k-user MAC. | Parham Noorzad, Michelle Effros, Michael Langberg |
| 2016 | ISIT | Can negligible cooperation increase network reliability? | Parham Noorzad, Michelle Effros, Michael Langberg |
| 2016 | ISIT | On tightness of an entropic region outer bound for network coding and the edge removal property. | Ming Fai Wong, Michelle Effros, Michael Langberg |
| 2015 | ISIT | Sufficiently myopic adversaries are blind. | Bikash Kumar Dey, Sidharth Jaggi, Michael Langberg |
| 2015 | ISIT | Connecting multiple-unicast and network error correction: Reduction and unachievability. | Wentao Huang, Michael Langberg, Jrg Kliewer |
| 2015 | ISIT | Coding for the ℓ∞-limited permutation channel. | Michael Langberg, Moshe Schwartz, Eitan Yaakobi |
| 2015 | ISIT | On the cost and benefit of cooperation. | Parham Noorzad, Michelle Effros, Michael Langberg |
| 2015 | ISIT | 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 |
| 2015 | STOC | A Characterization of the Capacity of Online (causal) Binary Channels. | Zitan Chen, Sidharth Jaggi, Michael Langberg |
| 2014 | ISIT | Polar coding for noisy write-once memories. | Eyal En Gad, Yue Li, Jrg Kliewer, Michael Langberg, Anxiao Jiang, Jehoshua Bruck |
| 2014 | ISIT | Reverse edge cut-set bounds for secure network coding. | Wentao Huang, Tracey Ho, Michael Langberg, Jrg Kliewer |
| 2014 | ISIT | On the power of cooperation: Can a little help a lot? | Parham Noorzad, Michelle Effros, Michael Langberg, Tracey Ho |
| 2014 | ISIT | Graph theory versus minimum rank for index coding. | Karthikeyan Shanmugam, Alexandros G. Dimakis, Michael Langberg |
| 2014 | ISIT | Linear capacity equivalence between multiple multicast and multiple unicast. | Ming Fai Wong, Michael Langberg, Michelle Effros |
| 2014 | ITW | Is there a canonical network for network information theory? | Michelle Effros, Michael Langberg |
| 2013 | ISIT | An equivalence between network coding and index coding. | Michelle Effros, Salim Y. El Rouayheb, Michael Langberg |
| 2013 | ISIT | Joint rewriting and error correction in write-once memories. | Anxiao Andrew Jiang, Yue Li, Eyal En Gad, Michael Langberg, Jehoshua Bruck |
| 2013 | ISIT | Local graph coloring and index coding. | Karthikeyan Shanmugam, Alexandros G. Dimakis, Michael Langberg |
| 2013 | ISIT | On a capacity equivalence between network and index coding and the edge removal problem. | Ming Fai Wong, Michael Langberg, Michelle Effros |
| 2013 | ISIT | Information-theoretic study of voting systems. | Eitan Yaakobi, Michael Langberg, Jehoshua Bruck |
| 2013 | ISIT | Sequence reconstruction for Grassmann graphs and permutations. | Eitan Yaakobi, Moshe Schwartz, Michael Langberg, Jehoshua Bruck |
| 2013 | ITA | Error correcting code for flash memories. | Anxiao Andrew Jiang, Yue Li, Eyal En Gad, Michael Langberg, Jehoshua Bruck |
| 2013 | ITW | Outer bounds and a functional study of the edge removal problem. | Eun Jee Lee, Michael Langberg, Michelle Effros |
| 2013 | ITW | Zero vs. ε error in interference channels. | Ilia Levi, Dan Vilenchik, Michael Langberg, Michelle Effros |
| 2012 | ISIT | Improved upper bounds on the capacity of binary channels with causal adversaries. | Bikash Kumar Dey, Sidharth Jaggi, Michael Langberg, Anand D. Sarwate |
| 2012 | ISIT | Coded cooperative data exchange problem for general topologies. | Mira Gonen, Michael Langberg |
| 2012 | ISIT | On linear index coding for random graphs. | Ishay Haviv, Michael Langberg |
| 2012 | ISIT | A characterization of the number of subsequences obtained via the deletion channel. | Yuvalal Liron, Michael Langberg |
| 2012 | ITW | Source coding for dependent sources. | Michael Langberg, Michelle Effros |
| 2011 | GLOBECOM | Finding Sparse Solutions for the Index Coding Problem. | Mohammad Asad R. Chaudhry, Zakia Asad, Alexander Sprintson, Michael Langberg |
| 2011 | ISIT | Index coding with outerplanar side information. | Yossi Berliner, Michael Langberg |
| 2011 | ISIT | On the complementary Index Coding problem. | Mohammad Asad R. Chaudhry, Zakia Asad, Alex Sprintson, Michael Langberg |
| 2011 | ISIT | Generalized Gray codes for local rank modulation. | Eyal En Gad, Michael Langberg, Moshe Schwartz, Jehoshua Bruck |
| 2011 | ISIT | Beating the Gilbert-Varshamov bound for online channels. | Ishay Haviv, Michael Langberg |
| 2011 | STOC | A unified framework for approximating and clustering data. | Dan Feldman, Michael Langberg |
| 2010 | ESA | Untitled record | Shiri Chechik, Michael Langberg, David Peleg, Liam Roditty |
| 2010 | ISIT | One-shot capacity of discrete channels. | Rui A. Costa, Michael Langberg, Joo Barros |
| 2010 | ISIT | Coding against delayed adversaries. | Bikash Kumar Dey, Sidharth Jaggi, Michael Langberg, Anand D. Sarwate |
| 2010 | ISIT | Data movement and aggregation in flash memories. | Anxiao Jiang, Michael Langberg, Robert Mateescu, Jehoshua Bruck |
| 2010 | ISIT | Communicating the sum of sources in a 3-sources/3-terminals network; revisited. | Michael Langberg, Aditya Ramamoorthy |
| 2010 | SODA | Universal epsilon-approximators for Integrals. | Michael Langberg, Leonard J. Schulman |
| 2009 | ISIT | Universal rewriting in constrained memories. | Anxiao Jiang, Michael Langberg, Moshe Schwartz, Jehoshua Bruck |
| 2009 | ISIT | Binary causal-adversary channels. | Michael Langberg, Sidharth Jaggi, Bikash Kumar Dey |
| 2009 | ISIT | Communicating the sum of sources in a 3-sources/3-terminals network. | Michael Langberg, Aditya Ramamoorthy |
| 2009 | STOC | Fault-tolerant spanners for general graphs. | Shiri Chechik, Michael Langberg, David Peleg, Liam Roditty |
| 2008 | ISIT | On the hardness of approximating the network coding capacity. | Michael Langberg, Alex Sprintson |
| 2008 | ISIT | Adversarial models and resilient schemes for network coding. | Leah Nutman, Michael Langberg |
| 2008 | ISIT | "Real" Slepian-Wolf codes. | Sagar Shenvi, Bikash Kumar Dey, Sidharth Jaggi, Michael Langberg |
| 2007 | INFOCOM | Resilient Network Coding in the Presence of Byzantine Adversaries. | Sidharth Jaggi, Michael Langberg, Sachin Katti, Tracey Ho, Dina Katabi, Muriel Mdard |
| 2007 | ISIT | Resilient network codes in the presence of eavesdropping Byzantine adversaries. | Sidharth Jaggi, Michael Langberg |
| 2007 | PODC | Distributed broadcasting and mapping protocols in directed anonymous networks. | Michael Langberg, Moshe Schwartz, Jehoshua Bruck |
| 2006 | CISS | Network Coding: A Computational Perspective. | Michael Langberg, Alexander Sprintson, Jehoshua Bruck |
| 2006 | ISIT | Oblivious channels. | Michael Langberg |
| 2006 | SODA | Analysis of incomplete data and an intrinsic-dimension Helly theorem. | Jie Gao, Michael Langberg, Leonard J. Schulman |
| 2005 | ISIT | Correction of adversarial errors in networks. | Sidharth Jaggi, Michael Langberg, Tracey Ho, Michelle Effros |
| 2005 | ISIT | The encoding complexity of network coding. | Michael Langberg, Alexander Sprintson, Jehoshua Bruck |
| 2005 | ISIT | Staleness vs. waiting time in universal discrete broadcast. | Michael Langberg, Alexander Sprintson, Jehoshua Bruck |
| 2004 | FOCS | Private Codes or Succinct Random Codes That Are (Almost) Perfect. | Michael Langberg |
| 2004 | ISIT | Optimal universal schedules for discrete broadcast. | Michael Langberg, Alexander Sprintson, Jehoshua Bruck |
| 2002 | FOCS | Graphs with Tiny Vector Chromatic Numbers and Huge Chromatic Numbers. | Uriel Feige, Michael Langberg, Gideon Schechtman |
| 2001 | ICALP | The RPR | Uriel Feige, Michael Langberg |