Thomas Ottmann

According to our database1, Thomas Ottmann authored at least 123 papers between 1971 and 2013.

Collaborative distances:



In proceedings 
PhD thesis 





Lecture Recording - a Success Story.
it - Information Technology, 2013

MOOCs and/or eLectures - A means of virtualizing university education?
Proceedings of the 2013 12th International Conference on Information Technology Based Higher Education and Training, 2013

Vorlesungsaufzeichnung: vom Experiment zum Routinedienst.
Proceedings of the DeLFI 2012, 2012

Algorithmen und Datenstrukturen, 5. Auflage.
Spektrum Akademischer Verlag, ISBN: 978-3-8274-2803-5, 2012

Electures-Wiki - Toward Engaging Students to Actively Work with Lecture Recordings.
TLT, 2011

Lecture Recording - vom Experiment zum Hochschulalltag.
Proceedings of the DeLFI 2011: Die 9. e-Learning Fachtagung Informatik, 2011

Maintaining the Personal Style and Flair of Handwriting in Presentation Recordings.
Proceedings of the Rainbow of Computer Science, 2011

New Data Structures for IP Lookup and Conflict Detection.
Proceedings of the Algorithmics of Large and Complex Networks - Design, 2009

Is the Popular R*-tree Suited for Packet Classification?
Proceedings of The Seventh IEEE International Symposium on Networking Computing and Applications, 2008

Relaxed min-augmented range trees for the representation of dynamic IP router tables.
Proceedings of the 13th IEEE Symposium on Computers and Communications (ISCC 2008), 2008

Versioning Tree Structures by Path-Merging.
Proceedings of the Frontiers in Algorithmics, Second Annual International Workshop, 2008

Update-efficient Data Structures for Dynamic Ip Router Tables.
Int. J. Found. Comput. Sci., 2007

Active-smoothing in digital ink environments.
Proceedings of the International Workshop on Educational Multimedia and Multimedia Education 2007, 2007

A New Output-Sensitive Algorithm to Detect and Resolve Conflicts in Internet Router Tables.
Proceedings of the INFOCOM 2007. 26th IEEE International Conference on Computer Communications, 2007

DFG-Schwerpunktprogramm "Netzbasierte Wissenskommunikation in Gruppen".
it - Information Technology, 2006

Disoriented Pen-Gestures for Identifying Users around the Tabletop without Cameras and Motion Sensors.
Proceedings of the First IEEE International Workshop on Horizontal Interactive Human-Computer Systems (Tabletop 2006), 2006

StuVa - Ein Werkzeug zur Studienverlaufsanalyse.
Proceedings of the HDI 2006, 2006

Einführung zur Themensektion "eLectures".
i-com, 2005

Student-built algorithm visualizations for assessment: flexible generation, feedback and grading.
Proceedings of the 10th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education, 2005

Overcoming Hard-To-Reach Toolboxes with On-Demand Menu Options for Cascading Electronic Whiteboards in Classrooms.
Proceedings of the Towards Sustainable and Scalable Educational Innovations Informed by the Learning Sciences, 2005

Proceedings of the Workshop Proceedings DeLFI 2005 und GMW05, 2005

Der Universitäre Lehrverbund Informatik - eine Bilanz.
Softwaretechnik-Trends, 2004

An optimal algorithm for one-separation of a set of isothetic polygons.
Inf. Sci., 2004

Post-processing inkml for random-access navigation of voluminous handwritten ink documents.
Proceedings of the 13th international conference on World Wide Web, 2004

Systems support for virtualizing traditional courses in science and engineering.
Proceedings of the Quality Education @ a Distance, 2003

e-Learning im Hochschulbereich: Kritische Erfolgsfaktoren.
Proceedings of the Security, 2003

From Lecture Recording Towards Personalized Collaborative Learning.
Proceedings of the Designing for Change in Networked Learning Environments, 2003

Enumerating Extreme Points in Higher Dimensions.
Nord. J. Comput., 2001

Animations for Teaching Purposes: Now and Tomorrow.
J. UCS, 2001

Towards a Virtual University.
J. UCS, 2001

Video in Vorlesungsaufzeichnungen mit informatikfernen Inhalten am Beispiel Archäologie.
Informatica Didactica, 2001

Relaxed balance for search trees with local rebalancing.
Acta Inf., 2001

The "Authoring on the Fly" system for automatic presentation recording.
Proceedings of the CHI '01 Extended Abstracts on Human Factors in Computing Systems, 2001

The "Authoring on the Fly" system for automated recording and replay of (tele)presentations.
Multimedia Syst., 2000

Möglichkeiten und Grenzen der Virtualisierung des Informatikstudiums.
Proceedings of the Informatik 2000, 2000

Authoring on the Fly.
Proceedings of the Informatik und Lernen in der Informationsgesellschaft, 1997

