| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Shiri Chechik, Michael Langberg, David Peleg, Liam Roditty |
f-Sensitivity Distance Oracles and Routing Schemes.  |
Algorithmica  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Bikash Kumar Dey, Sidharth Jaggi, Michael Langberg, Anand D. Sarwate |
Upper Bounds on the Capacity of Binary Channels with Causal Adversaries |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Mira Gonen, Michael Langberg |
Coded Cooperative Data Exchange Problem for General Topologies |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Yuvalal Liron, Michael Langberg |
A characterization of the number of subsequences obtained via the deletion channel |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Ishay Haviv, Michael Langberg |
Beating the Gilbert-Varshamov Bound for Online Channels |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Ishay Haviv, Michael Langberg |
On Linear Index Coding for Random Graphs |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Eyal En Gad, Michael Langberg, Moshe Schwartz, Jehoshua Bruck |
Generalized Gray Codes for Local Rank Modulation |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Michael Langberg, Michelle Effros |
Network Coding: Is zero error always possible? |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Dan Feldman, Michael Langberg |
A Unified Framework for Approximating and Clustering Data |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Eyal En Gad, Michael Langberg, Moshe Schwartz, Jehoshua Bruck |
Constant-Weight Gray Codes for Local Rank Modulation. |
IEEE Transactions on Information Theory |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Langberg, Alexander Sprintson |
On the Hardness of Approximating the Network Coding Capacity. |
IEEE Transactions on Information Theory |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Yossi Berliner, Michael Langberg |
Index coding with outerplanar side information. |
ISIT |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Mohammad Asad R. Chaudhry, Zakia Asad, Alex Sprintson, Michael Langberg |
On the complementary Index Coding problem. |
ISIT |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Eyal En Gad, Michael Langberg, Moshe Schwartz, Jehoshua Bruck |
Generalized Gray codes for local rank modulation. |
ISIT |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Ishay Haviv, Michael Langberg |
Beating the Gilbert-Varshamov bound for online channels. |
ISIT |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Mohammad Asad R. Chaudhry, Zakia Asad, Alexander Sprintson, Michael Langberg |
Finding Sparse Solutions for the Index Coding Problem. |
GLOBECOM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Dan Feldman, Michael Langberg |
A unified framework for approximating and clustering data. |
STOC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Jie Gao, Michael Langberg, Leonard J. Schulman |
Clustering lines in high-dimensional space: Classification of incomplete data. |
ACM Transactions on Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Aditya Ramamoorthy, Michael Langberg |
Communicating the sum of sources over a network |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Anxiao Jiang, Michael Langberg, Moshe Schwartz, Jehoshua Bruck |
Trajectory Codes for Flash Memory |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Hongyi Yao, Danilo Silva, Sidharth Jaggi, Michael Langberg |
Network Codes Resilient to Jamming and Eavesdropping |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Rui A. Costa, Michael Langberg, João Barros |
One-Shot Capacity of Discrete Channels |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Guy Kortsarz, Michael Langberg, Zeev Nutov |
Approximating Maximum Subgraphs without Short Cycles. |
SIAM J. Discrete Math. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Shiri Chechik, Michael Langberg, David Peleg, Liam Roditty |
Fault Tolerant Spanners for General Graphs. |
SIAM J. Comput. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Shiri Chechik, Michael Langberg, David Peleg, Liam Roditty |
f-Sensitivity Distance Oracles and Routing Schemes. |
ESA |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Langberg, Leonard J. Schulman |
Universal epsilon-approximators for Integrals. |
SODA |
2010 |
DBLP BibTeX RDF |
|
| 1 | Roni Bar-Yanai, Michael Langberg, David Peleg, Liam Roditty |
Realtime Classification for Encrypted Traffic. |
SEA |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Bikash Kumar Dey, Sidharth Jaggi, Michael Langberg, Anand D. Sarwate |
Coding against delayed adversaries. |
ISIT |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Anxiao Jiang, Michael Langberg, Robert Mateescu, Jehoshua Bruck |
Data movement and aggregation in flash memories. |
ISIT |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Langberg, Aditya Ramamoorthy |
Communicating the sum of sources in a 3-sources/3-terminals network; revisited. |
ISIT |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Rui A. Costa, Michael Langberg, João Barros |
One-shot capacity of discrete channels. |
ISIT |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Langberg, Leonard J. Schulman |
Contraction and Expansion of Convex Sets. |
Discrete & Computational Geometry |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Langberg, Sidharth Jaggi, Bikash Kumar Dey |
Binary Causal-Adversary Channels |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Doron Goldstein, Michael Langberg |
The Dense k Subgraph problem |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Michael Langberg, Alexander Sprintson, Jehoshua Bruck |
Network Coding: A Computational Perspective. |
IEEE Transactions on Information Theory |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Anxiao Jiang, Michael Langberg, Moshe Schwartz, Jehoshua Bruck |
Universal rewriting in constrained memories. |
ISIT |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Langberg, Sidharth Jaggi, Bikash Kumar Dey |
Binary causal-adversary channels. |
ISIT |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Langberg, Aditya Ramamoorthy |
Communicating the sum of sources in a 3-sources/3-terminals network. |
ISIT |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Shiri Chechik, Michael Langberg, David Peleg, Liam Roditty |
Fault-tolerant spanners for general graphs. |
STOC |
2009 |
DBLP DOI BibTeX RDF |
fault-tolerance, graphs, spanners |
| 1 | Jie Gao, Michael Langberg, Leonard J. Schulman |
Analysis of Incomplete Data and an Intrinsic-Dimension Helly Theorem. |
Discrete & Computational Geometry |
2008 |
DBLP DOI BibTeX RDF |
Helly theorem, Clustering, Approximation, Inference, Incomplete data, k-center, Core set |
| 1 | Leah Nutman, Michael Langberg |
Adversarial Models and Resilient Schemes for Network Coding |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Bikash Kumar Dey, Sidharth Jaggi, Michael Langberg |
"Real" Slepian-Wolf Codes |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Bikash Kumar Dey, Sidharth Jaggi, Michael Langberg |
Codes against Online Adversaries |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Michael Langberg |
Oblivious Communication Channels and Their Capacity. |
IEEE Transactions on Information Theory |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Sidharth Jaggi, Michael Langberg, Sachin Katti, Tracey Ho, Dina Katabi, Muriel Médard, Michelle Effros |
Resilient Network Coding in the Presence of Byzantine Adversaries. |
IEEE Transactions on Information Theory |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Langberg, Alexander Sprintson, Jehoshua Bruck |
Optimal Universal Schedules for Discrete Broadcast. |
IEEE Transactions on Information Theory |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Langberg |
Graph Coloring. |
Encyclopedia of Algorithms |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Sagar Shenvi, Bikash Kumar Dey, Sidharth Jaggi, Michael Langberg |
"Real" Slepian-Wolf codes. |
ISIT |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Langberg, Alex Sprintson |
On the hardness of approximating the network coding capacity. |
ISIT |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Nutman, Michael Langberg |
Adversarial models and resilient schemes for network coding. |
ISIT |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Guy Kortsarz, Michael Langberg, Zeev Nutov |
Approximating Maximum Subgraphs without Short Cycles. |
APPROX-RANDOM |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Adi Avidor, Michael Langberg |
The multi-multiway cut problem. |
Theor. Comput. Sci. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Langberg, Leonard J. Schulman |
Contraction and Expansion of Convex Sets. |
CCCG |
2007 |
DBLP BibTeX RDF |
|
| 1 | Sidharth Jaggi, Michael Langberg, Sachin Katti, Tracey Ho, Dina Katabi, Muriel Médard |
Resilient Network Coding in the Presence of Byzantine Adversaries. |
INFOCOM |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Langberg, Moshe Schwartz, Jehoshua Bruck |
Distributed broadcasting and mapping protocols in directed anonymous networks. |
PODC |
2007 |
DBLP DOI BibTeX RDF |
broadcast, anonymous networks, directed networks |
| 1 | Uriel Feige, Michael Langberg |
The RPR2 rounding technique for semidefinite programs. |
J. Algorithms |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Langberg |
Oblivious channels |
CoRR |
2006 |
DBLP BibTeX RDF |
|
| 1 | Michael Langberg, Alexander Sprintson, Jehoshua Bruck |
The encoding complexity of network coding. |
IEEE Transactions on Information Theory |
2006 |
DBLP DOI BibTeX RDF |
coding networks, encoding links, encoding nodes, multicast, network coding |
| 1 | Jie Gao, Michael Langberg, Leonard J. Schulman |
Analysis of incomplete data and an intrinsic-dimension Helly theorem. |
SODA |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Langberg, Yuval Rabani, Chaitanya Swamy |
Approximation Algorithms for Graph Homomorphism Problems. |
APPROX-RANDOM |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Uriel Feige, Michael Langberg, Gideon Schechtman |
Graphs with Tiny Vector Chromatic Numbers and Huge Chromatic Numbers. |
SIAM J. Comput. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Adi Avidor, Michael Langberg |
The Multi-multiway Cut Problem. |
SWAT |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Langberg |
Testing the Independence Number of Hypergraphs. |
APPROX-RANDOM |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Langberg |
Private Codes or Succinct Random Codes That Are (Almost) Perfect. |
FOCS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Langberg |
Testing the independence number of hypergraphs |
Electronic Colloquium on Computational Complexity (ECCC) |
2003 |
DBLP BibTeX RDF |
|
| 1 | Michael Langberg, Amir Pnueli, Yoav Rodeh |
The ROBDD Size of Simple CNF Formulas. |
CHARME |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Uriel Feige, Marek Karpinski, Michael Langberg |
Improved approximation of Max-Cut on graphs of bounded degree. |
J. Algorithms |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Uriel Feige, Michael Langberg, Gideon Schechtman |
Graphs with Tiny Vector Chromatic Numbers and Huge Chromatic Numbers. |
FOCS |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Uriel Feige, Marek Karpinski, Michael Langberg |
A note on approximating Max-Bisection on regular graphs. |
Inf. Process. Lett. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Uriel Feige, Michael Langberg |
Approximation Algorithms for Maximization Problems Arising in Graph Partitioning. |
J. Algorithms |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Uriel Feige, Michael Langberg |
The RPR2 Rounding Technique for Semidefinite Programs. |
ICALP |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Uriel Feige, Marek Karpinski, Michael Langberg |
A Note on Approximating MAX-BISECTION on Regular Graphs |
Electronic Colloquium on Computational Complexity (ECCC) |
2000 |
DBLP BibTeX RDF |
|
| 1 | Uriel Feige, Marek Karpinski, Michael Langberg |
Improved Approximation of MAX-CUT on Graphs of Bounded Degree |
Electronic Colloquium on Computational Complexity (ECCC) |
2000 |
DBLP BibTeX RDF |
|
| 1 | Uriel Feige, Michael Langberg, Kobbi Nissim |
On the hardness of approximating N P witnesses. |
APPROX |
2000 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")