Dana S. Richards is a writer, mathematics popularizer and Associate Professor in Computer Science at George Mason University.
His research interests include comparisons of protein sequences, Steiner tree algorithms,[1] information dissemination in networks, parallel heuristics, methodology for computationally intractable problems and parallel algorithms for median filters.
[6] He has written or edited seven books[7] and numerous journal articles.
[8] In addition, he is a reviewer for many journals, and has received numerous research awards.
He became an Associate Professor of Computer Science at George Mason University in 1994.