Eine Theorie sequentieller Netzwerke. - Thomas Ottmann (1971)

Ketten und arithmetische Prädikate von endlichen Automaten. - Thomas Ottmann (Automatentheorie und Formale Sprachen, 1973)

Simulation endlicher Automaten durch Ketten aus einfachen Bausteinautomaten. - Peter Koerber; Thomas Ottmann (J. Inf. Process. Cybern., 1974)

Mit regulären Grundbegriffen definierbare Prädikate. - Thomas Ottmann (Computing, 1975)

Eine universelle Turingmaschine mit zweidimensionalem Band, 7 Buchstaben und 2 Zuständen. - Thomas Ottmann (J. Inf. Process. Cybern., 1975)

Implementing Dictionaries Using Binary Trees of Very Small Height. - Hermann A. Maurer; Thomas Ottmann; Hans-Werner Six (Inf. Process. Lett., 1976)

Left-Fitting Translations. - Hans-Peter Kriegel; Thomas Ottmann (ICALP, 1977)

Tree-Structures for Set Manipulation Problems. - Hermann A. Maurer; Thomas Ottmann (MFCS, 1977)

Kleine universelle mehrdimensionale Turingmaschinen. - Hans Kleine Büning; Thomas Ottmann (J. Inf. Process. Cybern., 1977)

Lokale Simulierbarkeit zweidimensionaler Turingmaschinen. - Thomas Ottmann (J. Inf. Process. Cybern., 1977)

On the Form Equivalence of L-Forms. - Hermann A. Maurer; Thomas Ottmann; Arto Salomaa (Theor. Comput. Sci., 1977)

Good OL Forms. - H. Hule; Hermann A. Maurer; Thomas Ottmann (Acta Informatica, 1978)

Right Brother Trees. - Thomas Ottmann; Hans-Werner Six; Derick Wood (Commun. ACM, 1978)

Eine Einfache Universelle Menge Endlicher Automaten. - Thomas Ottmann (Math. Log. Q., 1978)

On Two-Symbol Complete E0L Forms. - Karel Culík II; Hermann A. Maurer; Thomas Ottmann (Theor. Comput. Sci., 1978)

Isomorphism, Form Equivalence and Sequence Equivalence of PD0L Forms. - Karel Culík II; Hermann A. Maurer; Thomas Ottmann; Keijo Ruohonen; Arto Salomaa (Theor. Comput. Sci., 1978)

A Uniform Approach to Balanced Binary and Multiway Trees. - Thomas Ottmann; Derick Wood (MFCS, 1979)

Node-Visit Optimal 1-2 Brother Trees. - Thomas Ottmann; Arnold L. Rosenberg; Hans-Werner Six; Derick Wood (Theoretical Computer Science, 1979)

On the correspondence between AVL trees and brother trees. - Thomas Ottmann; Hans-Werner Six; Derick Wood (Computing, 1979)

One-sided k-height-balanced trees. - Thomas Ottmann; Hans-Werner Six; Derick Wood (Computing, 1979)

Algorithms for Reporting and Counting Geometric Intersections. - Jon Louis Bentley; Thomas Ottmann (IEEE Trans. Computers, 1979)

The Power of a One-Dimensional Vector of Processors. - Jon Louis Bentley; Thomas Ottmann (WG, 1980)

The Analysis of Search Trees: A Survey. - Thomas Ottmann; Hans-Werner Six; Derick Wood (WG, 1980)

Higher Order Analysis of Random 1-2 Brother Trees. - Thomas Ottmann; Wolffried Stucky (BIT, 1980)

1-2 Brother Trees or AVL Trees Revisited. - Thomas Ottmann; Derick Wood (Comput. J., 1980)

The Complexity of Manipulating Hierarchically Defined Sets of Rectangles. - Jon Louis Bentley; Thomas Ottmann (MFCS, 1981)

