Optimal Merging and Sorting on the Erew Pram. - Torben Hagerup; Christine Rüb (Inf. Process. Lett., 1989)

A Guided Tour of Chernoff Bounds. - Torben Hagerup; Christine Rüb (Inf. Process. Lett., 1990)

Parallele Algorithmen zum Berechnen der Schnittpunkte von Liniensegmenten. - Christine Rüb (1990)

Exact accumulation of floating-point numbers. - Michael Müller 002; Christine Rüb; Wolfgang Rülling (IEEE Symposium on Computer Arithmetic, 1991)

Prozeßdefinition in einem algorithmischen Entwurfssystem. - Christine Rüb (Inform. Forsch. Entwickl., 1991)

Line-Segment Intersection Reporting in Parallel. - Christine Rüb (Algorithmica, 1992)

Lower Bounds for Merging on the Hypercube. - Christine Rüb (CIAC, 1994)

A Circuit for Exact Summation of Floating-Points Numbers. - Michael Müller 002; Christine Rüb; Wolfgang Rülling (Inf. Process. Lett., 1996)

Parallel MD-Simulations of Synthetic Polymers. - Bernd Jung 001; Hans-Peter Lenhof; Peter Müller 008; Christine Rüb (PP, 1997)

On the Average Running Time of Odd-Even Merge Sort. - Christine Rüb (J. Algorithms, 1997)

On Batcher's Merge Sorts as Parallel Sorting Algorithms. - Christine Rüb (STACS, 1998)

Simulating synthetic polymer chains in parallel. - Bernd Jung 001; Hans-Peter Lenhof; Peter Müller 008; Christine Rüb (Future Gener. Comput. Syst., 2000)