Browsing by Author "Vollmerhaus, W."

Now showing 1 - 4 of 4
  • Thumbnail Image
    ItemOpen Access
    JADE status report: a local computing network for research in distributed programming environments
    (1986-01-01) Unger, Brian W; Birtwistle, G.; Cleary, J.; Hill, D.; Keenan, T.; Rokne, J.; Kendall, J.; Vollmerhaus, W.; Witten, I.; Wyvill, B.
    No abstract
  • No Thumbnail Available
    ItemMetadata only
    ON COMPUTING A COMPLETE LIST OF IRREDUCIBLE NON-EMBEDDABLE GRAPHSFOR THE PROJECTIVE PLANE
    (1980-12-01) Vollmerhaus, W.; Thompson, D.J.
    This paper presents some initial work done in establishing a complete list of irreducible non-embeddable graphs for the projective plane. The main result presented is the following theorem: All irreducible non-embeddable graphs for the projective plane which have a subgraph contractable to $GAMMA sub 1$ and do not have a subgraph contractable to $K sub 3,4$, are contractable to one of four graphs listed in the set $S sub 2$.
  • Thumbnail Image
    ItemOpen Access
    THE SECD MACHINE ON A CHIP
    (1989-06-01) Birtwistle, G.; Graham, B.; Joyce, J.; Williams, S.; Brinsmead, M.; Keefe, M.; Kroeker, W.; Liblong, B.; Vollmerhaus, W.
    We describe work completed on the design, informal specification, and layout of a custom SECD machine. The chip contains around 25,000 transistors excluding memory cells. The work is part of a long term project which aims to support specification based VLSI design, build a library of cell and sub-system specifications, and investigate algorithms for transforming from specifications to other views.
  • No Thumbnail Available
    ItemMetadata only
    STABLE SUBGRAPHS OF TOROIDAL GROUPS
    (1980-02-01) Vollmerhaus, W.
    No Absract