Filter Results:
- Full text PDF available (95)
Publication Year
1999
2017
- This year (5)
- Last 5 years (41)
- Last 10 years (88)
Publication Type
Co-author
Journals and Conferences
Key Phrases
Learn More
- Alexander Kesselman, Zvi Lotker, Yishay Mansour, Boaz Patt-Shamir, Baruch Schieber, Maxim Sviridenko
- SIAM J. Comput.
- 2001
We consider two types of buffering policies that are used in network switches supporting QoS (Quality of Service). In the <italic>FIFO</italic> type, packets must be released in the order they arrive; the difficulty in this case is the limited buffer space. In the <italic>bounded-delay</italic> type, each packet has a maximum delay time by which it must be… (More)
- Guy Even, Zvi Lotker, Dana Ron, Shakhar Smorodinsky
- SIAM J. Comput.
- 2002
Motivated by a frequency assignment problem in cellular networks, we introduce and study a new coloring problem that we call Minimum Conflict-Free Coloring (Min-CF-Coloring). In its general form, the input of the Min-CF-coloring problem is a set system (X,S), where each S ∈ S is a subset of X . The output is a coloring χ of the sets in S that satisfies the… (More)
- Noga Alon, Chen Avin, Michal Koucký, Gady Kozma, Zvi Lotker, Mark R. Tuttle
- Combinatorics, Probability & Computing
- 2008
We pose a new and intriguing question motivated by distributed computing regarding random walks on graphs: How long does it take for several independent random walks, starting from the same vertex, to cover an entire graph? We study the <i>cover time</i> - the expected time required to visit every node in a graph at least once - and we show that for a large… (More)
- Chen Avin, Michal Koucký, Zvi Lotker
- ICALP
- 2008
Motivated by real world networks and use of algorithms based on random walks on these networks we study the simple random walks on dynamic undirected graphs with fixed underlying vertex set, i.e., graphs which are modified by inserting or deleting edges at every step of the walk. We are interested in the expected time needed to visit all the vertices of… (More)
- Ofer Feinerman, Amos Korman, Zvi Lotker, Jean-Sébastien Sereni
- PODC
- 2012
We use distributed computing tools to provide a new perspective on the behavior of cooperative biological ensembles. We introduce the <i>Ants Nearby Treasure Search (ANTS)</i> problem, a generalization of the classical cow-path problem [10, 20, 41, 42], which is relevant for collective foraging in animal groups. In the ANTS problem, <i>k</i> identical… (More)
- Zvi Lotker, Boaz Patt-Shamir
- PODC
- 2002
We consider a FIFO buffer with finite storage space. An arbitrary input stream of packets arrives at the buffer, but the output stream rate is bounded, so overflows may occur. Motivated by DiffServ, we assume that each packet has value either 1 or α, for some α > 1. The buffer management task is to decide which packets to drop so as to… (More)
- Zvi Lotker, Boaz Patt-Shamir, Adi Rosén
- SPAA
- 2002
We consider the model of "adversarial queuing theory" for packet networks introduced by Borodin et al. [6]. We show that the scheduling protocol First-In-First-Out (FIFO) can be unstable at any injection rate larger than $1/2$, and that it is always stable if the injection rate is no more than 1/d, where d is the length of the longest route used by any… (More)
- Zvi Lotker, Boaz Patt-Shamir, David Peleg
- Distributed Computing
- 2001
This paper considers the problem of distributively constructing a minimum-weight spanning tree (MST) for graphs of constant diameter in the bounded-messages model, where each message can contain at most <i>B</i> bits for some parameter <i>B</i>. It is shown that the time required to compute an MST for graphs of diameter 4 or 3 can be as high as… (More)
- Zvi Lotker, Boaz Patt-Shamir, Seth Pettie
- SPAA
- 2008
We present distributed network algorithms to compute weighted and unweighted matchings with improved approximation ratios and running times. The computational model is a network of processors exchanging <i>O</i>(log <i>n</i>)-bit messages (the CONGEST model). For unweighted graphs, we give an algorithm providing (1-ε)-approximation in <i>O</i>(log… (More)
- Zvi Lotker, Boaz Patt-Shamir, Adi Rosén
- PODC
- 2007
We consider distributed algorithms for approximate maximum matching on general graphs. Our main result is a randomized (4 + ε)-approximation distributed algorithm for weighted maximum matching, whose running time is <i>O</i>(log <i>n</i>) for any constant ε > 0, where <i>n</i> is the number of nodes in the graph. In addition, we consider the… (More)