Relaxed Balance for Search Trees with Local Rebalancing.
Proceedings of the Algorithms, 1997

Relaxed Balanced Red-Black Trees.
Proceedings of the Algorithms and Complexity, Third Italian Conference, 1997

An Optimal Algorithm for One-Separation of a Set of Isothetic Polygons.
Proceedings of the Algorithms and Complexity, Third Italian Conference, 1997

The Edge-flipping Distance of Triangulations.
J. UCS, 1996

Algorithmen und Datenstrukturen, 3. Auflage.
Spektrum Lehrbuch, Spektrum, ISBN: 978-3-8274-0110-6, 1996

New Tight Bounds on Uniquely Represented Dictionaries.
SIAM J. Comput., 1995

Authoring on the Fly.
J. UCS, 1995

Enumerating Extreme Points in Higher Dimensions.
Proceedings of the STACS 95, 1995

An Efficient Data Structure for Bidirectional Heuristic Search.
Proceedings of the Eleventh European Conference on Artificial Intelligence, 1994

Learning Picture Sets from Examples.
Proceedings of the Results and Trends in Theoretical Computer Science, 1994

Efficient Labelling Algorithms for the Maximum Noncrossing Matching Problem.
Discrete Applied Mathematics, 1993

How to incorporate expert knowledge into an authoring system.
Proceedings of the Computer Mediated Education of Information Technology Professionals and Advanced End-Users, 1993

Algorithmen und Datenstrukturen, 2. Auflage
Reihe Informatik 70, Bibliographisches Institut, ISBN: 3-411-16602-9, 1993

Updating Binary Trees with Constant Linkage Cost.
Int. J. Found. Comput. Sci., 1992

Restricted Orientation Computational Geometry.
Proceedings of the Data Structures and Efficient Algorithms, 1992

Defining families of trees with E0L grammars.
Discrete Applied Mathematics, 1991

Geometric Algorithms and their Complexity.
Proceedings of the Advances in Spatial Databases, 1991

Elektronische Kurse - Kritische Bilanz und Konsequenzen für die Werkzeuggestaltung.
Proceedings of the Informatik und Schule 1991, 1991

Ein typ- und regelgesteuertes Autorensystem.
Proceedings of the Hypertext/Hypermedia, 1991

Faster Uniquely Represented Dictionaries
Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991

Trees - A Personal View.
Proceedings of the New Results and New Trends in Computer Science, 1991

Binary Search Trees of Almost Optimal Height.
Acta Inf., 1990

How to Update a Balanced Binary Tree with a Constant Number of Rotations.
Proceedings of the SWAT 90, 1990

Algorithmen und Datenstrukturen
Reihe Informatik 70, Bibliographisches Institut, ISBN: 3-411-03161-1, 1990

Fast Algorithms for Direct Enclosures and Direct Dominances.
J. Algorithms, 1989

A Dynamic Fixed Windowing Problem.
Algorithmica, 1989

How Can Educational Software Survive Current Hardware.
Proceedings of the Computer Assisted Learning, 2nd International Conference, 1989

Identitätsprüfung von Polyonzügen aus kartographischen Datenbasen.
Proceedings of the Austrographics '88, 1988

Partitioning and separating sets of orthogonal polygons.
Inf. Sci., 1987

New algorithms for special cases of the hidden line elimination problem.
Computer Vision, Graphics, and Image Processing, 1987

Priority Search Trees in Secondary Memory (Extended Abstract).
Proceedings of the Graph-Theoretic Concepts in Computer Science, International Workshop, 1987

Numerical Stability of Geometric Algorithms.
Proceedings of the Third Annual Symposium on Computational Geometry, 1987

Numerical Stability of simple Geometric Algorithms in the plane.
Proceedings of the Computation Theory and Logic, In Memory of Dieter Rödding, 1987

Space-economical plane-sweep algorithms.
Computer Vision, Graphics, and Image Processing, 1986

Modellversuch computergestützter Informatikunterricht: Algorithmen und Datenstrukturen.
Proceedings of the Informatik-Grundbildung in Schule und Beruf, GI-Fachtagung, Kaiserslautern, 29. September, 1986

Verarbeitung und Verwaltung geometrischer Daten - Einführung in das Fachgespräch.
Proceedings of the GI - 16. Jahrestagung I, Berlin, 6.-10. Oktober 1986, Proceedings, 1986

Optimal Dynamic Solutions for Fixed Windowing Problems.
Proceedings of the Second Annual ACM SIGACT/SIGGRAPH Symposium on Computational Geometry, 1986

Search Trees and Bubble Memories.
ITA, 1985

Weight-balanced trees are not stratified.
Bulletin of the EATCS, 1985

A fast algorithm for the Boolean masking problem.
Computer Vision, Graphics, and Image Processing, 1985

Purely Top-Down Updating Algorithms for Stratified Search Trees.
Acta Inf., 1985

