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
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.
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.
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.
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.
Random sampling with a reservoir
Jeffrey S. Vitter.
ACM Transactions on Mathematical Software (1985)
External memory algorithms and data structures: dealing with massive data
Jeffrey Scott Vitter.
ACM Computing Surveys (2001)
High-order entropy-compressed text indexes
Roberto Grossi;Ankur Gupta;Jeffrey Scott Vitter.
symposium on discrete algorithms (2003)
Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
Roberto Grossi;Jeffrey Scott Vitter.
SIAM Journal on Computing (2005)
Wavelet-based histograms for selectivity estimation
Yossi Matias;Jeffrey Scott Vitter;Min Wang.
international conference on management of data (1998)
Algorithms for parallel memory, I: Two-level memories
Jeffrey S Vitter;Elizabeth A.M. Shriver.
Algorithmica (1993)
Design and analysis of dynamic Huffman codes
Jeffrey Scott Vitter.
Journal of the ACM (1987)
Approximate computation of multidimensional aggregates of sparse data using wavelets
Jeffrey Scott Vitter;Min Wang.
international conference on management of data (1999)
Arithmetic coding for data compression
Paul G. Howard;Jeffrey Scott Vitter.
Proceedings of the IEEE (1994)
External-memory graph algorithms
Yi-Jen Chiang;Michael T. Goodrich;Edward F. Grove;Roberto Tamassia.
symposium on discrete algorithms (1995)
If you think any of the details on this page are incorrect, let us know.
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:
Aarhus University
Brown University
Google (United States)
Duke University
Google (United States)
Google (United States)
University of California, Irvine
Brown University
Purdue University West Lafayette
Brown University
University of Minnesota
Google (Canada)
Dalian University of Technology
Verizon (United States)
University of Bari Aldo Moro
University of Montpellier
Poznań University of Technology
University of Oregon
The University of Texas at Austin
University of Virginia
Korea Advanced Institute of Science and Technology
University of Oregon
University of Lausanne
Sapienza University of Rome
University of Modena and Reggio Emilia
Georgia State University