Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

9 relations
Alexander StepanovC++Computer scienceGeneric programming

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2008
Highly Cited
2008
Why the two-pulse photon echo is not a good quantum memory protocol
We consider in this paper a two-pulse photon echo sequence in the prospect of quantum light storage. We analyze the conditions… 
Highly Cited
2007
Highly Cited
2007
Thatch and Mat Management in an Established Creeping Bentgrass Golf Green
Thatch is a layer of partially decomposed organic matter between green shoot tissue and the soil surface, and mat is thatch… 
Highly Cited
2001
Highly Cited
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… 
Highly Cited
1999
Highly Cited
1999
Handbook of computer vision and applications
Contents of Volume One: Preface. Contributors. B. Jahne, Introduction. Illumination and Image Formation. H. Hausecker, Radiation… 
Highly Cited
1987
Highly Cited
1987
Proof by Consistency
Highly Cited
1983
Highly Cited
1983
Factoring sparse multivariate polynomials
  • J. von zur Gathen
  • 24th Annual Symposium on Foundations of Computer…
  • 1983
  • Corpus ID: 1849053
Extended Abstract 1. Introduction The problem of factoring polynon1ials has a venerable history, and also has seen an exciting… 
Highly Cited
1980
Highly Cited
1980
How to Prove Algebraic Inductive Hypotheses Without Induction
This paper proves the correctness of algebraic methods for deciding the equivalence of expressions by applying rewrite rules, and… 
Highly Cited
1979
Highly Cited
1979
Final Algebra Semantics and Data Type Extensions
  • M. Wand
  • Journal of computer and system sciences (Print)
  • 1979
  • Corpus ID: 28611879
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… 
Highly Cited
1976
Highly Cited
1976
On square-free decomposition algorithms
  • D. Yun
  • Symposium on Symbolic and Algebraic Manipulation
  • 1976
  • Corpus ID: 12861227
In this paper, we will give three different (including revamped versions of Horowitz's and Musser's) algorithms for computing the… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)