Skip to main content

12 Result(s)

within H. -W. Six Remove this filter

and

  1. Chapter

    Modeling Hypermedia Applications with HyDev

    This paper introduces the HyDev approach to a structured and systematic development of hypermedia applications. HyDev focuses on the early phases of the development process, i.e. analysis and design. The requirem...

    P. Pauen, J. Voss, H.-W. Six in Designing Effective and Usable Multimedia Systems (1998)

    Download PDF (2122 KB)

  2. Chapter

    The integration of a layout constraint language with an object-oriented user interface management system

    In this paper we present the COMPASS constraint language which integrates high-level layout specifications with the DiwA user interface management system. The general concept of the COMPASS system is the autom...

    K. Korfmacher, H.-W. Six, J. Voss in Engineering for Human-Computer Interaction (1996)

    Download PDF (1634 KB)

  3. No Access

    Chapter and Conference Paper

    User interface development: Problems and experiences

    In this paper, we present a software engineer's view of user-interface development. First, we illustrate the main problem areas responsible for difficulties in building high-quality user-interfaces. Among them...

    H. -W. Six, J. Voss in New Results and New Trends in Computer Science (1991)

  4. No Access

    Chapter and Conference Paper

    Anbindung einer räumlich clusternden Zugriffsstruktur für geometrische Attribute an ein Standard-Datenbanksystem am Beispiel von Oracle

    Erweiterungen relationaler Datenbanksysteme um geometrische Frontends haben sich bisher gegenüber spezialisierten Geodatenbanksystemen meist als ineffizient erwiesen. In dieser Arbeit zeigen wir, daß eine gute...

    A. Henrich, A. Hilbert, H.-W. Six… in Datenbanksysteme in Büro, Technik und Wiss… (1991)

  5. No Access

    Chapter and Conference Paper

    DIWA — Ein hierarchisches Entwicklungsmodell für Benutzerdialoge

    In dieser Arbeit wird DIWA als ein hierarchisches Modell zur Strukturierung von Benutzerdialogen vorgestellt. Die mit DIWA assoziierte Beschreibungssprache erlaubt die Modellierung der dynamischen Aspekte weit...

    H.-W. Six, J. Voss in GI — 18. Jahrestagung (1988)

  6. No Access

    Article

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

    We derive an implementation in PASCAL of the insertion and deletion algorithms for 1–2 brother trees. The implementation is of interest not only in its own right but also in that it has given rise to an improv...

    Th. Ottmann, H. -W. Six, D. Wood in Computing (1981)

  7. No Access

    Chapter and Conference Paper

    A framework for data structures

    In this paper we outline a framework for data structures in the spirit of the Vienna Definition Language but extended to the most general class of objects, namely arbitrary directed rooted graphs in which the ...

    H. -W. Six in Graphtheoretic Concepts in Computer Science (1981)

  8. No Access

    Chapter and Conference Paper

    The analysis of search trees: A survey

    The combinatorial analysis of the behaviour of various classes of data structures is increasingly becoming amenable to investigation as new techniques are developed. In this paper we survey the results availab...

    Th. Ottmann, H. -W. Six, D. Wood in Graphtheoretic Concepts in Computer Science (1981)

  9. No Access

    Article

    The rectangle intersection problem revisited

    We take another look at the problem of intersecting rectangles with parallel sides. For this we derive a one-pass, time optimal algorithm which is easy to program, generalizes tod dimensions well, and illustrates...

    H. -W. Six, D. Wood in BIT Numerical Mathematics (1980)

  10. No Access

    Article

    One-sided k-height-balanced trees

    The purpose of this paper is to generalize the recent results on one-sided height-balanced trees (OSHB trees) to the case of one-sidedk-height-balanced trees, fork≥2. Surprisingly, this generalization leads to 0 ...

    Th. Ottmann, H. W. Six, D. Wood in Computing (1979)

  11. No Access

    Article

    On the correspondence between AVL trees and brother trees

    We discuss the relationships of the classes of height-balanced (search) trees and the classes of brother (search) trees. In particular we characterize each class of height-balanced trees in terms of the class ...

    Th Ottmann, H. -W. Six, D. Wood in Computing (1979)

  12. No Access

    Chapter and Conference Paper

    Node-visit optimal 1 – 2 brother trees

    We characterize node-visit optimal 1–2 brother trees and present a linear time algorithm to construct them.

    Th. Ottmann, A. L. Rosenberg, H. W. Six… in Theoretical Computer Science 4th GI Confer… (1979)