 | 2009 |
|---|
| 102 |       | Christine Maindorfer,
Tobias Lauer,
Thomas Ottmann:
New Data Structures for IP Lookup and Conflict Detection.
Algorithmics of Large and Complex Networks 2009: 319-329 |
| 2008 |
|---|
| 101 | | Khaireel A. Mohamed,
Tobias Langner,
Thomas Ottmann:
Versioning Tree Structures by Path-Merging.
FAW 2008: 101-112 |
| 100 | | Christine Maindorfer,
Bettina Bär,
Thomas Ottmann:
Relaxed min-augmented range trees for the representation of dynamic IP router tables.
ISCC 2008: 920-927 |
| 99 | | Christine Maindorfer,
Thomas Ottmann:
Is the Popular R*-tree Suited for Packet Classification?
NCA 2008: 168-176 |
| 2007 |
|---|
| 98 | | Khaireel A. Mohamed,
Thomas Ottmann:
Active-smoothing in digital ink environments.
ACM Multimedia EMME Workshop 2007: 119-120 |
| 97 | | Christine Maindorfer,
Khaireel A. Mohamed,
Thomas Ottmann,
Amitava Datta:
A New Output-Sensitive Algorithm to Detect and Resolve Conflicts in Internet Router Tables.
INFOCOM 2007: 2431-2435 |
| 96 | | Tobias Lauer,
Thomas Ottmann,
Amitava Datta:
Update-efficient Data Structures for Dynamic Ip Router Tables.
Int. J. Found. Comput. Sci. 18(1): 139-162 (2007) |
| 95 | | Tobias Lauer,
Thomas Ottmann,
Amitava Datta:
Update-Efficient Data Structures for Dynamic IP Router Tables.
Int. J. Found. Comput. Sci. 18(2): 295-317 (2007) |
| 2006 |
|---|
| 94 | | Christoph Hermann,
Thomas Ottmann:
StuVa - Ein Werkzeug zur Studienverlaufsanalyse.
HDI 2006: 127-136 |
| 93 | | Khaireel A. Mohamed,
S. Haag,
J. Peltason,
F. Dal-Ri,
Thomas Ottmann:
Disoriented Pen-Gestures for Identifying Users around the Tabletop without Cameras and Motion Sensors.
Tabletop 2006: 43-52 |
| 92 | | Tobias Lauer,
Thomas Ottmann,
Stephan Trahasch,
Jörg M. Haake,
Hans-Rüdiger Pfister,
Korinna Bauer,
Friedrich W. Hesse:
DFG-Schwerpunktprogramm "Netzbasierte Wissenskommunikation in Gruppen".
it - Information Technology 48(1): 52-59 (2006) |
| 2005 |
|---|
| 91 |  | Khaireel A. Mohamed,
Thomas Ottmann:
Overcoming Hard-To-Reach Toolboxes with On-Demand Menu Options for Cascading Electronic Whiteboards in Classrooms.
ICCE 2005: 803-806 |
| 90 | | Markus Krebs,
Tobias Lauer,
Thomas Ottmann,
Stephan Trahasch:
Student-built algorithm visualizations for assessment: flexible generation, feedback and grading.
ITiCSE 2005: 281-285 |
| 2004 |
|---|
| 89 | | Khaireel A. Mohamed,
Lioudmila Belenkaia,
Thomas Ottmann:
Post-processing inkml for random-access navigation of voluminous handwritten ink documents.
WWW (Alternate Track Papers & Posters) 2004: 266-267 |
| 88 | | Amitava Datta,
Kamala Krithivasan,
Thomas Ottmann:
An optimal algorithm for one-separation of a set of isothetic polygons.
Inf. Sci. 164(1-4): 65-88 (2004) |
| 87 | | Holger Horz,
Wolfgang Hürst,
Thomas Ottmann,
Christoph Rensing,
Stephan Trahasch:
Einführung zur Themensektion "eLectures".
i-com 4(3): 47 (2004) |
| 2003 |
|---|
| 86 | | Thomas Ottmann,
Robin Pomplun:
e-Learning im Hochschulbereich: Kritische Erfolgsfaktoren.
DFN-Arbeitstagung über Kommunikationsnetze 2003: 371-378 |
| 85 | | Thomas Ottmann,
Stephan Trahasch,
Tobias Lauer:
Systems support for virtualizing traditional courses in science and engineering.
Quality Education @ a Distance 2003: 73-82 |
| 2001 |
|---|
| 84 | | Kim S. Larsen,
Thomas Ottmann,
Eljas Soisalon-Soininen:
Relaxed balance for search trees with local rebalancing.
Acta Inf. 37(10): 743-763 (2001) |
| 83 | | Thomas Ottmann,
Rainer Müller,
G. Seitz,
Ch. Steinert:
Video in Vorlesungsaufzeichnungen mit informatikfernen Inhalten am Beispiel Archäologie.
Informatica Didactica 2: (2001) |
| 82 | | Amitava Datta,
Thomas Ottmann:
Towards a Virtual University.
J. UCS 7(10): 870-885 (2001) |
| 81 | | Tobias Lauer,
Rainer Müller,
Thomas Ottmann:
Animations for Teaching Purposes: Now and Tomorrow.
J. UCS 7(5): 420-433 (2001) |
| 80 | | Thomas Ottmann,
Sven Schuierer,
Subbiah Soundaralakshmi:
Enumerating Extreme Points in Higher Dimensions.
Nord. J. Comput. 8(2): 179-192 (2001) |
| 2000 |
|---|
| 79 | | Rainer Müller,
Thomas Ottmann:
The "Authoring on the Fly" system for automated recording and replay of (tele)presentations.
Multimedia Syst. 8(3): 158-176 (2000) |
| 1997 |
|---|
| 78 | | Amitava Datta,
Kamala Krithivasan,
Thomas Ottmann:
An Optimal Algorithm for One-Separation of a Set of Isothetic Polygons.
CIAC 1997: 110-121 |
| 77 | | Sabine Hanke,
Thomas Ottmann,
Eljas Soisalon-Soininen:
Relaxed Balanced Red-Black Trees.
CIAC 1997: 193-204 |
| 76 | | Kim S. Larsen,
Thomas Ottmann,
Eljas Soisalon-Soininen:
Relaxed Balance for Search Trees with Local Rebalancing.
ESA 1997: 350-363 |
| 75 | | Christian Bacher,
Rainer Müller,
Thomas Ottmann,
M. Will:
Authoring on the Fly.
INFOS 1997: 14-18 |
| 1996 |
|---|
| 74 | | Sabine Hanke,
Thomas Ottmann,
Sven Schuierer:
The Edge-flipping Distance of Triangulations.
J. UCS 2(8): 570-579 (1996) |
| 1995 |
|---|
| 73 | | Thomas Ottmann,
Sven Schuierer,
Subbiah Soundaralakshmi:
Enumerating Extreme Points in Higher Dimensions.
STACS 1995: 562-570 |
| 72 | | Thomas Ottmann,
Christian Bacher:
Authoring on the Fly.
J. UCS 1(10): 706-717 (1995) |
| 71 | | Arne Andersson,
Thomas Ottmann:
New Tight Bounds on Uniquely Represented Dictionaries.
SIAM J. Comput. 24(5): 1091-1101 (1995) |
| 1994 |
|---|
| 70 | | Jürgen Eckerle,
Thomas Ottmann:
An Efficient Data Structure for Bidirectional Heuristic Search.
ECAI 1994: 600-604 |
| 69 | | Anne Brüggemann-Klein,
Petra Fischer,
Thomas Ottmann:
Learning Picture Sets from Examples.
Results and Trends in Theoretical Computer Science 1994: 34-43 |
| 1993 |
|---|
| 68 | | Thomas Ottmann,
Peter Widmayer:
Algorithmen und Datenstrukturen, 2. Auflage
Bibliographisches Institut 1993 |
| 67 | | Friedrich Augenstein,
Thomas Ottmann,
Jürgen Schöning:
How to incorporate expert knowledge into an authoring system.
Computer Mediated Education of Information Technology Professionals and Advanced End-Users 1993: 117-126 |
| 66 | | Federico Malucelli,
Thomas Ottmann,
Daniele Pretolani:
Efficient Labelling Algorithms for the Maximum Noncrossing Matching Problem.
Discrete Applied Mathematics 47(2): 175-179 (1993) |
| 1992 |
|---|
| 65 | | Burkhard Monien,
Thomas Ottmann:
Data Structures and Efficient Algorithms, Final Report on the DFG Special Joint Initiative
Springer 1992 |
| 64 | | Bengt J. Nilsson,
Thomas Ottmann,
Sven Schuierer,
Christian Icking:
Restricted Orientation Computational Geometry.
Data Structures and Efficient Algorithms 1992: 148-185 |
| 63 | | Thomas Ottmann,
Derick Wood:
Updating Binary Trees with Constant Linkage Cost.
Int. J. Found. Comput. Sci. 3(4): 479-501 (1992) |
| 1991 |
|---|
| 62 | | Arne Andersson,
Thomas Ottmann:
Faster Uniquely Represented Dictionaries
FOCS 1991: 642-649 |
| 61 | | Friedrich Augenstein,
Thomas Ottmann,
Jürgen Schöning:
Ein typ- und regelgesteuertes Autorensystem.
Hypertext/Hypermedia 1991: 25-33 |
| 60 | | Thomas Ottmann:
Elektronische Kurse - Kritische Bilanz und Konsequenzen für die Werkzeuggestaltung.
INFOS 1991: 1-15 |
| 59 | | Thomas Ottmann:
Trees - A Personal View.
New Results and New Trends in Computer Science 1991: 243-255 |
| 58 | | Thomas Ottmann:
Geometric Algorithms and their Complexity.
SSD 1991: 3-4 |
| 57 | | Thomas Ottmann,
Derick Wood:
Defining families of trees with E0L grammars.
Discrete Applied Mathematics 32(2): 195-209 (1991) |
| 1990 |
|---|
| 56 | | Thomas Ottmann,
Peter Widmayer:
Algorithmen und Datenstrukturen
Bibliographisches Institut 1990 |
| 55 | | Thomas Ottmann,
Derick Wood:
How to Update a Balanced Binary Tree with a Constant Number of Rotations.
SWAT 1990: 122-131 |
| 54 | | Arne Andersson,
Christian Icking,
Rolf Klein,
Thomas Ottmann:
Binary Search Trees of Almost Optimal Height.
Acta Inf. 28(2): 165-178 (1990) |
| 1989 |
|---|
| 53 | | J. Dobrinski,
Thomas Ottmann:
How Can Educational Software Survive Current Hardware.
ICCAL 1989: 65-76 |
| 52 | | Rolf Klein,
Otto Nurmi,
Thomas Ottmann,
Derick Wood:
A Dynamic Fixed Windowing Problem.
Algorithmica 4(4): 535-550 (1989) |
| 51 | | Ralf Hartmut Güting,
Otto Nurmi,
Thomas Ottmann:
Fast Algorithms for Direct Enclosures and Direct Dominances.
J. Algorithms 10(2): 170-186 (1989) |
| 1988 |
|---|
| 50 | | B. Becker,
Thomas Ottmann:
Identitätsprüfung von Polyonzügen aus kartographischen Datenbasen.
Austrographics 1988: 105-119 |
| 1987 |
|---|
| 49 | | Thomas Ottmann:
Automata, Languages and Programming, 14th International Colloquium, ICALP87, Karlsruhe, Germany, July 13-17, 1987, Proceedings
Springer 1987 |
| 48 | | Thomas Ottmann,
Gerald Thiemt,
Christian P. Ullrich:
Numerical Stability of simple Geometric Algorithms in the plane.
Computation Theory and Logic 1987: 277-293 |
| 47 | | Thomas Ottmann,
Gerald Thiemt,
Christian P. Ullrich:
Numerical Stability of Geometric Algorithms.
Symposium on Computational Geometry 1987: 119-125 |
| 46 | | Christian Icking,
Rolf Klein,
Thomas Ottmann:
Priority Search Trees in Secondary Memory (Extended Abstract).
WG 1987: 84-93 |
| 45 | | Ralf Hartmut Güting,
Thomas Ottmann:
New algorithms for special cases of the hidden line elimination problem.
Computer Vision, Graphics, and Image Processing 40(2): 188-204 (1987) |
| 44 | | Thomas Ottmann,
Eljas Soisalon-Soininen,
Derick Wood:
Partitioning and separating sets of orthogonal polygons.
Inf. Sci. 42(1): 31-49 (1987) |
| 1986 |
|---|
| 43 | | Thomas Ottmann:
Verarbeitung und Verwaltung geometrischer Daten - Einführung in das Fachgespräch.
GI Jahrestagung (1) 1986: 437-440 |
| 42 | | Thomas Ottmann,
Peter Widmayer:
Modellversuch computergestützter Informatikunterricht: Algorithmen und Datenstrukturen.
INFOS 1986: 420-431 |
| 41 | | Rolf Klein,
Otto Nurmi,
Thomas Ottmann,
Derick Wood:
Optimal Dynamic Solutions for Fixed Windowing Problems.
Symposium on Computational Geometry 1986: 109-115 |
| 1985 |
|---|
| 40 | | Thomas Ottmann:
Computational Geometry: Selected Algorithms and Paradigms.
European Conference on Computer Algebra (1) 1985: 80-92 |
| 39 | | Ralf Hartmut Güting,
Thomas Ottmann:
New Algorithms for Special Cases of the Hidden Line Elimination Problem.
STACS 1985: 161-172 |
| 38 | | Thomas Ottmann,
Michael Schrapp,
Derick Wood:
Purely Top-Down Updating Algorithms for Stratified Search Trees.
Acta Inf. 22(1): 85-100 (1985) |
| 37 | | Thomas Ottmann,
Michael Schrapp,
Derick Wood:
Weight-balanced trees are not stratified.
Bulletin of the EATCS 25: 24-30 (1985) |
| 36 | | Thomas Ottmann,
Peter Widmayer,
Derick Wood:
A fast algorithm for the Boolean masking problem.
Computer Vision, Graphics, and Image Processing 30(3): 249-268 (1985) |
| 35 | | Philippe Flajolet,
Thomas Ottmann,
Derick Wood:
Search Trees and Bubble Memories.
ITA 19(2): 137-164 (1985) |
| 1984 |
|---|
| 34 | | Thomas Ottmann:
Geometrische Probleme beim VLSI-Design.
GI Jahrestagung (Fachgespräche) 1984: 58-68 |
| 33 | | Bernard Chazelle,
Thomas Ottmann,
Eljas Soisalon-Soininen,
Derick Wood:
The Complexity and Decidability of Separation.
ICALP 1984: 119-127 |
| 32 | | Thomas Ottmann,
Peter Widmayer:
Solving Visibility Problems by Using Skeleton Structures.
MFCS 1984: 459-470 |
| 31 | | Herbert Edelsbrunner,
Jan van Leeuwen,
Thomas Ottmann,
Derick Wood:
Computing the Connected Components of Simple Rectilinear Geometrical Objects in D-Space.
ITA 18(2): 171-183 (1984) |
| 30 | | Thomas Ottmann,
Eljas Soisalon-Soininen,
Derick Wood:
On the Definition and Computation of Rectlinear Convex Hulls.
Inf. Sci. 33: 157-171 (1984) |
| 29 | | Thomas Ottmann,
Douglas Stott Parker Jr.,
Arnold L. Rosenberg,
Hans-Werner Six,
Derick Wood:
Minimal-Cost Brother Trees.
SIAM J. Comput. 13(1): 197-217 (1984) |
| 1983 |
|---|
| 28 | | Jürgen Albert,
Thomas Ottmann:
Automaten, Sprachen und Maschinen für Anwender
Bibliographisches Institut 1983 |
| 27 | | Thomas Ottmann,
Peter Widmayer:
On translating a set of line segments.
Computer Vision, Graphics, and Image Processing 24(3): 382-389 (1983) |
| 1982 |
|---|
| 26 | | Thomas Ottmann,
Arnold L. Rosenberg,
Larry J. Stockmeyer:
A Dictionary Machine (for VLSI).
IEEE Trans. Computers 31(9): 892-897 (1982) |
| 1981 |
|---|
| 25 | | Jon Louis Bentley,
Thomas Ottmann:
The Complexity of Manipulating Hierarchically Defined Sets of Rectangles.
MFCS 1981: 1-15 |
| 24 | | Karel Culik II,
Thomas Ottmann,
Derick Wood:
Dense Multiway Trees.
ACM Trans. Database Syst. 6(3): 486-512 (1981) |
| 23 | | Jürgen Albert,
Hermann A. Maurer,
Thomas Ottmann:
On subregular OL forms.
Fundam. Inform. 4(1): 135-150 (1981) |
| 22 | | Thomas Ottmann,
Arto Salomaa,
Derick Wood:
Sub-Regular Grammar Forms.
Inf. Process. Lett. 12(4): 184-187 (1981) |
| 1980 |
|---|
| 21 | | Thomas Ottmann,
Hans-Werner Six,
Derick Wood:
The Analysis of Search Trees: A Survey.
WG 1980: 234-249 |
| 20 | | Jon Louis Bentley,
Thomas Ottmann:
The Power of a One-Dimensional Vector of Processors.
WG 1980: 80-89 |
| 19 | | Thomas Ottmann,
Wolffried Stucky:
Higher Order Analysis of Random 1-2 Brother Trees.
BIT 20(3): 302-314 (1980) |
| 18 | | Thomas Ottmann,
Derick Wood:
1-2 Brother Trees or AVL Trees Revisited.
Comput. J. 23(3): 248-255 (1980) |
| 1979 |
|---|
| 17 | | Thomas Ottmann,
Derick Wood:
A Uniform Approach to Balanced Binary and Multiway Trees.
MFCS 1979: 398-407 |
| 16 | | Thomas Ottmann,
Arnold L. Rosenberg,
Hans-Werner Six,
Derick Wood:
Node-Visit Optimal 1-2 Brother Trees.
Theoretical Computer Science 1979: 213-221 |
| 15 | | Jon Louis Bentley,
Thomas Ottmann:
Algorithms for Reporting and Counting Geometric Intersections.
IEEE Trans. Computers 28(9): 643-647 (1979) |
| 1978 |
|---|
| 14 | | H. Hule,
Hermann A. Maurer,
Thomas Ottmann:
Good OL Forms.
Acta Inf. 9: 345-353 (1978) |
| 13 | | Thomas Ottmann,
Hans-Werner Six,
Derick Wood:
Right Brother Trees.
Commun. ACM 21(9): 769-776 (1978) |
| 12 | | Karel Culik II,
Hermann A. Maurer,
Thomas Ottmann,
Keijo Ruohonen,
Arto Salomaa:
Isomorphism, Form Equivalence and Sequence Equivalence of PD0L Forms.
Theor. Comput. Sci. 6: 143-173 (1978) |
| 11 | | Karel Culik II,
Hermann A. Maurer,
Thomas Ottmann:
On Two-Symbol Complete E0L Forms.
Theor. Comput. Sci. 6: 69-92 (1978) |
| 1977 |
|---|
| 10 | | Hans-Peter Kriegel,
Thomas Ottmann:
Left-Fitting Translations.
ICALP 1977: 309-322 |
| 9 | | Hermann A. Maurer,
Thomas Ottmann:
Tree-Structures for Set Manipulation Problems.
MFCS 1977: 108-121 |
| 8 | | Hans Kleine Büning,
Thomas Ottmann:
Kleine universelle mehrdimensionale Turingmaschinen.
Elektronische Informationsverarbeitung und Kybernetik 13(4/5): 179-201 (1977) |
| 7 | | Thomas Ottmann:
Lokale Simulierbarkeit zweidimensionaler Turingmaschinen.
Elektronische Informationsverarbeitung und Kybernetik 13(9): 465-471 (1977) |
| 6 | | Hermann A. Maurer,
Thomas Ottmann,
Arto Salomaa:
On the Form Equivalence of L-Forms.
Theor. Comput. Sci. 4(2): 199-225 (1977) |
| 1976 |
|---|
| 5 | | Hermann A. Maurer,
Thomas Ottmann,
Hans-Werner Six:
Implementing Dictionaries Using Binary Trees of Very Small Height.
Inf. Process. Lett. 5(1): 11-14 (1976) |
| 1975 |
|---|
| 4 | | Thomas Ottmann:
Mit regulären Grundbegriffen definierbare Prädikate.
Computing 14(3): 213-223 (1975) |
| 3 | | Thomas Ottmann:
Eine universelle Turingmaschine mit zweidimensionalem Band, 7 Buchstaben und 2 Zuständen.
Elektronische Informationsverarbeitung und Kybernetik 11(1/2): 27-38 (1975) |
| 1974 |
|---|
| 2 | | Peter Koerber,
Thomas Ottmann:
Simulation endlicher Automaten durch Ketten aus einfachen Bausteinautomaten.
Elektronische Informationsverarbeitung und Kybernetik 10(2/3): 133-148 (1974) |
| 1973 |
|---|
| 1 | | Thomas Ottmann:
Ketten und arithmetische Prädikate von endlichen Automaten.
Automatentheorie und Formale Sprachen 1973: 74-80 |
