Abstract. Block-recursive codes for dense numerical linear algebra computations appear to be well-suited for execution on machines with deep memory hierarchies because they are e e...
A family of well known problems on graphs includingthe shortest path problem and the data flow analysis problem can be uniformly formulated as a fixed-point problem on graphs. We ...
Abstract. We show that subsumption problems in EL and related description logics can be expressed as uniform word problems in classes of semilattices with monotone operators. We us...
Abstract. This paper gives algebraic definitions for obtaining the minimal transition and place flows of a modular Petri net from the minimal transition and place flows of its comp...
Abstract. Deterministic graph grammars are finite devices which generate the transition graphs of pushdown automata. We define the notion of synchronization by grammars, generalizi...