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="R{\"u}b, Christine"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On Batcher's merge sorts as parallel sorting algorithms
Christine Rüb
Lecture Notes in Computer Science
1373
, 1998, pp. 410-420
On the average running time of odd-even merge sort
Christine Rüb
Journal of Algorithms
22
(2), 1997, pp. 329-346
A circuit for exact summation of floating-point numbers
Michael Müller
,
Christine Rüb
,
Wolfgang Rülling
Information Processing Letters
57
(3), 1996, pp. 159-163
On the average running time of odd-even merge sort
Christine Rüb
Lecture Notes in Computer Science
900
, 1995, pp. 491-502
Lower bounds for merging on the hypercube
Christine Rüb
Technical Report (MPI-I-93-148), 1993, October
Algorithms for geometric problems on network machines
Christine Rüb
misc, 1993
Line-segment intersection reporting in parallel
Christine Rüb
Algorithmica
8
, 1992, pp. 119-144
Optimal merging and sorting on the EREW PRAM
Torben Hagerup
,
Christine Rüb
Information Processing Letters
33
, 1989/90, pp. 181-185
A guided tour of Chernoff bounds
Torben Hagerup
,
Christine Rüb
Information Processing Letters
33
, 1989/90, pp. 305-308
A guided tour of Chernoff bounds
Torben Hagerup
,
Christine Rüb
Technical Report (A88/03), 1988, July