| Publication | Date of Publication | Type |
|---|
| Learning picture sets from examples | 2024-01-29 | Paper |
| How to update a balanced binary tree with a constant number of rotations | 2022-12-09 | Paper |
| Relaxed balance for search trees with local rebalancing | 2021-12-20 | Paper |
| Enumerating extreme points in higher dimensions | 2017-12-04 | Paper |
| Algorithmen und Datenstrukturen | 2017-12-04 | Paper |
| Maintaining the Personal Style and Flair of Handwriting in Presentation Recordings | 2011-05-27 | Paper |
| Algorithmen und Datenstrukturen | 2010-12-22 | Paper |
| New Data Structures for IP Lookup and Conflict Detection | 2009-07-09 | Paper |
| Versioning Tree Structures by Path-Merging | 2008-06-19 | Paper |
| UPDATE-EFFICIENT DATA STRUCTURES FOR DYNAMIC IP ROUTER TABLES | 2007-04-25 | Paper |
| UPDATE-EFFICIENT DATA STRUCTURES FOR DYNAMIC IP ROUTER TABLES | 2007-03-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4680533 | 2005-06-02 | Paper |
| An optimal algorithm for one-separation of a set of isothetic polygons | 2005-02-09 | Paper |
| Enumerating extreme points in higher dimensions | 2002-05-21 | Paper |
| Algorithms and data structures | 2002-04-14 | Paper |
| Animations for teaching purposes: Now and tomorrow | 2001-10-23 | Paper |
| relaxed balance for search trees with local rebalancing | 2001-08-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4942049 | 2000-03-19 | Paper |
| The ``authoring on the fly system for automated recording and replay of (tele)presentations | 2000-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4894115 | 1996-10-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4861481 | 1996-01-22 | Paper |
| Efficient labelling algorithms for the maximum noncrossing matching problem | 1994-03-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4692465 | 1993-06-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4036764 | 1993-05-18 | Paper |
| UPDATING BINARY TREES WITH CONSTANT LINKAGE COST | 1993-05-16 | Paper |
| Defining families of trees with E0L grammars | 1992-06-26 | Paper |
| Fast algorithms for direct enclosures and direct dominances | 1989-01-01 | Paper |
| A dynamic fixed windowing problem | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3795194 | 1988-01-01 | Paper |
| Partitioning and separating sets of orthogonal polygons | 1987-01-01 | Paper |
| New algorithms for special cases of the hidden line elimination problem | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3711731 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4725770 | 1986-01-01 | Paper |
| A fast algorithm for the Boolean masking problem | 1985-01-01 | Paper |
| A worst-case efficient algorithm for hidden-line elimination† | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3740258 | 1985-01-01 | Paper |
| Purely top-down updating algorithms for stratified search trees | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3686051 | 1985-01-01 | Paper |
| On the definition and computation of rectilinear convex hulls | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3217599 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3727415 | 1984-01-01 | Paper |
| Binary search trees with binary comparison cost | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3036710 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3666227 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4741930 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3959474 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3959475 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3325056 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3335001 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3959477 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3959476 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3928259 | 1981-01-01 | Paper |
| Sub-regular grammar forms | 1981-01-01 | Paper |
| Dense multiway trees | 1981-01-01 | Paper |
| Algorithm 43. The implementation of insertion and deletion algorithms for 1-2 brother trees | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3920670 | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3933755 | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3933766 | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3933767 | 1981-01-01 | Paper |
| 1-2 Brother Trees or AVL Trees Revisited | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3907085 | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3881885 | 1980-01-01 | Paper |
| Higher order analysis of random 1–2 brother trees | 1980-01-01 | Paper |
| Algorithms for Reporting and Counting Geometric Intersections | 1979-01-01 | Paper |
| On the correspondence between AVL trees and brother trees | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4181286 | 1979-01-01 | Paper |
| One-sided k-height-balanced trees | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4192988 | 1979-01-01 | Paper |
| On two-symbol complete EOL forms | 1978-01-01 | Paper |
| Right brother trees | 1978-01-01 | Paper |
| Isomorphism, form equivalence and sequence equivalence of PDOL forms | 1978-01-01 | Paper |
| Good OL forms | 1978-01-01 | Paper |
| Deletion in one-sided height balanced search trees | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4160425 | 1978-01-01 | Paper |
| Eine Einfache Universelle Menge Endlicher Automaten | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4124341 | 1977-01-01 | Paper |
| On the form equivalence of L-forms | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4125768 | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4141224 | 1977-01-01 | Paper |
| Implementing dictionaries using binary trees of very small height | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4096430 | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4113819 | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4144783 | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4071218 | 1975-01-01 | Paper |
| Mit regulären Grundbegriffen definierbare Prädikate | 1975-01-01 | Paper |
| Arithmetische Prädikate über einem Bereich endlicher Automaten | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4132433 | 1974-01-01 | Paper |
| Über Möglichkeiten zur Simulation Endlicher Automaten durch eine Art Sequentieller Netzwerke aus einfachen Bausteinen | 1973-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5181670 | 1973-01-01 | Paper |
