Michael Langberg

From MaRDI portal
Revision as of 15:16, 24 September 2023 by Import230924090903 (talk | contribs) (Created automatically from import230924090903)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:692634

Available identifiers

zbMath Open langberg.michaelWikidataQ59672188 ScholiaQ59672188MaRDI QIDQ692634

List of research outcomes





PublicationDate of PublicationType
Minimizing the alphabet size in codes with restricted error sets2024-07-23Paper
Competitive channel-capacity2024-07-23Paper
Reduced-Rank L1-Norm Principal-Component Analysis With Performance Guarantees2022-09-23Paper
Latency and Alphabet Size in the Context of Multicast Network Coding2022-07-13Paper
The Birthday Problem and Zero-Error List Codes2021-09-07Paper
Negligible Cooperation: Contrasting the Maximal- and Average-Error Cases2021-09-07Paper
Minimizing the alphabet size of erasure codes with restricted decoding sets2020-05-14Paper
https://portal.mardi4nfdi.de/entity/Q52125632020-01-29Paper
Sufficiently Myopic Adversaries Are Blind2020-01-28Paper
The Edge-Removal Problem’s Connections to the Zero-Error and $\delta$ -Dependence Problems in Network Coding2020-01-28Paper
The Capacity of Online (Causal) $q$ -Ary Error-Erasure Channels2019-07-19Paper
The Unbounded Benefit of Encoder Cooperation for the k-User MAC2018-09-14Paper
Can Negligible Rate Increase Network Reliability?2018-09-14Paper
Single-Unicast Secure Network Coding and Network Error Correction are as Hard as Multiple-Unicast Network Coding2018-09-14Paper
Constructing cospectral graphs via a new form of graph product2018-08-13Paper
Tight Network Topology Dependent Bounds on Rounds of Communication2018-07-16Paper
Coding for the $\boldsymbol \ell _\infty $ -Limited Permutation Channel2018-06-27Paper
Network Coding: A Computational Perspective2017-08-08Paper
On the Hardness of Approximating the Network Coding Capacity2017-07-27Paper
Constant-Weight Gray Codes for Local Rank Modulation2017-07-12Paper
Upper Bounds on the Capacity of Binary Channels With Causal Adversaries2017-06-08Paper
Generalized Gray Codes for Local Rank Modulation2017-06-08Paper
Trajectory Codes for Flash Memory2017-06-08Paper
H-wise independence2017-05-16Paper
Communication Efficient Secret Sharing2017-04-28Paper
Asymmetric Error Correction and Flash-Memory Rewriting Using Polar Codes2017-04-28Paper
Coded Cooperative Data Exchange Problem for General Topologies2017-04-28Paper
A Characterization of the Number of Subsequences Obtained via the Deletion Channel2017-04-28Paper
An Equivalence Between Network Coding and Index Coding2017-04-28Paper
Non-linear Cyclic Codes that Attain the Gilbert-Varshamov Bound2017-01-04Paper
A Characterization of the Capacity of Online (causal) Binary Channels2015-08-21Paper
Fault-tolerant spanners for general graphs2015-02-04Paper
A unified framework for approximating and clustering data2014-06-05Paper
https://portal.mardi4nfdi.de/entity/Q54176512014-05-22Paper
Distributed broadcasting and mapping protocols in directed anonymous networks2014-03-13Paper
\(f\)-sensitivity distance oracles and routing schemes2012-12-06Paper
Edge distribution in generalized graph products2012-11-07Paper
Fault Tolerant Spanners for General Graphs2011-04-04Paper
Approximating Maximum Subgraphs without Short Cycles2011-03-15Paper
f-Sensitivity Distance Oracles and Routing Schemes2010-09-06Paper
Correct Hardware Design and Verification Methods2010-02-05Paper
Contraction and expansion of convex sets2009-12-14Paper
Oblivious Communication Channels and Their Capacity2009-02-24Paper
Resilient Network Coding in the Presence of Byzantine Adversaries2009-02-24Paper
Optimal Universal Schedules for Discrete Broadcast2009-02-24Paper
https://portal.mardi4nfdi.de/entity/Q35472082008-12-21Paper
Approximating Maximum Subgraphs without Short Cycles2008-11-27Paper
Approximation Algorithms for Graph Homomorphism Problems2007-08-28Paper
The multi-multiway cut problem2007-06-06Paper
The RPR2 rounding technique for semidefinite programs2006-08-14Paper
Algorithm Theory - SWAT 20042005-09-07Paper
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques2005-08-25Paper
Graphs with Tiny Vector Chromatic Numbers and Huge Chromatic Numbers2005-02-21Paper
Improved approximation of Max-Cut on graphs of bounded degree2002-09-30Paper
A note on approximating Max-Bisection on regular graphs2002-07-14Paper
Approximation Algorithms for Maximization Problems Arising in Graph Partitioning2002-07-08Paper
https://portal.mardi4nfdi.de/entity/Q45350202002-06-12Paper
https://portal.mardi4nfdi.de/entity/Q27537322001-11-11Paper

Research outcomes over time

This page was built for person: Michael Langberg