- Private codes Succinct random codes that are (almost) perfect
- Testing the independence number of hypergraphs Michael Langberg
- The Multi-Multiway Cut Problem Adi Avidor ? and Michael Langberg ??
- Approximation Algorithms for Maximization Problems arising in
- Approximation Algorithms for Maximization Problems arising in Graph Partitioning
- Graphs with tiny vector chromatic numbers and huge chromatic numbers
- Correction of Adversarial Errors in Networks Sidharth Jaggi # , Michael Langberg + , Tracey Ho # and Michelle Effros #
- Improved approximation of MaxCut on graphs of bounded degree
- Improved approximation of MaxCut on graphs of bounded degree
- Approximating Maximum Subgraphs Without Short Cycles
- Coding against delayed adversaries Bikash Kumar Dey
- Network Codes Resilient to Jamming and Eavesdropping
- Resilient Network Coding in the Presence of Byzantine Adversaries
- On the hardness of approximating NP witnesses Uriel Feige, Michael Langberg, and Kobbi Nissim
- On the Multiple Unicast Network Coding Michael Langberg
- "Real" Slepian-Wolf Codes S. Shenvi, B. K. Dey, S. Jaggi, M. Langberg
- Resilient network codes in the presence of eavesdropping Byzantine adversaries
- Contraction and expansion of convex sets Michael Langberg
- Coping with NPhardness: Approximation algorithms based on
- Graph Coloring (1994, 1998; Karger, Motwani, Sudan) Michael Langberg, The Open University of Israel, www.openu.ac.il
- Universal -approximators for integrals Michael Langberg
- A note on approximating MaxBisection on regular graphs
- Succinct Proofs for NP and Spooky Interactions Cynthia Dwork # Michael Langberg + Moni Naor # Kobbi Nissim Omer Reingold
- On the Hardness of Approximating the Network Coding Capacity
- Fault-Tolerant Spanners for General Graphs S. Chechik
- Communicating the sum of sources in a 3-sources/3-terminals network
- Clustering Lines in High Dimensional Space: Classification of Incomplete Data
