Search the dblp DataBase

Publications of Author

1. Michael Langberg
   Testing the Independence Number of Hypergraphs. [Citation Graph (0, 0)][DBLP]
   APPROX-RANDOM, 2004, pp:405-416 [Conf]
   
2. Uriel Feige, Michael Langberg, Kobbi Nissim
   On the hardness of approximating N P witnesses. [Citation Graph (0, 0)][DBLP]
   APPROX, 2000, pp:120-131 [Conf]
   
3. Michael Langberg, Yuval Rabani, Chaitanya Swamy
   Approximation Algorithms for Graph Homomorphism Problems. [Citation Graph (0, 0)][DBLP]
   APPROX-RANDOM, 2006, pp:176-187 [Conf]
   
4. Michael Langberg, Amir Pnueli, Yoav Rodeh
   The ROBDD Size of Simple CNF Formulas. [Citation Graph (0, 0)][DBLP]
   CHARME, 2003, pp:363-377 [Conf]
   
5. Uriel Feige, Michael Langberg, Gideon Schechtman
   Graphs with Tiny Vector Chromatic Numbers and Huge Chromatic Numbers. [Citation Graph (0, 0)][DBLP]
   FOCS, 2002, pp:283-292 [Conf]
   
6. Michael Langberg
   Private Codes or Succinct Random Codes That Are (Almost) Perfect. [Citation Graph (0, 0)][DBLP]
   FOCS, 2004, pp:325-334 [Conf]
   
7. Uriel Feige, Michael Langberg
   The RPR² Rounding Technique for Semidefinite Programs. [Citation Graph (0, 0)][DBLP]
   ICALP, 2001, pp:213-224 [Conf]
   
8. Jie Gao, Michael Langberg, Leonard J. Schulman
   Analysis of incomplete data and an intrinsic-dimension Helly theorem. [Citation Graph (0, 0)][DBLP]
   SODA, 2006, pp:464-473 [Conf]
   
9. Adi Avidor, Michael Langberg
   The Multi-multiway Cut Problem. [Citation Graph (0, 0)][DBLP]
   SWAT, 2004, pp:273-284 [Conf]
   
10. Uriel Feige, Marek Karpinski, Michael Langberg
    Improved Approximation of MAX-CUT on Graphs of Bounded Degree [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2000, v:7, n:21, pp:- [Journal]
    
11. Uriel Feige, Marek Karpinski, Michael Langberg
    A Note on Approximating MAX-BISECTION on Regular Graphs [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2000, v:7, n:43, pp:- [Journal]
    
12. Michael Langberg
    Testing the independence number of hypergraphs [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2003, v:, n:076, pp:- [Journal]
    
13. Uriel Feige, Marek Karpinski, Michael Langberg
    A note on approximating Max-Bisection on regular graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2001, v:79, n:4, pp:181-188 [Journal]
    
14. Uriel Feige, Marek Karpinski, Michael Langberg
    Improved approximation of Max-Cut on graphs of bounded degree. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2002, v:43, n:2, pp:201-219 [Journal]
    
15. Uriel Feige, Michael Langberg
    Approximation Algorithms for Maximization Problems Arising in Graph Partitioning. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2001, v:41, n:2, pp:174-211 [Journal]
    
16. Uriel Feige, Michael Langberg
    The RPR² rounding technique for semidefinite programs. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2006, v:60, n:1, pp:1-23 [Journal]
    
17. Uriel Feige, Michael Langberg, Gideon Schechtman
    Graphs with Tiny Vector Chromatic Numbers and Huge Chromatic Numbers. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2004, v:33, n:6, pp:1338-1368 [Journal]
    
18. Adi Avidor, Michael Langberg
    The multi-multiway cut problem. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:377, n:1-3, pp:35-42 [Journal]
    
19. Michael Langberg, Alexander Sprintson, Jehoshua Bruck
    The encoding complexity of network coding. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2006, v:52, n:6, pp:2386-2397 [Journal]
    
20. Michael Langberg, Leonard J. Schulman
    Contraction and Expansion of Convex Sets. [Citation Graph (0, 0)][DBLP]
    CCCG, 2007, pp:25-28 [Conf]
    
21. Sidharth Jaggi, Michael Langberg, Sachin Katti, Tracey Ho, Dina Katabi, Muriel Médard
    Resilient Network Coding in the Presence of Byzantine Adversaries. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2007, pp:616-624 [Conf]
    
22. Michael Langberg, Moshe Schwartz, Jehoshua Bruck
    Distributed broadcasting and mapping protocols in directed anonymous networks. [Citation Graph (0, 0)][DBLP]
    PODC, 2007, pp:382-383 [Conf]
    
23. Michael Langberg
    Oblivious channels [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
    
24. 
    Approximating Maximum Subgraphs without Short Cycles. [Citation Graph (, )][DBLP]
    
    
25. 
    f-Sensitivity Distance Oracles and Routing Schemes. [Citation Graph (, )][DBLP]
    
    
26. 
    Universal epsilon-approximators for Integrals. [Citation Graph (, )][DBLP]
    
    
27. 
    Fault-tolerant spanners for general graphs. [Citation Graph (, )][DBLP]
    
    
28. 
    Realtime Classification for Encrypted Traffic. [Citation Graph (, )][DBLP]
    
    
29. 
    Adversarial Models and Resilient Schemes for Network Coding [Citation Graph (, )][DBLP]
    
    
30. 
    "Real" Slepian-Wolf Codes [Citation Graph (, )][DBLP]
    
    
31. 
    Codes against Online Adversaries [Citation Graph (, )][DBLP]
    
    
32. 
    Binary Causal-Adversary Channels [Citation Graph (, )][DBLP]
    
    
33. 
    The Dense k Subgraph problem [Citation Graph (, )][DBLP]
    
    
34. 
    Network Codes Resilient to Jamming and Eavesdropping [Citation Graph (, )][DBLP]
    
    
35. 
    Communicating the sum of sources over a network [Citation Graph (, )][DBLP]
    
    
36. 
    One-Shot Capacity of Discrete Channels [Citation Graph (, )][DBLP]
    
    
37. 
    Analysis of Incomplete Data and an Intrinsic-Dimension Helly Theorem. [Citation Graph (, )][DBLP]
    
    
38. 
    Contraction and Expansion of Convex Sets. [Citation Graph (, )][DBLP]