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="Liestman, Arthur L."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Nonadaptive broadcasting in trees
Hovhannes A. Harutyunyan
,
Arthur L. Liestman
,
Kazuhisa Makino
,
Thomas C. Shermer
Networks
57
(2), 2011, pp. 157-168
A linear algorithm for finding the
k
-broadcast center of a tree
Hovhannes A. Harutyunyan
,
Arthur L. Liestman
,
Bin Shao
Networks
53
(3), 2009, pp. 287-292
A zonal algorithm for clustering an hoc networks
Yuanzhu Peter Chen
,
Arthur L. Liestman
International Journal of Foundations of Computer Science
14
(2), 2003, pp. 305-322
Improved upper and lower bounds for
k
-broadcasting
Hovhannes A. Harutyunyan
,
Arthur L. Liestman
Networks
37
(2), 2001, pp. 94-101
k
-broadcasting in trees
Hovhannnes A. Harutyunyan
,
Arthur L. Liestman
Networks
38
(3), 2001, pp. 163-168
The even adjacency split problem for graphs
Grant A. Cheston
,
S.T. Hedetniemi
,
Arthur L. Liestman
,
J.B. Stehman
Discrete Applied Mathematics
102
(3), 2000, pp. 175-188
More broadcast graphs
Hovhannes A. Harutyunyan
,
Arthur L. Liestman
Discrete Applied Mathematics
98
(1-2), 1999, pp. 81-102
Messy broadcasting
Hovhannes A. Harutyunyan
,
Arthur L. Liestman
Parallel Processing Letters
8
(2), 1998, pp. 149-159
Minimum average time broadcast graphs
Arthur L. Liestman
,
Natas̑a Prz̑ulj
Parallel Processing Letters
8
(2), 1998, pp. 139-147
A note on the dimensionality of modified Knödel graphs
Jean-Claude Bermond
,
Hovhannes A. Harutyunyan
,
Arthur L. Liestman
,
Stephane Perennes
International Journal of Foundations of Computer Science
8
, 1997, pp. 109-116
Degree-constrained spanners for multidimensional grids
Arthur L. Liestman
,
Thomas C. Shermer
,
Christopher R. Stolte
Discrete Applied Mathematics
68
(1-2), 1996, pp. 119-144
Degree-constrained network spanners with nonconstant delay
Arthur L. Liestman
,
Thomas C. Shermer
SIAM Journal on Discrete Mathematics
8
(2), 1995, pp. 291-321
Degree-constrained pyramid spanners
Dana Richards
,
Arthur L. Liestman
Journal Parallel Distributed Computing
25
(1), 1995, pp. 1-6
Reliable broadcasting
Luisa Gargano
,
Arthur L. Liestman
,
Joseph G. Peters
,
Dana Richards
Discrete Applied Mathematics
53
, 1994, pp. 135-148
Open Problems
Pierre Fraigniaud
,
Arthur L. Liestman
,
Dominique Sotteau
Parallel Processing Letters
3
(4), 1993, pp. 507-524
An introduction to perpetual gossiping
Arthur L. Liestman
,
Dana Richards
Proceedings of the 4th International Symposium on Algorithms and Computation. ISAAC '93 (Hong Kong, December 15-17, 1993)
LNCS 762
, 1993, pp. 259-266
Perpetual gossiping
Arthur L. Liestman
,
Dana Richards
Parallel Processing Letters
3
(4), 1993, pp. 347-355
Network communication in edge-colored graphs: Gossiping
Arthur L. Liestman
,
Dana Richards
IEEE Transactions on Parallel and Distributed Systems
4
(4), 1993, pp. 438-445
Grid spanners
Arthur L. Liestman
,
Thomas C. Shermer
Networks
23
(2), 1993, pp. 123-133
Additive graph spanners
Arthur L. Liestman
,
Thomas C. Shermer
Networks
23
(4), 1993, pp. 343-363
Sparse broadcast graphs
Jean Claude Bermond
,
Pavol Hell
,
Arthur L. Liestman
,
Joseph G. Peters
Discrete Applied Mathematics
36
, 1992, pp. 97-130
Broadcasting in bounded degree graphs
Jean-Claude Bermond
,
Pavol Hell
,
Arthur L. Liestman
,
Joseph G. Peters
SIAM Journal on Discrete Mathematics
5
(1), 1992, February, pp. 10-24
Minimum broadcast digraphs
Arthur L. Liestman
,
Joseph G. Peters
Discrete Applied Mathematics
37/38
, 1992, pp. 401-419
Additive spanners for hypercubes
Arthur L. Liestman
,
Thomas C. Shermer
Parallel Processing Letters
1
(1), 1991, pp. 35-42
Broadcasting in one dimension
Pavol Hell
,
Arthur L. Liestman
Discrete Applied Mathematics
21
, 1988, pp. 101-111
Seiten 1
2
>