Lower Bounds and Reductions Between Grammar Problems.
Finding Two Disjoint Paths Between Two Pairs of Vertices in a Graph.
Some Complexity Results for Matrix Computations on Parallel Processors.
Simple Representations of Certain Classes of Languages.
Renaming a Set of Clauses as a Horn Set.
Renamings and Economy of Memory in Program Schemata.
A New Incompleteness Result for Hoare's System.
Preemptive Scheduling of Uniform Processor Systems.
Satisfiability Is Quasilinear Complete in NQL.
KEDMA - Linguistic Tools for Retrieval Systems.
Foundations of Probabilistic and Utility-Theoretic Indexing.
On Stable Parallel Linear System Solvers.
A Linear-Time On-Line Recognition Algorithm for "Palstar".
Separating Nondeterministic Time Complexity Classes.
Reversal-Bounded Multicounter Machines and Their Decision Problems.