| 1996 |
12 | | Otto Nurmi,
Eljas Soisalon-Soininen:
Chromatic Binary Search Trees. A Structure for Concurrent Rebalancing.
Acta Inf. 33(6): 547-557 (1996) |
| 1992 |
11 | | Otto Nurmi,
Esko Ukkonen:
Algorithm Theory - SWAT '92, Third Scandinavian Workshop on Algorithm Theory, Helsinki, Finland, July 8-10, 1992, Proceedings
Springer 1992 |
| 1991 |
10 | | Otto Nurmi,
Eljas Soisalon-Soininen:
Uncoupling Updating and Rebalancing in Chromatic Binary Search Trees.
PODS 1991: 192-198 |
| 1990 |
9 | | Juhani Kuittinen,
Otto Nurmi,
Seppo Sippu,
Eljas Soisalon-Soininen:
Efficient Implementation of Loops in Bottom-Up Evaluation of Logic Queries.
VLDB 1990: 372-379 |
| 1989 |
8 | | Rolf Klein,
Otto Nurmi,
Thomas Ottmann,
Derick Wood:
A Dynamic Fixed Windowing Problem.
Algorithmica 4(4): 535-550 (1989) |
7 | | Ralf Hartmut Güting,
Otto Nurmi,
Thomas Ottmann:
Fast Algorithms for Direct Enclosures and Direct Dominances.
J. Algorithms 10(2): 170-186 (1989) |
| 1988 |
6 | | Otto Nurmi,
Jörg-Rüdiger Sack:
Separating a Polyhedron by One Translation from a Set of Obstacles (Extended Abstract).
WG 1988: 202-212 |
5 | | Kai Koskimies,
Otto Nurmi,
Jukka Paakki,
Seppo Sippu:
The Design of a Language Processor Generator.
Softw., Pract. Exper. 18(2): 107-135 (1988) |
| 1987 |
4 | | Otto Nurmi,
Eljas Soisalon-Soininen,
Derick Wood:
Concurrency Control in Database Structures with Relaxed Balance.
PODS 1987: 170-176 |
| 1986 |
3 | | Rolf Klein,
Otto Nurmi,
Thomas Ottmann,
Derick Wood:
Optimal Dynamic Solutions for Fixed Windowing Problems.
Symposium on Computational Geometry 1986: 109-115 |
2 | | Otto Nurmi:
On translating a set of objects in 2- and 3-dimensional space.
Computer Vision, Graphics, and Image Processing 36(1): 42-52 (1986) |
| 1985 |
1 | | Otto Nurmi:
A Fast Line-Sweep Algorithm for Hidden Line Elimination.
BIT 25(3): 466-472 (1985) |