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="Annexstein, Fred"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Broadcasting in unstructured peer-to-peer overlay networks
Fred S. Annexstein
,
Kenneth A. Berman
,
Mijhalo A. Jovanović
Theoretical Computer Science
355
(1), 2006, pp. 25-36
Latency effects on reachability in large-scale peer-to-peer networks
Fred S. Annexstein
,
Kenneth A. Berman
,
Mihajlo A. Jovanović
Proceedings of the 13th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA'2001 (Crete Island, Greece, July 3-6, 2001)
, 2001, pp. 84-92
A multi-tree routing scheme using acyclic orientations
Fred S. Annexstein
,
Kenneth A. Berman
,
Tsan-Sheng Hsu
,
Ram Swaminathan
Theoretical Computer Science
240
(2), 2000, pp. 487-494
Directional routing via generalized
st
-numberings
Fred S. Annexstein
,
Kenneth A. Berman
SIAM Journal on Discrete Mathematics
13
(2), 2000, pp. 268-279
On testing consecutive-ones property in parallel
Fred Annexstein
,
Ram Swaminathan
Discrete Applied Mathematics
88
(1-3), 1998, pp. 7-28
A multi-tree generating routing scheme acyclic orientations
Fred S. Annexstein
,
Kenneth A. Berman
,
Ram Swaminathan
Lecture Notes in Computer Science
1276
, 1997, pp. 18-22
Approximation algorithms for optimal-depth independent spanning trees and
st
-numberings
Fred S. Annexstein
,
Kenneth A. Berman
,
Ram Swaminathan
Proceedings of the 4th International Colloquium on Structural Information and Communication Complexity, SIROCCO'97 (Monte Verità, Switzerland, July 24-26, 1997)
, 1997, pp. 12-23
An empirical study of ``lazy'' protocols for routing information in dynamic networks
Fred S. Annexstein
,
Chris Giannella
Proceedings of the 4th International Colloquium on Structural Information and Communication Complexity, SIROCCO'97 (Monte Verità, Switzerland, July 24-26, 1997)
, 1997, pp. 176-187
Work-preserving emulations of shuffle-exchange networks: An analysis of the complex plane diagram
Fred Annexstein
,
John Franco
Discrete Applied Mathematics
60
, 1995, pp. 13-23
A ranking algorithm for Hamilton paths in shuffle-exchange graphs
Fred S. Annexstein
,
Eugene A. Kuchko
Lecture Notes in Computer Science
955
, 1995, pp. 263-269
On finding solutions for extended Horn formulas
John S. Schlipf
,
Fred S. Annexstein
,
John V. Franco
,
R.P. Swaminathan
Information Processing Letters
54
, 1995, pp. 133-137
Embedding hypercubes and related networks into mesh-connected processor arrays
Fred Annexstein
Journal Parallel Distributed Computing
23
(1), 1994, pp. 72-79
On the diameter and bisector size of Cayley graphs
Fred Annexstein
,
Marc Baumslag
Math. Systems Theory
26
(3), 1993, pp. 271-291
Parallel implementations of graph embeddings
Fred S. Annexstein
Lecture Notes in Computer Science
678
, 1993, pp. 207-217
SIMD-emulations of hypercubes and related networks
Fred S. Annexstein
Proceedings of the 3rd IEEE Symposium on Parallel and Distributed Processing, SPDP'91 (Dallas, Texas, December 2-5, 1991)
, 1991, pp. 656-659
A unified framework for off-line permutation routing in parallel networks
Marc Baumslag
,
Fred Annexstein
Math. Systems Theory
24
, 1991, pp. 233-251
Group action graphs and parallel architectures
Fred Annexstein
,
Marc Baumslag
,
Arnold L. Rosenberg
SIAM Journal on Computing
19
, 1990, pp. 544-569