Nondeterministic Polynomial-Time Computations and Models of Arithmetic
Completeness of Rewrite Rules and Rewrite Strategies for FP
Minimal and Complete Word Unification
Some Computational Aspects of Circumscription
Polynomial-Time Implication Problems for Unary Inclusion Dependencies
Asymptotic Expansions for Large Closed Queuing Networks