Jeffrey Vitter
Location: (Lawrence, KS)
Personal Research Web Page: http://www.vitter.org/jsv/
Keywords: Massive data, external memory algorithms; compressed data structures; pattern matching; databases; data compression; machine learning and prediction; computational geometry; computational science; algorithm engineering; combinatorial optimization
Posted on: Saturday, May 8th, 2010
Broad Research Area: Databases / Information Retrieval / Data Mining, Numerical/Scientific Computing / HPC / Data-Intensive Scalable Computing, Theory / Algorithms
Research Interests:
Prof. Vitter’s research interests include the design and mathematical analysis of algorithms, especially dealing with massive data. He has worked extensively in data compression, string algorithms, external memory algorithms and I/O efficiency, computational geometry, caching and prefetching, machine learning, incremental algorithms, and order statistics. His work on the analysis of algorithms deals with the precise study of the performance of algorithms and data structures under various models. His work on I/O-efficient methods for solving problems involving massive data sets has helped shape the subfield of external memory algorithms. He is actively involved in developing efficient indexing methods for text and techniques for space-efficient processing of massive data. Other work includes sorting, information storage and retrieval, geographic information systems and spatial databases, clustering and geometric optimization, random sampling, and random variate generation.
Contact Information:
Email: EMAIL OBFUSCATED
Tel.: (979) 587-9904
Web page (including links to research interests, CV, and online publications catalog): http://www.vitter.org/jsv/
