Unidirectional star graphs. The computational complexity of satisfiability of temporal Horn formulas in propositional linear-time temporal logic. Speeding Lamport's fast mutual exclusion algorithm. On the relationship between deterministic time and deterministic reversal. Nancy Amato .
Improved processor bounds for parallel algorithms for weighted directed graphs.
Suchen H. Hsu and Richard Snodgrass . Optimal block size for set-valued attributes. Remarks on the equivalence of c-e structures and Petri nets. Edmund Ihler , Dorothea Wagner , and Frank Wagner . Modeling hypergraphs by graphs with the same mincut properties.