Jeffrey Scott Vitter (born 1955 in New Orleans, Louisiana) is a professor of computer science and engineering at Texas A&M University. From 2008 to 2009, he was the provost and executive vice president for academics at Texas A&M University.[1][2] He previously served from 2002 to 2008 as the Frederick L. Hovde Dean of Science at Purdue University in West Lafayette, Indiana. From 1993 to 2002, he held a distinguished professorship at Duke University in Durham, North Carolina as the Gilbert, Louis, and Edward Lehrman Professor, where he also served as department chair in computer science. He rose through the ranks to professor at Brown University from 1980 to 1993. He received a bachelor's degree with highest honors in mathematics in 1977 from the University of Notre Dame, a Ph.D. in Computer Science in 1980 from Stanford University under the supervision of Donald Knuth, and an MBA in 2002 from Duke University.
Vitter is a computer scientist with over 250 book, journal, and conference publications, primarily on the design and mathematical analysis of algorithms; his Google Scholar h-index is 54. He helped establish the field of external memory algorithms (a.k.a. I/O algorithms and massive data algorithmics) as a rigorous area of active investigation. He has made many fundamental contributions in
- external memory algorithms[3],
- databases,[4]
- hashing[5] and search data structures,
- randomized algorithms,
- sampling and random variate generation,
- prediction,[6][7]
- data compression, including
- average-case complexity.[12]
He is a John Simon Guggenheim Memorial Foundation Fellow (1986), a Fellow of the Institute of Electrical and Electronics Engineers (1993), a Fellow of the Association for Computing Machinery (1996), a National Science Foundation Presidential Young Investigator Awardee (1985), a member of Phi Beta Kappa (1977) and Sigma Xi (1983), and a Fulbright Scholar (1998).
Personal
Vitter and his wife Sharon have three children, Jillian, J. Scott Jr., and Audrey. He is a brother of U.S. Senator David Vitter (R-LA).
References
- ^ "Jeffrey Vitter Named As Texas A&M Provost". http://www.kbtx.com/home/headlines/24270649.html.
- ^ "A&M Provost Steps Down". http://www.theeagle.com/am/A-amp-amp-M-provost-steps-down.
- ^ J. S. Vitter, Algorithms and Data Structures for External Memory, Series on Foundations and Trends in Theoretical Computer Science, now Publishers, Hanover, MA, 2008, ISBN 978-1-60198-106-6.
- ^ J. S. Vitter and M. Wang, Approximate Computation of Multidimensional Aggregates of Sparse Data Using Wavelets, Proceedings of the 1999 ACM SIGMOD International Conference on Management of Data, June 1999, 193-204. Selected for the 2009 SIGMOD Test of Time Award.
- ^ J. S. Vitter and W.-C. Chen, Design and Analysis of Coalesced Hashing, Oxford University Press, New York, 1987, ISBN 0-19-504182-8.
- ^ J. S. Vitter and P. Krishnan, Optimal Prefetching via Data Compression, Journal of the ACM, 43(5), September 1996, 771-793.
- ^ P. Krishnan and J. S. Vitter, Optimal Prediction for Prefetching in the Worst Case, SIAM Journal on Computing, 27(6), December 1998, 1617-1636.
- ^ J. S. Vitter, Design and Analysis of Dynamic Huffman Codes, Journal of the ACM, 34(4), October 1987, 825-845
- ^ P. G. Howard and J. S. Vitter, Arithmetic Coding for Data Compression, Proceedings of the IEEE, 82(6), June 1994, 857-865
- ^ D. T. Hoang and J. S. Vitter, Efficient Algorithms for MPEG Video Compression, Wiley Series in Telecommunications and Signal Processing, John Wiley & Sons, New York, 2002, ISBN 0-471-37942-5.
- ^ R. Grossi and J. S. Vitter, Compressed Suffix Arrays and Suffix Trees, with Applications to Text Indexing and String Matching, SIAM Journal on Computing, 35(2), 2005, 378-407.
- ^ J. S. Vitter and Philippe Flajolet, Average-case Analysis of Algorithms and Data Structures, Chapter 9 in Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity, edited by J. van Leeuwen, Elsevier Press and M.I.T. Press, 1990, 431-524.
External links
- Jeff Vitter's web page with CV and links to publications
This entry is from Wikipedia, the leading user-contributed encyclopedia. It may not have been reviewed by professional editors (see full disclaimer)
