Searching for authors named David Peleg – sorted by Relevance.
-
Under the Supervision of
- Under the Supervision of Prof. David Peleg Department of Applied Mathematics and Computer Science
- Add To MetaCart
-
Approximating Minimum Communication Cost Spanning Trees and Related Problems
- .Sc. Degree by Eilon Reshef Under the Supervision of Prof. David Peleg Department of Computer Science
- Cited by 3 (0 self) – Add To MetaCart
-
Approximation Algorithms for Minimum Energy Bounded-Hop Strong Connectivity Range Assignment in Ad-hoc Networks
- -hoc Networks Erez Kantor David Peleg October 22, 2004 Abstract This paper concerns the range assignment problem
- Add To MetaCart
-
AND
- , Israel AND DAVID PELEG * Stanford University, Stanford, California 94305 Received March 2, 1988; revised
- Add To MetaCart
-
Generating Low-Degree 2-Spanners
- Generating Low-Degree 2-Spanners Guy Kortsarz David Peleg y April 14, 1993 Abstract A k
- Cited by 6 (0 self) – Add To MetaCart
-
Asynchronous Resource Discovery in Peer to Peer Networks
- -author of a previous paper on the subject, who died tragically on September 11th, 2001. David Peleg † Dept
- Cited by 9 (0 self) – Add To MetaCart
-
Deterministic Distributed Resource Discovery (Extended Abstract)
- Deterministic Distributed Resource Discovery (Extended abstract) Shay Kutten David Peleg y
- Cited by 13 (0 self) – Add To MetaCart
-
Labeling Schemes for Weighted Dynamic Trees
- Labeling Schemes for Weighted Dynamic Trees Amos Korman ∗ David Peleg ∗ October 13, 2006 Abstract
- Cited by 7 (6 self) – Add To MetaCart
-
A tight upper bound on the probabilistic embedding of seriesparallel graphs
- , The Weizmann Institute of Science, Rehovot, 76100 Israel. E-mail: {yuval.emek,david.peleg
- Cited by 1 (0 self) – Add To MetaCart
-
Approximating k-spanner problems for k > 2
- Approximating k-Spanner Problems for k > 2 Michael Elkin ∗ David Peleg † January 13, 2005 Abstract
- Cited by 2 (0 self) – Add To MetaCart