A Realistic Cost Measure for Binary Search Trees. - Thomas Ottmann; Arnold L. Rosenberg; Hans-Werner Six; Derick Wood (WG, 1981)

1-Pass Top-Down Update Schemes for Balanced Search Trees. - Thomas Ottmann; Michael Schrapp (WG, 1981)

The implementation of insertion and deletion algorithms for 1-2 brother trees. - Thomas Ottmann; Hans-Werner Six; Derick Wood (Computing, 1981)

On subregular OL forms. - Jürgen Albert; Hermann A. Maurer; Thomas Ottmann (Fundam. Informaticae, 1981)

Sub-Regular Grammar Forms. - Thomas Ottmann; Arto Salomaa; Derick Wood (Inf. Process. Lett., 1981)

Dense Multiway Trees. - Karel Culík II; Thomas Ottmann; Derick Wood (ACM Trans. Database Syst., 1981)

A comparison of iterative and defined classes of search trees. - Thomas Ottmann; Derick Wood (Int. J. Parallel Program., 1982)

A Dictionary Machine (for VLSI). - Thomas Ottmann; Arnold L. Rosenberg; Larry J. Stockmeyer (IEEE Trans. Computers, 1982)

Automaten, Sprachen und Maschinen für Anwender - Jürgen Albert; Thomas Ottmann (Bibliographisches Institut, 1983)

On translating a set of line segments. - Thomas Ottmann; Peter Widmayer (Comput. Vis. Graph. Image Process., 1983)

Geometrische Probleme beim VLSI-Design. - Thomas Ottmann (GI Jahrestagung (Fachgespräche), 1984)

The Complexity and Decidability of Separation. - Bernard Chazelle; Thomas Ottmann; Eljas Soisalon-Soininen; Derick Wood (ICALP, 1984)

Solving Visibility Problems by Using Skeleton Structures. - Thomas Ottmann; Peter Widmayer (MFCS, 1984)

Binary search trees with binary comparison cost. - Thomas Ottmann; Arnold L. Rosenberg; Hans-Werner Six; Derick Wood (Int. J. Parallel Program., 1984)

On the Definition and Computation of Rectlinear Convex Hulls. - Thomas Ottmann; Eljas Soisalon-Soininen; Derick Wood (Inf. Sci., 1984)

Computing the Connected Components of Simple Rectilinear Geometrical Objects in D-Space. - Herbert Edelsbrunner; Jan van Leeuwen; Thomas Ottmann; Derick Wood (RAIRO Theor. Informatics Appl., 1984)

Minimal-Cost Brother Trees. - Thomas Ottmann; Douglas Stott Parker Jr.; Arnold L. Rosenberg; Hans-Werner Six; Derick Wood (SIAM J. Comput., 1984)

The direct dominance problem. - Ralf Hartmut Güting; Otto Nurmi; Thomas Ottmann (SCG, 1985)

Computational Geometry: Selected Algorithms and Paradigms. - Thomas Ottmann (European Conference on Computer Algebra (1), 1985)

Purely Top-Down Updating Algorithms for Stratified Search Trees. - Thomas Ottmann; Michael Schrapp; Derick Wood (Acta Informatica, 1985)

A fast algorithm for the Boolean masking problem. - Thomas Ottmann; Peter Widmayer; Derick Wood (Comput. Vis. Graph. Image Process., 1985)

Weight-balanced trees are not stratified. - Thomas Ottmann; Michael Schrapp; Derick Wood (Bull. EATCS, 1985)

Search Trees and Bubble Memories. - Philippe Flajolet; Thomas Ottmann; Derick Wood (RAIRO Theor. Informatics Appl., 1985)

Optimal Dynamic Solutions for Fixed Windowing Problems. - Rolf Klein; Otto Nurmi; Thomas Ottmann; Derick Wood (SCG, 1986)

