Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Peleg, D."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Testing the irreducibility of nonsquare Perron-Frobenius systems
C. Avin
,
M. Borokhovich
,
Y. Haddad
,
E. Kantor
,
Z. Lotker
,
M. Parter
,
D. Peleg
Information Processing Letters
114
(12), 2014, pp. 728-733
Relaxed spanners for directed disk graphs
D. Peleg
,
L. Roditty
Algorithmica
65
(1), 2013, pp. 146-158
Equal-area locus-based convex polygon decomposition
D. Adjiashvili
,
D. Peleg
Theoretical Computer Science
411
(14-15), 2010, pp. 1648-1667
Fault tolerant spanners for general graphs
S. Chechik
,
M. Langberg
,
D. Peleg
,
L. Roditty
SIAM Journal on Computing
39
(7), 2010, pp. 3403-3423
The dense
k
-subgraph problem
U. Feige
,
G. Kortsarz
,
D. Peleg
Algorithmica
29
(3), 2001, pp. 410-421
Size bounds for dynamic monopolies
D. Peleg
Discrete Applied Mathematics
86
(2-3), 1998, pp. 263-273
Randomized approximation of bounded multicovering problems
D. Peleg
,
G. Schechtman
,
A. Wool
Algorithmica
18
(1), 1997, pp. 44-66
Approximating minimum communication spanning trees
D. Peleg
Proceedings of the 4th International Colloquium on Structural Information and Communication Complexity, SIROCCO'97 (Monte Verità , Switzerland, July 24-26, 1997)
, 1997, pp. 1-11
Size bounds for dynamic monopolies
D. Peleg
Proceedings of the 4th International Colloquium on Structural Information and Communication Complexity, SIROCCO'97 (Monte Verità , Switzerland, July 24-26, 1997)
, 1997, pp. 151-161
The complexity of reconfiguring network models
Y. Ben-Asher
,
K.-J. Lange
,
D. Peleg
,
A. Schuster
Information and Computation
121
(1), 1995, August, pp. 41-58
The power of reconfiguration
Y. Ben-Asher
,
D. Peleg
,
R. Ramaswami
,
A. Schuster
Journal Parallel Distributed Computing
13
(2), 1991, October, pp. 139-153
The power of reconfiguration
Y. Ben-Asher
,
D. Peleg
,
R. Ramaswami
,
A. Schuster
Lecture Notes in Computer Science
510
, 1991, pp. 139-150
Renaming in an asynchronous environment
H. Attiya
,
A. Bar-Noy
,
D. Dolev
,
D. Peleg
,
R. Reischuk
Journal of the ACM
37
(3), 1990, July, pp. 524-548
A trade-off between information and communication in broadcast protocols
B. Awerbuch
,
O. Goldreich
,
D. Peleg
,
R. Vainish
Journal of the ACM
37
(2), 1990, April, pp. 238-256
Network synchronization with polylogarithmic overhead
B. Awerbuch
,
D. Peleg
Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science. Vol.~II, FOCS'90 (St. Louis, Missouri, October 22-24, 1990)
, 1990, pp. 514-522
Sparse partitions
B. Awerbuch
,
D. Peleg
Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science. Vol.~II, FOCS'90 (St. Louis, Missouri, October 22-24, 1990)
, 1990, pp. 503-513
Computing with unreliable information
U. Feige
,
D. Peleg
,
P. Raghavan
,
E. Upfal
Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, STOC'90 (Baltimore, Maryland, May 14--16, 1990)
, 1990, pp. 128-137
The power of reconfiguration
Assaf Schuster
,
D. Peleg
,
R. Ramaswami
Technical Report (1990-15), 1990
Square meshes are not always optimal
A. Bar-Noy
,
D. Peleg
Proceedings of the 1st Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA'89 (Santa Fe, New Mexico, June 18-21, 1989)
, 1989, pp. 138-147
Constructing disjoint paths on expander graphs
D. Peleg
,
E. Upfal
Combinatorica
9
(3), 1989, pp. 289-313
Complexity considerations for distributed data structures
D. Peleg
Technical Report (CS89-31), 1989, December
A tradeoff between information and communication in broadcast protocols
B. Awerbuch
,
O. Goldreich
,
R. Vainish
,
D. Peleg
Lecture Notes in Computer Science
319
, 1988, pp. 369-379
Achievable cases in an asynchronous environment
H. Attiya
,
A. Bar-Noy
,
D. Dolev
,
D. Koller
,
D. Peleg
,
R. Reischuk
Proceedings of the 28th Annual IEEE Symposium on Foundations of Computer Science, FOCS'87 (Los Angeles, CA, October 12-14, 1987)
, 1987, pp. 337-346
The generalized packet routing problem
D. Peleg
,
E. Upfal
Theoretical Computer Science
53
(2-3), 1987, pp. 281-293
Constructing disjoint paths on expander graphs
D. Peleg
,
E. Upfal
Proceedings of the 19th Annual ACM Symposium on Theory of Computing, STOC'87 (New York City, May 25--27, 1987)
, 1987, pp. 264-273
Seiten 1
2
>