A 1998 paper by Princeton University's Margaret Martonosi and Sharad Malik, Accelerating Boolean Satisfiability with Configurable Hardware (Zhong, Martonosi, Ashar, Malik), was named among the top 25 most influential papers of the past 20 years by International IEEE Symposium on Field-Programmable Custom Computing Machines.
“This paper represents one of the early, successful approaches to implementing a SAT solver on FPGAs and is an early example of the advantages of specializing a circuit for a particular problem instance. It has several excellent features, including software that translates the Boolean satisfiability problem to FPGAs. An interesting discussion of compile times versus run times in the paper is still relevant to current problems in heterogeneous acceleration,” said Miriam Leeser, in an endorsement of the paper that was published in Architecture and Technology. Read more at about this paper.