Verarbeitung und Verwaltung geometrischer Daten - Einführung in das Fachgespräch. - Thomas Ottmann (GI Jahrestagung (1), 1986)

Modellversuch computergestützter Informatikunterricht: Algorithmen und Datenstrukturen. - Thomas Ottmann; Peter Widmayer (INFOS, 1986)

Space-economical plane-sweep algorithms. - Thomas Ottmann; Derick Wood (Comput. Vis. Graph. Image Process., 1986)

Numerical Stability of simple Geometric Algorithms in the plane. - Thomas Ottmann; Gerald Thiemt; Christian P. Ullrich (Computation Theory and Logic, 1987)

Numerical Stability of Geometric Algorithms. - Thomas Ottmann; Gerald Thiemt; Christian P. Ullrich (SCG, 1987)

Priority Search Trees in Secondary Memory (Extended Abstract). - Christian Icking; Rolf Klein; Thomas Ottmann (WG, 1987)

New algorithms for special cases of the hidden line elimination problem. - Ralf Hartmut Güting; Thomas Ottmann (Comput. Vis. Graph. Image Process., 1987)

Partitioning and separating sets of orthogonal polygons. - Thomas Ottmann; Eljas Soisalon-Soininen; Derick Wood (Inf. Sci., 1987)

Identitätsprüfung von Polyonzügen aus kartographischen Datenbasen. - B. Becker; Thomas Ottmann (Austrographics, 1988)

How Can Educational Software Survive Current Hardware. - J. Dobrinski; Thomas Ottmann (ICCAL, 1989)

A Dynamic Fixed Windowing Problem. - Rolf Klein; Otto Nurmi; Thomas Ottmann; Derick Wood (Algorithmica, 1989)

Fast Algorithms for Direct Enclosures and Direct Dominances. - Ralf Hartmut Güting; Otto Nurmi; Thomas Ottmann (J. Algorithms, 1989)

Algorithmen und Datenstrukturen - Thomas Ottmann; Peter Widmayer (Bibliographisches Institut, 1990)

How to Update a Balanced Binary Tree with a Constant Number of Rotations. - Thomas Ottmann; Derick Wood (SWAT, 1990)

Binary Search Trees of Almost Optimal Height. - Arne Andersson; Christian Icking; Rolf Klein; Thomas Ottmann (Acta Informatica, 1990)

Trees - A Personal View. - Thomas Ottmann (New Results and New Trends in Computer Science, 1991)

Faster Uniquely Represented Dictionaries - Arne Andersson; Thomas Ottmann (FOCS, 1991)

Ein typ- und regelgesteuertes Autorensystem. - Friedrich Augenstein; Thomas Ottmann; Jürgen Schöning (Hypertext/Hypermedia, 1991)

Elektronische Kurse - Kritische Bilanz und Konsequenzen für die Werkzeuggestaltung. - Thomas Ottmann (INFOS, 1991)

Geometric Algorithms and their Complexity. - Thomas Ottmann (SSD, 1991)

Defining families of trees with E0L grammars. - Thomas Ottmann; Derick Wood (Discret. Appl. Math., 1991)

Restricted Orientation Computational Geometry. - Bengt J. Nilsson; Thomas Ottmann; Sven Schuierer; Christian Icking (Data Structures and Efficient Algorithms, 1992)

Updating Binary Trees with Constant Linkage Cost. - Thomas Ottmann; Derick Wood (Int. J. Found. Comput. Sci., 1992)

Algorithmen und Datenstrukturen, 2. Auflage - Thomas Ottmann; Peter Widmayer (Bibliographisches Institut, 1993)

How to incorporate expert knowledge into an authoring system. - Friedrich Augenstein; Thomas Ottmann; Jürgen Schöning (Computer Mediated Education of Information Technology Professionals and Advanced End-Users, 1993)

Efficient Labelling Algorithms for the Maximum Noncrossing Matching Problem. - Federico Malucelli; Thomas Ottmann; Daniele Pretolani (Discret. Appl. Math., 1993)

