Thomas Ottmann

From MaRDI portal
Person:199233

Available identifiers

zbMath Open ottmann.thomas-aWikidataQ102111034 ScholiaQ102111034MaRDI QIDQ199233

List of research outcomes

PublicationDate of PublicationType
Learning picture sets from examples2024-01-29Paper
How to update a balanced binary tree with a constant number of rotations2022-12-09Paper
Relaxed balance for search trees with local rebalancing2021-12-20Paper
Enumerating extreme points in higher dimensions2017-12-04Paper
Algorithmen und Datenstrukturen2017-12-04Paper
Maintaining the Personal Style and Flair of Handwriting in Presentation Recordings2011-05-27Paper
Algorithmen und Datenstrukturen2010-12-22Paper
New Data Structures for IP Lookup and Conflict Detection2009-07-09Paper
Versioning Tree Structures by Path-Merging2008-06-19Paper
UPDATE-EFFICIENT DATA STRUCTURES FOR DYNAMIC IP ROUTER TABLES2007-04-25Paper
UPDATE-EFFICIENT DATA STRUCTURES FOR DYNAMIC IP ROUTER TABLES2007-03-13Paper
https://portal.mardi4nfdi.de/entity/Q46805332005-06-02Paper
An optimal algorithm for one-separation of a set of isothetic polygons2005-02-09Paper
https://portal.mardi4nfdi.de/entity/Q27481522002-05-21Paper
https://portal.mardi4nfdi.de/entity/Q27822382002-04-14Paper
https://portal.mardi4nfdi.de/entity/Q27364212001-10-23Paper
relaxed balance for search trees with local rebalancing2001-08-26Paper
https://portal.mardi4nfdi.de/entity/Q49420492000-03-19Paper
The ``authoring on the fly system for automated recording and replay of (tele)presentations2000-01-01Paper
https://portal.mardi4nfdi.de/entity/Q48941151996-10-01Paper
https://portal.mardi4nfdi.de/entity/Q48614811996-01-22Paper
Efficient labelling algorithms for the maximum noncrossing matching problem1994-03-17Paper
https://portal.mardi4nfdi.de/entity/Q46924651993-06-05Paper
https://portal.mardi4nfdi.de/entity/Q40367641993-05-18Paper
UPDATING BINARY TREES WITH CONSTANT LINKAGE COST1993-05-16Paper
Defining families of trees with E0L grammars1992-06-26Paper
A dynamic fixed windowing problem1989-01-01Paper
Fast algorithms for direct enclosures and direct dominances1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37951941988-01-01Paper
Partitioning and separating sets of orthogonal polygons1987-01-01Paper
New algorithms for special cases of the hidden line elimination problem1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37117311986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47257701986-01-01Paper
Purely top-down updating algorithms for stratified search trees1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36860511985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37402581985-01-01Paper
A fast algorithm for the Boolean masking problem1985-01-01Paper
A worst-case efficient algorithm for hidden-line elimination1985-01-01Paper
On the definition and computation of rectilinear convex hulls1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32175991984-01-01Paper
Binary search trees with binary comparison cost1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37274151984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30367101983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36662271983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47419301983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33250561982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33350011982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39594741982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39594751982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39594761982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39594771982-01-01Paper
Algorithm 43. The implementation of insertion and deletion algorithms for 1-2 brother trees1981-01-01Paper
Sub-regular grammar forms1981-01-01Paper
Dense multiway trees1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39206701981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39282591981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39337551981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39337661981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39337671981-01-01Paper
1-2 Brother Trees or AVL Trees Revisited1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38818851980-01-01Paper
Higher order analysis of random 1–2 brother trees1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39070851980-01-01Paper
One-sided k-height-balanced trees1979-01-01Paper
On the correspondence between AVL trees and brother trees1979-01-01Paper
Algorithms for Reporting and Counting Geometric Intersections1979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41812861979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41929881979-01-01Paper
Isomorphism, form equivalence and sequence equivalence of PDOL forms1978-01-01Paper
On two-symbol complete EOL forms1978-01-01Paper
Good OL forms1978-01-01Paper
Eine Einfache Universelle Menge Endlicher Automaten1978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41604251978-01-01Paper
Deletion in one-sided height balanced search trees1978-01-01Paper
Right brother trees1978-01-01Paper
On the form equivalence of L-forms1977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41243411977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41257681977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41412241977-01-01Paper
Implementing dictionaries using binary trees of very small height1976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40964301976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41138191976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41447831976-01-01Paper
Mit regulären Grundbegriffen definierbare Prädikate1975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40712181975-01-01Paper
Arithmetische Prädikate über einem Bereich endlicher Automaten1974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41324331974-01-01Paper
Über Möglichkeiten zur Simulation Endlicher Automaten durch eine Art Sequentieller Netzwerke aus einfachen Bausteinen1973-01-01Paper
https://portal.mardi4nfdi.de/entity/Q51816701973-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Thomas Ottmann