# Otto Nurmi

According to our database

Collaborative distances:

^{1}, Otto Nurmi authored at least 15 papers between 1985 and 2015.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2015

Some Tools for Aiding Teaching the Basics of Digital Electronics and Signal Processing.

Proceedings of the CSEDU 2015, 2015

1996

Relaxed avl trees, main-memory databases and concurrency.

Int. J. Comput. Math., 1996

Chromatic Binary Search Trees. A Structure for Concurrent Rebalancing.

Acta Inf., 1996

1991

Uncoupling Updating and Rebalancing in Chromatic Binary Search Trees.

Proceedings of the Tenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1991

1990

Efficient Implementation of Loops in Bottom-Up Evaluation of Logic Queries.

Proceedings of the 16th International Conference on Very Large Data Bases, 1990

1989

Fast Algorithms for Direct Enclosures and Direct Dominances.

J. Algorithms, 1989

A Dynamic Fixed Windowing Problem.

Algorithmica, 1989

1988

The Design of a Language Processor Generator.

Softw., Pract. Exper., 1988

Separating a Polyhedron by One Translation from a Set of Obstacles (Extended Abstract).

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1988

1987

Algorithms for computational geometry.

PhD thesis, 1987

Concurrency Control in Database Structures with Relaxed Balance.

Proceedings of the Sixth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1987

1986

On translating a set of objects in 2- and 3-dimensional space.

Computer Vision, Graphics, and Image Processing, 1986

Optimal Dynamic Solutions for Fixed Windowing Problems.

Proceedings of the Second Annual ACM SIGACT/SIGGRAPH Symposium on Computational Geometry, 1986

1985

A Fast Line-Sweep Algorithm for Hidden Line Elimination.

BIT, 1985

The direct dominance problem.

Proceedings of the First Annual Symposium on Computational Geometry, 1985