default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOtto Nurmi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
[c7]Suvi Karhu, Jarmo T. Alander, Otto Nurmi:
Some Tools for Aiding Teaching the Basics of Digital Electronics and Signal Processing. CSEDU (1) 2015: 193-201
1990 – 1999
- 1996
- [j7]Otto Nurmi, Eljas Soisalon-Soininen:
Chromatic Binary Search Trees. A Structure for Concurrent Rebalancing. Acta Informatica 33(6): 547-557 (1996) - [j6]Otto Nurmi, Eljas Soisalon-Soininen, Derick Wood:
Relaxed avl trees, main-memory databases and concurrency. Int. J. Comput. Math. 62(1-2): 23-44 (1996) - 1992
- [e1]Otto Nurmi, Esko Ukkonen:
Algorithm Theory - SWAT '92, Third Scandinavian Workshop on Algorithm Theory, Helsinki, Finland, July 8-10, 1992, Proceedings. Lecture Notes in Computer Science 621, Springer 1992, ISBN 3-540-55706-7 [contents] - 1991
- [c6]Otto Nurmi, Eljas Soisalon-Soininen:
Uncoupling Updating and Rebalancing in Chromatic Binary Search Trees. PODS 1991: 192-198 - 1990
- [c5]Juhani Kuittinen, Otto Nurmi, Seppo Sippu, Eljas Soisalon-Soininen:
Efficient Implementation of Loops in Bottom-Up Evaluation of Logic Queries. VLDB 1990: 372-379
1980 – 1989
- 1989
- [j5]Rolf Klein, Otto Nurmi, Thomas Ottmann, Derick Wood:
A Dynamic Fixed Windowing Problem. Algorithmica 4(4): 535-550 (1989) - [j4]Ralf Hartmut Güting, Otto Nurmi, Thomas Ottmann:
Fast Algorithms for Direct Enclosures and Direct Dominances. J. Algorithms 10(2): 170-186 (1989) - 1988
- [j3]Kai Koskimies, Otto Nurmi, Jukka Paakki, Seppo Sippu:
The Design of a Language Processor Generator. Softw. Pract. Exp. 18(2): 107-135 (1988) - [c4]Otto Nurmi, Jörg-Rüdiger Sack:
Separating a Polyhedron by One Translation from a Set of Obstacles (Extended Abstract). WG 1988: 202-212 - 1987
- [b1]Otto Nurmi:
Algorithms for computational geometry. Karlsruhe Institute of Technology, Germany, 1987, pp. 1-142 - [c3]Otto Nurmi, Eljas Soisalon-Soininen, Derick Wood:
Concurrency Control in Database Structures with Relaxed Balance. PODS 1987: 170-176 - 1986
- [j2]Otto Nurmi:
On translating a set of objects in 2- and 3-dimensional space. Comput. Vis. Graph. Image Process. 36(1): 42-52 (1986) - [c2]Rolf Klein, Otto Nurmi, Thomas Ottmann, Derick Wood:
Optimal Dynamic Solutions for Fixed Windowing Problems. SCG 1986: 109-115 - 1985
- [j1]Otto Nurmi:
A Fast Line-Sweep Algorithm for Hidden Line Elimination. BIT 25(3): 466-472 (1985) - [c1]Ralf Hartmut Güting, Otto Nurmi, Thomas Ottmann:
The direct dominance problem. SCG 1985: 81-88
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:06 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
