Thomas Ottmann

Proceedings of the 2013 12th International Conference on Information Technology Based Higher Education and Training, 2013

2012

Vorlesungsaufzeichnung: vom Experiment zum Routinedienst.

[BibT_eX]

[DOI]

Proceedings of the DeLFI 2012, 2012

Algorithmen und Datenstrukturen, 5. Auflage.

[BibT_eX]

[DOI]

Spektrum Akademischer Verlag, ISBN: 978-3-8274-2803-5, 2012

2011

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

[BibT_eX]

[DOI]

Christoph Hermann

IEEE Trans. Learn. Technol., 2011

Lecture Recording - vom Experiment zum Hochschulalltag.

[BibT_eX]

[DOI]

Proceedings of the DeLFI 2011: Die 9. e-Learning Fachtagung Informatik, 2011

Maintaining the Personal Style and Flair of Handwriting in Presentation Recordings.

[BibT_eX]

[DOI]

Proceedings of the Rainbow of Computer Science, 2011

2009

New Data Structures for IP Lookup and Conflict Detection.

[BibT_eX]

[DOI]

Christine Maindorfer

Proceedings of the Algorithmics of Large and Complex Networks - Design, 2009

2008

Is the Popular R*-tree Suited for Packet Classification?

[BibT_eX]

[DOI]

Christine Maindorfer

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.

[BibT_eX]

[DOI]

Christine Maindorfer

Bettina Bär

Proceedings of the 13th IEEE Symposium on Computers and Communications (ISCC 2008), 2008

Versioning Tree Structures by Path-Merging.

[BibT_eX]

[DOI]

Tobias Langner

Proceedings of the Frontiers in Algorithmics, Second Annual International Workshop, 2008

2007

Update-Efficient Data Structures for Dynamic IP Router Tables.

[BibT_eX]

[DOI]

Amitava Datta

Int. J. Found. Comput. Sci., 2007

Active-smoothing in digital ink environments.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the INFOCOM 2007. 26th IEEE International Conference on Computer Communications, 2007

2006

DFG-Schwerpunktprogramm "Netzbasierte Wissenskommunikation in Gruppen".

[BibT_eX]

[DOI]

it Inf. Technol., 2006

Disoriented Pen-Gestures for Identifying Users around the Tabletop without Cameras and Motion Sensors.

[BibT_eX]

[DOI]

Proceedings of the First IEEE International Workshop on Horizontal Interactive Human-Computer Systems (Tabletop 2006), 2006

StuVa - Werkzeugunterstützte Studienverlaufsanalyse zur Unterstützung der Studienberatung.

[BibT_eX]

[DOI]

Christoph Hermann

Proceedings of the HDI 2006, 2006

2005

Einführung zur Themensektion "eLectures".

[BibT_eX]

[DOI]

i-com, 2005

Student-built algorithm visualizations for assessment: flexible generation, feedback and grading.

[BibT_eX]

[DOI]

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.

[BibT_eX]

Proceedings of the Towards Sustainable and Scalable Educational Innovations Informed by the Learning Sciences, 2005

Vorwort.

[BibT_eX]

[DOI]

Proceedings of the Workshop Proceedings DeLFI 2005 und GMW05, 2005

2004

Der Universitäre Lehrverbund Informatik - eine Bilanz.

[BibT_eX]

[DOI]

Paul-Thomas Kandzia

Gabriele Kraus

Softwaretechnik-Trends, 2004

An optimal algorithm for one-separation of a set of isothetic polygons.

[BibT_eX]

[DOI]

Amitava Datta

Kamala Krithivasan

Inf. Sci., 2004

Post-processing inkml for random-access navigation of voluminous handwritten ink documents.

[BibT_eX]

[DOI]

Lioudmila Belenkaia

Proceedings of the 13th international conference on World Wide Web, 2004

2003

Systems support for virtualizing traditional courses in science and engineering.

[BibT_eX]

[DOI]

Stephan Trahasch

Proceedings of the Quality Education @ a Distance, 2003

e-Learning im Hochschulbereich: Kritische Erfolgsfaktoren.

[BibT_eX]

[DOI]

Robin Pomplun

Proceedings of the Security, 2003

From Lecture Recording Towards Personalized Collaborative Learning.

[BibT_eX]

[DOI]

Proceedings of the Designing for Change in Networked Learning Environments, 2003

2001

Enumerating Extreme Points in Higher Dimensions.

[BibT_eX]

[DOI]

Sven Schuierer

Subbiah Soundaralakshmi

Nord. J. Comput., 2001

