H-Index & Metrics Top Publications

H-Index & Metrics

Discipline name H-index Citations Publications World Ranking National Ranking
Computer Science H-index 72 Citations 21,177 259 World Ranking 743 National Ranking 449

Research.com Recognitions

Awards & Achievements

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

What is he best known for?

The fields of study he is best known for:

  • Algorithm
  • Programming language
  • Operating system

His primary areas of investigation include Algorithm, Auxiliary memory, Theoretical computer science, Data structure and Data mining. He interconnects Overhead, Block size, Out-of-core algorithm, Parallel computing and Sorting in the investigation of issues within Auxiliary memory. His research integrates issues of Probabilistic logic, Ranking, Null graph, Voltage graph and Data set in his study of Theoretical computer science.

His Data structure study incorporates themes from Search engine indexing and Linear space. The study incorporates disciplines such as Discrete mathematics, FM-index, Compressed suffix array and Succinct data structure in addition to Search engine indexing. His research in Data mining intersects with topics in Page fault, Joins and Markov chain.

His most cited work include:

  • Random sampling with a reservoir (1212 citations)
  • High-order entropy-compressed text indexes (646 citations)
  • External memory algorithms and data structures: dealing with massive data (611 citations)

What are the main themes of his work throughout his whole career to date?

Algorithm, Theoretical computer science, Data structure, Combinatorics and Auxiliary memory are his primary areas of study. His study in Data compression, Arithmetic coding, Sorting, Context-adaptive binary arithmetic coding and Huffman coding is done as part of Algorithm. His Theoretical computer science study combines topics from a wide range of disciplines, such as Data mining, Coalesced hashing, Computational complexity theory, Dynamic perfect hashing and Computation.

His work carried out in the field of Data structure brings together such families of science as Wavelet Tree, Range query, Set and Search engine indexing. His Combinatorics research is multidisciplinary, incorporating elements of Discrete mathematics and Wildcard character. His Auxiliary memory research integrates issues from Out-of-core algorithm and Parallel computing.

He most often published in these fields:

  • Algorithm (33.14%)
  • Theoretical computer science (25.07%)
  • Data structure (20.75%)

What were the highlights of his more recent work (between 2007-2021)?

  • Algorithm (33.14%)
  • Combinatorics (18.73%)
  • Search engine indexing (10.95%)

In recent papers he was focusing on the following fields of study:

Jeffrey Scott Vitter mostly deals with Algorithm, Combinatorics, Search engine indexing, Data structure and Pattern matching. His research on Algorithm often connects related areas such as Byte. His biological study spans a wide range of topics, including Space, Wildcard character, Index and Empirical entropy.

His Search engine indexing research includes elements of Pattern recognition, Succinct data structure and Source code. His research integrates issues of Auxiliary memory, Wavelet Tree, Information retrieval and String in his study of Data structure. His studies in Pattern matching integrate themes in fields like Theoretical computer science, Range query, String searching algorithm, Entropy and Sequence.

Between 2007 and 2021, his most popular works were:

  • Algorithms and Data Structures for External Memory (179 citations)
  • Space-Efficient Framework for Top-k String Retrieval Problems (88 citations)
  • Inverted indexes for phrases and strings (42 citations)

In his most recent research, the most cited papers focused on:

  • Algorithm
  • Programming language
  • Operating system

Jeffrey Scott Vitter mainly focuses on Data structure, Combinatorics, Information retrieval, Algorithm and Inverted index. The study incorporates disciplines such as Theoretical computer science, Auxiliary memory, Wavelet Tree and Search engine indexing in addition to Data structure. He has researched Search engine indexing in several fields, including Entropy and Range query.

His study in Combinatorics is interdisciplinary in nature, drawing from both Space, Listing and Compressed suffix array. Analysis of algorithms and Out-of-core algorithm are the subjects of his Algorithm studies. His studies deal with areas such as String, Set, Relevance and Ranking as well as Inverted index.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

Top Publications

Random sampling with a reservoir

Jeffrey S. Vitter.
ACM Transactions on Mathematical Software (1985)

1514 Citations

External memory algorithms and data structures: dealing with massive data

Jeffrey Scott Vitter.
ACM Computing Surveys (2001)

888 Citations

High-order entropy-compressed text indexes

Roberto Grossi;Ankur Gupta;Jeffrey Scott Vitter.
symposium on discrete algorithms (2003)

838 Citations

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

Roberto Grossi;Jeffrey Scott Vitter.
SIAM Journal on Computing (2005)

769 Citations

Wavelet-based histograms for selectivity estimation

Yossi Matias;Jeffrey Scott Vitter;Min Wang.
international conference on management of data (1998)

563 Citations

Algorithms for parallel memory, I: Two-level memories

Jeffrey S Vitter;Elizabeth A.M. Shriver.
Algorithmica (1993)

503 Citations

Design and analysis of dynamic Huffman codes

Jeffrey Scott Vitter.
Journal of the ACM (1987)

492 Citations

Approximate computation of multidimensional aggregates of sparse data using wavelets

Jeffrey Scott Vitter;Min Wang.
international conference on management of data (1999)

491 Citations

Arithmetic coding for data compression

Paul G. Howard;Jeffrey Scott Vitter.
Proceedings of the IEEE (1994)

435 Citations

External-memory graph algorithms

Yi-Jen Chiang;Michael T. Goodrich;Edward F. Grove;Roberto Tamassia.
symposium on discrete algorithms (1995)

412 Citations

Profile was last updated on December 6th, 2021.
Research.com Ranking is based on data retrieved from the Microsoft Academic Graph (MAG).
The ranking h-index is inferred from publications deemed to belong to the considered discipline.

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

Contact us

Top Scientists Citing Jeffrey Scott Vitter

Gonzalo Navarro

Gonzalo Navarro

University of Chile

Publications: 214

Lars Arge

Lars Arge

Aarhus University

Publications: 78

Paolo Ferragina

Paolo Ferragina

University of Pisa

Publications: 60

Yufei Tao

Yufei Tao

Chinese University of Hong Kong

Publications: 58

Peter Sanders

Peter Sanders

Karlsruhe Institute of Technology

Publications: 56

J. Ian Munro

J. Ian Munro

University of Waterloo

Publications: 54

Simon J. Puglisi

Simon J. Puglisi

University of Helsinki

Publications: 49

Kunihiko Sadakane

Kunihiko Sadakane

University of Tokyo

Publications: 48

Michael T. Goodrich

Michael T. Goodrich

University of California, Irvine

Publications: 46

Veli Mäkinen

Veli Mäkinen

University of Helsinki

Publications: 43

Minos Garofalakis

Minos Garofalakis

Technical University of Crete

Publications: 41

Pankaj K. Agarwal

Pankaj K. Agarwal

Duke University

Publications: 40

Gerth Stølting Brodal

Gerth Stølting Brodal

Aarhus University

Publications: 39

Sudipto Guha

Sudipto Guha

University of Pennsylvania

Publications: 39

Nikos Mamoulis

Nikos Mamoulis

University of Ioannina

Publications: 38

Something went wrong. Please try again later.