New Algorithms for Special Cases of the Hidden Line Elimination Problem.
Proceedings of the STACS 85, 1985

Computational Geometry: Selected Algorithms and Paradigms.
Proceedings of the EUROCAL '85, 1985

The direct dominance problem.
Proceedings of the First Annual Symposium on Computational Geometry, 1985

Minimal-Cost Brother Trees.
SIAM J. Comput., 1984

Computing the Connected Components of Simple Rectilinear Geometrical Objects in D-Space.
ITA, 1984

On the Definition and Computation of Rectlinear Convex Hulls.
Inf. Sci., 1984

Binary search trees with binary comparison cost.
International Journal of Parallel Programming, 1984

Solving Visibility Problems by Using Skeleton Structures.
Proceedings of the Mathematical Foundations of Computer Science 1984, 1984

The Complexity and Decidability of Separation.
Proceedings of the Automata, 1984

Geometrische Probleme beim VLSI-Design.
Proceedings of the Fachgespräche auf der 14. GI-Jahrestagung, 1984

On translating a set of line segments.
Computer Vision, Graphics, and Image Processing, 1983

Automaten, Sprachen und Maschinen für Anwender
Reihe Informatik 38, Bibliographisches Institut, ISBN: 3-411-01651-5, 1983

A Dictionary Machine (for VLSI).
IEEE Trans. Computers, 1982

A comparison of iterative and defined classes of search trees.
International Journal of Parallel Programming, 1982

Dense Multiway Trees.
ACM Trans. Database Syst., 1981

Sub-Regular Grammar Forms.
Inf. Process. Lett., 1981

On subregular OL forms.
Fundam. Inform., 1981

The implementation of insertion and deletion algorithms for 1-2 brother trees.
Computing, 1981

1-Pass Top-Down Update Schemes for Balanced Search Trees.
Proceedings of the 7th Conference Graphtheoretic Concepts in Computer Science (WG '81), 1981

A Realistic Cost Measure for Binary Search Trees.
Proceedings of the 7th Conference Graphtheoretic Concepts in Computer Science (WG '81), 1981

The Complexity of Manipulating Hierarchically Defined Sets of Rectangles.
Proceedings of the Mathematical Foundations of Computer Science 1981, Strbske Pleso, Czechoslovakia, August 31, 1981

1-2 Brother Trees or AVL Trees Revisited.
Comput. J., 1980

Higher Order Analysis of Random 1-2 Brother Trees.
BIT, 1980

The Analysis of Search Trees: A Survey.
Proceedings of the Graphtheoretic Concepts in Computer Science, 1980

The Power of a One-Dimensional Vector of Processors.
Proceedings of the Graphtheoretic Concepts in Computer Science, 1980

Algorithms for Reporting and Counting Geometric Intersections.
IEEE Trans. Computers, 1979

One-sided k-height-balanced trees.
Computing, 1979

On the correspondence between AVL trees and brother trees.
Computing, 1979

Node-Visit Optimal 1-2 Brother Trees.
Proceedings of the Theoretical Computer Science, 1979

A Uniform Approach to Balanced Binary and Multiway Trees.
Proceedings of the Mathematical Foundations of Computer Science 1979, 1979

Isomorphism, Form Equivalence and Sequence Equivalence of PD0L Forms.
Theor. Comput. Sci., 1978

On Two-Symbol Complete E0L Forms.
Theor. Comput. Sci., 1978

Eine Einfache Universelle Menge Endlicher Automaten.
Math. Log. Q., 1978

Right Brother Trees.
Commun. ACM, 1978

Good OL Forms.
Acta Inf., 1978

On the Form Equivalence of L-Forms.
Theor. Comput. Sci., 1977

Lokale Simulierbarkeit zweidimensionaler Turingmaschinen.
Elektronische Informationsverarbeitung und Kybernetik, 1977

Kleine universelle mehrdimensionale Turingmaschinen.
Elektronische Informationsverarbeitung und Kybernetik, 1977

Tree-Structures for Set Manipulation Problems.
Proceedings of the Mathematical Foundations of Computer Science 1977, 1977

Left-Fitting Translations.
Proceedings of the Automata, 1977

Implementing Dictionaries Using Binary Trees of Very Small Height.
Inf. Process. Lett., 1976

Eine universelle Turingmaschine mit zweidimensionalem Band, 7 Buchstaben und 2 Zuständen.
Elektronische Informationsverarbeitung und Kybernetik, 1975

Mit regulären Grundbegriffen definierbare Prädikate.
Computing, 1975

Simulation endlicher Automaten durch Ketten aus einfachen Bausteinautomaten.
Elektronische Informationsverarbeitung und Kybernetik, 1974

Ketten und arithmetische Prädikate von endlichen Automaten.
Proceedings of the 1. Fachtagung über Automatentheorie und Formale Sprachen, 1973

Eine Theorie sequentieller Netzwerke.
PhD thesis, 1971