Animations for Teaching Purposes: Now and Tomorrow.

[BibT_eX]

[DOI]

Rainer Müller

J. Univers. Comput. Sci., 2001

Towards a Virtual University.

[BibT_eX]

[DOI]

Amitava Datta

J. Univers. Comput. Sci., 2001

Video in Vorlesungsaufzeichnungen mit informatikfernen Inhalten am Beispiel Archäologie.

[BibT_eX]

[DOI]

Informatica Didact., 2001

Relaxed balance for search trees with local rebalancing.

[BibT_eX]

[DOI]

Kim S. Larsen

Acta Informatica, 2001

The "Authoring on the Fly" system for automatic presentation recording.

[BibT_eX]

[DOI]

Proceedings of the CHI 2001 Extended Abstracts on Human Factors in Computing Systems, 2001

2000

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

[BibT_eX]

[DOI]

Rainer Müller

Multim. Syst., 2000

Möglichkeiten und Grenzen der Virtualisierung des Informatikstudiums.

[BibT_eX]

[DOI]

Proceedings of the Informatik 2000, 2000

1997

Authoring on the Fly.

[BibT_eX]

[DOI]

Proceedings of the Informatik und Lernen in der Informationsgesellschaft, 1997

Relaxed Balanced Red-Black Trees.

[BibT_eX]

[DOI]

Sabine Hanke

Proceedings of the Algorithms and Complexity, Third Italian Conference, 1997

1996

The Edge-flipping Distance of Triangulations.

[BibT_eX]

[DOI]

Sabine Hanke

Sven Schuierer

J. Univers. Comput. Sci., 1996

Algorithmen und Datenstrukturen, 3. Auflage.

[BibT_eX]

Spektrum Lehrbuch, Spektrum, ISBN: 978-3-8274-0110-6, 1996

1995

New Tight Bounds on Uniquely Represented Dictionaries.

[BibT_eX]

[DOI]

Arne Andersson

SIAM J. Comput., 1995

Authoring on the Fly.

[BibT_eX]

[DOI]

Christian Bacher

J. Univers. Comput. Sci., 1995

1994

An Efficient Data Structure for Bidirectional Heuristic Search.

[BibT_eX]

Jürgen Eckerle

Proceedings of the Eleventh European Conference on Artificial Intelligence, 1994

Learning Picture Sets from Examples.

[BibT_eX]

[DOI]

Anne Brüggemann-Klein

Petra Fischer

Proceedings of the Results and Trends in Theoretical Computer Science, 1994

1993

Efficient Labelling Algorithms for the Maximum Noncrossing Matching Problem.

[BibT_eX]

[DOI]

Federico Malucelli

Daniele Pretolani

Discret. Appl. Math., 1993

How to incorporate expert knowledge into an authoring system.

[BibT_eX]

Friedrich Augenstein

Jürgen Schöning

Proceedings of the Computer Mediated Education of Information Technology Professionals and Advanced End-Users, 1993

Algorithmen und Datenstrukturen, 2. Auflage

[BibT_eX]

Reihe Informatik 70, Bibliographisches Institut, ISBN: 3-411-16602-9, 1993

1992

Updating Binary Trees with Constant Linkage Cost.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 1992

Restricted Orientation Computational Geometry.

[BibT_eX]

[DOI]

Proceedings of the Data Structures and Efficient Algorithms, 1992

1991

Defining families of trees with E0L grammars.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1991

Geometric Algorithms and their Complexity.

[BibT_eX]

[DOI]

Proceedings of the Advances in Spatial Databases, 1991

Elektronische Kurse - Kritische Bilanz und Konsequenzen für die Werkzeuggestaltung.

[BibT_eX]

[DOI]

Proceedings of the Informatik und Schule 1991, 1991

Ein typ- und regelgesteuertes Autorensystem.

[BibT_eX]

[DOI]

Friedrich Augenstein

Jürgen Schöning

Proceedings of the Hypertext/Hypermedia, 1991

Faster Uniquely Represented Dictionaries

[BibT_eX]

[DOI]

Arne Andersson

Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991

Trees - A Personal View.

[BibT_eX]

[DOI]

Proceedings of the New Results and New Trends in Computer Science, 1991

1990

Binary Search Trees of Almost Optimal Height.

[BibT_eX]

[DOI]

Acta Informatica, 1990

How to Update a Balanced Binary Tree with a Constant Number of Rotations.

[BibT_eX]

[DOI]

Proceedings of the SWAT 90, 1990

Algorithmen und Datenstrukturen

[BibT_eX]

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

