Biography:Michael Langston
Michael Allen Langston is a professor of electrical engineering and computer science at the University of Tennessee.[1] In several publications with Michael Fellows in the late 1980s, he showed that the Robertson–Seymour theorem could be used to prove the existence of a polynomial-time algorithm for problems such as linkless embedding without allowing the algorithm itself to be explicitly constructed;[2][3] this work was foundational to the field of parameterized complexity.[4] He has also collaborated with scientists at Oak Ridge National Laboratory on the computational analysis of genomics data and reconstruction of gene regulatory networks.[5][6]
Langston received his doctorate (PhD) in 1981 at Texas A&M University in computing science.[1] His dissertation was Processor scheduling with improved heuristic algorithms.[7] He worked at Washington State University, the University of Illinois, and the University of Maryland Global Campus Europe before taking his present position at the University of Tennessee.[5] He has also served in the United States Army as a paratrooper and officer in the 17th Cavalry Regiment and as personnel database manager for VII Corps.[8]
His honors include the Commendation Medal, U.S. Army, 1979; the Distinguished Teaching Award, Texas A&M University, 1981;[5] the Distinguished Service Prize, ACM Special Interest Group on Algorithms and Computation Theory, 2001;[9] and the Chancellor's Award for Research and Creative Achievement, University of Tennessee, 1994[5] and 2014.
References
- ↑ 1.0 1.1 "Michael Langston". People. University of Tennessee Min H. Kao Department of Electrical Engineering and Computer Science. 9 January 2020. https://www.eecs.utk.edu/people/michael-langston/.
- ↑ Cygan, Marek; Fomin, Fedor V.; Kowalik, Łukasz; Lokshtanov, Daniel; Marx, Dániel; Pilipczuk, Marcin; Pilipczuk, Michał; Saket, Saurabh (2015). Parameterized Algorithms. Springer. pp. 143–144. doi:10.1007/978-3-319-21275-3. ISBN 978-3-319-21274-6.
- ↑ Flum, Jörg; Grohe, Martin (2006). Parameterized Complexity Theory. Springer. p. 299. doi:10.1007/3-540-29953-X. ISBN 978-3-540-29952-3.
- ↑ Cygan et al. (2015), p. v.
- ↑ 5.0 5.1 5.2 5.3 Womac, Amanda (Spring 2008). "Faculty focus: Dr. Michael Langston". Tennessee Engineer (Tickle College of Engineering, University of Tennessee): 3, 5. http://web.eecs.utk.edu/~mlangsto/faculty-focus.pdf.
- ↑ "First, the Questions: Tough scientific questions drive systems biology research at ORNL". Oak Ridge National Laboratory Review 3 (4): 4–5. 2004. https://www.ornl.gov/sites/default/files/ORNL%20Review%20v37n3%202004.pdf.
- ↑ Langston, Michael Allen (1981). Processor scheduling with improved heuristic algorithms (Doctoral dissertation). Texas A&M University. hdl:1969.1/DISSERTATIONS-647904.
- ↑ Langston, Michael. "Biographical data". University of Tennessee. http://web.eecs.utk.edu/~mlangsto/bio-data.html.
- ↑ "SIGACT Distinguished Service Prize". Association for Computing Machinery. http://www.sigact.org/prizes/service.html. Retrieved 24 September 2021.
External links
- Mike Langston's Homepage
- Michael Langston publications indexed by Google Scholar
 |  |
