Now showing items 37-39 of 176

    • An Analysis of Sorting Networks 

      Smith, Burton J. (1972-10)
      Comparators which sort two numbers can be interconnected to form networks which sort n numbers for any n. The input and output characteristics of comparator networks are analyzed from several different points of view.
    • Cooperation of Mutually Suspicious Subsystems in a Computer Utility 

      Schroeder, Michael D. (1972-09)
      This thesis describes practical protection mechanisms that allow mutually suspicious subsystems to cooperate in a single computation and still be protected from one another. The mechanisms are based on the division of a ...
    • Finite Tree Automata and W-Automata 

      Hossley, Robert (1972-09)
      Chapter I is a survey of finite automata as acceptors of finite labeled trees. Chapter II is a survey of finite automata as acceptors of infinite strings on a finite alphabet. Among the automata models considered in ...