Z
Zvi Lotker
Researcher at Bar-Ilan University
Publications - 190
Citations - 4185
Zvi Lotker is an academic researcher from Bar-Ilan University. The author has contributed to research in topics: Wireless network & Upper and lower bounds. The author has an hindex of 34, co-authored 188 publications receiving 3905 citations. Previous affiliations of Zvi Lotker include University of Paris & Centrum Wiskunde & Informatica.
Papers
More filters
Journal ArticleDOI
Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks
TL;DR: It is shown that O(log |X|) colors suffice for set systems in which X is a set of points in the plane and the sets are intersections of X with scaled translations of a convex region.
Book ChapterDOI
How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs)
TL;DR: It is shown that there are adversary strategies which force the expected cover time of a simple random walk on connected dynamic graphs to be exponential, and a simple strategy is provided, the lazyrandom walk, that guarantees polynomial cover time regardless of the changes made by the adversary.
Journal ArticleDOI
Buffer Overflow Management in QoS Switches
Alexander Kesselman,Zvi Lotker,Yishay Mansour,Boaz Patt-Shamir,Baruch Schieber,Maxim Sviridenko +5 more
TL;DR: It is proved that the greedy algorithm that drops the earliest packets among all low-value packets is the best greedy algorithm, and the competitive ratio of any on-line algorithm for a uniform bounded-delay buffer is bounded away from 1, independent of the delay size.
Proceedings ArticleDOI
Many random walks are faster than one
TL;DR: The cover time is studied and it is shown that for a large collection of interesting graphs, running many random walks in parallel yields a speed-up in the cover time that is linear in the number of parallel walks.
Journal ArticleDOI
Minimum-Weight Spanning Tree Construction in O (log log n ) Communication Rounds
TL;DR: A distributed algorithm is presented which constructs a minimum-weight spanning tree in O(log log n) communication rounds, where in each round any process can send a message to every other process.