Michael Langberg

2008
24	EE	Leah Nutman, Michael Langberg: Adversarial Models and Resilient Schemes for Network Coding CoRR abs/0801.0701: (2008)
2007
23		Michael Langberg, Leonard J. Schulman: Contraction and Expansion of Convex Sets. CCCG 2007: 25-28
22	EE	Sidharth Jaggi, Michael Langberg, Sachin Katti, Tracey Ho, Dina Katabi, Muriel Médard: Resilient Network Coding in the Presence of Byzantine Adversaries. INFOCOM 2007: 616-624
21	EE	Michael Langberg, Moshe Schwartz, Jehoshua Bruck: Distributed broadcasting and mapping protocols in directed anonymous networks. PODC 2007: 382-383
20	EE	Adi Avidor, Michael Langberg: The multi-multiway cut problem. Theor. Comput. Sci. 377(1-3): 35-42 (2007)
2006
19	EE	Michael Langberg, Yuval Rabani, Chaitanya Swamy: Approximation Algorithms for Graph Homomorphism Problems. APPROX-RANDOM 2006: 176-187
18	EE	Jie Gao, Michael Langberg, Leonard J. Schulman: Analysis of incomplete data and an intrinsic-dimension Helly theorem. SODA 2006: 464-473
17	EE	Michael Langberg: Oblivious channels CoRR abs/cs/0601041: (2006)
16	EE	Michael Langberg, Alexander Sprintson, Jehoshua Bruck: The encoding complexity of network coding. IEEE Transactions on Information Theory 52(6): 2386-2397 (2006)
15	EE	Uriel Feige, Michael Langberg: The RPR2 rounding technique for semidefinite programs. J. Algorithms 60(1): 1-23 (2006)
2004
14	EE	Michael Langberg: Testing the Independence Number of Hypergraphs. APPROX-RANDOM 2004: 405-416
13	EE	Michael Langberg: Private Codes or Succinct Random Codes That Are (Almost) Perfect. FOCS 2004: 325-334
12	EE	Adi Avidor, Michael Langberg: The Multi-multiway Cut Problem. SWAT 2004: 273-284
11	EE	Uriel Feige, Michael Langberg, Gideon Schechtman: Graphs with Tiny Vector Chromatic Numbers and Huge Chromatic Numbers. SIAM J. Comput. 33(6): 1338-1368 (2004)
2003
10	EE	Michael Langberg, Amir Pnueli, Yoav Rodeh: The ROBDD Size of Simple CNF Formulas. CHARME 2003: 363-377
9	EE	Michael Langberg: Testing the independence number of hypergraphs Electronic Colloquium on Computational Complexity (ECCC)(076): (2003)
2002
8	EE	Uriel Feige, Michael Langberg, Gideon Schechtman: Graphs with Tiny Vector Chromatic Numbers and Huge Chromatic Numbers. FOCS 2002: 283-292
7	EE	Uriel Feige, Marek Karpinski, Michael Langberg: Improved approximation of Max-Cut on graphs of bounded degree. J. Algorithms 43(2): 201-219 (2002)
2001
6	EE	Uriel Feige, Michael Langberg: The RPR2 Rounding Technique for Semidefinite Programs. ICALP 2001: 213-224
5	EE	Uriel Feige, Marek Karpinski, Michael Langberg: A note on approximating Max-Bisection on regular graphs. Inf. Process. Lett. 79(4): 181-188 (2001)
4	EE	Uriel Feige, Michael Langberg: Approximation Algorithms for Maximization Problems Arising in Graph Partitioning. J. Algorithms 41(2): 174-211 (2001)
2000
3	EE	Uriel Feige, Michael Langberg, Kobbi Nissim: On the hardness of approximating N P witnesses. APPROX 2000: 120-131
2	EE	Uriel Feige, Marek Karpinski, Michael Langberg: Improved Approximation of MAX-CUT on Graphs of Bounded Degree Electronic Colloquium on Computational Complexity (ECCC) 7(21): (2000)
1	EE	Uriel Feige, Marek Karpinski, Michael Langberg: A Note on Approximating MAX-BISECTION on Regular Graphs Electronic Colloquium on Computational Complexity (ECCC) 7(43): (2000)

Coauthor Index

1	Adi Avidor	[12] [20]
2	Jehoshua Bruck	[16] [21]
3	Uriel Feige	[1] [2] [3] [4] [5] [6] [7] [8] [11] [15]
4	Jie Gao	[18]
5	Tracey Ho	[22]
6	Sidharth Jaggi	[22]
7	Marek Karpinski	[1] [2] [5] [7]
8	Dina Katabi	[22]
9	Sachin Katti	[22]
10	Muriel Médard	[22]
11	Kobbi Nissim	[3]
12	Leah Nutman	[24]
13	Amir Pnueli	[10]
14	Yuval Rabani	[19]
15	Yoav Rodeh	[10]
16	Gideon Schechtman	[8] [11]
17	Leonard J. Schulman	[18] [23]
18	Moshe Schwartz	[21]
19	Alexander Sprintson	[16]
20	Chaitanya Swamy	[19]

Colors in the list of coauthors