Erez Kantor

According to our database1, Erez Kantor authored at least 31 papers between 2006 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Improved Algorithms for Scheduling Unsplittable Flows on Paths.
Algorithmica, February, 2023

The Minimum Principle of SINR: A Useful Discretization Tool for Wireless Communication.
ACM Trans. Algorithms, January, 2023

2021
Nonuniform SINR+Voronoi diagrams are effectively uniform.
Theor. Comput. Sci., 2021

2019
Online Disjoint Set Cover Without Prior Knowledge.
Proceedings of the 27th Annual European Symposium on Algorithms, 2019

2018
The topology of wireless communication on a line.
Theor. Comput. Sci., 2018

Growing Half-Balls: Minimizing Storage and Communication Costs in Content Delivery Networks.
SIAM J. Discret. Math., 2018

2017
SINR diagram with interference cancellation.
Ad Hoc Networks, 2017

Asymptotically Optimal Approximation Algorithms for Coflow Scheduling.
Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, 2017

2016
On the effect of the deployment setting on broadcasting in Euclidean radio networks.
Distributed Comput., 2016

Efficient k-shot broadcasting in radio networks.
Discret. Appl. Math., 2016

Storage-Optimized Data-Atomic Algorithms for Handling Erasures and Errors in Distributed Storage Systems.
Proceedings of the 2016 IEEE International Parallel and Distributed Processing Symposium, 2016

2015
On the Capacity of Bufferless Networks-on-Chip.
IEEE Trans. Parallel Distributed Syst., 2015

The Topology of Wireless Communication.
J. ACM, 2015

Nonuniform SINR+Voroni Diagrams Are Effectively Uniform.
Proceedings of the Distributed Computing - 29th International Symposium, 2015

Computing in Additive Networks with Bounded-Information Codes.
Proceedings of the Distributed Computing - 29th International Symposium, 2015

Optimal Competitiveness for the Rectilinear Steiner Arborescence Problem.
Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

2014
Testing the irreducibility of nonsquare Perron-Frobenius systems.
Inf. Process. Lett., 2014

Multi-message broadcast with abstract MAC layers and unreliable links.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2014

Optimal Competitiveness for Symmetric Rectilinear Steiner Arborescence and Related Problems.
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

2013
Generalized Perron-Frobenius Theorem for Nonsquare Matrices.
CoRR, 2013

Prudent Opportunistic Cognitive Radio Access Protocols.
Proceedings of the Distributed Computing - 27th International Symposium, 2013

Generalized Perron-Frobenius Theorem for Multiple Choice Matrices, and Applications.
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

2012
SINR Diagrams: Convexity and Its Applications in Wireless Networks.
J. ACM, 2012

Growing Half-Balls: Minimizing Storage and Communication Costs in CDNs.
Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

2011
Capacity optimized NoC for multi-mode SoC.
Proceedings of the 48th Design Automation Conference, 2011

2009
Approximate hierarchical facility location and applications to the bounded depth Steiner tree and range assignment problems.
J. Discrete Algorithms, 2009

Broadcasting in UDG radio networks with unknown topology.
Distributed Comput., 2009

SINR diagrams: towards algorithmically usable SINR models of wireless networks.
Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, 2009

2008
Time efficient k-shot broadcasting in known topology radio networks.
Distributed Comput., 2008

2007
Energy and Time Efficient Broadcasting in Known Topology Radio Networks.
Proceedings of the Distributed Computing, 21st International Symposium, 2007

2006
Approximate Hierarchical Facility Location and Applications to the Shallow Steiner Tree and Range Assignment Problems.
Proceedings of the Algorithms and Complexity, 6th Italian Conference, 2006


  Loading...