Learning Picture Sets from Examples. - Anne Brüggemann-Klein; Petra Fischer; Thomas Ottmann (Results and Trends in Theoretical Computer Science, 1994)

An Efficient Data Structure for Bidirectional Heuristic Search. - Jürgen Eckerle; Thomas Ottmann (ECAI, 1994)

Authoring on the Fly. - Thomas Ottmann; Christian Bacher (J. Univers. Comput. Sci., 1995)

New Tight Bounds on Uniquely Represented Dictionaries. - Arne Andersson; Thomas Ottmann (SIAM J. Comput., 1995)

Algorithmen und Datenstrukturen, 3. Auflage. - Thomas Ottmann; Peter Widmayer (Spektrum, 1996)

The Edge-flipping Distance of Triangulations. - Sabine Hanke; Thomas Ottmann; Sven Schuierer (J. Univers. Comput. Sci., 1996)

Relaxed Balanced Red-Black Trees. - Sabine Hanke; Thomas Ottmann; Eljas Soisalon-Soininen (CIAC, 1997)

Authoring on the Fly. - Christian Bacher; Rainer Müller; Thomas Ottmann; M. Will (INFOS, 1997)

Möglichkeiten und Grenzen der Virtualisierung des Informatikstudiums. - Thomas Ottmann (GI Jahrestagung, 2000)

The "Authoring on the Fly" system for automated recording and replay of (tele)presentations. - Rainer Müller; Thomas Ottmann (Multim. Syst., 2000)

The "Authoring on the Fly" system for automatic presentation recording. - Wolfgang Hürst; Gabriela Maass; Rainer Müller; Thomas Ottmann (CHI Extended Abstracts, 2001)

Relaxed balance for search trees with local rebalancing. - Kim S. Larsen; Thomas Ottmann; Eljas Soisalon-Soininen (Acta Informatica, 2001)

Video in Vorlesungsaufzeichnungen mit informatikfernen Inhalten am Beispiel Archäologie. - Thomas Ottmann; Rainer Müller; G. Seitz; Ch. Steinert (Informatica Didact., 2001)

Towards a Virtual University. - Amitava Datta; Thomas Ottmann (J. Univers. Comput. Sci., 2001)

Animations for Teaching Purposes: Now and Tomorrow. - Tobias Lauer; Rainer Müller; Thomas Ottmann (J. Univers. Comput. Sci., 2001)

Enumerating Extreme Points in Higher Dimensions. - Thomas Ottmann; Sven Schuierer; Subbiah Soundaralakshmi (Nord. J. Comput., 2001)

From Lecture Recording Towards Personalized Collaborative Learning. - T. Fiehn; Tobias Lauer; Jochen Lienhard; Thomas Ottmann; Stephan Trahasch; Bernd Zupancic (CSCL, 2003)

e-Learning im Hochschulbereich: Kritische Erfolgsfaktoren. - Thomas Ottmann; Robin Pomplun (DFN-Arbeitstagung über Kommunikationsnetze, 2003)

Systems support for virtualizing traditional courses in science and engineering. - Thomas Ottmann; Stephan Trahasch; Tobias Lauer (Quality Education @ a Distance, 2003)

Post-processing inkml for random-access navigation of voluminous handwritten ink documents. - Khaireel A. Mohamed; Lioudmila Belenkaia; Thomas Ottmann (WWW (Alternate Track Papers & Posters), 2004)

An optimal algorithm for one-separation of a set of isothetic polygons. - Amitava Datta; Kamala Krithivasan; Thomas Ottmann (Inf. Sci., 2004)

Der Universitäre Lehrverbund Informatik - eine Bilanz. - Paul-Thomas Kandzia; Gabriele Kraus; Thomas Ottmann (Softwaretechnik-Trends, 2004)

