Jeffrey Vitter | Academic Influence

Jeffrey Vitter's AcademicInfluence.com Rankings

Jeffrey Vitter

Computer Science

#2155

World Rank

#2240

Historical Rank

#979

USA Rank

Database

#1076

World Rank

#1132

Historical Rank

#307

USA Rank

computer-science Degrees

Download Badge

Computer Science

Jeffrey Vitter's Degrees

PhD Computer Science Stanford University
Masters Computer Science Stanford University
Bachelors Mathematics University of Notre Dame

Similar Degrees You Can Earn

Why Is Jeffrey Vitter Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Jeffrey Scott Vitter is a U.S. computer scientist and academic administrator. Born in 1955 in New Orleans, Vitter has served in several senior higher education administration posts. He is a former chancellor of the University of Mississippi . He assumed the chancellor position on January 1, 2016. His formal investiture to the chancellorship took place on November 10, 2016, at the University of Mississippi's Oxford Campus.

(See a Problem?)

Jeffrey Vitter's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Random sampling with a reservoir (1985) (1611)
The input/output complexity of sorting and related problems (1988) (1315)
High-order entropy-compressed text indexes (2003) (759)
External memory algorithms and data structures: dealing with massive data (2001) (724)
Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract) (2000) (605)
Wavelet-based histograms for selectivity estimation (1998) (456)
Approximate computation of multidimensional aggregates of sparse data using wavelets (1999) (396)
External-memory graph algorithms (1995) (375)
Design and analysis of dynamic Huffman codes (1987) (364)
Efficient Indexing Methods for Probabilistic Threshold Queries over Uncertain Data (2004) (313)
Practical prefetching via data compression (1993) (253)
Data cube approximation and histograms via wavelets (1998) (250)
Approximations with Minimum Packing Constraint Violation (1992) (240)
Algorithms and Data Structures for External Memory (2008) (235)
External-memory computational geometry (1993) (226)
Optimal prefetching via data compression (1991) (225)
Scalable Sweeping-Based Spatial Join (1998) (222)
Fast and efficient lossless image compression (1993) (220)
Supporting Incremental Join Queries on Ranked Inputs (2001) (220)
e-approximations with minimum packing constraint violation (extended abstract) (1992) (212)
Algorithms for parallel memory, I: Two-level memories (2005) (203)
Average-Case Analysis of Algorithms and Data Structures (1991) (198)
Approximation Algorithms for Geometric Median Problems (1992) (197)
External memory algorithms (1998) (193)
Practical Implementations of Arithmetic Coding (1991) (190)
Dynamic Maintenance of Wavelet-Based Histograms (2000) (184)
Indexing for Data Models with Constraints and Classes (1996) (174)
On two-dimensional indexability and optimal range search indexing (1999) (164)
Optimal dynamic interval management in external memory (1996) (163)
Analysis of arithmetic coding for data compression (1991) (143)
When indexing equals compression: experiments with compressing suffix arrays and applications (2004) (141)
Optimal External Memory Interval Management (2003) (141)
Rank-aware query optimization (2004) (138)
Efficient Bulk Operations on Dynamic R-Trees (1999) (135)
Bkd-Tree: A Dznamic Scalable kd-Tree (2003) (129)
Arithmetic Coding for Data Compression (1994) (122)
Efficient Flow Computation on Massive Grid Terrain Datasets (2003) (121)
Complexity Models for Incremental Computation (1994) (119)
New methods for lossless image compression using arithmetic coding (1991) (118)
Simple randomized mergesort on parallel disks (1996) (115)
Faster methods for random sampling (1984) (111)
Deterministic distribution sort in shared and distributed memory multiprocessors (1993) (111)
Shortest paths in euclidean graphs (2005) (110)
Efficient join processing over uncertain data (2006) (110)
Load Balancing in the Lp Norm (1995) (107)
Adaptive Disk Spindown via Optimal Rent-to-Buy in Probabilistic Environments (1999) (107)
Space-Efficient Framework for Top-k String Retrieval Problems (2009) (104)
Pairing heaps: experiments and analysis (1987) (102)
New Classes for Parallel Complexity: A Study of Unification and Other Complete Problems for P (1986) (99)
XPathLearner: An On-line Self-Tuning Markov Histogram for XML Path Selectivity Estimation (2002) (94)
Efficient searching with linear constraints (1998) (92)
Optimal disk I/O with parallel block transfer (1990) (88)
Blocking for external graph searching (1992) (87)
USeR: A New Framework for Redoing (1984) (87)
Compressed data structures: dictionaries and data-aware measures (2006) (85)
Algorithm 673: Dynamic Huffman coding (1989) (75)
Algorithms for parallel memory, II: Hierarchical multilevel memories (1992) (73)
Estimating alphanumeric selectivity in the presence of wildcards (1996) (72)
Strategic directions in storage I/O issues in large-scale computing (1996) (71)
Proceedings of the thirtieth annual ACM symposium on Theory of computing (1998) (70)
On sorting strings in external memory (extended abstract) (1997) (70)
I/O-Efficient Algorithms for Problems on Grid-Based Terrains (2001) (70)
An efficient algorithm for sequential random sampling (1987) (69)
Greed sort: optimal deterministic sorting on parallel disks (1995) (69)
Large-scale sorting in parallel memories (extended abstract) (1991) (67)
US&R: A New Framework for Redoing (1984) (67)
Implementing I/O-efficient Data Structures Using TPIE (2002) (67)
Geometric Burrows-Wheeler Transform: Linking Range Searching and Text Indexing (2008) (63)
Adaptive rank-aware query optimization in relational databases (2006) (63)
Efficient 3-D range searching in external memory (1996) (62)
Characterizing Web Document Change (2001) (61)
Arithmetic coding for data compression : Data compression (1994) (61)
On Sorting Strings in External Memory (1997) (61)
Indexing for data models with constraints and classes (extended abstract) (1993) (61)
Cylindrical static and kinetic binary space partitions (1997) (59)
Design and analysis of fast text compression based on quasi-arithmetic coding (1993) (59)
I/O-efficient algorithms for contour-line extraction and planar graph blocking (1998) (57)
Parallel lossless image compression using Huffman and arithmetic coding (1992) (57)
Mining deviants in time series data streams (2004) (55)
External memory algorithms and data structures (1999) (54)
Dynamic Generation of Discrete Random Variates (1993) (52)
Inverted indexes for phrases and strings (2011) (51)
SASH: A Self-Adaptive Histogram Set for Dynamically Changing Workloads (2003) (50)
Scalable mining for classification rules in relational databases (1998) (50)
Lower Bounds for Planar Orthogonal Drawings of Graphs (1991) (50)
Parallel Transitive Closure and Point Location in Planar Structures (1991) (49)
Optimal prediction for prefetching in the worst case (1994) (48)
Dynamic maintenance of web indexes using landmarks (2003) (48)
Distributed computing with load-managed active storage (2002) (47)
A Unified Approach for Indexed and Non-Indexed Spatial Joins (2000) (47)
Large-Scale Sorting in Uniform Memory Hierarchies (1993) (46)
Load balancing in the L/sub p/ norm (1995) (45)
The Design and Analysis of BucketSort for Bubble Memory Secondary Storage (1985) (44)
On searching compressed string collections cache-obliviously (2008) (44)
Duality Between Prefetching and Queued Writing with Parallel Disks (2001) (43)
Modeling and optimizing I/O throughput of multiple disks on a bus (1999) (43)
Binary space partitions for fat rectangles (1996) (42)
Efficient sorting using registers and caches (2000) (42)
A Framework for Index Bulk Loading and Dynamization (2001) (41)
Compression, Indexing, and Retrieval for Massive String Data (2010) (40)
Supporting I/O-efficient scientific computation in TPIE (1995) (40)
A data structure for arc insertion and regular path finding (1991) (40)
Online Perfect Matching and Mobile Computing (1995) (40)
External-Memory Algorithms for Processing Line Segments in Geographic Information Systems (1995) (40)
Design and analysis of dynamic Huffman coding (1985) (39)
Lexicographic Bit Allocation for MPEG Video (1997) (39)
Competitive parallel disk prefetching and buffer management (1997) (37)
An efficient I/O interface for optical disks (1985) (36)
Flow computation on massive grids (2001) (36)
Application-controlled paging for a shared cache (1995) (35)
Fast Construction of Wavelet Trees (2014) (35)
Error modeling for hierarchical lossless image compression (1992) (35)
Space-Efficient Frameworks for Top-k String Retrieval (2014) (35)
Theory and practice of I/O-efficient algorithms for multidimensional batched searching problems (1998) (35)
Complexity Results on Learning by Neural Nets (1991) (34)
Compressed Index for Dictionary Matching (2008) (33)
String Retrieval for Multi-pattern Queries (2010) (33)
Faster compressed dictionary matching (2010) (33)
Paradigms for optimal sorting with multiple disks (1993) (32)
Computation of the axial view of a set of isothetic parallelepipeds (1990) (32)
The I/O Complexity of Sorting and Related Problems (Extended Abstract) (1987) (32)
I/O-efficient dynamic point location in monotone planar subdivisions (1999) (32)
I/O-e cient scienti c computation using TPIE (1996) (30)
Bulk operations for space-partitioning trees (2004) (30)
Efficient Maximal Repeat Finding Using the Burrows-Wheeler Transform and Wavelet Tree (2012) (30)
Fast progressive lossless image compression (1994) (29)
Design and Analysis of Coalesced Hashing (1986) (28)
Efficient bundle sorting (2000) (28)
Coping with Uncertainty in Map Learning (1989) (27)
Wavelet Trees: From Theory to Practice (2011) (27)
Efficient cost measures for motion estimation at low bit rates (1998) (27)
Top-k Document Retrieval in External Memory (2013) (26)
Online Data Structures in External Memory (1999) (26)
Approximate data structures with applications (1994) (26)
Efficient Algorithms for MPEG Video Compression (2002) (26)
Optimal cooperative search in fractional cascaded data structures (1990) (25)
A Simplified Technique for Hidden-Line Elimination in Terrains (1991) (25)
Efficient Memory Access in Large-Scale Computation (1991) (25)
Learning in parallel (1988) (24)
Analysis of the Search Performance of Coalesced Hashing (1983) (24)
A Framework for Dynamizing Succinct Data Structures (2007) (24)
Implementations for coalesced hashing (1982) (23)
US&R: A new framework for redoing (Extended Abstract) (1984) (23)
An efficient algorithm for graph edit distance computation (2019) (21)
A non-intrusive approach for classifying residential water events using coincident electricity data (2018) (21)
Optimal parallel algorithms for transitive closure and point location in planar structures (1989) (21)
Distribution sort with randomized cycle (2001) (21)
Faster Compressed Top-k Document Retrieval (2013) (20)
Robust Iterators in ET++ (1992) (20)
Space-Efficient String Indexing for Wildcard Pattern Matching (2014) (20)
Succinct Index for Dynamic Dictionary Matching (2009) (20)
EÆcient Searching with Linear Constraints (1997) (20)
Document Listing for Queries with Excluded Pattern (2012) (20)
A theoretical framework for memory-adaptive algorithms (1999) (19)
Wavelet-Based Cost Estimation for Spatial Queries (2001) (19)
Efficient memory access in large-scale computation (invited paper) (1991) (19)
Categorical range maxima queries (2014) (19)
Efficient cost measures for motion compensation at low bit rates (1996) (19)
A Simple and Efficient Parallel Disk Mergesort (1999) (18)
Practical techniques for constructing binary space partitions for orthogonal rectangles (1997) (18)
Complexity results on learning by neural nets (2004) (17)
Selectivity estimation in the presence of alphanumeric correlations (1997) (17)
Compressed Dictionaries: Space Measures, Data Sets, and Experiments (2006) (16)
Optimal Deterministic Sorting on Parallel Disks (1992) (16)
Optimum algorithms for two random sampling problems (1983) (16)
An Efficient Algorithm for Discovering Motifs in Large DNA Data Sets (2015) (16)
Dynamic Data Structures for Document Collections and Graphs (2015) (16)
Optimal Dynamic Interval Management in External Memory (extended abstract). (1996) (16)
CXHist : An On-line Classification-Based Histogram for XML String Selectivity Estimation (2005) (16)
Fast and Eecient Lossless Image Compression Fast and Efficient Lossless Image Compression (1993) (16)
Explicit bit minimization for motion-compensated video coding (1994) (15)
The SBC-tree: an index for run-length compressed sequences (2008) (15)
Fast compression with a static model in high-order entropy (2004) (15)
Optimal dispatch and equipment sizing of a residential central utility plant for improving rooftop solar integration (2018) (14)
Report of the Working Group on Storage I/O for Large-Scale Computing (1996) (14)
On position restricted substring searching in succinct space (2012) (14)
Indexes for Document Retrieval with Relevance (2013) (14)
Ordered Pattern Matching: Towards Full-Text Retrieval (2006) (14)
Geometric BWT: Compressed Text Indexing via Sparse Suffixes and Range Searching (2015) (14)
Online algorithms for prefetching and caching on parallel disks (2004) (14)
On Entropy-Compressed Text Indexing in External Memory (2009) (14)
I/O-Efficient Compressed Text Indexes: From Theory to Practice (2010) (14)
An efficient parallel algorithm for shortest paths in planar layered digraphs (2005) (14)
Proceedings of the twenty-third annual ACM symposium on Theory of computing (1991) (14)
Cache-Oblivious Index for Approximate String Matching (2007) (13)
Analysis of new variants of coalesced hashing (1984) (13)
A Theory for Memory-Based Learning (2004) (12)
A theory for memory-based learning (1992) (12)
Lower bounds and parallel algorithms for planar orthogonal grid drawings (1991) (12)
Parallel algorithms for unification and other complete problems in p (1984) (12)
Efficient Update of Indexes for Dynamically Changing Web Documents (2007) (12)
I/O-efficient algorithms and environments (1996) (12)
Dynamic algorithms for optimization problems in bounded tree-width graphs (1993) (12)
External-Memory Computational Geometry (Preliminary Version) (1993) (12)
Dictionary Selection Using Partial Matching (1999) (12)
Efficient Graph Similarity Search in External Memory (2017) (12)
Compressed text indexing with wildcards (2011) (11)
Optimal Color Range Reporting in One Dimension (2013) (11)
Analysis of coalesced hashing (1980) (11)
Water Event Categorization Using Sub-Metered Water and Coincident Electricity Data (2018) (11)
Deletion algorithms for hashing that preserve randomness (1982) (11)
Using Vapnik-Chervonenkis Dimension to Analyze the Testing Complexity of Program Segments (1996) (11)
A Practical Implementation of Compressed Suffix Arrays with Applications to Self-Indexing (2014) (11)
Optimal sizing and dispatch for a community-scale potable water recycling facility (2018) (10)
Introduction --Sorting (1985) (10)
Complexity issues in learning by neural nets (1989) (10)
Approximation and learning techniques in database systems (1999) (10)
An Efficient Exact Algorithm for the Motif Stem Search Problem over Large Alphabets (2015) (10)
A Parallel Algorithm for Recognizing Unordered Depth-First Search (1988) (9)
Dynamic Rank/Select Dictionaries with Applications to XML Indexing (2006) (9)
CAMEL: concept annotated image libraries (2000) (9)
Greed Sort: An Optimal External Sorting Algorithm for Multiple Disks (1991) (9)
Text compression via alphabet re-representation (1997) (9)
External Sorting and Permuting (2008) (9)
Practical Implementations of Arithmetic Coding 1 (1992) (9)
Lexicographic bit allocation for MPEG video coding (1997) (8)
Learning to Make Rent-to-Buy Decisions with Systems Applications (1995) (8)
Modeling and optimizing I/O throughput of multiple disks on a bus (summary) (1998) (8)
A Complexity Theoretic Approach to Incremental Computation (1991) (8)
Tuning the coalesced hashing method to obtain optimum performance (1980) (8)
Analysis of Early-Insertion Standard Coalesced Hashing (1983) (8)
Nearly optimal vector quantization via linear programming (1992) (8)
The Maximum Size of Dynamic Data Structures (1991) (8)
External Memory Algorithms: Dealing With Massive Data (2002) (8)
Maximum queue size and hashing with lazy deletion (1991) (8)
I/O Overhead and Parallel VLSI Architectures for Lattice Computations (1990) (8)
Theory and Practice of I/O-Efficient Algorithms for Multidimensional Batched Searching Problems (Extended Abstract) (1998) (8)
Feature reduction based on semantic similarity for graph classification (2020) (8)
An efficient motif finding algorithm for large DNA data sets (2014) (7)
Distribution Sort with Randomized Cycling (2008) (7)
Multiplexing VBR video sequences onto a CBR channel with lexicographic optimization (1997) (7)
Compressed Dictionary Matching with One Error (2011) (7)
Optimal Deterministic Sorting in Parallel Memory Hierarchies (1992) (7)
General Methods for the Analysis of the Maximum Size of Dynamic Data Structures (Extended Abstract) (1989) (7)
Rate-distortion optimizations for motion estimation in low-bit-rate video coding (1996) (7)
MSQ-Index: A Succinct Index for Fast Graph Similarity Search (2016) (6)
Distribution sort with randomizing cycle (2001) (6)
On Optimal Top-K String Retrieval (2012) (6)
A Simple and EÆcient Parallel Disk Mergesort (1999) (6)
Practical Prefetching via Data Compression Practical Prefetching via Data Compression (1993) (6)
Multiple-dictionary compression using partial matching (1995) (6)
Lexicographically optimal smoothing for broadband traffic multiplexing (2002) (6)
DIMACS workshop on External memory algorithms and visualization (1999) (6)
The power of duality for prefetching and sorting with parallel disks (2001) (6)
Compressing Dictionary Matching Index via Sparsification Technique (2015) (6)
Characterizing fusion market entry via an agent-based power plant fleet model (2019) (5)
CS2A: A Compressed Suffix Array-Based Method for Short Read Alignment (2016) (5)
Lexicographically Optimal Rate Control for Video Coding with MPEG Buffer Constraints (1996) (5)
Multimedia retrieval by regions, concepts, and constraints (2001) (5)
Reference sequence selection for motif searches (2015) (5)
Shortest Paths in Euclidean Graphs (Extended Abstract) (1984) (5)
The Object Complexity Model for Hidden-Surface Removal (1999) (5)
Nearly Tight Bounds on the Encoding Length of the Burrows-Wheeler Transform (2008) (4)
An Algorithmic Framework for Compression and Text Indexing ∗ (2005) (4)
External-Memory Graph Algorithms (extended abstract) (1994) (4)
Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, May 1-4, 1999, Atlanta, Georgia, USA (1999) (4)
The complexity of hashing with lazy deletion (2005) (4)
A Data-Aware FM-index (2015) (4)
RefSelect: a reference sequence selection algorithm for planted (l, d) motif search (2016) (4)
Two papers on dynamic Huffman codes (1987) (4)
A Shared-Memory Scheme for Coalesced Hashing (1981) (4)
The Indiana Center for Database Systems at Purdue University (2005) (4)
ANALYSIS OF ARITHMETIC CODING FOR (1991) (4)
Time- and space-efficient maximal repeat finding using the burrows-wheeler transform and wavelet trees (2010) (4)
Compressed Text Indexing and Range Searching (2006) (4)
Constrained querying of multimedia databases: issues and approaches (2001) (4)
Computational Complexity of an Optical Disk Interface (Extended Abstract) (1984) (3)
I/O-Efficient Dynamic Point Location in Monotone Subdivisions (1999) (3)
PSI-RA: A parallel sparse index for read alignment on genomes (2010) (3)
Optimum Algorithms for a Model of Direct Chaining (1985) (3)
Efficient Compression and Indexing for Highly Repetitive DNA Sequence Collections (2020) (3)
Fast Computation of Graph Edit Distance (2017) (3)
Applicable and Robust Geometric Computing (2001) (3)
A lexicographic framework for MPEG rate control (1997) (3)
Output-sensitive generation of the perspective view of isothetic parallelepipeds (1990) (3)
External memory algorithms : DIMACS Workshop External Memory Algorithms and Visualization, May 20-22, 1998 (1999) (3)
Constructing Binary Space Partitions for Orthogonal Rectabgles in Practice (1998) (3)
Proceedings of the 3rd International Workshop on Algorithm Engineering (1999) (3)
Geometric and Spatial Data Structures in External Memory (2018) (3)
A Parallel Algorithm for Planar Orthogonal Grid Drawings (2000) (3)
StemFinder: An efficient algorithm for searching motif stems over large alphabets (2013) (3)
Aggregate Predicate Support in DBMS (2002) (3)
Round-like behavior in multiple disks on a bus (1999) (3)
Entropy-Compressed Indexes for Multidimensional Pattern Matching (2004) (2)
Algorithm Engineering: 3rd International Workshop, WAE’99 London, UK, July 19–21, 1999 Proceedings (1999) (2)
Using computational learning theory to analyze the testing complexity of program segments (1993) (2)
Optimal lexicographic shaping of aggregate streaming data (2005) (2)
General Methods for the Analysis of the Maximum Size of Data Structures (1989) (2)
Fast Progressive Lossless Image Compression Fast Progressive Lossless Image Compression Fast Progressive Lossless Image Compression (1994) (2)
Deletion Algorithms for Coalesced Hashing (1986) (2)
Fast Pattern-Matching via k-bit Filtering Based Text Decomposition (2012) (2)
Boosting Pattern Matching Performance via k-bit Filtering (2010) (1)
Improving solar-induced grid-level flexibility requirements using residential central utility plants (2017) (1)
On competitive online read-many parallel disks scheduling (2005) (1)
Guest Editor's Introduction: Special Issue on Large-Scale Memories. (1994) (1)
Fully Dynamic Techniques for Reachability in Planar sT-graphs (1990) (1)
Compressed data structures with relevance (2012) (1)
Tight competitive ratios for parallel disk prefetching and caching (2008) (1)
Text Compression via Alphabet Re-representation Extended Abstract (1997) (1)
A divide and conquer approach to shortest paths in planar layered digraphs (1992) (1)
Guest editor's introduction (2005) (1)
Optimal Deterministic Sorting on Parallel Processors and Parallel Memory Hierarchies (2001) (1)
Efficient Join Processing over Uncertain Data Technical Report (2005) (1)
Load Balancing in the Euclidean Norm (1995) (1)
cient Searching with Linear Constraints (1)
Compression Based on Quasi-Arithmetic Coding (1994) (1)
Deletion Algorithms for Hashing that Preserve Randomness (detailed abstract) (1981) (1)
Practical Succinct Text Indexes in External Memory (2018) (1)
Analysis of Arithmetic Coding for Data Compression 1 (1992) (1)
Addendum to "Analysis of Some New Variants of Coalesced Hashing" (1985) (1)
Multiparadigm Design Environments (1992) (1)
The Object Complexity Modelfor Hidden-Surface (1995) (1)
Paradigms for EÆcient Design of External Memory Algorithms (1)
Simple Randomized Mergesort on Parallel Disks1 (1996) (1)
Communication issues in large-scale geometric computation (1996) (1)
Application-Controlled Paging for a Shared Cache (extended abstract) (1995) (0)
Design and analysis of lossless and lossy data compression methods with applications to communication and caching (1994) (0)
Design and Analysis of Dynamic Huffman Coding* (extended abstract) (1985) (0)
Programming Techniques and Data Structures (2006) (0)
A United States Patent ( 19 ) 11 Patent Number : 6 , 122 , 379 Barbir ( 45 ) Date of Patent : Sep (2017) (0)
The Performance of In-memory Sorting (1999) (0)
Ranked Document Retrieval in External Memory (2022) (0)
Enhancing Univerity Research through Corporate Engagement and Collaboration (2014) (0)
Information as a Paradigm (2012) (0)
Have Developed Strategies for Estimating Selectivity Lor, a Linear-time Probabilistic Counting Algo- Rithm for Database Applications," Acm Trans. on 8 a Strawman" Random Sampling Scheme Rs (0)
Design and Analysis of Lossless and Lossy Data Compression Methods and Applications to Communication and Caching - Final Report. (1997) (0)
Wavelet-Based Cost Estimation for Spatial Queries ( extended abstract ) (2001) (0)
Proceedings of the Paris C. Kanellakis memorial workshop on Principles of computing & knowledge: Paris C. Kanellakis memorial workshop on the occasion of his 50th birthday (2003) (0)
Rate-Distortion Optimizations for MotionEstimation in Low-Bitrate Video (1995) (0)
Algorithmic techniques to overcome the input/output bottleneck (1998) (0)
Computing with Continuous-Time Liapunov Systems (2007) (0)
CS-- 1995 -01 Coping with Uncertainty in Map Learning (1989) (0)
Compressed Indexes for Fast Search in Sequences (2002) (0)
Optimal Incremental Algorithms for Top-k Joins with User-Defined Join Constraints (2007) (0)
Method for carrying out distribution sorting. (1984) (0)
3 A Prefetching Algorithm Based on Ziv-Lempel (2004) (0)
Strategies for electronics test (1987) (0)
Algorithms for very large spatial databases (2002) (0)
On-line methods for database optimization (2004) (0)
Sequence sorting in secondary storage (1997) (0)
Optimal Prefetching via Data Compression (Extended Abstract) (1991) (0)
Optimal External Memory Interval Management 2003 by Lars Arge and (2003) (0)
Dynamic Generation of Discrete Random Variates 1 (1997) (0)
ACM SIGACT 1999-2000 annual report (2000) (0)
Compressed Data Structures with Relevance ( Invited Keynote ) (2012) (0)
CIndex: compressed indexes for fast retrieval of FASTQ files (2021) (0)
Optimum Algorithms for Two Random Sampling Problems (Extended Abstract) (1983) (0)
Editor's foreword special issue on parallel and distributed computing, Part I (1988) (0)
Multiple-Dictionary Coding Using Partial Matching. (1995) (0)
Fast and Efficient Lossless Image Compression Fast and Eecient Lossless Image Compression Fast and Efficient Lossless Image Compression (1994) (0)
An Application-Controlled Paging Algorithm for a Shared Cache (1995) (0)
Algorithms for Processing Large-Scale Data (1997) (0)
Opportunities for urban water systems to deliver demand-side benefits to the electric grid (2018) (0)
PCK50 - Principles of Computing & Knowledge, Paris C. Kanellakis Memorial Workshop, San Diego, California, USA, June 8th, 2003 (2003) (0)
Editor's foreword special issue on parallel and distributed computing, Part II (2005) (0)
To: Provosts, Vice Presidents, Vice Provosts, Deans, Directors, and Heads of Schools, Divisions, Departments, and Offices (2008) (0)

This paper list is powered by the following services:

Other Resources About Jeffrey Vitter

en.wikipedia.org

What Schools Are Affiliated With Jeffrey Vitter?

Jeffrey Vitter is affiliated with the following schools:

Image Attributions

Image Source for Jeffrey Vitter