David Peleg
David Peleg
Professor of Computer Science, Weizmann Institute
Vahvistettu sähköpostiosoite verkkotunnuksessa weizmann.ac.il
Nimike
Viittaukset
Viittaukset
Vuosi
Distributed computing: a locality-sensitive approach
D Peleg
Society for Industrial and Applied Mathematics, 2000
16022000
The dense k-subgraph problem
U Feige, D Peleg, G Kortsarz
Algorithmica 29 (3), 410-421, 2001
6262001
Graph spanners
D Peleg, AA Schäffer
Journal of graph theory 13 (1), 99-116, 1989
6201989
A trade-off between space and efficiency for routing tables
D Peleg, E Upfal
Journal of the ACM (JACM) 36 (3), 510-530, 1989
5361989
An optimal synchronizer for the hypercube
D Peleg, JD Ullman
Proceedings of the sixth annual ACM Symposium on Principles of distributed …, 1987
4731987
A lower bound for radio broadcast
N Alon, A Bar-Noy, N Linial, D Peleg
Journal of Computer and System Sciences 43 (2), 290-298, 1991
3821991
Distance labeling in graphs
C Gavoille, D Peleg, S Pérennes, R Raz
Journal of Algorithms 53 (1), 85-112, 2004
3702004
Sparse partitions
B Awerbuch, D Peleg
Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science …, 1990
3651990
Renaming in an asynchronous environment
H Attiya, A Bar-Noy, D Dolev, D Peleg, R Reischuk
Journal of the ACM (JACM) 37 (3), 524-548, 1990
3621990
A graph-theoretic game and its application to the k-server problem
N Alon, RM Karp, D Peleg, D West
SIAM Journal on Computing 24 (1), 78-100, 1995
3451995
Fast distributed construction of smallk-dominating sets and applications
S Kutten, D Peleg
Journal of Algorithms 28 (1), 40-66, 1998
3041998
Randomized broadcast in networks
U Feige, D Peleg, P Raghavan, E Upfal
Random Structures & Algorithms 1 (4), 447-460, 1990
2991990
Fault-tolerant gathering algorithms for autonomous mobile robots
N Agmon, D Peleg
SIAM Journal on Computing 36 (1), 56-82, 2006
2942006
The power of reconfiguration
Y Ben-Asher, D Peleg, R Ramaswami, A Schuster
Journal of parallel and distributed computing 13 (2), 139-153, 1991
2851991
Computing with noisy information
U Feige, P Raghavan, D Peleg, E Upfal
SIAM Journal on Computing 23 (5), 1001-1018, 1994
2821994
Distributed verification and hardness of distributed approximation
AD Sarma, S Holzer, L Kor, A Korman, D Nanongkai, G Pandurangan, ...
SIAM Journal on Computing 41 (5), 1235-1265, 2012
2782012
A sublinear time distributed algorithm for minimum-weight spanning trees
JA Garay, S Kutten, D Peleg
SIAM Journal on Computing 27 (1), 302-316, 1998
2581998
Concurrent online tracking of mobile users
B Awerbuch, D Peleg
ACM SIGCOMM Computer Communication Review 21 (4), 221-233, 1991
2551991
Local majorities, coalitions and monopolies in graphs: a review
D Peleg
Theoretical Computer Science 282 (2), 231-257, 2002
2242002
The availability of quorum systems
D Peleg, A Wool
Information and Computation 123 (2), 210-223, 1995
2011995
Järjestelmä ei voi suorittaa toimenpidettä nyt. Yritä myöhemmin uudelleen.
Artikkelit 1–20