Vorwort. - Holger Horz; Wolfgang Hürst; Thomas Ottmann; Christoph Rensing; Stephan Trahasch (DeLFI Workshops, 2005)

Overcoming Hard-To-Reach Toolboxes with On-Demand Menu Options for Cascading Electronic Whiteboards in Classrooms. - Khaireel A. Mohamed; Thomas Ottmann (ICCE, 2005)

Student-built algorithm visualizations for assessment: flexible generation, feedback and grading. - Markus Krebs; Tobias Lauer; Thomas Ottmann; Stephan Trahasch (ITiCSE, 2005)

Einführung zur Themensektion "eLectures". - Holger Horz; Wolfgang Hürst; Thomas Ottmann; Christoph Rensing; Stephan Trahasch (i-com, 2005)

StuVa - Werkzeugunterstützte Studienverlaufsanalyse zur Unterstützung der Studienberatung. - Christoph Hermann; Thomas Ottmann (HDI, 2006)

Disoriented Pen-Gestures for Identifying Users around the Tabletop without Cameras and Motion Sensors. - Khaireel A. Mohamed; S. Haag; Julia Peltason; Frank Dal-Ri; Thomas Ottmann (Tabletop, 2006)

DFG-Schwerpunktprogramm "Netzbasierte Wissenskommunikation in Gruppen". - Tobias Lauer; Thomas Ottmann; Stephan Trahasch; Jörg M. Haake; Hans-Rüdiger Pfister; Korinna Bauer; Friedrich W. Hesse (it Inf. Technol., 2006)

A New Output-Sensitive Algorithm to Detect and Resolve Conflicts in Internet Router Tables. - Christine Maindorfer; Khaireel A. Mohamed; Thomas Ottmann; Amitava Datta (INFOCOM, 2007)

Active-smoothing in digital ink environments. - Khaireel A. Mohamed; Thomas Ottmann (ACM Multimedia EMME Workshop, 2007)

Update-efficient Data Structures for Dynamic Ip Router Tables. - Tobias Lauer; Thomas Ottmann; Amitava Datta (Int. J. Found. Comput. Sci., 2007)

Versioning Tree Structures by Path-Merging. - Khaireel A. Mohamed; Tobias Langner; Thomas Ottmann (FAW, 2008)

Relaxed min-augmented range trees for the representation of dynamic IP router tables. - Christine Maindorfer; Bettina Bär; Thomas Ottmann (ISCC, 2008)

Is the Popular R*-tree Suited for Packet Classification? - Christine Maindorfer; Thomas Ottmann (NCA, 2008)

New Data Structures for IP Lookup and Conflict Detection. - Christine Maindorfer; Tobias Lauer; Thomas Ottmann (Algorithmics of Large and Complex Networks, 2009)

Maintaining the Personal Style and Flair of Handwriting in Presentation Recordings. - Khaireel A. Mohamed; Thomas Ottmann (Rainbow of Computer Science, 2011)

Lecture Recording - vom Experiment zum Hochschulalltag. - Paul-Thomas Kandzia; Serge Linckels; Thomas Ottmann; Stephan Trahasch (DeLFI Workshops, 2011)

Electures-Wiki - Toward Engaging Students to Actively Work with Lecture Recordings. - Christoph Hermann; Thomas Ottmann (IEEE Trans. Learn. Technol., 2011)

Algorithmen und Datenstrukturen, 5. Auflage. - Thomas Ottmann; Peter Widmayer (Spektrum Akademischer Verlag, 2012)

Vorlesungsaufzeichnung: vom Experiment zum Routinedienst. - Thomas Ottmann (DeLFI, 2012)

MOOCs and/or eLectures - A means of virtualizing university education? - Thomas Ottmann (ITHET, 2013)

Lecture Recording - a Success Story. - Paul-Thomas Kandzia; Serge Linckels; Thomas Ottmann; Stephan Trahasch (it Inf. Technol., 2013)