If G is an n vertex maximal planar graph and &dgr;?1/3, then the vertex set of G can be partitioned into three sets A, B, C such that neither A nor B...

First order static database constraints are expressed as counter-examples, i.e., examples that violate the integrity of the database. Examples are da...

The traditional approach to database querying and updating treats insertions and deletions of tuples in an asymmetric manner: if a tuple t is insert...

A formalism is presented for tracking assertions which hold universally, i.e., at the end of all the execution paths to a given program point, and ass...

The list-ranking problem is considered for parallel computers which communicate through an interconnection network. The algorithms are based on the id...