Thomas Ottmann

126 papers A* 5A 4B 11C 4Misc 1Journal 58Unranked 36
YearRankTypeTitle / Venue / Authors
2013 J jnl
Lecture Recording - a Success Story.
it Inf. Technol.
Paul-Thomas Kandzia, Serge Linckels, Thomas Ottmann, Stephan Trahasch
2013 — conf
MOOCs and/or eLectures - A means of virtualizing university education?
ITHET
Thomas Ottmann
2012 — book
Algorithmen und Datenstrukturen, 5. Auflage.
Thomas Ottmann, Peter Widmayer
2012 — conf
Vorlesungsaufzeichnung: vom Experiment zum Routinedienst.
DeLFI
Thomas Ottmann
2011 J jnl
Electures-Wiki - Toward Engaging Students to Actively Work with Lecture Recordings.
IEEE Trans. Learn. Technol.
Christoph Hermann, Thomas Ottmann
2011 — conf
Lecture Recording - vom Experiment zum Hochschulalltag.
DeLFI Workshops
Paul-Thomas Kandzia, Serge Linckels, Thomas Ottmann, Stephan Trahasch
2011 — conf
Maintaining the Personal Style and Flair of Handwriting in Presentation Recordings.
Rainbow of Computer Science
Khaireel A. Mohamed, Thomas Ottmann
2009 — conf
New Data Structures for IP Lookup and Conflict Detection.
Algorithmics of Large and Complex Networks
Christine Maindorfer, Tobias Lauer, Thomas Ottmann
2008 B conf
Is the Popular R*-tree Suited for Packet Classification?
NCA
Christine Maindorfer, Thomas Ottmann
2008 C conf
Relaxed min-augmented range trees for the representation of dynamic IP router tables.
ISCC
Christine Maindorfer, Bettina Bär, Thomas Ottmann
2008 Misc conf
Versioning Tree Structures by Path-Merging.
FAW
Khaireel A. Mohamed, Tobias Langner, Thomas Ottmann
2007 A* conf
A New Output-Sensitive Algorithm to Detect and Resolve Conflicts in Internet Router Tables.
INFOCOM
Christine Maindorfer, Khaireel A. Mohamed, Thomas Ottmann, Amitava Datta
2007 — conf
Active-smoothing in digital ink environments.
ACM Multimedia EMME Workshop
Khaireel A. Mohamed, Thomas Ottmann
2007 J jnl
Update-Efficient Data Structures for Dynamic IP Router Tables.
Int. J. Found. Comput. Sci.
Tobias Lauer, Thomas Ottmann, Amitava Datta
2007 J jnl
Update-efficient Data Structures for Dynamic Ip Router Tables.
Int. J. Found. Comput. Sci.
Tobias Lauer, Thomas Ottmann, Amitava Datta
2006 J jnl
DFG-Schwerpunktprogramm "Netzbasierte Wissenskommunikation in Gruppen".
it Inf. Technol.
Tobias Lauer, Thomas Ottmann, Stephan Trahasch, Jörg M. Haake, Hans-Rüdiger Pfister, Korinna Bauer, Friedrich W. Hesse
2006 — conf
Disoriented Pen-Gestures for Identifying Users around the Tabletop without Cameras and Motion Sensors.
Tabletop
Khaireel A. Mohamed, S. Haag, Julia Peltason, Frank Dal-Ri, Thomas Ottmann
2006 — conf
StuVa - Werkzeugunterstützte Studienverlaufsanalyse zur Unterstützung der Studienberatung.
HDI
Christoph Hermann, Thomas Ottmann
2005 J jnl
Einführung zur Themensektion "eLectures".
i-com
Holger Horz, Wolfgang Hürst, Thomas Ottmann, Christoph Rensing, Stephan Trahasch
2005 C conf
Overcoming Hard-To-Reach Toolboxes with On-Demand Menu Options for Cascading Electronic Whiteboards in Classrooms.
ICCE
Khaireel A. Mohamed, Thomas Ottmann
2005 B conf
Student-built algorithm visualizations for assessment: flexible generation, feedback and grading.
ITiCSE
Markus Krebs, Tobias Lauer, Thomas Ottmann, Stephan Trahasch
2005 — conf
Vorwort.
DeLFI Workshops
Holger Horz, Wolfgang Hürst, Thomas Ottmann, Christoph Rensing, Stephan Trahasch
2004 J jnl
An optimal algorithm for one-separation of a set of isothetic polygons.
Inf. Sci.
Amitava Datta, Kamala Krithivasan, Thomas Ottmann
2004 J jnl
Der Universitäre Lehrverbund Informatik - eine Bilanz.
Softwaretechnik-Trends
Paul-Thomas Kandzia, Gabriele Kraus, Thomas Ottmann
2004 — conf
Post-processing inkml for random-access navigation of voluminous handwritten ink documents.
WWW (Alternate Track Papers & Posters)
Khaireel A. Mohamed, Lioudmila Belenkaia, Thomas Ottmann
2003 — conf
From Lecture Recording Towards Personalized Collaborative Learning.
CSCL
T. Fiehn, Tobias Lauer, Jochen Lienhard, Thomas Ottmann, Stephan Trahasch, Bernd Zupancic
2003 — conf
Systems support for virtualizing traditional courses in science and engineering.
Quality Education @ a Distance
Thomas Ottmann, Stephan Trahasch, Tobias Lauer
2003 — conf
e-Learning im Hochschulbereich: Kritische Erfolgsfaktoren.
DFN-Arbeitstagung über Kommunikationsnetze
Thomas Ottmann, Robin Pomplun
2001 J jnl
Animations for Teaching Purposes: Now and Tomorrow.
J. Univers. Comput. Sci.
Tobias Lauer, Rainer Müller, Thomas Ottmann
2001 J jnl
Enumerating Extreme Points in Higher Dimensions.
Nord. J. Comput.
Thomas Ottmann, Sven Schuierer, Subbiah Soundaralakshmi
2001 J jnl
Relaxed balance for search trees with local rebalancing.
Acta Informatica
Kim S. Larsen, Thomas Ottmann, Eljas Soisalon-Soininen
2001 — conf
The "Authoring on the Fly" system for automatic presentation recording.
CHI Extended Abstracts
Wolfgang Hürst, Gabriela Maass, Rainer Müller, Thomas Ottmann
2001 J jnl
Towards a Virtual University.
J. Univers. Comput. Sci.
Amitava Datta, Thomas Ottmann
2001 J jnl
Video in Vorlesungsaufzeichnungen mit informatikfernen Inhalten am Beispiel Archäologie.
Informatica Didact.
Thomas Ottmann, Rainer Müller, G. Seitz, Ch. Steinert
2000 — conf
Möglichkeiten und Grenzen der Virtualisierung des Informatikstudiums.
GI Jahrestagung
Thomas Ottmann
2000 J jnl
The "Authoring on the Fly" system for automated recording and replay of (tele)presentations.
Multim. Syst.
Rainer Müller, Thomas Ottmann
1997 C conf
An Optimal Algorithm for One-Separation of a Set of Isothetic Polygons.
CIAC
Amitava Datta, Kamala Krithivasan, Thomas Ottmann
1997 — conf
Authoring on the Fly.
INFOS
Christian Bacher, Rainer Müller, Thomas Ottmann, M. Will
1997 A conf
Relaxed Balance for Search Trees with Local Rebalancing.
ESA
Kim S. Larsen, Thomas Ottmann, Eljas Soisalon-Soininen
1997 C conf
Relaxed Balanced Red-Black Trees.
CIAC
Sabine Hanke, Thomas Ottmann, Eljas Soisalon-Soininen
1996 — book
Algorithmen und Datenstrukturen, 3. Auflage.
Thomas Ottmann, Peter Widmayer
1996 J jnl
The Edge-flipping Distance of Triangulations.
J. Univers. Comput. Sci.
Sabine Hanke, Thomas Ottmann, Sven Schuierer
1995 J jnl
Authoring on the Fly.
J. Univers. Comput. Sci.
Thomas Ottmann, Christian Bacher
1995 A conf
Enumerating Extreme Points in Higher Dimensions.
STACS
Thomas Ottmann, Sven Schuierer, Subbiah Soundaralakshmi
1995 J jnl
New Tight Bounds on Uniquely Represented Dictionaries.
SIAM J. Comput.
Arne Andersson, Thomas Ottmann
1994 A conf
An Efficient Data Structure for Bidirectional Heuristic Search.
ECAI
Jürgen Eckerle, Thomas Ottmann
1994 — conf
Learning Picture Sets from Examples.
Results and Trends in Theoretical Computer Science
Anne Brüggemann-Klein, Petra Fischer, Thomas Ottmann
1993 — book
Algorithmen und Datenstrukturen, 2. Auflage
Thomas Ottmann, Peter Widmayer
1993 J jnl
Efficient Labelling Algorithms for the Maximum Noncrossing Matching Problem.
Discret. Appl. Math.
Federico Malucelli, Thomas Ottmann, Daniele Pretolani
1993 — conf
How to incorporate expert knowledge into an authoring system.
Computer Mediated Education of Information Technology Professionals and Advanced End-Users
Friedrich Augenstein, Thomas Ottmann, Jürgen Schöning
1992 — ed.
Data Structures and Efficient Algorithms, Final Report on the DFG Special Joint Initiative
Data Structures and Efficient Algorithm
Burkhard Monien, Thomas Ottmann
1992 — conf
Restricted Orientation Computational Geometry.
Data Structures and Efficient Algorithms
Bengt J. Nilsson, Thomas Ottmann, Sven Schuierer, Christian Icking
1992 J jnl
Updating Binary Trees with Constant Linkage Cost.
Int. J. Found. Comput. Sci.
Thomas Ottmann, Derick Wood
1991 J jnl
Defining families of trees with E0L grammars.
Discret. Appl. Math.
Thomas Ottmann, Derick Wood
1991 — conf
Ein typ- und regelgesteuertes Autorensystem.
Hypertext/Hypermedia
Friedrich Augenstein, Thomas Ottmann, Jürgen Schöning
1991 — conf
Elektronische Kurse - Kritische Bilanz und Konsequenzen für die Werkzeuggestaltung.
INFOS
Thomas Ottmann
1991 A* conf
Faster Uniquely Represented Dictionaries
FOCS
Arne Andersson, Thomas Ottmann
1991 — conf
Geometric Algorithms and their Complexity.
SSD
Thomas Ottmann
1991 — conf
Trees - A Personal View.
New Results and New Trends in Computer Science
Thomas Ottmann
1990 — book
Algorithmen und Datenstrukturen
Thomas Ottmann, Peter Widmayer
1990 J jnl
Binary Search Trees of Almost Optimal Height.
Acta Informatica
Arne Andersson, Christian Icking, Rolf Klein, Thomas Ottmann
1990 — conf
How to Update a Balanced Binary Tree with a Constant Number of Rotations.
SWAT
Thomas Ottmann, Derick Wood
1989 J jnl
A Dynamic Fixed Windowing Problem.
Algorithmica
Rolf Klein, Otto Nurmi, Thomas Ottmann, Derick Wood
1989 J jnl
Fast Algorithms for Direct Enclosures and Direct Dominances.
J. Algorithms
Ralf Hartmut Güting, Otto Nurmi, Thomas Ottmann
1989 — conf
How Can Educational Software Survive Current Hardware.
ICCAL
J. Dobrinski, Thomas Ottmann
1988 — conf
Identitätsprüfung von Polyonzügen aus kartographischen Datenbasen.
Austrographics
B. Becker, Thomas Ottmann
1987 A* ed.
Automata, Languages and Programming, 14th International Colloquium, ICALP87, Karlsruhe, Germany, July 13-17, 1987, Proceedings
ICALP
Thomas Ottmann
1987 J jnl
New algorithms for special cases of the hidden line elimination problem.
Comput. Vis. Graph. Image Process.
Ralf Hartmut Güting, Thomas Ottmann
1987 — conf
Numerical Stability of Geometric Algorithms.
SCG
Thomas Ottmann, Gerald Thiemt, Christian P. Ullrich
1987 — conf
Numerical Stability of simple Geometric Algorithms in the plane.
Computation Theory and Logic
Thomas Ottmann, Gerald Thiemt, Christian P. Ullrich
1987 J jnl
Partitioning and separating sets of orthogonal polygons.
Inf. Sci.
Thomas Ottmann, Eljas Soisalon-Soininen, Derick Wood
1987 B conf
Priority Search Trees in Secondary Memory (Extended Abstract).
WG
Christian Icking, Rolf Klein, Thomas Ottmann
1986 — conf
Modellversuch computergestützter Informatikunterricht: Algorithmen und Datenstrukturen.
INFOS
Thomas Ottmann, Peter Widmayer
1986 — conf
Optimal Dynamic Solutions for Fixed Windowing Problems.
SCG
Rolf Klein, Otto Nurmi, Thomas Ottmann, Derick Wood
1986 J jnl
Space-economical plane-sweep algorithms.
Comput. Vis. Graph. Image Process.
Thomas Ottmann, Derick Wood
1986 — conf
Verarbeitung und Verwaltung geometrischer Daten - Einführung in das Fachgespräch.
GI Jahrestagung (1)
Thomas Ottmann
1985 J jnl
A fast algorithm for the Boolean masking problem.
Comput. Vis. Graph. Image Process.
Thomas Ottmann, Peter Widmayer, Derick Wood
1985 — conf
Computational Geometry: Selected Algorithms and Paradigms.
European Conference on Computer Algebra (1)
Thomas Ottmann
1985 A conf
New Algorithms for Special Cases of the Hidden Line Elimination Problem.
STACS
Ralf Hartmut Güting, Thomas Ottmann
1985 J jnl
Purely Top-Down Updating Algorithms for Stratified Search Trees.
Acta Informatica
Thomas Ottmann, Michael Schrapp, Derick Wood
1985 J jnl
Search Trees and Bubble Memories.
RAIRO Theor. Informatics Appl.
Philippe Flajolet, Thomas Ottmann, Derick Wood
1985 — conf
The direct dominance problem.
SCG
Ralf Hartmut Güting, Otto Nurmi, Thomas Ottmann
1985 J jnl
Weight-balanced trees are not stratified.
Bull. EATCS
Thomas Ottmann, Michael Schrapp, Derick Wood
1984 J jnl
Binary search trees with binary comparison cost.
Int. J. Parallel Program.
Thomas Ottmann, Arnold L. Rosenberg, Hans-Werner Six, Derick Wood
1984 J jnl
Computing the Connected Components of Simple Rectilinear Geometrical Objects in D-Space.
RAIRO Theor. Informatics Appl.
Herbert Edelsbrunner, Jan van Leeuwen, Thomas Ottmann, Derick Wood
1984 — conf
Geometrische Probleme beim VLSI-Design.
GI Jahrestagung (Fachgespräche)
Thomas Ottmann
1984 J jnl
Minimal-Cost Brother Trees.
SIAM J. Comput.
Thomas Ottmann, Douglas Stott Parker Jr., Arnold L. Rosenberg, Hans-Werner Six, Derick Wood
1984 J jnl
On the Definition and Computation of Rectlinear Convex Hulls.
Inf. Sci.
Thomas Ottmann, Eljas Soisalon-Soininen, Derick Wood
1984 B conf
Solving Visibility Problems by Using Skeleton Structures.
MFCS
Thomas Ottmann, Peter Widmayer
1984 A* conf
The Complexity and Decidability of Separation.
ICALP
Bernard Chazelle, Thomas Ottmann, Eljas Soisalon-Soininen, Derick Wood
1983 — book
Automaten, Sprachen und Maschinen für Anwender
Jürgen Albert, Thomas Ottmann
1983 J jnl
On translating a set of line segments.
Comput. Vis. Graph. Image Process.
Thomas Ottmann, Peter Widmayer
1982 J jnl
A Dictionary Machine (for VLSI).
IEEE Trans. Computers
Thomas Ottmann, Arnold L. Rosenberg, Larry J. Stockmeyer
1982 J jnl
A comparison of iterative and defined classes of search trees.
Int. J. Parallel Program.
Thomas Ottmann, Derick Wood
1981 B conf
1-Pass Top-Down Update Schemes for Balanced Search Trees.
WG
Thomas Ottmann, Michael Schrapp
1981 B conf
A Realistic Cost Measure for Binary Search Trees.
WG
Thomas Ottmann, Arnold L. Rosenberg, Hans-Werner Six, Derick Wood
1981 J jnl
Dense Multiway Trees.
ACM Trans. Database Syst.
Karel Culík II, Thomas Ottmann, Derick Wood
1981 J jnl
On subregular OL forms.
Fundam. Informaticae
Jürgen Albert, Hermann A. Maurer, Thomas Ottmann
1981 J jnl
Sub-Regular Grammar Forms.
Inf. Process. Lett.
Thomas Ottmann, Arto Salomaa, Derick Wood
1981 B conf
The Complexity of Manipulating Hierarchically Defined Sets of Rectangles.
MFCS
Jon Louis Bentley, Thomas Ottmann
1981 J jnl
The implementation of insertion and deletion algorithms for 1-2 brother trees.
Computing
Thomas Ottmann, Hans-Werner Six, Derick Wood
1980 J jnl
1-2 Brother Trees or AVL Trees Revisited.
Comput. J.
Thomas Ottmann, Derick Wood
1980 J jnl
Higher Order Analysis of Random 1-2 Brother Trees.
BIT
Thomas Ottmann, Wolffried Stucky
1980 B conf
The Analysis of Search Trees: A Survey.
WG
Thomas Ottmann, Hans-Werner Six, Derick Wood
1980 B conf
The Power of a One-Dimensional Vector of Processors.
WG
Jon Louis Bentley, Thomas Ottmann
1979 B conf
A Uniform Approach to Balanced Binary and Multiway Trees.
MFCS
Thomas Ottmann, Derick Wood
1979 J jnl
Algorithms for Reporting and Counting Geometric Intersections.
IEEE Trans. Computers
Jon Louis Bentley, Thomas Ottmann
1979 — conf
Node-Visit Optimal 1-2 Brother Trees.
Theoretical Computer Science
Thomas Ottmann, Arnold L. Rosenberg, Hans-Werner Six, Derick Wood
1979 J jnl
On the correspondence between AVL trees and brother trees.
Computing
Thomas Ottmann, Hans-Werner Six, Derick Wood
1979 J jnl
One-sided k-height-balanced trees.
Computing
Thomas Ottmann, Hans-Werner Six, Derick Wood
1978 J jnl
Eine Einfache Universelle Menge Endlicher Automaten.
Math. Log. Q.
Thomas Ottmann
1978 J jnl
Good OL Forms.
Acta Informatica
H. Hule, Hermann A. Maurer, Thomas Ottmann
1978 J jnl
Isomorphism, Form Equivalence and Sequence Equivalence of PD0L Forms.
Theor. Comput. Sci.
Karel Culík II, Hermann A. Maurer, Thomas Ottmann, Keijo Ruohonen, Arto Salomaa
1978 J jnl
On Two-Symbol Complete E0L Forms.
Theor. Comput. Sci.
Karel Culík II, Hermann A. Maurer, Thomas Ottmann
1978 J jnl
Right Brother Trees.
Commun. ACM
Thomas Ottmann, Hans-Werner Six, Derick Wood
1977 J jnl
Kleine universelle mehrdimensionale Turingmaschinen.
J. Inf. Process. Cybern.
Hans Kleine Büning, Thomas Ottmann
1977 A* conf
Left-Fitting Translations.
ICALP
Hans-Peter Kriegel, Thomas Ottmann
1977 J jnl
Lokale Simulierbarkeit zweidimensionaler Turingmaschinen.
J. Inf. Process. Cybern.
Thomas Ottmann
1977 J jnl
On the Form Equivalence of
Theor. Comput. Sci.
Hermann A. Maurer, Thomas Ottmann, Arto Salomaa
1977 B conf
Tree-Structures for Set Manipulation Problems.
MFCS
Hermann A. Maurer, Thomas Ottmann
1976 J jnl
Implementing Dictionaries Using Binary Trees of Very Small Height.
Inf. Process. Lett.
Hermann A. Maurer, Thomas Ottmann, Hans-Werner Six
1975 J jnl
Eine universelle Turingmaschine mit zweidimensionalem Band, 7 Buchstaben und 2 Zuständen.
J. Inf. Process. Cybern.
Thomas Ottmann
1975 J jnl
Mit regulären Grundbegriffen definierbare Prädikate.
Computing
Thomas Ottmann
1974 J jnl
Simulation endlicher Automaten durch Ketten aus einfachen Bausteinautomaten.
J. Inf. Process. Cybern.
Peter Koerber, Thomas Ottmann
1973 — conf
Ketten und arithmetische Prädikate von endlichen Automaten.
Automatentheorie und Formale Sprachen
Thomas Ottmann
1971 — —
Eine Theorie sequentieller Netzwerke.
Thomas Ottmann