default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichael Langberg
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j44]Mira Gonen
, Ishay Haviv, Michael Langberg, Alex Sprintson:
Minimizing the Alphabet Size in Codes With Restricted Error Sets. IEEE Trans. Inf. Theory 70(6): 3891-3902 (2024)- [j43]Michael Langberg, Oron Sabag:
Competitive Channel-Capacity. IEEE Trans. Inf. Theory 70(7): 4585-4598 (2024) - [c114]Michael Langberg, Oron Sabag:
Competitive Analysis of Arbitrary Varying Channels. ISIT 2024: 145-150 - [c113]Michael Langberg, Michelle Effros:
Characterizing positive-rate secure multicast network coding with eavesdropping nodes. ISIT 2024: 1303-1308 - [c112]Bikash Kumar Dey, Sidharth Jaggi, Michael Langberg, Anand D. Sarwate, Y. Zhang:
Computationally Efficient Codes for Strongly Dobrushin-Stambler Nonsymmetrizable Oblivious AVCs. ISIT 2024: 1586-1591 - [c111]Oliver Kosut, Michelle Effros, Michael Langberg:
Nobody Expects a Differential Equation: Minimum Energy-Per-Bit for the Gaussian Relay Channel with Rank-1 Linear Relaying. ISIT 2024: 3332-3337 - [i71]Oliver Kosut, Michelle Effros, Michael Langberg:
Nobody Expects a Differential Equation: Minimum Energy-Per-Bit for the Gaussian Relay Channel with Rank-1 Linear Relaying. CoRR abs/2401.15495 (2024) - [i70]Payam Abdisarabshali, Kwang Taik Kim, Michael Langberg, Weifeng Su, Seyyedali Hosseinalipour:
Dynamic D2D-Assisted Federated Learning over O-RAN: Performance Analysis, MAC Scheduler, and Asymmetric User Selection. CoRR abs/2404.06324 (2024) - [i69]Michael Langberg, Michelle Effros:
Characterizing positive-rate key-cast (and multicast network coding) with eavesdropping nodes. CoRR abs/2407.01703 (2024) - [i68]Michael Langberg, Oron Sabag:
Competitive Analysis of Arbitrary Varying Channels. CoRR abs/2407.02949 (2024) - 2023
- [c110]Sijie Li, Prasad Krishnan, Sidharth Jaggi, Michael Langberg, Anand D. Sarwate:
Computationally Efficient Codes for Adversarial Binary-Erasure Channels. ISIT 2023: 228-233 - [c109]Michael Langberg, Oron Sabag:
Competitive Channel-Capacity. ISIT 2023: 939-944 - [c108]Oliver Kosut, Michelle Effros, Michael Langberg:
Perfect vs. Independent Feedback in the Multiple-Access Channel. ISIT 2023: 1502-1507 - [i67]Michael Langberg, Michelle Effros:
Multiple Key-cast over Networks. CoRR abs/2302.03524 (2023) - [i66]Oliver Kosut, Michelle Effros, Michael Langberg:
Perfect vs. Independent Feedback in the Multiple-Access Channel. CoRR abs/2305.06340 (2023) - [i65]Michael Langberg, Oron Sabag:
Competitive Channel-Capacity. CoRR abs/2306.07814 (2023) - 2022
- [j42]Mira Gonen, Michael Langberg, Alex Sprintson:
Latency and Alphabet Size in the Context of Multicast Network Coding. IEEE Trans. Inf. Theory 68(7): 4289-4300 (2022) - [c107]Mira Gonen, Michael Langberg, Alex Sprintson:
Group Testing on General Set-Systems. ISIT 2022: 874-879 - [c106]Oliver Kosut, Michelle Effros, Michael Langberg:
On the Benefit of Cooperation in Relay Networks. ISIT 2022: 1945-1950 - [c105]Yihan Zhang, Sidharth Jaggi, Michael Langberg, Anand D. Sarwate:
The Capacity of Causal Adversarial Channels. ISIT 2022: 2523-2528 - [c104]Michael Langberg, Michelle Effros:
Network Coding Multicast Key-Capacity. ITW 2022: 422-427 - [i64]Oliver Kosut, Michelle Effros, Michael Langberg:
On the Benefit of Cooperation in Relay Networks. CoRR abs/2202.01878 (2022) - [i63]Michael Langberg, Michelle Effros:
Network Coding Multicast Key-Capacity. CoRR abs/2202.03918 (2022) - [i62]Mira Gonen, Michael Langberg, Alex Sprintson:
Group Testing on General Set-Systems. CoRR abs/2202.04988 (2022) - [i61]Yihan Zhang, Sidharth Jaggi, Michael Langberg, Anand D. Sarwate:
The Capacity of Causal Adversarial Channels. CoRR abs/2205.06708 (2022) - 2021
- [j41]Parham Noorzad, Michelle Effros, Michael Langberg, Victoria Kostina:
The Birthday Problem and Zero-Error List Codes. IEEE Trans. Inf. Theory 67(9): 5791-5803 (2021) - [j40]Parham Noorzad, Michael Langberg, Michelle Effros:
Negligible Cooperation: Contrasting the Maximal- and Average-Error Cases. IEEE Trans. Inf. Theory 67(9): 5885-5902 (2021) - [j39]Hossein Kamrani, Alireza Zolghadr-E-Asli, Panos P. Markopoulos, Michael Langberg, Dimitris A. Pados, George N. Karystinos:
Reduced-Rank L1-Norm Principal-Component Analysis With Performance Guarantees. IEEE Trans. Signal Process. 69: 240-255 (2021) - [c103]Mira Gonen, Michael Langberg, Alex Sprintson:
Minimizing the Alphabet Size in Codes with Restricted Error Sets. ISIT 2021: 940-945 - [c102]Michael Langberg, Michelle Effros:
Edge removal in undirected networks. ISIT 2021: 1421-1426 - [c101]Oliver Kosut, Michelle Effros, Michael Langberg:
Every Bit Counts: Second-Order Analysis of Cooperation in the Multiple-Access Channel. ISIT 2021: 2214-2219 - [i60]Michael Langberg, Michelle Effros:
Beyond Capacity: The Joint Time-Rate Region. CoRR abs/2101.12236 (2021) - [i59]Oliver Kosut, Michelle Effros, Michael Langberg:
Every Bit Counts: Second-Order Analysis of Cooperation in the Multiple-Access Channel. CoRR abs/2102.01247 (2021) - [i58]Mira Gonen, Michael Langberg, Alex Sprintson:
Minimizing the alphabet size in codes with restricted error sets. CoRR abs/2102.02608 (2021) - 2020
- [j38]Michael Langberg, Michelle Effros:
The Edge-Removal Problem's Connections to the Zero-Error and $\delta$ -Dependence Problems in Network Coding. IEEE Trans. Inf. Theory 66(2): 900-913 (2020) - [c100]Mira Gonen, Ishay Haviv, Michael Langberg, Alex Sprintson:
Minimizing the alphabet size of erasure codes with restricted decoding sets. ISIT 2020: 144-149 - [c99]Amitalok J. Budkuley, Bikash Kumar Dey, Sidharth Jaggi, Michael Langberg, Anand D. Sarwate, Carol Wang:
Symmetrizability for Myopic AVCs. ISIT 2020: 2103-2107 - [i57]Fei Wei, Michael Langberg, Michelle Effros:
Towards an Operational Definition of Group Network Codes. CoRR abs/2002.00781 (2020) - [i56]Michael Langberg, Shi Li, Sai Vikneshwar Mani Jayaraman, Atri Rudra:
Topology Dependent Bounds For FAQs. CoRR abs/2003.05575 (2020) - [i55]Mira Gonen, Ishay Haviv, Michael Langberg, Alex Sprintson:
Minimizing the alphabet size of erasure codes with restricted decoding sets. CoRR abs/2005.06947 (2020) - [i54]Michael Langberg, Michelle Effros:
Edge removal in undirected networks. CoRR abs/2005.10315 (2020)
2010 – 2019
- 2019
- [j37]Ishay Haviv, Michael Langberg:
H-wise Independence. Chic. J. Theor. Comput. Sci. 2019 (2019) - [j36]Zitan Chen, Sidharth Jaggi, Michael Langberg:
The Capacity of Online (Causal) $q$ -Ary Error-Erasure Channels. IEEE Trans. Inf. Theory 65(6): 3384-3411 (2019) - [j35]Bikash Kumar Dey, Sidharth Jaggi, Michael Langberg:
Sufficiently Myopic Adversaries Are Blind. IEEE Trans. Inf. Theory 65(9): 5718-5736 (2019) - [c98]Fei Wei, Michael Langberg, Michelle Effros:
A Local Perspective on the Edge Removal Problem. ISIT 2019: 191-195 - [c97]Bikash Kumar Dey, Sidharth Jaggi, Michael Langberg, Anand D. Sarwate, Carol Wang:
The Interplay of Causality and Myopia in Adversarial Channel Models. ISIT 2019: 1002-1006 - [c96]Debaditya Chaudhuri, Michael Langberg, Michelle Effros:
Secure Network Coding in the Setting in Which a Non-Source Node May Generate Random Keys. ISIT 2019: 2309-2313 - [c95]Michael Langberg, Shi Li, Sai Vikneshwar Mani Jayaraman, Atri Rudra:
Topology Dependent Bounds For FAQs. PODS 2019: 432-449 - [i53]Fei Wei, Michael Langberg, Michelle Effros:
A Local Perspective on the Edge Removal Problem. CoRR abs/1907.01133 (2019) - [i52]Debaditya Chaudhuri, Michael Langberg, Michelle Effros:
Secure Network Coding in the Setting in Which a Non-Source Node May Generate Random Keys. CoRR abs/1907.03522 (2019) - [i51]Parham Noorzad, Michael Langberg, Michelle Effros:
Negligible Cooperation: Contrasting the Maximal- and Average-Error Cases. CoRR abs/1911.10449 (2019) - 2018
- [j34]Parham Noorzad, Michelle Effros, Michael Langberg:
The Unbounded Benefit of Encoder Cooperation for the $k$ -User MAC. IEEE Trans. Inf. Theory 64(5): 3655-3678 (2018) - [j33]Parham Noorzad, Michelle Effros, Michael Langberg:
Can Negligible Rate Increase Network Reliability? IEEE Trans. Inf. Theory 64(6): 4282-4293 (2018) - [j32]Wentao Huang, Tracey Ho, Michael Langberg, Jörg Kliewer:
Single-Unicast Secure Network Coding and Network Error Correction are as Hard as Multiple-Unicast Network Coding. IEEE Trans. Inf. Theory 64(6): 4496-4512 (2018) - [c94]Mira Gonen, Michael Langberg, Alex Sprintson:
Latency and Alphabet Size in the Context of Multicast Network Coding. Allerton 2018: 212-218 - [c93]Tongxin Li, Bikash Kumar Dey, Sidharth Jaggi, Michael Langberg, Anand D. Sarwate:
Quadratically Constrained Channels with Causal Adversaries. ISIT 2018: 621-625 - [c92]Debaditya Chaudhuri, Michael Langberg:
Trade-offs between Rate and Security in Linear Multicast Network Coding. ISIT 2018: 846-850 - [c91]Parham Noorzad, Michelle Effros, Michael Langberg:
Can Negligihle Cooperation Increase Capacity? The Average-Error Case. ISIT 2018: 1256-1260 - [i50]Parham Noorzad, Michelle Effros, Michael Langberg:
Can Negligible Cooperation Increase Network Capacity? The Average-Error Case. CoRR abs/1801.03655 (2018) - [i49]Parham Noorzad, Michelle Effros, Michael Langberg, Victoria Kostina:
The Birthday Problem and Zero-Error List Codes. CoRR abs/1802.04719 (2018) - [i48]Tongxin Li, Bikash Kumar Dey, Sidharth Jaggi, Michael Langberg, Anand D. Sarwate:
Quadratically Constrained Channels with Causal Adversaries. CoRR abs/1805.03319 (2018) - 2017
- [j31]Michael Langberg, Moshe Schwartz, Eitan Yaakobi:
Coding for the ℓ∞-Limited Permutation Channel. IEEE Trans. Inf. Theory 63(12): 7676-7686 (2017) - [c90]Fei Wei, Michael Langberg:
The effect of removing a network communication edge: Group network codes. Allerton 2017: 134-141 - [c89]Parham Noorzad, Michelle Effros, Michael Langberg:
The benefit of encoder cooperation in the presence of state information. ISIT 2017: 41-45 - [c88]Sidharth Jaggi, Michael Langberg:
Two-way interference channels with jammers. ISIT 2017: 491-495 - [c87]Ishay Haviv, Michael Langberg, Moshe Schwartz, Eitan Yaakobi:
Non-linear cyclic codes that attain the Gilbert-Varshamov bound. ISIT 2017: 586-588 - [c86]Ming Fai Wong, Michelle Effros, Michael Langberg:
A code equivalence between streaming network coding and streaming index coding. ISIT 2017: 1638-1642 - [c85]Parham Noorzad, Michelle Effros, Michael Langberg, Victoria Kostina:
The birthday problem and zero-error list codes. ISIT 2017: 1648-1652 - [c84]Arkadev Chattopadhyay, Michael Langberg, Shi Li, Atri Rudra:
Tight Network Topology Dependent Bounds on Rounds of Communication. SODA 2017: 2524-2539 - [i47]Ishay Haviv, Michael Langberg, Moshe Schwartz, Eitan Yaakobi:
Non-linear Cyclic Codes that Attain the Gilbert-Varshamov Bound. CoRR abs/1701.01043 (2017) - [i46]Parham Noorzad, Michelle Effros, Michael Langberg:
The Benefit of Encoder Cooperation in the Presence of State Information. CoRR abs/1707.05869 (2017) - 2016
- [j30]Eyal En Gad, Yue Li, Jörg Kliewer, Michael Langberg, Anxiao Andrew Jiang, Jehoshua Bruck:
Asymmetric Error Correction and Flash-Memory Rewriting Using Polar Codes. IEEE Trans. Inf. Theory 62(7): 4024-4038 (2016) - [j29]Wentao Huang, Michael Langberg, Jörg Kliewer, Jehoshua Bruck:
Communication Efficient Secret Sharing. IEEE Trans. Inf. Theory 62(12): 7195-7206 (2016) - [c83]Michael Langberg, Michelle Effros:
On the Capacity Advantage of a Single Bit. GLOBECOM Workshops 2016: 1-6 - [c82]Parham Noorzad, Michelle Effros, Michael Langberg:
The unbounded benefit of encoder cooperation for the k-user MAC. ISIT 2016: 340-344 - [c81]Bikash Kumar Dey, Sidharth Jaggi, Michael Langberg, Anand D. Sarwate:
A bit of delay is sufficient and stochastic encoding is necessary to overcome online adversarial erasures. ISIT 2016: 880-884 - [c80]Zitan Chen, Sidharth Jaggi, Michael Langberg:
The capacity of online (causal) q-ary error-erasure channels. ISIT 2016: 915-919 - [c79]Woong Kim, Michael Langberg, Michelle Effros:
A characterization of the capacity region for network coding with dependent sources. ISIT 2016: 1764-1768 - [c78]Ming Fai Wong, Michelle Effros, Michael Langberg:
On tightness of an entropic region outer bound for network coding and the edge removal property. ISIT 2016: 1769-1773 - [c77]Parham Noorzad, Michelle Effros, Michael Langberg:
Can negligible cooperation increase network reliability? ISIT 2016: 1784-1788 - [r2]Michael Langberg, Chandra Chekuri:
Graph Coloring. Encyclopedia of Algorithms 2016: 869-872 - [i45]Parham Noorzad, Michelle Effros, Michael Langberg:
Can Negligible Cooperation Increase Network Reliability? (Extended Version). CoRR abs/1601.05769 (2016) - [i44]Parham Noorzad, Michelle Effros, Michael Langberg:
The Unbounded Benefit of Encoder Cooperation for the $k$-User MAC (Extended Version). CoRR abs/1601.06113 (2016) - [i43]Zitan Chen, Sidharth Jaggi, Michael Langberg:
The Capacity of Online (Causal) $q$-ary Error-Erasure Channels. CoRR abs/1602.00276 (2016) - [i42]Bikash Kumar Dey, Sidharth Jaggi, Michael Langberg, Anand D. Sarwate:
The benefit of a 1-bit jump-start, and the necessity of stochastic encoding, in jamming channels. CoRR abs/1602.02384 (2016) - [i41]Michael Langberg, Michelle Effros:
On the Capacity Advantage of a Single Bit. CoRR abs/1607.07024 (2016) - [i40]Arkadev Chattopadhyay, Michael Langberg, Shi Li, Atri Rudra:
Tight Network Topology Dependent Bounds on Rounds of Communication. CoRR abs/1608.03313 (2016) - [i39]Bikash Kumar Dey, Sidharth Jaggi, Michael Langberg:
Sufficiently Myopic Adversaries are Blind. CoRR abs/1610.01287 (2016) - [i38]Arkadev Chattopadhyay, Michael Langberg, Shi Li, Atri Rudra:
Tight Network Topology Dependent Bounds on Rounds of Communication. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [j28]Yuvalal Liron, Michael Langberg:
A Characterization of the Number of Subsequences Obtained via the Deletion Channel. IEEE Trans. Inf. Theory 61(5): 2300-2312 (2015) - [j27]Michelle Effros, Salim Y. El Rouayheb, Michael Langberg:
An Equivalence Between Network Coding and Index Coding. IEEE Trans. Inf. Theory 61(5): 2478-2487 (2015) - [j26]Mira Gonen, Michael Langberg:
Coded Cooperative Data Exchange Problem for General Topologies. IEEE Trans. Inf. Theory 61(10): 5656-5669 (2015) - [c76]Parham Noorzad, Michelle Effros, Michael Langberg:
On the cost and benefit of cooperation. ISIT 2015: 36-40 - [c75]Wentao Huang, Michael Langberg, Jörg Kliewer:
Connecting multiple-unicast and network error correction: Reduction and unachievability. ISIT 2015: 361-365 - [c74]Ming Fai Wong, Michelle Effros, Michael Langberg:
On an equivalence of the reduction of k-unicast to 2-unicast capacity and the edge removal property. ISIT 2015: 371-375 - [c73]Bikash Kumar Dey, Sidharth Jaggi, Michael Langberg:
Sufficiently myopic adversaries are blind. ISIT 2015: 1164-1168 - [c72]Michael Langberg, Moshe Schwartz, Eitan Yaakobi:
Coding for the ℓ∞-limited permutation channel. ISIT 2015: 1936-1940 - [c71]Mingyue Ji, Ming Fai Wong, Antonia M. Tulino, Jaime Llorca, Giuseppe Caire, Michelle Effros, Michael Langberg:
On the fundamental limits of caching in combination networks. SPAWC 2015: 695-699 - [c70]Zitan Chen, Sidharth Jaggi, Michael Langberg:
A Characterization of the Capacity of Online (causal) Binary Channels. STOC 2015: 287-296 - [i37]Parham Noorzad, Michelle Effros, Michael Langberg:
On the Cost and Benefit of Cooperation (Extended Version). CoRR abs/1504.04432 (2015) - [i36]Wentao Huang, Michael Langberg, Jörg Kliewer:
Connecting Multiple-unicast and Network Error Correction: Reduction and Unachievability. CoRR abs/1504.04930 (2015) - [i35]Wentao Huang, Michael Langberg, Jörg Kliewer, Jehoshua Bruck:
Communication Efficient Secret Sharing. CoRR abs/1505.07515 (2015) - [i34]Parham Noorzad, Michelle Effros, Michael Langberg:
The Multivariate Covering Lemma and its Converse. CoRR abs/1508.03349 (2015) - 2014
- [j25]Hongyi Yao, Danilo Silva, Sidharth Jaggi, Michael Langberg:
Network Codes Resilient to Jamming and Eavesdropping. IEEE/ACM Trans. Netw. 22(6): 1978-1987 (2014) - [c69]Wentao Huang, Tracey Ho, Michael Langberg, Jörg Kliewer:
Single-source/sink network error correction is as hard as multiple-unicast. Allerton 2014: 423-430 - [c68]Wentao Huang, Tracey Ho, Michael Langberg, Jörg Kliewer:
Reverse edge cut-set bounds for secure network coding. ISIT 2014: 106-110 - [c67]Karthikeyan Shanmugam, Alexandros G. Dimakis, Michael Langberg:
Graph theory versus minimum rank for index coding. ISIT 2014: 291-295 - [c66]Eyal En Gad, Yue Li, Jörg Kliewer, Michael Langberg, Anxiao Jiang, Jehoshua Bruck:
Polar coding for noisy write-once memories. ISIT 2014: 1638-1642 - [c65]Ming Fai Wong, Michael Langberg, Michelle Effros:
Linear capacity equivalence between multiple multicast and multiple unicast. ISIT 2014: 2152-2156 - [c64]Parham Noorzad, Michelle Effros, Michael Langberg, Tracey Ho:
On the power of cooperation: Can a little help a lot? ISIT 2014: 3132-3136 - [c63]Michelle Effros, Michael Langberg:
Is there a canonical network for network information theory? ITW 2014: 82-86 - [i33]Parham Noorzad, Michelle Effros, Michael Langberg, Tracey Ho:
On the Power of Cooperation: Can a Little Help a Lot? (Extended Version). CoRR abs/1401.6498 (2014) - [i32]Wentao Huang, Tracey Ho, Michael Langberg, Jörg Kliewer:
Reverse Edge Cut-Set Bounds for Secure Network Coding. CoRR abs/1401.7085 (2014) - [i31]Karthikeyan Shanmugam, Alexandros G. Dimakis, Michael Langberg:
Graph Theory versus Minimum Rank for Index Coding. CoRR abs/1402.3898 (2014) - [i30]Wentao Huang, Tracey Ho, Michael Langberg, Jörg Kliewer:
Single-Source/Sink Network Error Correction Is as Hard as Multiple-Unicast. CoRR abs/1410.1905 (2014) - [i29]Eyal En Gad, Yue Li, Jörg Kliewer, Michael Langberg, Anxiao Jiang, Jehoshua Bruck:
Asymmetric Error Correction and Flash-Memory Rewriting using Polar Codes. CoRR abs/1410.3542 (2014) - [i28]Zitan Chen, Sidharth Jaggi, Michael Langberg:
A characterization of the capacity of online (causal) binary channels. CoRR abs/1412.6376 (2014) - 2013
- [j24]Aditya Ramamoorthy, Michael Langberg:
Communicating the Sum of Sources Over a Network. IEEE J. Sel. Areas Commun. 31(4): 655-665 (2013) - [j23]Bikash Kumar Dey, Sidharth Jaggi, Michael Langberg:
Codes Against Online Adversaries: Large Alphabets. IEEE Trans. Inf. Theory 59(6): 3304-3316 (2013) - [j22]Bikash Kumar Dey, Sidharth Jaggi, Michael Langberg, Anand D. Sarwate:
Upper Bounds on the Capacity of Binary Channels With Causal Adversaries. IEEE Trans. Inf. Theory 59(6): 3753-3763 (2013) - [j21]Anxiao Jiang, Michael Langberg, Moshe Schwartz, Jehoshua Bruck:
Trajectory Codes for Flash Memory. IEEE Trans. Inf. Theory 59(7): 4530-4541 (2013) - [j20]Eyal En Gad, Michael Langberg, Moshe Schwartz, Jehoshua Bruck:
Generalized Gray Codes for Local Rank Modulation. IEEE Trans. Inf. Theory 59(10): 6664-6673 (2013) - [c62]Ming Fai Wong, Michael Langberg, Michelle Effros:
On a capacity equivalence between multiple multicast and multiple unicast. Allerton 2013: 1537-1544 - [c61]Ishay Haviv, Michael Langberg:
H-wise independence. ITCS 2013: 541-552 - [c60]Eitan Yaakobi, Moshe Schwartz, Michael Langberg, Jehoshua Bruck:
Sequence reconstruction for Grassmann graphs and permutations. ISIT 2013: 874-878 - [c59]Michelle Effros, Salim Y. El Rouayheb, Michael Langberg:
An equivalence between network coding and index coding. ISIT 2013: 967-971 - [c58]Ming Fai Wong, Michael Langberg, Michelle Effros:
On a capacity equivalence between network and index coding and the edge removal problem. ISIT 2013: 972-976 - [c57]Anxiao Andrew Jiang, Yue Li, Eyal En Gad, Michael Langberg, Jehoshua Bruck:
Joint rewriting and error correction in write-once memories. ISIT 2013: 1067-1071 - [c56]Eitan Yaakobi, Michael Langberg, Jehoshua Bruck:
Information-theoretic study of voting systems. ISIT 2013: 1087-1091 - [c55]Karthikeyan Shanmugam, Alexandros G. Dimakis, Michael Langberg:
Local graph coloring and index coding. ISIT 2013: 1152-1156 - [c54]Anxiao Andrew Jiang, Yue Li, Eyal En Gad, Michael Langberg, Jehoshua Bruck:
Error correcting code for flash memories. ITA 2013: 1-4 - [c53]Eun Jee Lee, Michael Langberg, Michelle Effros:
Outer bounds and a functional study of the edge removal problem. ITW 2013: 1-5 - [c52]Ilia Levi, Dan Vilenchik, Michael Langberg, Michelle Effros:
Zero vs. ε error in interference channels. ITW 2013: 1-5 - [c51]Pak Hou Che, Minghua Chen, Tracey Ho, Sidharth Jaggi, Michael Langberg:
Routing for security in networks with adversarial nodes. NetCod 2013: 1-6 - [c50]Wentao Huang, Tracey Ho, Michael Langberg, Jörg Kliewer:
On secure network coding with uniform wiretap sets. NetCod 2013: 1-6 - [i27]Karthikeyan Shanmugam, Alexandros G. Dimakis, Michael Langberg:
Local Graph Coloring and Index Coding. CoRR abs/1301.5359 (2013) - [i26]Pak Hou Che, Minghua Chen, Tracey Ho, Sidharth Jaggi, Michael Langberg:
Routing for Security in Networks with Adversarial Nodes. CoRR abs/1303.0141 (2013) - [i25]Ilia Levi, Dan Vilenchik, Michael Langberg, Michelle Effros:
Zero vs. epsilon Error in Interference Channels. CoRR abs/1307.6779 (2013) - 2012
- [j19]Shiri Chechik, Michael Langberg, David Peleg, Liam Roditty:
f-Sensitivity Distance Oracles and Routing Schemes. Algorithmica 63(4): 861-882 (2012) - [c49]Yuvalal Liron, Michael Langberg:
A characterization of the number of subsequences obtained via the deletion channel. ISIT 2012: 503-507 - [c48]Bikash Kumar Dey, Sidharth Jaggi, Michael Langberg, Anand D. Sarwate:
Improved upper bounds on the capacity of binary channels with causal adversaries. ISIT 2012: 681-685 - [c47]Ishay Haviv, Michael Langberg:
On linear index coding for random graphs. ISIT 2012: 2231-2235 - [c46]Mira Gonen, Michael Langberg:
Coded cooperative data exchange problem for general topologies. ISIT 2012: 2606-2610 - [c45]Michael Langberg, Michelle Effros:
Source coding for dependent sources. ITW 2012: 70-74 - [i24]Yuvalal Liron, Michael Langberg:
A characterization of the number of subsequences obtained via the deletion channel. CoRR abs/1202.1644 (2012) - [i23]Mira Gonen, Michael Langberg:
Coded Cooperative Data Exchange Problem for General Topologies. CoRR abs/1202.2088 (2012) - [i22]Bikash Kumar Dey, Sidharth Jaggi, Michael Langberg, Anand D. Sarwate:
Upper Bounds on the Capacity of Binary Channels with Causal Adversaries. CoRR abs/1204.2587 (2012) - [i21]Wentao Huang, Tracey Ho, Michael Langberg, Jörg Kliewer:
On secure network coding with uniform wiretap sets. CoRR abs/1208.4390 (2012) - [i20]Michael Langberg, Dan Vilenchik:
Edge distribution in generalized graph products. CoRR abs/1211.1467 (2012) - [i19]Michelle Effros, Salim Y. El Rouayheb, Michael Langberg:
An Equivalence between Network Coding and Index Coding. CoRR abs/1211.6660 (2012) - 2011
- [j18]Michael Langberg, Alexander Sprintson:
On the Hardness of Approximating the Network Coding Capacity. IEEE Trans. Inf. Theory 57(2): 1008-1014 (2011) - [j17]Eyal En Gad, Michael Langberg, Moshe Schwartz, Jehoshua Bruck:
Constant-Weight Gray Codes for Local Rank Modulation. IEEE Trans. Inf. Theory 57(11): 7431-7442 (2011) - [c44]Michael Langberg, Michelle Effros:
Network coding: Is zero error always possible? Allerton 2011: 1478-1485 - [c43]Mohammad Asad R. Chaudhry, Zakia Asad, Alexander Sprintson, Michael Langberg:
Finding Sparse Solutions for the Index Coding Problem. GLOBECOM 2011: 1-5 - [c42]Mohammad Asad R. Chaudhry, Zakia Asad, Alex Sprintson, Michael Langberg:
On the complementary Index Coding problem. ISIT 2011: 244-248 - [c41]Yossi Berliner, Michael Langberg:
Index coding with outerplanar side information. ISIT 2011: 806-810 - [c40]Eyal En Gad, Michael Langberg, Moshe Schwartz, Jehoshua Bruck:
Generalized Gray codes for local rank modulation. ISIT 2011: 874-878 - [c39]Ishay Haviv, Michael Langberg:
Beating the Gilbert-Varshamov bound for online channels. ISIT 2011: 1392-1396 - [c38]Dan Feldman, Michael Langberg:
A unified framework for approximating and clustering data. STOC 2011: 569-578 - [i18]Ishay Haviv, Michael Langberg:
Beating the Gilbert-Varshamov Bound for Online Channels. CoRR abs/1101.1045 (2011) - [i17]Michael Langberg, Michelle Effros:
Network Coding: Is zero error always possible? CoRR abs/1102.3162 (2011) - [i16]Eyal En Gad, Michael Langberg, Moshe Schwartz, Jehoshua Bruck:
Generalized Gray Codes for Local Rank Modulation. CoRR abs/1103.0317 (2011) - [i15]Dan Feldman, Michael Langberg:
A Unified Framework for Approximating and Clustering Data. CoRR abs/1106.1379 (2011) - [i14]Ishay Haviv, Michael Langberg:
On Linear Index Coding for Random Graphs. CoRR abs/1107.0390 (2011) - 2010
- [j16]Shiri Chechik, Michael Langberg, David Peleg, Liam Roditty:
Fault Tolerant Spanners for General Graphs. SIAM J. Comput. 39(7): 3403-3423 (2010) - [j15]Guy Kortsarz, Michael Langberg, Zeev Nutov:
Approximating Maximum Subgraphs without Short Cycles. SIAM J. Discret. Math. 24(1): 255-269 (2010) - [j14]Jie Gao, Michael Langberg, Leonard J. Schulman:
Clustering lines in high-dimensional space: Classification of incomplete data. ACM Trans. Algorithms 7(1): 8:1-8:26 (2010) - [c37]Shiri Chechik, Michael Langberg, David Peleg, Liam Roditty:
f-Sensitivity Distance Oracles and Routing Schemes. ESA (1) 2010: 84-96 - [c36]Rui A. Costa, Michael Langberg, João Barros:
One-shot capacity of discrete channels. ISIT 2010: 211-215 - [c35]Bikash Kumar Dey, Sidharth Jaggi, Michael Langberg, Anand D. Sarwate:
Coding against delayed adversaries. ISIT 2010: 285-289 - [c34]Michael Langberg, Aditya Ramamoorthy:
Communicating the sum of sources in a 3-sources/3-terminals network; revisited. ISIT 2010: 1853-1857 - [c33]Anxiao Jiang, Michael Langberg, Robert Mateescu, Jehoshua Bruck:
Data movement and aggregation in flash memories. ISIT 2010: 1918-1922 - [c32]Michael Langberg, Leonard J. Schulman:
Universal epsilon-approximators for Integrals. SODA 2010: 598-607 - [c31]Roni Bar-Yanai, Michael Langberg, David Peleg, Liam Roditty:
Realtime Classification for Encrypted Traffic. SEA 2010: 373-385 - [i13]Hongyi Yao, Danilo Silva, Sidharth Jaggi, Michael Langberg:
Network Codes Resilient to Jamming and Eavesdropping. CoRR abs/1001.3714 (2010) - [i12]Aditya Ramamoorthy, Michael Langberg:
Communicating the sum of sources over a network. CoRR abs/1001.5319 (2010) - [i11]Rui A. Costa, Michael Langberg, João Barros:
One-Shot Capacity of Discrete Channels. CoRR abs/1006.0334 (2010) - [i10]Anxiao Jiang, Michael Langberg, Moshe Schwartz, Jehoshua Bruck:
Trajectory Codes for Flash Memory. CoRR abs/1012.5430 (2010)
2000 – 2009
- 2009
- [j13]Michael Langberg, Leonard J. Schulman:
Contraction and Expansion of Convex Sets. Discret. Comput. Geom. 42(4): 594-614 (2009) - [j12]Michael Langberg, Alexander Sprintson, Jehoshua Bruck:
Network Coding: A Computational Perspective. IEEE Trans. Inf. Theory 55(1): 147-157 (2009) - [c30]Michael Langberg, Muriel Médard:
On the multiple unicast network coding, conjecture. Allerton 2009: 222-227 - [c29]Anxiao Jiang, Michael Langberg, Robert Mateescu, Jehoshua Bruck:
Data movement in flash memories. Allerton 2009: 1031-1038 - [c28]Bikash Kumar Dey, Sidharth Jaggi, Michael Langberg:
Codes against online adversaries. Allerton 2009: 1169-1176 - [c27]Anxiao Jiang, Michael Langberg, Moshe Schwartz, Jehoshua Bruck:
Universal rewriting in constrained memories. ISIT 2009: 1219-1223 - [c26]Michael Langberg, Aditya Ramamoorthy:
Communicating the sum of sources in a 3-sources/3-terminals network. ISIT 2009: 2121-2125 - [c25]Michael Langberg, Sidharth Jaggi, Bikash Kumar Dey:
Binary causal-adversary channels. ISIT 2009: 2723-2727 - [c24]Shiri Chechik, Michael Langberg, David Peleg, Liam Roditty:
Fault-tolerant spanners for general graphs. STOC 2009: 435-444 - [i9]Michael Langberg, Sidharth Jaggi, Bikash Kumar Dey:
Binary Causal-Adversary Channels. CoRR abs/0901.1853 (2009) - [i8]Doron Goldstein, Michael Langberg:
The Dense k Subgraph problem. CoRR abs/0912.5327 (2009) - 2008
- [j11]Jie Gao, Michael Langberg, Leonard J. Schulman:
Analysis of Incomplete Data and an Intrinsic-Dimension Helly Theorem. Discret. Comput. Geom. 40(4): 537-560 (2008) - [j10]Michael Langberg:
Oblivious Communication Channels and Their Capacity. IEEE Trans. Inf. Theory 54(1): 424-429 (2008) - [j9]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 Trans. Inf. Theory 54(6): 2596-2603 (2008) - [j8]Michael Langberg, Alexander Sprintson, Jehoshua Bruck:
Optimal Universal Schedules for Discrete Broadcast. IEEE Trans. Inf. Theory 54(9): 4365-4372 (2008) - [c23]Guy Kortsarz, Michael Langberg, Zeev Nutov:
Approximating Maximum Subgraphs without Short Cycles. APPROX-RANDOM 2008: 118-131 - [c22]Leah Nutman, Michael Langberg:
Adversarial models and resilient schemes for network coding. ISIT 2008: 171-175 - [c21]Michael Langberg, Alex Sprintson:
On the hardness of approximating the network coding capacity. ISIT 2008: 315-319 - [c20]Sagar Shenvi, Bikash Kumar Dey, Sidharth Jaggi, Michael Langberg:
"Real" Slepian-Wolf codes. ISIT 2008: 1423-1427 - [r1]Michael Langberg:
Graph Coloring. Encyclopedia of Algorithms 2008 - [i7]Leah Nutman, Michael Langberg:
Adversarial Models and Resilient Schemes for Network Coding. CoRR abs/0801.0701 (2008) - [i6]Bikash Kumar Dey, Sidharth Jaggi, Michael Langberg:
"Real" Slepian-Wolf Codes. CoRR abs/0810.1424 (2008) - [i5]Bikash Kumar Dey, Sidharth Jaggi, Michael Langberg:
Codes against Online Adversaries. CoRR abs/0811.2850 (2008) - 2007
- [j7]Adi Avidor, Michael Langberg:
The multi-multiway cut problem. Theor. Comput. Sci. 377(1-3): 35-42 (2007) - [c19]Michael Langberg, Leonard J. Schulman:
Contraction and Expansion of Convex Sets. CCCG 2007: 25-28 - [c18]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 - [c17]Sidharth Jaggi, Michael Langberg:
Resilient network codes in the presence of eavesdropping Byzantine adversaries. ISIT 2007: 541-545 - [c16]Michael Langberg, Moshe Schwartz, Jehoshua Bruck:
Distributed broadcasting and mapping protocols in directed anonymous networks. PODC 2007: 382-383 - 2006
- [j6]Uriel Feige, Michael Langberg:
The RPR2 rounding technique for semidefinite programs. J. Algorithms 60(1): 1-23 (2006) - [j5]Michael Langberg, Alexander Sprintson, Jehoshua Bruck:
The encoding complexity of network coding. IEEE Trans. Inf. Theory 52(6): 2386-2397 (2006) - [c15]Michael Langberg, Yuval Rabani, Chaitanya Swamy:
Approximation Algorithms for Graph Homomorphism Problems. APPROX-RANDOM 2006: 176-187 - [c14]Michael Langberg, Alexander Sprintson, Jehoshua Bruck:
Network Coding: A Computational Perspective. CISS 2006: 877-882 - [c13]Michael Langberg:
Oblivious channels. ISIT 2006: 2739-2743 - [c12]Jie Gao, Michael Langberg, Leonard J. Schulman:
Analysis of incomplete data and an intrinsic-dimension Helly theorem. SODA 2006: 464-473 - [i4]Michael Langberg:
Oblivious channels. CoRR abs/cs/0601041 (2006) - 2005
- [c11]Sidharth Jaggi, Michael Langberg, Tracey Ho, Michelle Effros:
Correction of adversarial errors in networks. ISIT 2005: 1455-1459 - [c10]Michael Langberg, Alexander Sprintson, Jehoshua Bruck:
The encoding complexity of network coding. ISIT 2005: 1987-1991 - [c9]Michael Langberg, Alexander Sprintson, Jehoshua Bruck:
Staleness vs. waiting time in universal discrete broadcast. ISIT 2005: 2124-2128 - 2004
- [j4]Uriel Feige, Michael Langberg, Gideon Schechtman:
Graphs with Tiny Vector Chromatic Numbers and Huge Chromatic Numbers. SIAM J. Comput. 33(6): 1338-1368 (2004) - [c8]Michael Langberg:
Testing the Independence Number of Hypergraphs. APPROX-RANDOM 2004: 405-416 - [c7]Michael Langberg:
Private Codes or Succinct Random Codes That Are (Almost) Perfect. FOCS 2004: 325-334 - [c6]Michael Langberg, Alexander Sprintson, Jehoshua Bruck:
Optimal universal schedules for discrete broadcast. ISIT 2004: 111 - [c5]Adi Avidor, Michael Langberg:
The Multi-multiway Cut Problem. SWAT 2004: 273-284 - 2003
- [c4]Michael Langberg, Amir Pnueli, Yoav Rodeh:
The ROBDD Size of Simple CNF Formulas. CHARME 2003: 363-377 - [i3]Michael Langberg:
Testing the independence number of hypergraphs. Electron. Colloquium Comput. Complex. TR03 (2003) - 2002
- [j3]Uriel Feige, Marek Karpinski, Michael Langberg:
Improved approximation of Max-Cut on graphs of bounded degree. J. Algorithms 43(2): 201-219 (2002) - [c3]Uriel Feige, Michael Langberg, Gideon Schechtman:
Graphs with Tiny Vector Chromatic Numbers and Huge Chromatic Numbers. FOCS 2002: 283-292 - 2001
- [j2]Uriel Feige, Marek Karpinski, Michael Langberg:
A note on approximating Max-Bisection on regular graphs. Inf. Process. Lett. 79(4): 181-188 (2001) - [j1]Uriel Feige, Michael Langberg:
Approximation Algorithms for Maximization Problems Arising in Graph Partitioning. J. Algorithms 41(2): 174-211 (2001) - [c2]Uriel Feige, Michael Langberg:
The RPR2 Rounding Technique for Semidefinite Programs. ICALP 2001: 213-224 - 2000
- [c1]Uriel Feige, Michael Langberg, Kobbi Nissim:
On the hardness of approximating N P witnesses. APPROX 2000: 120-131 - [i2]Uriel Feige, Marek Karpinski, Michael Langberg:
Improved Approximation of MAX-CUT on Graphs of Bounded Degree. Electron. Colloquium Comput. Complex. TR00 (2000) - [i1]Uriel Feige, Marek Karpinski, Michael Langberg:
A Note on Approximating MAX-BISECTION on Regular Graphs. Electron. Colloquium Comput. Complex. TR00 (2000)
Coauthor Index
[c113] [c111] [i71] [i69] [c108] [i67] [i66] [c106] [c104] [i64] [i63] [j41] [j40] [c102] [c101] [i60] [i59] [j38] [i57] [i54] [c98] [c96] [i53] [i52] [i51] [j34] [j33] [c91] [i50] [i49] [c89] [c86] [c85] [i46] [c83] [c82] [c79] [c78] [c77] [i45] [i44] [i41] [j27] [c76] [c74] [c71] [i37] [i34] [c65] [c64] [c63] [i33] [c62] [c59] [c58] [c53] [c52] [i25] [c45] [i19] [c44] [i17] [j9] [c11]
Alexander Sprintson
aka: Alex Sprintson
aka: Alex Sprintson
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-12 22:57 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
