Decidability of the purely existential fragment of the theory of term algebras.
Concurrent dynamic logic.
Recognizing planar perfect graphs.
Answering queries on embedded-complete database schemes.
Estimating the multiplicities of conflicts to speed their resolution in multiple access channels.
Linear probing with a nonuniform address distribution.
Inference with path resolution and semantic graphs.
Associative table lookup processing for multioperand residue arithmetic.
A model for distributed systems based on graph rewriting.
Minimal degrees for polynomial reducibilities.
Optimal reconfiguration strategy for a degradable multimodule computing system.