activity
20142025
most citedOptimal LRC codes for all lenghts n <= q

14 citations · 23 across the 6 of their papers we have counts for

collaborators

6 papers

cs.NI2025

Plan-Based Scalable Online Virtual Network Embedding

Oleg Kolosov, David Breitgand, Dean H. Lorenz +1

Network virtualization allows hosting applications with diverse computation and communication requirements on shared edge infrastructure. Given a set of requests for deploying virt…

cs.NI2025

The Power of Alternatives in Network Embedding

Oleg Kolosov, Gala Yadgar, David Breitgand +1

In the virtual network embedding problem, the goal is to map embed a set of virtual network instances to a given physical network substrate at minimal cost, while respecting the ca…

cs.DC2023

Theory vs. Practice in Modeling Edge Storage Systems

Oleg Kolosov, Mehmet Fatih Aktas, Emina Soljanin +1

Edge systems promise to bring data and computing closer to the users of time-critical applications. Specifically, edge storage systems are emerging as a new system paradigm, where…

cs.IT2018★ 14 cited

Optimal LRC codes for all lenghts n <= q

Oleg Kolosov, Alexander Barg, Itzhak Tamo +1

A family of distance-optimal LRC codes from certain subcodes of -ary Reed-Solomon codes, proposed by I.~Tamo and A.~Barg in 2014, assumes that the code length is a multiple…

cs.IT2015

When Do WOM Codes Improve the Erasure Factor in Flash Memories?

Eitan Yaakobi, Alexander Yucovich, Gal Maor +1

Flash memory is a write-once medium in which reprogramming cells requires first erasing the block that contains them. The lifetime of the flash is a function of the number of block…

cs.GT2014★ 9 cited

Convergence of Tâtonnement in Fisher Markets

Noa Avigdor-Elgrabli, Yuval Rabani, Gala Yadgar

Analyzing simple and natural price-adjustment processes that converge to a market equilibrium is a fundamental question in economics. Such an analysis may have implications in econ…