1989

Fast Algorithms for Direct Enclosures and Direct Dominances.

[BibT_eX]

[DOI]

Ralf Hartmut Güting

Otto Nurmi

J. Algorithms, 1989

A Dynamic Fixed Windowing Problem.

[BibT_eX]

[DOI]

Algorithmica, 1989

How Can Educational Software Survive Current Hardware.

[BibT_eX]

[DOI]

J. Dobrinski

Proceedings of the Computer Assisted Learning, 2nd International Conference, 1989

1988

Identitätsprüfung von Polyonzügen aus kartographischen Datenbasen.

[BibT_eX]

[DOI]

B. Becker

Proceedings of the Austrographics '88, 1988

1987

Partitioning and separating sets of orthogonal polygons.

[BibT_eX]

[DOI]

Inf. Sci., 1987

New algorithms for special cases of the hidden line elimination problem.

[BibT_eX]

[DOI]

Ralf Hartmut Güting

Comput. Vis. Graph. Image Process., 1987

Priority Search Trees in Secondary Memory (Extended Abstract).

[BibT_eX]

[DOI]

Christian Icking

Rolf Klein

Proceedings of the Graph-Theoretic Concepts in Computer Science, International Workshop, 1987

Numerical Stability of Geometric Algorithms.

[BibT_eX]

[DOI]

Gerald Thiemt

Christian P. Ullrich

Proceedings of the Third Annual Symposium on Computational Geometry, 1987

Numerical Stability of simple Geometric Algorithms in the plane.

[BibT_eX]

[DOI]

Gerald Thiemt

Christian P. Ullrich

Proceedings of the Computation Theory and Logic, In Memory of Dieter Rödding, 1987

1986

Space-economical plane-sweep algorithms.

[BibT_eX]

[DOI]

Comput. Vis. Graph. Image Process., 1986

Modellversuch computergestützter Informatikunterricht: Algorithmen und Datenstrukturen.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the GI - 16. Jahrestagung I, Berlin, 6.-10. Oktober 1986, Proceedings, 1986

Optimal Dynamic Solutions for Fixed Windowing Problems.

[BibT_eX]

[DOI]

Proceedings of the Second Annual ACM SIGACT/SIGGRAPH Symposium on Computational Geometry, 1986

1985

Search Trees and Bubble Memories.

[BibT_eX]

[DOI]

Philippe Flajolet

RAIRO Theor. Informatics Appl., 1985

Weight-balanced trees are not stratified.

[BibT_eX]

Michael Schrapp

Bull. EATCS, 1985

A fast algorithm for the Boolean masking problem.

[BibT_eX]

[DOI]

Comput. Vis. Graph. Image Process., 1985

Purely Top-Down Updating Algorithms for Stratified Search Trees.

[BibT_eX]

[DOI]

Michael Schrapp

Acta Informatica, 1985

Computational Geometry: Selected Algorithms and Paradigms.

[BibT_eX]

[DOI]

Proceedings of the EUROCAL '85, 1985

The direct dominance problem.

[BibT_eX]

[DOI]

Ralf Hartmut Güting

Otto Nurmi

Proceedings of the First Annual Symposium on Computational Geometry, 1985

1984

Minimal-Cost Brother Trees.

[BibT_eX]

[DOI]

Douglas Stott Parker Jr.

Arnold L. Rosenberg

SIAM J. Comput., 1984

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

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1984

On the Definition and Computation of Rectlinear Convex Hulls.

[BibT_eX]

[DOI]

Inf. Sci., 1984

Binary search trees with binary comparison cost.

[BibT_eX]

[DOI]

Int. J. Parallel Program., 1984

Solving Visibility Problems by Using Skeleton Structures.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1984, 1984

The Complexity and Decidability of Separation.

[BibT_eX]

[DOI]

Bernard Chazelle

Proceedings of the Automata, 1984

Geometrische Probleme beim VLSI-Design.

[BibT_eX]

[DOI]

Proceedings of the Fachgespräche auf der 14. GI-Jahrestagung, 1984

1983

On translating a set of line segments.

[BibT_eX]

[DOI]

Comput. Vis. Graph. Image Process., 1983

Automaten, Sprachen und Maschinen für Anwender

[BibT_eX]

Jürgen Albert

Reihe Informatik 38, Bibliographisches Institut, ISBN: 3-411-01651-5, 1983

1982

A Dictionary Machine (for VLSI).

[BibT_eX]

[DOI]

Arnold L. Rosenberg

Larry J. Stockmeyer

IEEE Trans. Computers, 1982

