Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThomas Ottmann
Person information
- affiliation: University of Freiburg, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2010 – 2019
- 2013
[j58]Paul-Thomas Kandzia, Serge Linckels, Thomas Ottmann, Stephan Trahasch:
Lecture Recording - a Success Story. it Inf. Technol. 55(3): 115-122 (2013)- [c60]Thomas Ottmann:
MOOCs and/or eLectures - A means of virtualizing university education? ITHET 2013: 1-6 - 2012
- [b6]Thomas Ottmann, Peter Widmayer:
Algorithmen und Datenstrukturen, 5. Auflage. Spektrum Akademischer Verlag 2012, ISBN 978-3-8274-2803-5, pp. I-XXII, 1-774 - [c59]Thomas Ottmann:
Vorlesungsaufzeichnung: vom Experiment zum Routinedienst. DeLFI 2012: 14 - 2011
- [j57]Christoph Hermann, Thomas Ottmann:
Electures-Wiki - Toward Engaging Students to Actively Work with Lecture Recordings. IEEE Trans. Learn. Technol. 4(4): 315-326 (2011) - [c58]Khaireel A. Mohamed, Thomas Ottmann:
Maintaining the Personal Style and Flair of Handwriting in Presentation Recordings. Rainbow of Computer Science 2011: 228-244 - [c57]Paul-Thomas Kandzia, Serge Linckels, Thomas Ottmann, Stephan Trahasch:
Lecture Recording - vom Experiment zum Hochschulalltag. DeLFI Workshops 2011
2000 – 2009
- 2009
- [c56]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
- [c55]Khaireel A. Mohamed, Tobias Langner, Thomas Ottmann:
Versioning Tree Structures by Path-Merging. FAW 2008: 101-112 - [c54]Christine Maindorfer, Bettina Bär, Thomas Ottmann:
Relaxed min-augmented range trees for the representation of dynamic IP router tables. ISCC 2008: 920-927 - [c53]Christine Maindorfer, Thomas Ottmann:
Is the Popular R*-tree Suited for Packet Classification? NCA 2008: 168-176 - 2007
- [j56]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) - [j55]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) - [c52]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 - [c51]Khaireel A. Mohamed, Thomas Ottmann:
Active-smoothing in digital ink environments. ACM Multimedia EMME Workshop 2007: 119-120 - 2006
- [j54]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 Inf. Technol. 48(1): 52-59 (2006) - [c50]Christoph Hermann, Thomas Ottmann:
StuVa - Werkzeugunterstützte Studienverlaufsanalyse zur Unterstützung der Studienberatung. HDI 2006: 127-135 - [c49]Khaireel A. Mohamed, S. Haag, Julia Peltason, Frank Dal-Ri, Thomas Ottmann:
Disoriented Pen-Gestures for Identifying Users around the Tabletop without Cameras and Motion Sensors. Tabletop 2006: 43-52 - 2005
- [j53]Holger Horz, Wolfgang Hürst, Thomas Ottmann, Christoph Rensing, Stephan Trahasch:
Einführung zur Themensektion "eLectures". i-com 4(3): 47 (2005) - [c48]Holger Horz, Wolfgang Hürst, Thomas Ottmann, Christoph Rensing, Stephan Trahasch:
Vorwort. DeLFI Workshops 2005: 9-10 - [c47]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 - [c46]Markus Krebs, Tobias Lauer, Thomas Ottmann, Stephan Trahasch:
Student-built algorithm visualizations for assessment: flexible generation, feedback and grading. ITiCSE 2005: 281-285 - 2004
- [j52]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) - [j51]Paul-Thomas Kandzia, Gabriele Kraus, Thomas Ottmann:
Der Universitäre Lehrverbund Informatik - eine Bilanz. Softwaretechnik-Trends 24(1) (2004) - [c45]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 - 2003
- [c44]T. Fiehn, Tobias Lauer, Jochen Lienhard, Thomas Ottmann, Stephan Trahasch, Bernd Zupancic:
From Lecture Recording Towards Personalized Collaborative Learning. CSCL 2003: 471-475 - [c43]Thomas Ottmann, Robin Pomplun:
e-Learning im Hochschulbereich: Kritische Erfolgsfaktoren. DFN-Arbeitstagung über Kommunikationsnetze 2003: 371-378 - [c42]Thomas Ottmann, Stephan Trahasch, Tobias Lauer:
Systems support for virtualizing traditional courses in science and engineering. Quality Education @ a Distance 2003: 73-82 - 2001
- [j50]Kim S. Larsen, Thomas Ottmann, Eljas Soisalon-Soininen:
Relaxed balance for search trees with local rebalancing. Acta Informatica 37(10): 743-763 (2001) - [j49]Thomas Ottmann, Rainer Müller, G. Seitz, Ch. Steinert:
Video in Vorlesungsaufzeichnungen mit informatikfernen Inhalten am Beispiel Archäologie. Informatica Didact. 2 (2001) - [j48]Tobias Lauer, Rainer Müller, Thomas Ottmann:
Animations for Teaching Purposes: Now and Tomorrow. J. Univers. Comput. Sci. 7(5): 420-433 (2001) - [j47]Amitava Datta, Thomas Ottmann:
Towards a Virtual University. J. Univers. Comput. Sci. 7(10): 870-885 (2001) - [j46]Thomas Ottmann, Sven Schuierer, Subbiah Soundaralakshmi:
Enumerating Extreme Points in Higher Dimensions. Nord. J. Comput. 8(2): 179-192 (2001) - [c41]Wolfgang Hürst, Gabriela Maass, Rainer Müller, Thomas Ottmann:
The "Authoring on the Fly" system for automatic presentation recording. CHI Extended Abstracts 2001: 5-6 - 2000
- [j45]Rainer Müller, Thomas Ottmann:
The "Authoring on the Fly" system for automated recording and replay of (tele)presentations. Multim. Syst. 8(3): 158-176 (2000) - [c40]Thomas Ottmann:
Möglichkeiten und Grenzen der Virtualisierung des Informatikstudiums. GI Jahrestagung 2000: 3-11
1990 – 1999
- 1997
- [c39]Amitava Datta, Kamala Krithivasan, Thomas Ottmann:
An Optimal Algorithm for One-Separation of a Set of Isothetic Polygons. CIAC 1997: 110-121 - [c38]Sabine Hanke, Thomas Ottmann, Eljas Soisalon-Soininen:
Relaxed Balanced Red-Black Trees. CIAC 1997: 193-204 - [c37]Kim S. Larsen, Thomas Ottmann, Eljas Soisalon-Soininen:
Relaxed Balance for Search Trees with Local Rebalancing. ESA 1997: 350-363 - [c36]Christian Bacher, Rainer Müller, Thomas Ottmann, M. Will:
Authoring on the Fly. INFOS 1997: 14-18 - 1996
- [b5]Thomas Ottmann, Peter Widmayer:
Algorithmen und Datenstrukturen, 3. Auflage. Spektrum Lehrbuch, Spektrum 1996, ISBN 978-3-8274-0110-6, pp. I-XVII, 1-696 - [j44]Sabine Hanke, Thomas Ottmann, Sven Schuierer:
The Edge-flipping Distance of Triangulations. J. Univers. Comput. Sci. 2(8): 570-579 (1996) - 1995
- [j43]Thomas Ottmann, Christian Bacher:
Authoring on the Fly. J. Univers. Comput. Sci. 1(10): 706-717 (1995) - [j42]Arne Andersson, Thomas Ottmann:
New Tight Bounds on Uniquely Represented Dictionaries. SIAM J. Comput. 24(5): 1091-1101 (1995) - [c35]Thomas Ottmann, Sven Schuierer, Subbiah Soundaralakshmi:
Enumerating Extreme Points in Higher Dimensions. STACS 1995: 562-570 - 1994
- [c34]Anne Brüggemann-Klein, Petra Fischer, Thomas Ottmann:
Learning Picture Sets from Examples. Results and Trends in Theoretical Computer Science 1994: 34-43 - [c33]Jürgen Eckerle, Thomas Ottmann:
An Efficient Data Structure for Bidirectional Heuristic Search. ECAI 1994: 600-604 - 1993
- [b4]Thomas Ottmann, Peter Widmayer:
Algorithmen und Datenstrukturen, 2. Auflage. Reihe Informatik 70, Bibliographisches Institut 1993, ISBN 3-411-16602-9 - [j41]Federico Malucelli, Thomas Ottmann, Daniele Pretolani:
Efficient Labelling Algorithms for the Maximum Noncrossing Matching Problem. Discret. Appl. Math. 47(2): 175-179 (1993) - [c32]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 - 1992
- [j40]Thomas Ottmann, Derick Wood:
Updating Binary Trees with Constant Linkage Cost. Int. J. Found. Comput. Sci. 3(4): 479-501 (1992) - [c31]Bengt J. Nilsson, Thomas Ottmann, Sven Schuierer, Christian Icking:
Restricted Orientation Computational Geometry. Data Structures and Efficient Algorithms 1992: 148-185 - [e2]Burkhard Monien, Thomas Ottmann:
Data Structures and Efficient Algorithms, Final Report on the DFG Special Joint Initiative. Lecture Notes in Computer Science 594, Springer 1992, ISBN 3-540-55488-2 [contents] - 1991
- [j39]Thomas Ottmann, Derick Wood:
Defining families of trees with E0L grammars. Discret. Appl. Math. 32(2): 195-209 (1991) - [c30]Thomas Ottmann:
Trees - A Personal View. New Results and New Trends in Computer Science 1991: 243-255 - [c29]Arne Andersson, Thomas Ottmann:
Faster Uniquely Represented Dictionaries. FOCS 1991: 642-649 - [c28]Friedrich Augenstein, Thomas Ottmann, Jürgen Schöning:
Ein typ- und regelgesteuertes Autorensystem. Hypertext/Hypermedia 1991: 25-33 - [c27]Thomas Ottmann:
Elektronische Kurse - Kritische Bilanz und Konsequenzen für die Werkzeuggestaltung. INFOS 1991: 1-15 - [c26]Thomas Ottmann:
Geometric Algorithms and their Complexity. SSD 1991: 3-4 - 1990
- [b3]Thomas Ottmann, Peter Widmayer:
Algorithmen und Datenstrukturen. Reihe Informatik 70, Bibliographisches Institut 1990, ISBN 3-411-03161-1 - [j38]Arne Andersson, Christian Icking, Rolf Klein, Thomas Ottmann:
Binary Search Trees of Almost Optimal Height. Acta Informatica 28(2): 165-178 (1990) - [c25]Thomas Ottmann, Derick Wood:
How to Update a Balanced Binary Tree with a Constant Number of Rotations. SWAT 1990: 122-131
1980 – 1989
- 1989
- [j37]Rolf Klein, Otto Nurmi, Thomas Ottmann, Derick Wood:
A Dynamic Fixed Windowing Problem. Algorithmica 4(4): 535-550 (1989) - [j36]Ralf Hartmut Güting, Otto Nurmi, Thomas Ottmann:
Fast Algorithms for Direct Enclosures and Direct Dominances. J. Algorithms 10(2): 170-186 (1989) - [c24]J. Dobrinski, Thomas Ottmann:
How Can Educational Software Survive Current Hardware. ICCAL 1989: 65-76 - 1988
- [c23]B. Becker, Thomas Ottmann:
Identitätsprüfung von Polyonzügen aus kartographischen Datenbasen. Austrographics 1988: 105-119 - 1987
- [j35]Ralf Hartmut Güting, Thomas Ottmann:
New algorithms for special cases of the hidden line elimination problem. Comput. Vis. Graph. Image Process. 40(2): 188-204 (1987) - [j34]Thomas Ottmann, Eljas Soisalon-Soininen, Derick Wood:
Partitioning and separating sets of orthogonal polygons. Inf. Sci. 42(1): 31-49 (1987) - [c22]Thomas Ottmann, Gerald Thiemt, Christian P. Ullrich:
Numerical Stability of simple Geometric Algorithms in the plane. Computation Theory and Logic 1987: 277-293 - [c21]Thomas Ottmann, Gerald Thiemt, Christian P. Ullrich:
Numerical Stability of Geometric Algorithms. SCG 1987: 119-125 - [c20]Christian Icking, Rolf Klein, Thomas Ottmann:
Priority Search Trees in Secondary Memory (Extended Abstract). WG 1987: 84-93 - [e1]Thomas Ottmann:
Automata, Languages and Programming, 14th International Colloquium, ICALP87, Karlsruhe, Germany, July 13-17, 1987, Proceedings. Lecture Notes in Computer Science 267, Springer 1987, ISBN 3-540-18088-5 [contents] - 1986
- [j33]Thomas Ottmann, Derick Wood:
Space-economical plane-sweep algorithms. Comput. Vis. Graph. Image Process. 34(1): 35-51 (1986) - [c19]Rolf Klein, Otto Nurmi, Thomas Ottmann, Derick Wood:
Optimal Dynamic Solutions for Fixed Windowing Problems. SCG 1986: 109-115 - [c18]Thomas Ottmann:
Verarbeitung und Verwaltung geometrischer Daten - Einführung in das Fachgespräch. GI Jahrestagung (1) 1986: 437-440 - [c17]Thomas Ottmann, Peter Widmayer:
Modellversuch computergestützter Informatikunterricht: Algorithmen und Datenstrukturen. INFOS 1986: 420-431 - 1985
- [j32]Thomas Ottmann, Michael Schrapp, Derick Wood:
Purely Top-Down Updating Algorithms for Stratified Search Trees. Acta Informatica 22(1): 85-100 (1985) - [j31]Thomas Ottmann, Peter Widmayer, Derick Wood:
A fast algorithm for the Boolean masking problem. Comput. Vis. Graph. Image Process. 30(3): 249-268 (1985) - [j30]Thomas Ottmann, Michael Schrapp, Derick Wood:
Weight-balanced trees are not stratified. Bull. EATCS 25: 24-30 (1985) - [j29]Philippe Flajolet, Thomas Ottmann, Derick Wood:
Search Trees and Bubble Memories. RAIRO Theor. Informatics Appl. 19(2): 137-164 (1985) - [c16]Ralf Hartmut Güting, Otto Nurmi, Thomas Ottmann:
The direct dominance problem. SCG 1985: 81-88 - [c15]Thomas Ottmann:
Computational Geometry: Selected Algorithms and Paradigms. European Conference on Computer Algebra (1) 1985: 80-92 - [c14]Ralf Hartmut Güting, Thomas Ottmann:
New Algorithms for Special Cases of the Hidden Line Elimination Problem. STACS 1985: 161-172 - 1984
- [j28]Thomas Ottmann, Arnold L. Rosenberg, Hans-Werner Six, Derick Wood:
Binary search trees with binary comparison cost. Int. J. Parallel Program. 13(2): 77-101 (1984) - [j27]Thomas Ottmann, Eljas Soisalon-Soininen, Derick Wood:
On the Definition and Computation of Rectlinear Convex Hulls. Inf. Sci. 33: 157-171 (1984) - [j26]Herbert Edelsbrunner, Jan van Leeuwen, Thomas Ottmann, Derick Wood:
Computing the Connected Components of Simple Rectilinear Geometrical Objects in D-Space. RAIRO Theor. Informatics Appl. 18(2): 171-183 (1984) - [j25]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) - [c13]Thomas Ottmann:
Geometrische Probleme beim VLSI-Design. GI Jahrestagung (Fachgespräche) 1984: 58-68 - [c12]Bernard Chazelle, Thomas Ottmann, Eljas Soisalon-Soininen, Derick Wood:
The Complexity and Decidability of Separation. ICALP 1984: 119-127 - [c11]Thomas Ottmann, Peter Widmayer:
Solving Visibility Problems by Using Skeleton Structures. MFCS 1984: 459-470 - 1983
- [b2]Jürgen Albert, Thomas Ottmann:
Automaten, Sprachen und Maschinen für Anwender. Reihe Informatik 38, Bibliographisches Institut 1983, ISBN 3-411-01651-5 - [j24]Thomas Ottmann, Peter Widmayer:
On translating a set of line segments. Comput. Vis. Graph. Image Process. 24(3): 382-389 (1983) - 1982
- [j23]Thomas Ottmann, Derick Wood:
A comparison of iterative and defined classes of search trees. Int. J. Parallel Program. 11(3): 155-178 (1982) - [j22]Thomas Ottmann, Arnold L. Rosenberg, Larry J. Stockmeyer:
A Dictionary Machine (for VLSI). IEEE Trans. Computers 31(9): 892-897 (1982) - 1981
- [j21]Thomas Ottmann, Hans-Werner Six, Derick Wood:
The implementation of insertion and deletion algorithms for 1-2 brother trees. Computing 26(4): 367-378 (1981) - [j20]Jürgen Albert, Hermann A. Maurer, Thomas Ottmann:
On subregular OL forms. Fundam. Informaticae 4(1): 135-150 (1981) - [j19]Thomas Ottmann, Arto Salomaa, Derick Wood:
Sub-Regular Grammar Forms. Inf. Process. Lett. 12(4): 184-187 (1981) - [j18]Karel Culík II, Thomas Ottmann, Derick Wood:
Dense Multiway Trees. ACM Trans. Database Syst. 6(3): 486-512 (1981) - [c10]Jon Louis Bentley, Thomas Ottmann:
The Complexity of Manipulating Hierarchically Defined Sets of Rectangles. MFCS 1981: 1-15 - [c9]Thomas Ottmann, Arnold L. Rosenberg, Hans-Werner Six, Derick Wood:
A Realistic Cost Measure for Binary Search Trees. WG 1981: 163-172 - [c8]Thomas Ottmann, Michael Schrapp:
1-Pass Top-Down Update Schemes for Balanced Search Trees. WG 1981: 279-292 - 1980
- [j17]Thomas Ottmann, Wolffried Stucky:
Higher Order Analysis of Random 1-2 Brother Trees. BIT 20(3): 302-314 (1980) - [j16]Thomas Ottmann, Derick Wood:
1-2 Brother Trees or AVL Trees Revisited. Comput. J. 23(3): 248-255 (1980) - [c7]Jon Louis Bentley, Thomas Ottmann:
The Power of a One-Dimensional Vector of Processors. WG 1980: 80-89 - [c6]Thomas Ottmann, Hans-Werner Six, Derick Wood:
The Analysis of Search Trees: A Survey. WG 1980: 234-249
1970 – 1979
- 1979
- [j15]Thomas Ottmann, Hans-Werner Six, Derick Wood:
One-sided k-height-balanced trees. Computing 22(4): 283-290 (1979) - [j14]Thomas Ottmann, Hans-Werner Six, Derick Wood:
On the correspondence between AVL trees and brother trees. Computing 23(1): 43-54 (1979) - [j13]Jon Louis Bentley, Thomas Ottmann:
Algorithms for Reporting and Counting Geometric Intersections. IEEE Trans. Computers 28(9): 643-647 (1979) - [c5]Thomas Ottmann, Derick Wood:
A Uniform Approach to Balanced Binary and Multiway Trees. MFCS 1979: 398-407 - [c4]Thomas Ottmann, Arnold L. Rosenberg, Hans-Werner Six, Derick Wood:
Node-Visit Optimal 1-2 Brother Trees. Theoretical Computer Science 1979: 213-221 - 1978
- [j12]H. Hule, Hermann A. Maurer, Thomas Ottmann:
Good OL Forms. Acta Informatica 9: 345-353 (1978) - [j11]Thomas Ottmann, Hans-Werner Six, Derick Wood:
Right Brother Trees. Commun. ACM 21(9): 769-776 (1978) - [j10]Thomas Ottmann:
Eine Einfache Universelle Menge Endlicher Automaten. Math. Log. Q. 24(1-6): 55-61 (1978) - [j9]Karel Culík II, Hermann A. Maurer, Thomas Ottmann:
On Two-Symbol Complete E0L Forms. Theor. Comput. Sci. 6: 69-92 (1978) - [j8]Karel Culík 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) - 1977
- [j7]Hans Kleine Büning, Thomas Ottmann:
Kleine universelle mehrdimensionale Turingmaschinen. J. Inf. Process. Cybern. 13(4/5): 179-201 (1977) - [j6]Thomas Ottmann:
Lokale Simulierbarkeit zweidimensionaler Turingmaschinen. J. Inf. Process. Cybern. 13(9): 465-471 (1977) - [j5]Hermann A. Maurer, Thomas Ottmann, Arto Salomaa:
On the Form Equivalence of L-Forms. Theor. Comput. Sci. 4(2): 199-225 (1977) - [c3]Hans-Peter Kriegel, Thomas Ottmann:
Left-Fitting Translations. ICALP 1977: 309-322 - [c2]Hermann A. Maurer, Thomas Ottmann:
Tree-Structures for Set Manipulation Problems. MFCS 1977: 108-121 - 1976
- [j4]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
- [j3]Thomas Ottmann:
Mit regulären Grundbegriffen definierbare Prädikate. Computing 14(3): 213-223 (1975) - [j2]Thomas Ottmann:
Eine universelle Turingmaschine mit zweidimensionalem Band, 7 Buchstaben und 2 Zuständen. J. Inf. Process. Cybern. 11(1/2): 27-38 (1975) - 1974
- [j1]