activity
20082024
most citedDistributed Large Scale Network Utility Maximization

42 citations · 52 across the 5 of their papers we have counts for

collaborators

7 papers

cs.DC2024

Arma: Byzantine Fault Tolerant Consensus with Horizontal Scalability

Yacov Manevich, Hagar Meir, Kaoutar Elkhiyaoui +2

Arma is a Byzantine Fault Tolerant (BFT) consensus system designed to achieve horizontal scalability across all hardware resources: network bandwidth, CPU, and disk I/O. As opposed…

cs.DC2021

A Byzantine Fault-Tolerant Consensus Library for Hyperledger Fabric

Artem Barger, Yacov Manevich, Hagar Meir +1

Hyperledger Fabric is an enterprise grade permissioned distributed ledger platform that offers modularity for a broad set of industry use cases. One modular component is a pluggabl…

cs.DC2019

Lockless Transaction Isolation in Hyperledger Fabric

Hagar Meir, Artem Barger, Yacov Manevich +1

Hyperledger Fabric is a distributed operating system for permissioned blockchains hosted by the Linux Foundation. It is the first truly extensible blockchain system for running dis…

cs.DC2018

Service Discovery for Hyperledger Fabric

Yacov Manevich, Artem Barger, Yoav Tock

Hyperledger Fabric (HLF) is a modular and extensible permissioned blockchain platform released to open-source and hosted by the Linux Foundation. The platform's design exhibits pri…

cs.NI2009★ 3 cited

A Hybrid Multicast-Unicast Infrastructure for Efficient Publish-Subscribe in Enterprise Networks

Danny Bickson, Ezra N. Hoch, Nir Naaman +1

One of the main challenges in building a large scale publish-subscribe infrastructure in an enterprise network, is to provide the subscribers with the required information, while m…

cs.IT2009★ 42 cited

Distributed Large Scale Network Utility Maximization

Danny Bickson, Yoav Tock, Argyris Zymnis +2

Recent work by Zymnis et al. proposes an efficient primal-dual interior-point method, using a truncated Newton method, for solving the network utility maximization (NUM) problem. T…

cs.IT2008★ 7 cited

Polynomial Linear Programming with Gaussian Belief Propagation

Danny Bickson, Yoav Tock, Ori Shental +1

Interior-point methods are state-of-the-art algorithms for solving linear programming (LP) problems with polynomial complexity. Specifically, the Karmarkar algorithm typically solv…