A comparison of iterative and defined classes of search trees.

[BibT_eX]

[DOI]

Int. J. Parallel Program., 1982

1981

Dense Multiway Trees.

[BibT_eX]

[DOI]

Karel Culík II

ACM Trans. Database Syst., 1981

Sub-Regular Grammar Forms.

[BibT_eX]

[DOI]

Arto Salomaa

Inf. Process. Lett., 1981

On subregular OL forms.

[BibT_eX]

Jürgen Albert

Fundam. Informaticae, 1981

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

[BibT_eX]

[DOI]

Computing, 1981

1-Pass Top-Down Update Schemes for Balanced Search Trees.

[BibT_eX]

Michael Schrapp

Proceedings of the 7th Conference Graphtheoretic Concepts in Computer Science (WG '81), 1981

A Realistic Cost Measure for Binary Search Trees.

[BibT_eX]

Proceedings of the 7th Conference Graphtheoretic Concepts in Computer Science (WG '81), 1981

The Complexity of Manipulating Hierarchically Defined Sets of Rectangles.

[BibT_eX]

[DOI]

Jon Louis Bentley

Proceedings of the Mathematical Foundations of Computer Science 1981, Strbske Pleso, Czechoslovakia, August 31, 1981

1980

1-2 Brother Trees or AVL Trees Revisited.

[BibT_eX]

[DOI]

Comput. J., 1980

Higher Order Analysis of Random 1-2 Brother Trees.

[BibT_eX]

[DOI]

Wolffried Stucky

BIT, 1980

The Analysis of Search Trees: A Survey.

[BibT_eX]

[DOI]

Proceedings of the Graphtheoretic Concepts in Computer Science, 1980

The Power of a One-Dimensional Vector of Processors.

[BibT_eX]

[DOI]

Jon Louis Bentley

Proceedings of the Graphtheoretic Concepts in Computer Science, 1980

1979

Algorithms for Reporting and Counting Geometric Intersections.

[BibT_eX]

[DOI]

Jon Louis Bentley

IEEE Trans. Computers, 1979

One-sided k-height-balanced trees.

[BibT_eX]

[DOI]

Computing, 1979

On the correspondence between AVL trees and brother trees.

[BibT_eX]

[DOI]

Computing, 1979

Node-Visit Optimal 1-2 Brother Trees.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Computer Science, 1979

A Uniform Approach to Balanced Binary and Multiway Trees.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1979, 1979

1978

Isomorphism, Form Equivalence and Sequence Equivalence of PD0L Forms.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1978

On Two-Symbol Complete E0L Forms.

[BibT_eX]

[DOI]

Karel Culík II

Theor. Comput. Sci., 1978

Eine Einfache Universelle Menge Endlicher Automaten.

[BibT_eX]

[DOI]

Math. Log. Q., 1978

Right Brother Trees.

[BibT_eX]

[DOI]

Commun. ACM, 1978

Good OL Forms.

[BibT_eX]

[DOI]

H. Hule

Acta Informatica, 1978

1977

On the Form Equivalence of <i>L</i>-Forms.

[BibT_eX]

[DOI]

Arto Salomaa

Theor. Comput. Sci., 1977

Lokale Simulierbarkeit zweidimensionaler Turingmaschinen.

[BibT_eX]

J. Inf. Process. Cybern., 1977

Kleine universelle mehrdimensionale Turingmaschinen.

[BibT_eX]

Hans Kleine Büning

J. Inf. Process. Cybern., 1977

Tree-Structures for Set Manipulation Problems.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1977, 1977

Left-Fitting Translations.

[BibT_eX]

[DOI]

Hans-Peter Kriegel

Proceedings of the Automata, 1977

1976

Implementing Dictionaries Using Binary Trees of Very Small Height.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1976

1975

Eine universelle Turingmaschine mit zweidimensionalem Band, 7 Buchstaben und 2 Zuständen.

[BibT_eX]

J. Inf. Process. Cybern., 1975

Mit regulären Grundbegriffen definierbare Prädikate.

[BibT_eX]

[DOI]

Computing, 1975

1974

Simulation endlicher Automaten durch Ketten aus einfachen Bausteinautomaten.

[BibT_eX]

Peter Koerber

J. Inf. Process. Cybern., 1974

1973

Ketten und arithmetische Prädikate von endlichen Automaten.

[BibT_eX]

[DOI]

Proceedings of the 1. Fachtagung über Automatentheorie und Formale Sprachen, 1973

1971

Eine Theorie sequentieller Netzwerke.

[BibT_eX]