• Publications
  • Influence
Principles and methods of testing finite state machines-a survey
The fundamental problems in testing finite state machines and techniques for solving these problems are reviewed, tracing progress in the area from its inception to the present and the stare of the art is traced.
The Complexity of Multiterminal Cuts
It is shown that the problem becomes NP-hard as soon as $k=3$, but can be solved in polynomial time for planar graphs for any fixed $k$, if the planar problem is NP- hard, however, if £k$ is not fixed.
On the Desirability of Acyclic Database Schemes
It is shown that this class of database schemes, called acychc, has a number of desirable properties that have been studied by other researchers and are shown to be eqmvalent to acydicity.
On the approximability of trade-offs and optimal access of Web sources
These concepts and techniques are applied to formulate and solve approximately a cost-time-quality trade-off for optimizing access to the World-Wide Web, in a model first studied by Etzioni et al. (1996).
The complexity of probabilistic verification
This work determines the complexity of testing whether a finite state, sequential or concurrent probabilistic program satisfies its specification expressed in linear-time temporal logic and addresses questions for specifications described by ω-automata or formulas in extended temporal logic.
How easy is local search?
Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
An article of golfing equipment has a golf tee attached to a spring-biassed reel by a length of string which can be aligned with the green or hole and used as an aid in swinging the club face in the correct direction.