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