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="Richards, Dana"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Logic and Language Models for Computer Science
Henry Hamburger
,
Dana Richards
Buch, 2002, pp. xiv, 341
Tree open ear decomposition in parallel graph algorithms
Louis Ibarra
,
Dana Richards
Parallel Processing Letters
5
(2), 1995, pp. 129-138
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
Efficient parallel graph algorithms based on open ear decomposition
Louis Ibarra
,
Dana Richards
Proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science 1993. MFCS'93(GdaĆsk, Poland, August/September 1993)
LNCS 711
, 1993, pp. 506-516
Efficient parallel graph algorithms based on open ear decomposition
Louis Ibarra
,
Dana Richards
Parallel Computing
19
(8), 1993, pp. 873-886
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
Steiner tree problems
F.K. Hwang
,
Dana S. Richards
Networks
22
(1), 1992, pp. 55-89
Stacks, queues, and deques with order-statistic operations
Dana S. Richards
,
Jeffrey S. Salowe
Acta Informatica
29
, 1992, pp. 395-414
A rectilinear Steiner minimal tree algorithm for convex point sets
Dana S. Richards
,
Jeffrey S. Salowe
Lecture Notes in Computer Science
447
, 1990, pp. 201-212
Efficient algorithms for path partitions
Craig Williams
,
Dana Richards
Discrete Applied Mathematics
27
, 1990, pp. 267-276
Fast heuristic algorithms for rectilinear Steiner trees
Dana Richards
Algorithmica
4
, 1989, pp. 191-207
On the inference of strategies
Charles Swart
,
Dana Richards
Theoretical Computer Science
67
, 1989, pp. 5-18
Toward optimal gossiping schemes with conference calls
Arthur L. Liestman
,
Dana Richards
Discrete Applied Mathematics
7
, 1984, pp. 183-189
On a theorem of Chorneyko and Mohanty
Dana S. Richards
Journal of Combinatorial Theory Series A
27
, 1979, pp. 392-393