30 citations · 72 across the 26 of their papers we have counts for
4 papers · 1 filter
Edge removal in undirected networks
Michael Langberg, Michelle Effros
The edge-removal problem asks whether the removal of a -capacity edge from a given network can decrease the communication rate between source-terminal pairs by more than . In…
Minimizing the alphabet size of erasure codes with restricted decoding sets
Mira Gonen, Ishay Haviv, Michael Langberg +1
A Maximum Distance Separable code over an alphabet is defined via an encoding function that allows to retrieve a message from the codeword $…
Topology Dependent Bounds For FAQs
Michael Langberg, Shi Li, Sai Vikneshwar Mani Jayaraman +1
In this paper, we prove topology dependent bounds on the number of rounds needed to compute Functional Aggregate Queries (FAQs) studied by Abo Khamis et al. [PODS 2016] in a synchr…
Towards an Operational Definition of Group Network Codes
Fei Wei, Michael Langberg, Michelle Effros
Group network codes are a generalization of linear codes that have seen several studies over the last decade. When studying network codes, operations performed at internal network…