B.S., mathematics (with highest honors), University of Notre Dame, 1977
Ph.D., computer science, Stanford University, 1980
M.B.A., Duke University, 2002
Dr. Vitter, a professor of computer science, serves as the University of Kansas provost and executive vice chancellor. For a more complete biography, including a full curriculum vitæ, please go to his provost web page.
Dr. Vitter seeks to exploit the rich interdependence between mathematical computing theory and practice. His work in algorithm design and analysis spans several application areas. The challenge in each case is to design algorithms that are both provably efficient and practical to implement. He is also interested in the complementary field of computational complexity, which considers the inherent difficulty of problems and thus allows researchers to determine when algorithms are optimal.
- Efficient algorithms for external memory
- Compressed text indexes and data structures
- Data compression
- Prediction for caching and prefetching
- Database access and data mining
- Machine learning and neural networks
- Computational geometry
- Parallel processing
- Incremental (or dynamic) computation
- Random sampling and order statistics
- Analysis of hashing methods
- Design and analysis of data structures and graph algorithms
- Phi Beta Kappa, 1977–present
- Association for Computing Machinery (ACM) (currently Fellow) and its Special Interest Group on Algorithms and Computation Theory (ACM SIGACT), 1979–present
- Institute of Electrical and Electronics Engineers (IEEE) (currently Fellow) and IEEE Computer Society, 1980–present
- Sigma Xi, 1983–present
- European Association for Theoretical Computer Science (EATCS), 1984–present
- American Association for the Advancement of Science (AAAS) (currently Fellow), 2003–present
Dr. Vitter has more than 300 book, journal, conference, and patent publications. His Google Scholar h-index is more than 65, and he is an ISI highly cited researcher. Several of his more recent publications can be accessed electronically from his online publication library. Below are some representative publications:
- J. S. Vitter and W. C. Chen. Design and Analysis of Coalesced Hashing, Oxford University Press, New York, NY, 1987.
- J. S. Vitter. "Design and Analysis of Dynamic Human Codes," Journal of the ACM, 34(4), October 1987, 825–845. Conference version in FOCS '85.
- A. Aggarwal and J. S. Vitter. "The Input/Output Complexity of Sorting and Related Problems, ''Communications of the ACM, 31(9), September 1988, 1116-1127. Conference version in ICALP '87.
- J. S. Vitter and Ph. 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 and M.I.T. Press, 1990, 431–524.
- J. S. Vitter and E. A. M. Shriver. "Algorithms for Parallel Memory I: Two-Level Memories,'' and "Algorithms for Parallel Memory II: Hierarchical Multilevel Memories,''double special issue on Large-Scale Memories in Algorithmica, 12(2–3), 1994, 110–147 and 148–169. Conference version in STOC '90.
- J. S. Vitter and P. Krishnan. "Optimal Prefetching via Data Compression," Journal of the ACM, 43(5) September 1996, 771–793. Conference version in FOCS '91.
- P. G. Howard and J. S. Vitter. "Arithmetic Coding for Data Compression,'' invited paper in Proceedings of the IEEE, 82(6), June 1994, 857–865.
- Y.-J. Chiang, M. T. Goodrich, E. F. Grove, R. Tamassia, D. E. Vengroff, and J. S. Vitter. "External-Memory Graph Algorithms, "Proceedings of the 6th Annual SIAM/ACM Symposium on Discrete Algorithms (SODA~'95), San Francisco, CA, January 1995, 139–149.
- 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 (SIGMOD '99), Philadelphia, PA, June 1999, 193–204. Recipient of the 2009 ACM SIGMOD Test of Time Award.
- 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. Conference version in STOC '00.
- 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, NY, 2002.
- R. Grossi, A. Gupta, and J. S. Vitter. "High-Order Entropy-Compressed Text Indexes,"Proceedings of the 14th Annual SIAM/ACM Symposium on Discrete Algorithms (SODA '03), Baltimore, MD, January 2003, 841–850.
- J. S. Vitter. Algorithms and Data Structures for External Memory, Series on Foundations and Trends in Theoretical Computer Science, now Publishers, Hanover, MA, 2008.
- W.-K. Hon, R. Shah, and J. S. Vitter. Space-Efficient Framework for Top-k String Retrieval Problems,"Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science (FOCS '09), Atlanta, GA, October 2009, 713–722.
- W.-K. Hon, R. Shah, and J. S. Vitter. Compression, Indexing, and Retrieval for Massive String Data,"keynote address by Dr. Vitter, invited paper in Proceedings of the 19th Annual Conference on Combinatorial Pattern Matching (CPM '10), New York, NY, June 2010, published in Lecture Notes in Computer Science, Springer, Berlin, Germany.
- E. E. Lindstrom and J. S. Vitter. "External Sorting Using Key Value Distribution and Range Formation," United States Patent No. 4,575,798, IBM Corporation, March 11, 1986.
- J. S. Vitter, K. M. Curewitz, and P. Krishnan. "Online Background Predictors and Prefetchers," United States Patent No. 5,485,609, Duke University, January 16, 1996.
- Y. Matias, J. S. Vitter, and N. Young. "Method for Implementing Approximate Data Structures using Operations on Machine Words," United States Patent No. 5,519,840, AT&T Corporation, May 21, 1996.
- R. D. Barve, P. B. Gibbons, B. K. Hillyer, Y. Matias, E. Shriver, and J. S. Vitter. "A System and Method for Modeling and Optimizing I/O Throughput of Multiple Disks on a Bus, I" United States patent No. 6,260,108, Lucent Technologies, July 10, 2001.
- R. D. Barve, P. B. Gibbons, B. K. Hillyer, Y. Matias, E. Shriver, and J. S. Vitter. "A System and Method for Modeling and Optimizing I/O Throughput of Multiple Disks on a Bus, II" United States patent No. 6,301,640, Lucent Technologies, October 9, 2001.
- L. Arge, O. Procopiuc, S. Ramaswamy, T. Suel, and J. S. Vitter. "System and Method for Performing Scalable Sweep Based Spatial Join," United States patent pending.