ITTC Contacts

Jeffrey Vitter
 
Affiliate
Jeffrey Vitter
Affiliate Researcher

ITTC Lab Affiliation(s)
   No Specific Affiliation
Contact Info
Primary Office:



Email Address: jsv@ittc.ku.edu
Homepage: http://www.ittc.ku.edu/~jsv/
Awards

  • National Science Foundation Presidential Young Investigator Award, 1985-1991.
  • Fellow, John Simon Guggenheim Memorial Foundation, 1986-present.
  • Fellow, Institute of Electrical and Electronics Engineers (IEEE), 1993-present.
  • Fellow, Association for Computing Machinery (ACM), 1996-present.
  • Recognition of Service Award, Association for Computing Machinery (ACM), 1997.
  • Fulbright Scholar, 1998.
  • Medal of the University of Helsinki, Helsinki, Finland, 1999.
  • Recognition of Service Award, Association for Computing Machinery (ACM), 2001.
  • Fuqua Scholar, Fuqua School of Business, Duke University, 2002.
  • 2009 SIGMOD Test of Time Award, awarded by the Association for Computing Machinery (ACM) Special Interest Group for Management of Data (SIGMOD) to the authors of the most impactful SIGMOD paper from 10 years earlier.
  • Fellow, American Association for the Advancement of Science, 2009-present.
Biography

Education

B.S., mathematics (with highest honors), University of Notre Dame, 1977
Ph.D., computer science, Stanford University, 1980
M.B.A., Duke University, 2002

Teaching

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.

Research

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
Memberships
  • 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
Publications

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: Patents
  • 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.


Partner with ITTC

The Information and Telecommunication Technology Center at the University of Kansas has developed several assistance policies that enhance interactions between the Center and local, Kansas, or national companies. 

ITTC assistance includes initial free consulting (normally one to five hours). If additional support is needed, ITTC will offer one of the following approaches: 

Sponsored Research Agreement

Individuals and organizations can enter into agreements with KUCR/ITTC and provide funds for sponsored research to be performed at ITTC with the assistance of faculty, staff and students.

Licensing and Royalty/Equity Agreement

An ITTC goal is the development of investment-grade technologies for transfer to, and marketing by, local, Kansas, and national businesses. To enhance this process, the Center has developed flexible policies that allow for licensing, royalty, and equity arrangements to meet both the needs of ITTC and the company.

Commercialization Development

Companies with a technology need that can be satisfied with ITTC's resources can look to us for assistance. We can develop a relationship with interested partners that will provide for the development of a technology suited for commercialization.

ITTC Resource Access

ITTC resources, including computers and software systems, may be made available to Kansas companies in accordance with the Center's mission and applicable Regents and University policies.

ITTC Calendar
There are no upcoming events at this time.