The following pages link to David R. Musser (Q1094887):
Displaying 24 items.
- (Q808711) (redirect page) (← links)
- Semi-unification (Q808713) (← links)
- Proof by consistency (Q1094888) (← links)
- Only prime superpositions need be considered in the Knuth-Bendix completion procedure (Q1106657) (← links)
- Analysis of the Pope-Stein division algorithm (Q1248370) (← links)
- (Q2764156) (← links)
- On Proving Uniform Termination and Restricted Termination of Rewriting Systems (Q3040518) (← links)
- A Generalized Class of Polynomials that are Hard to Factor (Q3311656) (← links)
- (Q3687693) (← links)
- (Q3819992) (← links)
- Abstract Data Type Specification in the Affirm System (Q3868738) (← links)
- (Q3880315) (← links)
- (Q3933737) (← links)
- (Q3942387) (← links)
- (Q3993347) (← links)
- Multivariate Polynomial Factorization (Q4055074) (← links)
- On the Efficiency of a Polynomial Irreducibility Test (Q4148947) (← links)
- Abstract data types and software validation (Q4168047) (← links)
- (Q4227353) (← links)
- (Q4412488) (← links)
- (Q4444763) (← links)
- (Q4817007) (← links)
- (Q5364939) (← links)
- (Q5603619) (← links)
