Dana S. Richards is a writer, mathematics popularizer and Associate Professor in Computer ScienceatGeorge Mason University.
Dana S. Richards
| |
|---|---|
| Nationality | American |
| Alma mater | University of Virginia University of Illinois at Urbana–Champaign |
| Scientific career | |
| Fields | Computer science |
| Institutions | George Mason University University of Virginia |
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.[2] He is the longtime bibliographer of polymath Martin Gardner.[3]
Richards received an M.S. from the University of Virginia in 1976[4] and a Ph.D. in computer science from the University of Illinois at Urbana-Champaign under Chung Laung Liu in 1984.[5]
He was an Assistant Professor of Computer Science at the University of Virginia,[4] and a Program Director of Theory of Computing at the National Science Foundation (June 1993 through May 1994).[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.[4]
Dana Richards was a friend of Martin Gardner going back to the 1970s,[9][10][11][12] and in his writing and speaking he often memorialized and popularized Gardner's work.[13][14] In 2006 he edited The Colossal Book of Short Puzzles and Problems which collected all of Gardner's short puzzles in one volume.[15] He wrote Gardner's obituary in Science[16] and in 2023 he published a comprehensive bibliography of Gardner's works.[3]
Since Gardner's death in 2010 events called Celebration of Mind are held every October which include games, magic and puzzles in the Gardner tradition, and Richards is frequently featured at these events discussing Gardner's life and work.[17]