David Musser

Known as: Dave Musser, Musser 
David "Dave" Musser is a professor emeritus of computer science at the Rensselaer Polytechnic Institute in Troy, New York, United States. He is known… (More)
Wikipedia

Related topics

Related topics

9 relations
Alexander StepanovC++Computer scienceGeneric programming
(More)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
SELECTIVE OXIDATION OF CYCLOHEXANE TO CYCLOHEXANONE
  • 2013
Cyclohexane oxidation is an important commercial reaction for the preparation of cyclohexanol and cyclohexanone, which are… (More)
  • figure 5.1
  • figure 5.2
  • table 5.1
  • figure 5.3
  • table 5.2
Is this relevant?
2011
2011
Towards a Technique of Incorporating Domain Knowledge for Unit Conversion in Scientific Reasoning Systems
Unit conversion is often considered a straightforward task using analytical knowledge like the definition of centimeters in terms… (More)
Is this relevant?
2010
2010
Endogenizing the Planning Horizon in Urban fringe agriculture
To evaluate the nature of farm operation longevity in urban fringe agriculture, this paper develops a model that endogenizes… (More)
  • table 1
  • figure 1
Is this relevant?
2003
2003
Influence of Cry1Ab Protein and Hybrid Genotype on Fumonisin Contamination and Fusarium Ear Rot of Corn
corn (Cawood et al., 1991; CFSAN, 2001a; Musser and Plattner, 1997; Sydenham et al., 1992; Thiel et al., 1992). Fusarium ear rot… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • table 2
Is this relevant?
2001
2001
Developing and Refining Mental Models in Open-Ended Learning Environments: A Case Study.
This qualitative case study focused on the nature of science learning through open-ended problem solving. Twelve eighth graders… (More)
  • figure 1
  • figure 2
  • table 2
  • figure 3
  • figure 4
Is this relevant?
1998
1998
Generic programming projects and open problems
a session was held discussing possible projects, with nominations also for open problems. Dave Musser started the discussion by… (More)
Is this relevant?
Highly Cited
1989
Highly Cited
1989
Automatic Proofs by Induction in Theories without Constructors
Inducfionless induction consists of using pure equational reasoning for proving the validity of an equation in the initial… (More)
Is this relevant?
Highly Cited
1987
Highly Cited
1987
Proof by Consistency
Advances of the past decade in methods and computer programs for showing consistency of proof systems based on first-order… (More)
  • figure 4
  • figure 5
  • figure 7
Is this relevant?
1981
1981
Newton's iteration and the sparse Hensel algorithm (Extended Abstract)
This paper presents an organization of the p-adic lifting (or Hensel) algorithm that differs from the organization previously… (More)
Is this relevant?
Highly Cited
1978
Highly Cited
1978
Abstract Data Types and Software Validation
A data abstraction can be naturally specified using algebraic axioms. The virtue of these axioms is that they permit a… (More)
  • figure 3
  • figure 4
  • figure 8
  • figure 9
  • figure 10
Is this relevant?