The direct dominance problem. - Ralf Hartmut Güting; Otto Nurmi; Thomas Ottmann (SCG, 1985)

A Fast Line-Sweep Algorithm for Hidden Line Elimination. - Otto Nurmi (BIT, 1985)

Optimal Dynamic Solutions for Fixed Windowing Problems. - Rolf Klein; Otto Nurmi; Thomas Ottmann; Derick Wood (SCG, 1986)

On translating a set of objects in 2- and 3-dimensional space. - Otto Nurmi (Comput. Vis. Graph. Image Process., 1986)

Concurrency Control in Database Structures with Relaxed Balance. - Otto Nurmi; Eljas Soisalon-Soininen; Derick Wood (PODS, 1987)

Algorithms for computational geometry. - Otto Nurmi (1987)

Separating a Polyhedron by One Translation from a Set of Obstacles (Extended Abstract). - Otto Nurmi; Jörg-Rüdiger Sack (WG, 1988)

The Design of a Language Processor Generator. - Kai Koskimies; Otto Nurmi; Jukka Paakki; Seppo Sippu (Softw. Pract. Exp., 1988)

A Dynamic Fixed Windowing Problem. - Rolf Klein; Otto Nurmi; Thomas Ottmann; Derick Wood (Algorithmica, 1989)

Fast Algorithms for Direct Enclosures and Direct Dominances. - Ralf Hartmut Güting; Otto Nurmi; Thomas Ottmann (J. Algorithms, 1989)

Efficient Implementation of Loops in Bottom-Up Evaluation of Logic Queries. - Juhani Kuittinen; Otto Nurmi; Seppo Sippu; Eljas Soisalon-Soininen (VLDB, 1990)

Uncoupling Updating and Rebalancing in Chromatic Binary Search Trees. - Otto Nurmi; Eljas Soisalon-Soininen (PODS, 1991)

Chromatic Binary Search Trees. A Structure for Concurrent Rebalancing. - Otto Nurmi; Eljas Soisalon-Soininen (Acta Informatica, 1996)

Relaxed avl trees, main-memory databases and concurrency. - Otto Nurmi; Eljas Soisalon-Soininen; Derick Wood (Int. J. Comput. Math., 1996)

Some Tools for Aiding Teaching the Basics of Digital Electronics and Signal Processing. - Suvi Karhu; Jarmo T. Alander; Otto Nurmi (CSEDU (1), 2015)