activity
20082017
most citedStorage-Optimized Data-Atomic Algorithms for Handling Erasures and Errors in Distributed Storage Systems

10 citations · 23 across the 8 of their papers we have counts for

collaborators

11 papers

cs.DS2017

Improved Algorithms for Scheduling Unsplittable Flows on Paths

Hamidreza Jahanjou, Erez Kantor, Rajmohan Rajaraman

In this paper, we investigate offline and online algorithms for rufpp, the problem of minimizing the number of rounds required to schedule a set of unsplittable flows of non-unifor…

cs.DC2016

Asymptotically Optimal Approximation Algorithms for Coflow Scheduling

Hamidreza Jahanjou, Erez Kantor, Rajmohan Rajaraman

Many modern datacenter applications involve large-scale computations composed of multiple data flows that need to be completed over a shared set of distributed resources. Such a co…

cs.DC2016★ 10 cited

Storage-Optimized Data-Atomic Algorithms for Handling Erasures and Errors in Distributed Storage Systems

Kishori M. Konwar, N. Prakash, Erez Kantor +3

Erasure codes are increasingly being studied in the context of implementing atomic memory objects in large scale asynchronous distributed storage systems. When compared with the tr…

cs.DC2015

Computing in Additive Networks with Bounded-Information Codes

Keren Censor-Hillel, Erez Kantor, Nancy Lynch +1

This paper studies the theory of the additive wireless network model, in which the received signal is abstracted as an addition of the transmitted signals. Our central observation…

cs.DS2015

Optimal competitiveness for the Rectilinear Steiner Arborescence problem

Erez Kantor, Shay Kutten

We present optimal online algorithms for two related known problems involving Steiner Arborescence, improving both the lower and the upper bounds. One of them is the well studied c…

cs.DC2014★ 5 cited

Multi-Message Broadcast with Abstract MAC Layers and Unreliable Links

Mohsen Ghaffari, Erez Kantor, Nancy Lynch +1

We study the multi-message broadcast problem using abstract MAC layer models of wireless networks. These models capture the key guarantees of existing MAC layers while abstracting…

cs.CG2013

SINR Diagram with Interference Cancellation

Chen Avin, Asaf Cohen, Yoram Haddad +4

In this paper we study the reception zones of a wireless network in the SINR model with receivers that employ \emph{interference cancellation} (IC), a technique that allows a recei…

math.NA2013★ 2 cited

Generalized Perron--Frobenius Theorem for Nonsquare Matrices

Chen Avin, Michael Borokhovich, Yoram Haddad +4

The celebrated Perron--Frobenius (PF) theorem is stated for irreducible nonnegative square matrices, and provides a simple characterization of their eigenvectors and eigenvalues. T…

cs.DC2013

Optimal competitiveness for Symmetric Rectilinear Steiner Arborescence and related problems

Erez Kantor, Shay Kutten

We present optimal competitive algorithms for two interrelated known problems involving Steiner Arborescence. One is the continuous problem of the Symmetric Rectilinear Steiner Arb…

cs.DS2011

The Topology of Wireless Communication

Erez Kantor, Zvi Lotker, Merav Parter +1

In this paper we study the topological properties of wireless communication maps and their usability in algorithmic design. We consider the SINR model, which compares the received…

cs.NI2008★ 6 cited

SINR Diagrams: Towards Algorithmically Usable SINR Models of Wireless Networks

Chen Avin, Yuval Emek, Erez Kantor +3

The rules governing the availability and quality of connections in a wireless network are described by physical models such as the signal-to-interference & noise ratio (SINR) model…