Steven Homer received his Ph.D. in mathematics from M.I.T. in 1978. He is a Professor of Computer Science at Boston University where he has been on the faculty since 1982. He served as department chairman for four of those years. At various times he has also served as acting chair, associate chair, graduate director and undergraduate director of the department. He is currently Co-Director of the Center for Reliable Informations Systems and Cyber Security, which he co-founded in 2002.
Dr. Homer has been a Fulbright Scholar in Heidelberg (1988-89) and Visiting Research Professor in Oxford (1996). In 1994 Dr. Homer was awarded a Computational Science Undergraduate Teaching Award from the Department of Energy. From 1994 to 1997 he served as chair of the the annual IEEE Conference on Computational Complexity. From 1991 to 1994 Dr. Homer was a member of the CIES area committee to award Fulbright Fellowships in computer science. He chaired that committee in 1994. His research interests include complexity theory, quantum computation, security, parallel and randomized algorithms, mathematical logic and computational learning theory. He has published over 70 research papers in these fields.
M. Fang, S. Fenner, F. Green, S. Homer, and Y. Zhang. Quantum Lower Bounds for Fanout May 25, 2005.
Lance Fortnow and Steve Homer. A Brief History of Complexity Theory November 14, 2002.
Steven Homer and Marcus Peinado. On the Performance of Polynomial-time CLIQUE Approximation Algorithms on Very Large Graphs