Остановите войну!
for scientists:
default search action
Thomas Ottmann
- > Home > Persons > Thomas Ottmann
Publications
- 1992
- [j40]Thomas Ottmann, Derick Wood:
Updating Binary Trees with Constant Linkage Cost. Int. J. Found. Comput. Sci. 3(4): 479-501 (1992) - 1991
- [j39]Thomas Ottmann, Derick Wood:
Defining families of trees with E0L grammars. Discret. Appl. Math. 32(2): 195-209 (1991) - 1990
- [c25]Thomas Ottmann, Derick Wood:
How to Update a Balanced Binary Tree with a Constant Number of Rotations. SWAT 1990: 122-131 - 1989
- [j37]Rolf Klein, Otto Nurmi, Thomas Ottmann, Derick Wood:
A Dynamic Fixed Windowing Problem. Algorithmica 4(4): 535-550 (1989) - 1987
- [j34]Thomas Ottmann, Eljas Soisalon-Soininen, Derick Wood:
Partitioning and separating sets of orthogonal polygons. Inf. Sci. 42(1): 31-49 (1987) - 1986
- [j33]Thomas Ottmann, Derick Wood:
Space-economical plane-sweep algorithms. Comput. Vis. Graph. Image Process. 34(1): 35-51 (1986) - [c19]Rolf Klein, Otto Nurmi, Thomas Ottmann, Derick Wood:
Optimal Dynamic Solutions for Fixed Windowing Problems. SCG 1986: 109-115 - 1985
- [j32]Thomas Ottmann, Michael Schrapp, Derick Wood:
Purely Top-Down Updating Algorithms for Stratified Search Trees. Acta Informatica 22(1): 85-100 (1985) - [j31]Thomas Ottmann, Peter Widmayer, Derick Wood:
A fast algorithm for the Boolean masking problem. Comput. Vis. Graph. Image Process. 30(3): 249-268 (1985) - [j30]Thomas Ottmann, Michael Schrapp, Derick Wood:
Weight-balanced trees are not stratified. Bull. EATCS 25: 24-30 (1985) - [j29]Philippe Flajolet, Thomas Ottmann, Derick Wood:
Search Trees and Bubble Memories. RAIRO Theor. Informatics Appl. 19(2): 137-164 (1985) - 1984
- [j28]Thomas Ottmann, Arnold L. Rosenberg, Hans-Werner Six, Derick Wood:
Binary search trees with binary comparison cost. Int. J. Parallel Program. 13(2): 77-101 (1984) - [j27]Thomas Ottmann, Eljas Soisalon-Soininen, Derick Wood:
On the Definition and Computation of Rectlinear Convex Hulls. Inf. Sci. 33: 157-171 (1984) - [j26]Herbert Edelsbrunner, Jan van Leeuwen, Thomas Ottmann, Derick Wood:
Computing the Connected Components of Simple Rectilinear Geometrical Objects in D-Space. RAIRO Theor. Informatics Appl. 18(2): 171-183 (1984) - [j25]Thomas Ottmann, Douglas Stott Parker Jr., Arnold L. Rosenberg, Hans-Werner Six, Derick Wood:
Minimal-Cost Brother Trees. SIAM J. Comput. 13(1): 197-217 (1984) - [c12]Bernard Chazelle, Thomas Ottmann, Eljas Soisalon-Soininen, Derick Wood:
The Complexity and Decidability of Separation. ICALP 1984: 119-127 - 1982
- [j23]Thomas Ottmann, Derick Wood:
A comparison of iterative and defined classes of search trees. Int. J. Parallel Program. 11(3): 155-178 (1982) - 1981
- [j21]Thomas Ottmann, Hans-Werner Six, Derick Wood:
The implementation of insertion and deletion algorithms for 1-2 brother trees. Computing 26(4): 367-378 (1981) - [j19]Thomas Ottmann, Arto Salomaa, Derick Wood:
Sub-Regular Grammar Forms. Inf. Process. Lett. 12(4): 184-187 (1981) - [j18]Karel Culík II, Thomas Ottmann, Derick Wood:
Dense Multiway Trees. ACM Trans. Database Syst. 6(3): 486-512 (1981) - [c9]Thomas Ottmann, Arnold L. Rosenberg, Hans-Werner Six, Derick Wood:
A Realistic Cost Measure for Binary Search Trees. WG 1981: 163-172 - 1980
- [j16]Thomas Ottmann, Derick Wood:
1-2 Brother Trees or AVL Trees Revisited. Comput. J. 23(3): 248-255 (1980) - [c6]Thomas Ottmann, Hans-Werner Six, Derick Wood:
The Analysis of Search Trees: A Survey. WG 1980: 234-249 - 1979
- [j15]Thomas Ottmann, Hans-Werner Six, Derick Wood:
One-sided k-height-balanced trees. Computing 22(4): 283-290 (1979) - [j14]Thomas Ottmann, Hans-Werner Six, Derick Wood:
On the correspondence between AVL trees and brother trees. Computing 23(1): 43-54 (1979) - [c5]Thomas Ottmann, Derick Wood:
A Uniform Approach to Balanced Binary and Multiway Trees. MFCS 1979: 398-407 - [c4]Thomas Ottmann, Arnold L. Rosenberg, Hans-Werner Six, Derick Wood:
Node-Visit Optimal 1-2 Brother Trees. Theoretical Computer Science 1979: 213-221 - 1978
- [j11]Thomas Ottmann, Hans-Werner Six, Derick Wood:
Right Brother Trees. Commun. ACM 21(9): 769-776 (1978)
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 2024-04-25 01:49 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint