David R. Musser

Available identifiers

zbMath Open musser.david-rDBLPm/DavidRMusserWikidataQ5237857 ScholiaQ5237857MaRDI QIDQ1094887

List of research outcomes

Publication	Date of Publication	Type
Fundamental proof methods in computer science. A computer-based approach	2017-09-29	Paper
https://portal.mardi4nfdi.de/entity/Q4817007	2004-09-14	Paper
https://portal.mardi4nfdi.de/entity/Q4444763	2004-01-27	Paper
https://portal.mardi4nfdi.de/entity/Q4412488	2003-07-15	Paper
https://portal.mardi4nfdi.de/entity/Q2764156	2002-01-22	Paper
https://portal.mardi4nfdi.de/entity/Q4227353	1999-06-21	Paper
https://portal.mardi4nfdi.de/entity/Q3993347	1992-09-17	Paper
Semi-unification	1991-01-01	Paper
Only prime superpositions need be considered in the Knuth-Bendix completion procedure	1988-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3819992	1988-01-01	Paper
Proof by consistency	1987-01-01	Paper
On Proving Uniform Termination and Restricted Termination of Rewriting Systems	1983-01-01	Paper
A Generalized Class of Polynomials that are Hard to Factor	1983-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3687693	1982-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3942387	1982-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3933737	1981-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3880315	1980-01-01	Paper
Abstract Data Type Specification in the Affirm System	1980-01-01	Paper
Abstract data types and software validation	1978-01-01	Paper
On the Efficiency of a Polynomial Irreducibility Test	1978-01-01	Paper
Analysis of the Pope-Stein division algorithm	1977-01-01	Paper
Multivariate Polynomial Factorization	1975-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q5603619	1969-01-01	Paper

Research outcomes over time

This page was built for person: David R. Musser