#### Filter Results:

- Full text PDF available (205)

#### Publication Year

1983

2017

- This year (6)
- Last 5 years (68)
- Last 10 years (122)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Uriel Feige, Guy Kortsarz, David Peleg
- Algorithmica
- 2001

This paper considers the problem of computing the dense k -vertex subgraph of a given graph, namely, the subgraph with the most edges. An approximation algorithm is developed for the problem, with approximation ratio O(n δ ) , for some δ < 1/3 .

- Hagit Attiya, Amotz Bar-Noy, Danny Dolev, David Peleg, Rüdiger Reischuk
- J. ACM
- 1990

This paper is concerned with the solvability of the problem of processor renaming in unreliable, completely asynchronous distributed systems. Fischer et al. prove in [8] that “nontrivial consensus” cannot be attained in such systems, even when only a single, benign processor failure is possible. In contrast, this paper shows that problems of… (More)

- Noga Alon, Amotz Bar-Noy, Nathan Linial, David Peleg
- J. Comput. Syst. Sci.
- 1991

A radio network is a synchronous network of processors that communicate by transmitting messages to their neighbors, where a processor receives a message in a given step if and only if it is silent in this step and precisely one of its neighbors transmits. In this paper we prove the existence of a family of radius-2 networks on n vertices for which any… (More)

- Noga Alon, Richard M. Karp, David Peleg, Douglas B. West
- On-Line Algorithms
- 1991

This paper investigates a zero-sum game played on a weighted connected graph G between two players, the tree player and the edge player. At each play, the tree player chooses a spanning tree T and the edge player chooses an edge e. The payoo to the edge player is cost(T ; e), deened as follows: If e lies in the tree T then cost(T ; e) = 0; if e does not lie… (More)

This abstract presents a collection of clustering and decomposition techniques enabling the construction of sparse and locality preserving representations for arbitrary networks. These new clustering techniques have already found several powerful applications in the area of distributed network algorithms. Two of these applications are described in this… (More)

- David Peleg, Eli Upfal
- J. ACM
- 1989

Two conflicting goals play a crucial role in the design of routing schemes for communication networks. A routing scheme should use paths that are as short as possible for routing messages in the network, while keeping the routing information stored in the processors' local memory as succinct as possible. The efficiency of a routing scheme is measured in… (More)

- Cyril Gavoille, David Peleg, Stéphane Pérennes, Ran Raz
- SODA
- 2001

We consider the problem of labeling the nodes of a graph in a way that will allow one to compute the distance between any two nodes directly from their labels (without using any additional information). Our main interest is in the minimal length of labels needed in different cases. We obtain upper bounds and (most importantly) lower bounds for several… (More)

- Uriel Feige, Prabhakar Raghavan, David Peleg, Eli Upfal
- SIAM J. Comput.
- 1994

This paper studies the depth of noisy decision trees in which each node gives the wrong answer with some constant probability. In the noisy Boolean decision tree model, tight bounds are given on the number of queries to input variables required to compute threshold functions, the parity function and symmetric functions. In the noisy comparison tree model,… (More)

- Uriel Feige, David Peleg, Prabhakar Raghavan, Eli Upfal
- SIGAL International Symposium on Algorithms
- 1990

- David Peleg, Alejandro A. Schäffer
- Journal of Graph Theory
- 1989