World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
80
Citations
26140
World Ranking
1080
National Ranking
581

Research.com Recognitions

  • 2018 - Fellow, National Academy of Inventors
  • 2009 - Fellow of the American Association for the Advancement of Science (AAAS)
  • 1996 - ACM Fellow For contributions to the theory of information storage and retrieval and to the design and mathematical analysis of computer algorithms.
  • 1993 - IEEE Fellow For contributions to the theory of sorting and searching and to the design and analysis of computer algorithms.
  • 1986 - Fellow of John Simon Guggenheim Memorial Foundation

Overview

Jeffrey Scott Vitter is affiliated with the University of Mississippi in the United States. Their research spans multiple fields with a focus on computer science and biochemistry, genetics, and molecular biology. Within these main fields, their work explores various subfields including molecular biology, artificial intelligence, computer vision and pattern recognition, statistical and nonlinear physics, and computer graphics and computer-aided design.

The scientist's research topics primarily include algorithms and data compression, genomics and phylogenetic studies, DNA and biological computing, advanced graph neural networks, graph theory and algorithms, complex network analysis techniques, and computational geometry and mesh generation.

Frequent coauthors collaborating with this researcher include Hongwei Huo, Zhigang Sun, Jun Huan, Sushovan Majhi, and Carola Wenk.

Key recent papers authored by Jeffrey Scott Vitter are:

  • Feature reduction based on semantic similarity for graph classification, 2020, Neurocomputing
  • Approximating Gromov-Hausdorff distance in Euclidean space, 2023, Computational Geometry
  • Efficient Compression and Indexing for Highly Repetitive DNA Sequence Collections, 2020, IEEE/ACM Transactions on Computational Biology and Bioinformatics
  • Practical High-Order Entropy-Compressed Text Self-Indexing, 2021, IEEE Transactions on Knowledge and Data Engineering
  • CIndex: compressed indexes for fast retrieval of FASTQ files, 2021, Bioinformatics

The venues in which this researcher frequently publishes include Neurocomputing, Computational Geometry, IEEE/ACM Transactions on Computational Biology and Bioinformatics, IEEE Transactions on Knowledge and Data Engineering, and Bioinformatics.

Throughout their career, Jeffrey Scott Vitter has received several honors including:

  • Fellow, National Academy of Inventors (2018)
  • Fellow of the American Association for the Advancement of Science (AAAS) (2009)
  • ACM Fellow (1996) for contributions to the theory of information storage and retrieval and to the design and mathematical analysis of computer algorithms
  • IEEE Fellow (1993) for contributions to the theory of sorting and searching and to the design and analysis of computer algorithms
  • Fellow of John Simon Guggenheim Memorial Foundation (1986)

Best Publications

  • Random sampling with a reservoir

    Jeffrey S. Vitter

  • The input/output complexity of sorting and related problems

    Alok Aggarwal;S. Vitter Jeffrey

  • External memory algorithms and data structures: dealing with massive data

    Jeffrey Scott Vitter

  • High-order entropy-compressed text indexes

    Roberto Grossi;Ankur Gupta;Jeffrey Scott Vitter

  • Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching

    Roberto Grossi;Jeffrey Scott Vitter

  • Wavelet-based histograms for selectivity estimation

    Yossi Matias;Jeffrey Scott Vitter;Min Wang

  • Design and analysis of dynamic Huffman codes

    Jeffrey Scott Vitter

  • Algorithms for parallel memory, I: Two-level memories

    Jeffrey S Vitter;Elizabeth A.M. Shriver

  • Approximate computation of multidimensional aggregates of sparse data using wavelets

    Jeffrey Scott Vitter;Min Wang

  • Arithmetic coding for data compression

    P.G. Howard;J.S. Vitter

  • External-memory graph algorithms

    Yi-Jen Chiang;Michael T. Goodrich;Edward F. Grove;Roberto Tamassia

  • Efficient indexing methods for probabilistic threshold queries over uncertain data

    Reynold Cheng;Yuni Xia;Sunil Prabhakar;Rahul Shah

  • Practical prefetching via data compression

    Kenneth M. Curewitz;P. Krishnan;Jeffrey Scott Vitter

  • Optimal prefetching via data compression

    Jeffrey Scott Vitter;P. Krishnan

  • Average-Case Analysis of Algorithms and Data Structures.

    Jeffrey Scott Vitter;Philippe Flajolet

  • Data cube approximation and histograms via wavelets

    Jeffrey Scott Vitter;Min Wang;Bala Iyer

  • Fast and efficient lossless image compression

    P.G. Howard;J.S. Vitter

  • Scalable Sweeping-Based Spatial Join

    Lars Arge;Octavian Procopiuc;Sridhar Ramaswamy;Torsten Suel

  • External-memory computational geometry

    M.T. Goodrich;Jyh-Jong Tsay;D.E. Vengroff;J.S. Vitter

  • e-approximations with minimum packing constraint violation (extended abstract)

    Jyh-Han Lin;Jeffrey Scott Vitter

  • Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract)

    Roberto Grossi;Jeffrey Scott Vitter

  • External-Memory Graph Algorithms

    Yi-Feng Chian;Michael T. Goodrich;Edward Grove;Roberto Tamassia

Frequent Co-Authors

Lars Arge
Lars Arge Aarhus University
Roberto Tamassia
Roberto Tamassia Brown University
Min Wang
Min Wang Google (United States)
Pankaj K. Agarwal
Pankaj K. Agarwal Duke University
Yossi Matias
Yossi Matias Google (United States)
Philip M. Long
Philip M. Long Google (United States)
Michael T. Goodrich
Michael T. Goodrich University of California, Irvine
Franco P. Preparata
Franco P. Preparata Brown University
Peter Sanders
Peter Sanders Karlsruhe Institute of Technology
Walid G. Aref
Walid G. Aref Purdue University West Lafayette

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

If you’re interested in expanding your career options beyond traditional computer science roles, a wide range of related online degrees can help you diversify your skill set. For those seeking to protect digital systems, a cyber security bachelor degree online can open doors to jobs in information security, risk assessment, and threat analysis.

Tech-savvy professionals may also consider leadership roles in industries like construction or criminal justice. Earning a construction management masters degree online builds on project management, engineering, and technology skills, preparing graduates for high-demand management positions. If you’re interested in public safety or law, understanding criminal justice degree online cost can help you plan a pathway in this rewarding field.

Analytical thinkers might find a strong fit in the finance sector, where technological advances are reshaping accounting practices. Pursuing the best online accounting program provides the technical and quantitative expertise needed for modern financial roles. By considering these diverse online degree pathways, you can align your studies with your unique career ambitions and take advantage of emerging opportunities.

Best Scientists Citing Jeffrey Scott Vitter

Trending Scientists

Recently Published Articles