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="Gerstel, O."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The bit complexity of distributed sorting
O. Gerstel
,
S. Zaks
Algorithmica
18
(3), 1997, pp. 405-416
On-the-fly replay: A practical paradigm and its implementation for distributed debugging
O. Gerstel
,
S. Zaks
,
M. Hurfin
,
N. Plouzeau
,
M. Raynal
Proceedings of the 6th IEEE Symposium on Parallel and Distributed Processing, SPDP'94 (Dallas, Texas, October 26-29, 1994)
, 1994, pp. 266-272
A new characterization of tree medians with applications to distributed sorting
O. Gerstel
,
S. Zaks
misc, 1994
A new characterization of tree medians with applications to distributed sorting
O. Gerstel
,
S. Zaks
Networks
24
(1), 1994, pp. 23-29
The bit complexity of distributed sorting (extended abstract)
O. Gerstel
,
S. Zaks
Lecture Notes in Computer Science
726
, 1993, pp. 181-191
A new characterization of tree medians with applications to distributed algorithms
O. Gerstel
,
S. Zaks
Lecture Notes in Computer Science
657
, 1993, pp. 135-144
Bit complexity of order statistics on a distributed star network
O. Gerstel
,
Y. Mansour
,
S. Zaks
Information Processing Letters
30
, 1989, pp. 127-132