Tuning the Coalesced Hashing Method to Obtain Optimum Performance (Detailed Abstract) - Jeffrey Scott Vitter (FOCS, 1980)

Analysis of coalesced hashing. - Jeffrey Scott Vitter (1980)

Deletion Algorithms for Hashing that Preserve Randomness (detailed abstract) - Jeffrey Scott Vitter (FOCS, 1981)

A Shared-Memory Scheme for Coalesced Hashing. - Jeffrey Scott Vitter (Inf. Process. Lett., 1981)

Implementations for Coalesced Hashing. - Jeffrey Scott Vitter (Commun. ACM, 1982)

Deletion Algorithms for Hashing That Preserve Randomness. - Jeffrey Scott Vitter (J. Algorithms, 1982)

Optimum Algorithms for Two Random Sampling Problems (Extended Abstract) - Jeffrey Scott Vitter (FOCS, 1983)

Analysis of Early-Insertion Standard Coalesced Hashing. - Wen-Chin Chen; Jeffrey Scott Vitter (SIAM J. Comput., 1983)

Analysis of the Search Performance of Coalesced Hashing - Jeffrey Scott Vitter (J. ACM, 1983)

Parallel algorithms for unification and other complete problems in p. - Jeffrey Scott Vitter; Roger A. Simons (ACM Annual Conference, 1984)

Shortest Paths in Euclidean Graphs (Extended Abstract) - Robert Sedgewick; Jeffrey Scott Vitter (FOCS, 1984)

Computational Complexity of an Optical Disk Interface (Extended Abstract). - Jeffrey Scott Vitter (ICALP, 1984)

USeR: A New Framework for Redoing. - Jeffrey Scott Vitter (Software Development Environments (SDE), 1984)

Faster Methods for Random Sampling. - Jeffrey Scott Vitter (Commun. ACM, 1984)

US&R: A New Framework for Redoing. - Jeffrey Scott Vitter (IEEE Softw., 1984)

Analysis of New Variants of Coalesced Hashing. - Wen-Chin Chen; Jeffrey Scott Vitter (ACM Trans. Database Syst., 1984)

Design and Analysis of Dynamic Huffman Coding (Extended Abstract) - Jeffrey Scott Vitter (FOCS, 1985)

Optimum Algorithms for a Model of Direct Chaining. - Jeffrey Scott Vitter; Wen-Chin Chen (SIAM J. Comput., 1985)

The Design and Analysis of BucketSort for Bubble Memory Secondary Storage. - Eugene E. Lindstrom; Jeffrey Scott Vitter (IEEE Trans. Computers, 1985)

Addendum to "Analysis of Some New Variants of Coalesced Hashing". - Wen-Chin Chen; Jeffrey Scott Vitter (ACM Trans. Database Syst., 1985)

An Efficient I/O Interface for Optical Disks. - Jeffrey Scott Vitter (ACM Trans. Database Syst., 1985)

Random Sampling with a Reservoir. - Jeffrey Scott Vitter (ACM Trans. Math. Softw., 1985)

Shortest Paths in Euclidean Graphs. - Robert Sedgewick; Jeffrey Scott Vitter (Algorithmica, 1986)

The Complexity of Hashing with Lazy Deletion. - Christopher J. Van Wyk; Jeffrey Scott Vitter (Algorithmica, 1986)

Deletion Algorithms for Coalesced Hashing. - Wen-Chin Chen; Jeffrey Scott Vitter (Comput. J., 1986)

New Classes for Parallel Complexity: A Study of Unification and Other Complete Problems for P. - Jeffrey Scott Vitter; Roger A. Simons (IEEE Trans. Computers, 1986)

The I/O Complexity of Sorting and Related Problems (Extended Abstract). - Alok Aggarwal; Jeffrey Scott Vitter (ICALP, 1987)

Pairing Heaps: Experiments and Analysis. - John T. Stasko; Jeffrey Scott Vitter (Commun. ACM, 1987)

Design and analysis of dynamic Huffman codes. - Jeffrey Scott Vitter (J. ACM, 1987)

An efficient algorithm for sequential random sampling. - Jeffrey Scott Vitter (ACM Trans. Math. Softw., 1987)

Editor's Foreword: Special Issue on Parallel and Distributed Computing, Part I. - Jeffrey Scott Vitter (Algorithmica, 1988)

Editor's Foreword: Special Issue on Parallel and Distributed Computing, Part II. - Jeffrey Scott Vitter (Algorithmica, 1988)

The Input/Output Complexity of Sorting and Related Problems. - Alok Aggarwal; Jeffrey Scott Vitter (Commun. ACM, 1988)

A Parallel Algorithm for Recognizing Unordered Depth-First Search. - Catherine A. Schevon; Jeffrey Scott Vitter (Inf. Process. Lett., 1988)

Complexity Issues in Learning by Neural Nets. - Jyh-Han Lin; Jeffrey Scott Vitter (COLT, 1989)

General Methods for the Analysis of the Maximum Size of Dynamic Data Structures (Extended Abstract). - Claire Kenyon-Mathieu; Jeffrey Scott Vitter (ICALP, 1989)

Optimal Parallel Algorithms for Transitive Closure and Point Location in Planar Structures. - Roberto Tamassia; Jeffrey Scott Vitter (SPAA, 1989)

Algorithm 673: Dynamic Huffman coding. - Jeffrey Scott Vitter (ACM Trans. Math. Softw., 1989)

Average-Case Analysis of Algorithms and Data Structures. - Jeffrey Scott Vitter; Philippe Flajolet (Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (A), 1990)

A Data Structure for Arc Insertion and Regular Path Finding. - Adam L. Buchsbaum; Paris C. Kanellakis; Jeffrey Scott Vitter (SODA, 1990)

Optimal Disk I/O with Parallel Block Transfer (Extended Abstract) - Jeffrey Scott Vitter; Elizabeth A. M. Shriver (STOC, 1990)

Computation of the axial view of a set of isothetic parallelepipeds. - Franco P. Preparata; Jeffrey Scott Vitter; Mariette Yvinec (ACM Trans. Graph., 1990)

Optimal Prefetching via Data Compression (Extended Abstract) - Jeffrey Scott Vitter; P. Krishnan (FOCS, 1991)

Large-Scale Sorting in Parallel Memories (Extended Abstract). - Mark H. Nodine; Jeffrey Scott Vitter (SPAA, 1991)

Lower bounds and parallel algorithms for planar orthogonal grid drawings. - Roberto Tamassia; Ioannis G. Tollis; Jeffrey Scott Vitter (SPDP, 1991)

Efficient Memory Access in Large-Scale Computation. - Jeffrey Scott Vitter (STACS, 1991)

Maximum Queue Size and Hashing with Lazy Deletion. - Claire Kenyon-Mathieu; Jeffrey Scott Vitter (Algorithmica, 1991)

A Data Dtructure for Arc Insertion and Regular Path Finding. - Adam L. Buchsbaum; Paris C. Kanellakis; Jeffrey Scott Vitter (Ann. Math. Artif. Intell., 1991)

Lower Bounds for Planar Orthogonal Drawings of Graphs. - Roberto Tamassia; Ioannis G. Tollis; Jeffrey Scott Vitter (Inf. Process. Lett., 1991)

Complexity Results on Learning by Neural Nets. - Jyh-Han Lin; Jeffrey Scott Vitter (Mach. Learn., 1991)

The Maximum Size of Dynamic Data Structures. - Claire Kenyon-Mathieu; Jeffrey Scott Vitter (SIAM J. Comput., 1991)

Parallel Transitive Closure and Point Location in Planar Structures. - Roberto Tamassia; Jeffrey Scott Vitter (SIAM J. Comput., 1991)

I/O Overhead and Parallel VLSI Architectures for Lattice Computations. - Mark H. Nodine; Daniel P. Lopresti; Jeffrey Scott Vitter (IEEE Trans. Computers, 1991)

Error Modeling for Hierarchical Lossless Image Compression. - Paul G. Howard; Jeffrey Scott Vitter (Data Compression Conference, 1992)

Nearly Optimal Vecot Quantization via Linear Programming. - Jyh-Han Lin; Jeffrey Scott Vitter (Data Compression Conference, 1992)

A Divide and Conquer Approach to Shortest Paths in Planar Layered Digraphs. - Sairam Sairam; Roberto Tamassia; Jeffrey Scott Vitter (SPDP, 1992)

epsilon-Approximations with Minimum Packing Constraint Violation (Extended Abstract) - Jyh-Han Lin; Jeffrey Scott Vitter (STOC, 1992)

Output-Sensitive Generation of the Perspective View of Isothetic Parallelepipeds. - Franco P. Preparata; Jeffrey Scott Vitter; Mariette Yvinec (Algorithmica, 1992)

Approximation Algorithms for Geometric Median Problems. - Jyh-Han Lin; Jeffrey Scott Vitter (Inf. Process. Lett., 1992)

Analysis of Arithmetic Coding for Data Compression. - Paul G. Howard; Jeffrey Scott Vitter (Inf. Process. Manag., 1992)

New Methods for Lossless Image Compression Using Arithmetic Coding. - Paul G. Howard; Jeffrey Scott Vitter (Inf. Process. Manag., 1992)

Learning in Parallel - Jeffrey Scott Vitter; Jyh-Han Lin (Inf. Comput., 1992)

Using computational learning theory to analyze the testing complexity of program segments. - Kathleen Romanik; Jeffrey Scott Vitter (COMPSAC, 1993)

Fast and Efficient Lossless Image Compression. - Paul G. Howard; Jeffrey Scott Vitter (Data Compression Conference, 1993)

External-Memory Computational Geometry (Preliminary Version) - Michael T. Goodrich; Jyh-Jong Tsay; Darren Erik Vengroff; Jeffrey Scott Vitter (FOCS, 1993)

Dynamic algorithms for optimization problems in bounded tree-width graphs. - Robert F. Cohen; Sairam Sairam; Roberto Tamassia; Jeffrey Scott Vitter (IPCO, 1993)

Practical Prefetching via Data Compression. - Kenneth M. Curewitz; P. Krishnan; Jeffrey Scott Vitter (SIGMOD Conference, 1993)

Deterministic Distribution Sort in Shared and Distributed Memory Multiprocessors. - Mark H. Nodine; Jeffrey Scott Vitter (SPAA, 1993)

A Complexity Theoretic Approach to Incremental Computation. - Sairam Sairam; Jeffrey Scott Vitter; Roberto Tamassia (STACS, 1993)

A Simplified Technique for Hidden-Line Elimination in Terrains. - Franco P. Preparata; Jeffrey Scott Vitter (Int. J. Comput. Geom. Appl., 1993)

Large-Scale Sorting in Uniform Memory Hierarchies. - Jeffrey Scott Vitter; Mark H. Nodine (J. Parallel Distributed Comput., 1993)

Explicit Bit Minimization for Motion-Compensated Video Coding. - Dzung T. Hoang; Philip M. Long; Jeffrey Scott Vitter (Data Compression Conference, 1994)

Approximate Data Structures with Applications. - Yossi Matias; Jeffrey Scott Vitter; Neal E. Young (SODA, 1994)

Guest Editor's Introduction: Special Issue on Large-Scale Memories. - Jeffrey Scott Vitter (Algorithmica, 1994)

Algorithms for Parallel Memory I: Two-Level Memories. - Jeffrey Scott Vitter; Elizabeth A. M. Shriver (Algorithmica, 1994)

Algorithms for Parallel Memory II: Hierarchical Multilevel Memories. - Jeffrey Scott Vitter; Elizabeth A. M. Shriver (Algorithmica, 1994)

Design and Analysis of Fast Text Compression Based on Quasi-Arithmetic Coding. - Paul G. Howard; Jeffrey Scott Vitter (Inf. Process. Manag., 1994)

A Theory for Memory-Based Learning. - Jyh-Han Lin; Jeffrey Scott Vitter (Mach. Learn., 1994)

Arithmetic coding for data compression. - Paul G. Howard; Jeffrey Scott Vitter (Proc. IEEE, 1994)

Complexity Models for Incremental Computation. - Peter Bro Miltersen; Sairam Subramanian; Jeffrey Scott Vitter; Roberto Tamassia (Theor. Comput. Sci., 1994)

Multiple-Dictionary Coding Using Partial Matching. - Dzung T. Hoang; Philip M. Long; Jeffrey Scott Vitter (Data Compression Conference, 1995)

External-Memory Algorithms for Processing Line Segments in Geographic Information Systems (Extended Abstract). - Lars Arge; Darren Erik Vengroff; Jeffrey Scott Vitter (ESA, 1995)

Load Balancing in the Lp Norm. - Baruch Awerbuch; Yossi Azar; Edward F. Grove; Ming-Yang Kao; P. Krishnan; Jeffrey Scott Vitter (FOCS, 1995)

Application-Controlled Paging for a Shared Cache (Extended Abstract). - Rakesh D. Barve; Edward F. Grove; Jeffrey Scott Vitter (FOCS, 1995)

Learning to Make Rent-to-Buy Decisions with Systems Applications. - P. Krishnan; Philip M. Long; Jeffrey Scott Vitter (ICML, 1995)

External-Memory Graph Algorithms. - Yi-Jen Chiang; Michael T. Goodrich; Edward F. Grove; Roberto Tamassia; Darren Erik Vengroff; Jeffrey Scott Vitter (SODA, 1995)

Supporting I/O-efficient scientific computation in TPIE. - Darren Erik Vengroff; Jeffrey Scott Vitter (SPDP, 1995)

Online Perfect Matching and Mobile Computing. - Edward F. Grove; Ming-Yang Kao; P. Krishnan; Jeffrey Scott Vitter (WADS, 1995)

An Efficient Parallel Algorithm for Shortest Paths in Planar Layered Digraphs. - Sairam Subramanian; Roberto Tamassia; Jeffrey Scott Vitter (Algorithmica, 1995)

Greed Sort: Optimal Deterministic Sorting on Parallel Disks. - Mark H. Nodine; Jeffrey Scott Vitter (J. ACM, 1995)

Efficient Cost Measures for Motion Compensation at Low Bit Rates (Extended Abstract). - Dzung T. Hoang; Philip M. Long; Jeffrey Scott Vitter (Data Compression Conference, 1996)

Binary Search Partitions for Fat Rectangles. - Pankaj K. Agarwal; Edward F. Grove; T. M. Murali 001; Jeffrey Scott Vitter (FOCS, 1996)

Optimal Dynamic Interval Management in External Memory (extended abstract). - Lars Arge; Jeffrey Scott Vitter (FOCS, 1996)

Estimating Alphanumeric Selectivity in the Presence of Wildcards. - P. Krishnan; Jeffrey Scott Vitter; Balakrishna R. Iyer (SIGMOD Conference, 1996)

Efficient 3-D Range Searching in External Memory. - Darren Erik Vengroff; Jeffrey Scott Vitter (STOC, 1996)

Blocking for External Graph Searching. - Mark H. Nodine; Michael T. Goodrich; Jeffrey Scott Vitter (Algorithmica, 1996)

Optimal Cooperative Search in Fractional Cascaded Data Structures. - Roberto Tamassia; Jeffrey Scott Vitter (Algorithmica, 1996)

Strategic Directions in Storage I/O Issues in Large-Scale Computing. - Garth A. Gibson; Jeffrey Scott Vitter; John Wilkes (ACM Comput. Surv., 1996)

I/O-Efficient Algorithms and Environments. - Darren Erik Vengroff; Jeffrey Scott Vitter (ACM Comput. Surv., 1996)

Communication Issues in Large-Scale Geometric Computation. - Jeffrey Scott Vitter (ACM Comput. Surv., 1996)

Using Vapnik-Chervonenkis Dimension to Analyze the Testing Complexity of Program Segments. - Kathleen Romanik; Jeffrey Scott Vitter (Inf. Comput., 1996)

Parallel Lossless Image Compression Using Huffman and Arithmetic Coding. - Paul G. Howard; Jeffrey Scott Vitter (Inf. Process. Lett., 1996)

Optimal Prefetching via Data Compression. - Jeffrey Scott Vitter; P. Krishnan (J. ACM, 1996)

Indexing for Data Models with Constraints and Classes. - Paris C. Kanellakis; Sridhar Ramaswamy; Darren Erik Vengroff; Jeffrey Scott Vitter (J. Comput. Syst. Sci., 1996)

Practical Techniques for Constructing Binary Space Partitions for Orthogonal Rectangles. - Pankaj K. Agarwal; T. M. Murali 001; Jeffrey Scott Vitter (SCG, 1997)

A Lexicographic Framework for MPEG Rate Control. - Dzung T. Hoang; Elliot L. Linzer; Jeffrey Scott Vitter (Data Compression Conference, 1997)

Selectivity Estimation in the Presence of Alphanumeric Correlations. - Min Wang 001; Jeffrey Scott Vitter; Balakrishna R. Iyer (ICDE, 1997)

Multiplexing VBR Video Sequences onto a CBR Channel with Lexicographic Optimization. - Dzung T. Hoang; Jeffrey Scott Vitter (ICIP (1), 1997)

Lexicographic Bit Allocation for MPEG Video Coding. - Dzung T. Hoang; Jeffrey Scott Vitter; Elliot L. Linzer (ICIP (1), 1997)

Sequence sorting in secondary storage. - Lars Arge; Paolo Ferragina; Roberto Grossi; Jeffrey Scott Vitter (SEQUENCES, 1997)

On Sorting Strings in External Memory (Extended Abstract). - Lars Arge; Paolo Ferragina; Roberto Grossi; Jeffrey Scott Vitter (STOC, 1997)

Lexicographic Bit Allocation for MPEG Video. - Dzung T. Hoang; Elliot L. Linzer; Jeffrey Scott Vitter (J. Vis. Commun. Image Represent., 1997)

Coping with Uncertainty in Map Learning. - Kenneth Basye; Thomas L. Dean; Jeffrey Scott Vitter (Mach. Learn., 1997)

Simple Randomized Mergesort on Parallel Disks. - Rakesh D. Barve; Edward F. Grove; Jeffrey Scott Vitter (Parallel Comput., 1997)

Data Cube Approximation and Histograms via Wavelets. - Jeffrey Scott Vitter; Min Wang 001; Balakrishna R. Iyer (CIKM, 1998)

Constructing Binary Space Partitions for Orthogonal Rectabgles in Practice. - T. M. Murali 001; Pankaj K. Agarwal; Jeffrey Scott Vitter (ESA, 1998)

Scalable Mining for Classification Rules in Relational Databases. - Min Wang 001; Balakrishna R. Iyer; Jeffrey Scott Vitter (IDEAS, 1998)

External Memory Algorithms. - Jeffrey Scott Vitter (PODS, 1998)

Modeling and Optimizing I/O Throughput of Multiple Disks on a Bus (Summary). - Rakesh D. Barve; Elizabeth A. M. Shriver; Phillip B. Gibbons; Bruce Hillyer; Yossi Matias; Jeffrey Scott Vitter (SIGMETRICS, 1998)

Wavelet-Based Histograms for Selectivity Estimation. - Yossi Matias; Jeffrey Scott Vitter; Min Wang 001 (SIGMOD Conference, 1998)

I/O-Efficient Algorithms for Contour-line Extraction and Planar Graph Blocking (Extended Abstract). - Pankaj K. Agarwal; Lars Arge; T. M. Murali 001; Kasturi R. Varadarajan; Jeffrey Scott Vitter (SODA, 1998)

Theory and Practice of I/O-Efficient Algorithms for Multidimensional Batched Searching Problems (Extended Abstract). - Lars Arge; Octavian Procopiuc; Sridhar Ramaswamy; Torsten Suel; Jeffrey Scott Vitter (SODA, 1998)

Scalable Sweeping-Based Spatial Join. - Lars Arge; Octavian Procopiuc; Sridhar Ramaswamy; Torsten Suel; Jeffrey Scott Vitter (VLDB, 1998)

Optimal Prediction for Prefetching in the Worst Case. - P. Krishnan; Jeffrey Scott Vitter (SIAM J. Comput., 1998)

Efficient cost measures for motion estimation at low bit rates. - Dzung T. Hoang; Philip M. Long; Jeffrey Scott Vitter (IEEE Trans. Circuits Syst. Video Technol., 1998)

A Theoretical Framework for Memory-Adaptive Algorithms. - Rakesh D. Barve; Jeffrey Scott Vitter (FOCS, 1999)

Online Data Structures in External Memory. - Jeffrey Scott Vitter (ICALP, 1999)

Round-Like Behavior in Multiple Disks on a Bus. - Rakesh D. Barve; Phillip B. Gibbons; Bruce Hillyer; Yossi Matias; Elizabeth A. M. Shriver; Jeffrey Scott Vitter (IOPADS, 1999)

On Two-Dimensional Indexability and Optimal Range Search Indexing. - Lars Arge; Vasilis Samoladas; Jeffrey Scott Vitter (PODS, 1999)

Modeling and Optimizing I/O Throughput of Multiple Disks on a Bus. - Rakesh D. Barve; Elizabeth A. M. Shriver; Phillip B. Gibbons; Bruce Hillyer; Yossi Matias; Jeffrey Scott Vitter (SIGMETRICS, 1999)

Approximate Computation of Multidimensional Aggregates of Sparse Data Using Wavelets. - Jeffrey Scott Vitter; Min Wang 001 (SIGMOD Conference, 1999)

I/O-Efficient Dynamic Point Location in Monotone Planar Subdivisions. - Pankaj K. Agarwal; Lars Arge; Gerth Stølting Brodal; Jeffrey Scott Vitter (SODA, 1999)

Adaptive Disk Spindown via Optimal Rent-to-Buy in Probabilistic Environments. - P. Krishnan; Philip M. Long; Jeffrey Scott Vitter (Algorithmica, 1999)

The Object Complexity Model for Hidden-Surface Removal. - Edward F. Grove; T. M. Murali 001; Jeffrey Scott Vitter (Int. J. Comput. Geom. Appl., 1999)

Dictionary Selection Using Partial Matching. - Dzung T. Hoang; Philip M. Long; Jeffrey Scott Vitter (Inf. Sci., 1999)

Text compression via alphabet re-representation. - Philip M. Long; Apostol Natsev; Jeffrey Scott Vitter (Neural Networks, 1999)

A Unified Approach for Indexed and Non-Indexed Spatial Joins. - Lars Arge; Octavian Procopiuc; Sridhar Ramaswamy; Torsten Suel; Jan Vahrenhold; Jeffrey Scott Vitter (EDBT, 2000)

Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract). - Roberto Grossi; Jeffrey Scott Vitter (STOC, 2000)

Dynamic Maintenance of Wavelet-Based Histograms. - Yossi Matias; Jeffrey Scott Vitter; Min Wang 001 (VLDB, 2000)

Cylindrical static and kinetic binary space partitions. - Pankaj K. Agarwal; Leonidas J. Guibas; T. M. Murali 001; Jeffrey Scott Vitter (Comput. Geom., 2000)

Competitive Parallel Disk Prefetching and Buffer Management. - Rakesh D. Barve; Mahesh Kallahalla; Peter J. Varman; Jeffrey Scott Vitter (J. Algorithms, 2000)

Efficient Searching with Linear Constraints. - Pankaj K. Agarwal; Lars Arge; Jeff Erickson 001; Paolo Giulio Franciosa; Jeffrey Scott Vitter (J. Comput. Syst. Sci., 2000)

A Parallel Algorithm for Planar Orthogonal Grid Drawings. - Roberto Tamassia; Ioannis G. Tollis; Jeffrey Scott Vitter (Parallel Process. Lett., 2000)

Binary Space Partitions for Fat Rectangles. - Pankaj K. Agarwal; Edward F. Grove; T. M. Murali 001; Jeffrey Scott Vitter (SIAM J. Comput., 2000)

Application-Controlled Paging for a Shared Cache. - Rakesh D. Barve; Edward F. Grove; Jeffrey Scott Vitter (SIAM J. Comput., 2000)

ACM SIGACT 1999-2000 annual report. - Jeffrey Scott Vitter (SIGACT News, 2000)

Flow Computation on Massive Grids. - Laura Toma; Rajiv Wickremesinghe; Lars Arge; Jeffrey S. Chase; Jeffrey Scott Vitter; Patrick N. Halpin; Dean L. Urban (ACM-GIS, 2001)

A Framework for Index Bulk Loading and Dynamization. - Pankaj K. Agarwal; Lars Arge; Octavian Procopiuc; Jeffrey Scott Vitter (ICALP, 2001)

Distribution sort with randomizing cycle. - Jeffrey Scott Vitter; David A. Hutchinson (SODA, 2001)

The power of duality for prefetching and sorting with parallel disks. - David A. Hutchinson; Peter Sanders 001; Jeffrey Scott Vitter (SPAA, 2001)

CAMEL: concept annotated image libraries. - Apostol Natsev; Atul Chadha; Basuki Soetarman; Jeffrey Scott Vitter (Storage and Retrieval for Media Databases, 2001)

Constrained querying of multimedia databases: issues and approaches. - Apostol Natsev; John R. Smith; Yuan-Chi Chang; Chung-Sheng Li; Jeffrey Scott Vitter (Storage and Retrieval for Media Databases, 2001)

Wavelet-Based Cost Estimation for Spatial Queries. - Min Wang 001; Jeffrey Scott Vitter; Lipyeow Lim; Sriram Padmanabhan (SSTD, 2001)

Supporting Incremental Join Queries on Ranked Inputs. - Apostol Natsev; Yuan-Chi Chang; John R. Smith; Chung-Sheng Li; Jeffrey Scott Vitter (VLDB, 2001)

Characterizing Web Document Change. - Lipyeow Lim; Min Wang 001; Sriram Padmanabhan; Jeffrey Scott Vitter; Ramesh C. Agarwal (WAIM, 2001)

External memory algorithms and data structures. - Jeffrey Scott Vitter (ACM Comput. Surv., 2001)

I/O-Efficient Algorithms for Problems on Grid-Based Terrains. - Lars Arge; Laura Toma; Jeffrey Scott Vitter (ACM J. Exp. Algorithmics, 2001)

Aggregate Predicate Support in DBMS. - Apostol Natsev; Gene Y. C. Fuh; Weidong Chen 008; Chi-Huang Chiu; Jeffrey Scott Vitter (Australasian Database Conference, 2002)

Implementing I/O-efficient Data Structures Using TPIE. - Lars Arge; Octavian Procopiuc; Jeffrey Scott Vitter (ESA, 2002)

Distributed Computing with Load-Managed Active Storage. - Rajiv Wickremesinghe; Jeffrey S. Chase; Jeffrey Scott Vitter (HPDC, 2002)

Compressed Indexes for Fast Search in Sequences. - Jeffrey Scott Vitter; Roberto Grossi (JCIS, 2002)

Lexicographically optimal smoothing for broadband traffic multiplexing. - Stergios V. Anastasiadis; Peter J. Varman; Jeffrey Scott Vitter; Ke Yi 001 (PODC, 2002)

XPathLearner: An On-line Self-Tuning Markov Histogram for XML Path Selectivity Estimation. - Lipyeow Lim; Min Wang 001; Sriram Padmanabhan; Jeffrey Scott Vitter; Ronald Parr (VLDB, 2002)

Efficient Bulk Operations on Dynamic R-Trees. - Lars Arge; Klaus H. Hinrichs; Jan Vahrenhold; Jeffrey Scott Vitter (Algorithmica, 2002)

Efficient Sorting Using Registers and Caches. - Rajiv Wickremesinghe; Lars Arge; Jeffrey S. Chase; Jeffrey Scott Vitter (ACM J. Exp. Algorithmics, 2002)

A Simple and Efficient Parallel Disk Mergesort. - Rakesh D. Barve; Jeffrey Scott Vitter (Theory Comput. Syst., 2002)

High-order entropy-compressed text indexes. - Roberto Grossi; Ankur Gupta 003; Jeffrey Scott Vitter (SODA, 2003)

Bkd-Tree: A Dznamic Scalable kd-Tree. - Octavian Procopiuc; Pankaj K. Agarwal; Lars Arge; Jeffrey Scott Vitter (SSTD, 2003)

SASH: A Self-Adaptive Histogram Set for Dynamically Changing Workloads. - Lipyeow Lim; Min Wang 001; Jeffrey Scott Vitter (VLDB, 2003)

Dynamic maintenance of web indexes using landmarks. - Lipyeow Lim; Min Wang 001; Sriram Padmanabhan; Jeffrey Scott Vitter; Ramesh C. Agarwal (WWW, 2003)

Efficient Flow Computation on Massive Grid Terrain Datasets. - Lars Arge; Jeffrey S. Chase; Patrick N. Halpin; Laura Toma; Jeffrey Scott Vitter; Dean L. Urban; Rajiv Wickremesinghe (GeoInformatica, 2003)

Dynamic Generation of Discrete Random Variates. - Yossi Matias; Jeffrey Scott Vitter; Wen-Chun Ni (Theory Comput. Syst., 2003)

Optimal External Memory Interval Management. - Lars Arge; Jeffrey Scott Vitter (SIAM J. Comput., 2003)

Fast Compression with a Static Model in High-Order Entropy. - Luca Foschini 002; Roberto Grossi; Ankur Gupta 003; Jeffrey Scott Vitter (Data Compression Conference, 2004)

Bulk Operations for Space-Partitioning Trees. - Thanaa M. Ghanem; Rahul Shah 001; Mohamed F. Mokbel; Walid G. Aref; Jeffrey Scott Vitter (ICDE, 2004)

Rank-aware Query Optimization. - Ihab F. Ilyas; Rahul Shah 001; Walid G. Aref; Jeffrey Scott Vitter; Ahmed K. Elmagarmid (SIGMOD Conference, 2004)

When indexing equals compression: experiments with compressing suffix arrays and applications. - Roberto Grossi; Ankur Gupta 003; Jeffrey Scott Vitter (SODA, 2004)

Online algorithms for prefetching and caching on parallel disks. - Rahul Shah 001; Peter J. Varman; Jeffrey Scott Vitter (SPAA, 2004)

Mining Deviants in Time Series Data Streams. - S. Muthukrishnan 001; Rahul Shah 001; Jeffrey Scott Vitter (SSDBM, 2004)

Efficient Indexing Methods for Probabilistic Threshold Queries over Uncertain Data. - Reynold Cheng; Yuni Xia; Sunil Prabhakar 001; Rahul Shah 001; Jeffrey Scott Vitter (VLDB, 2004)

Geometric and Spatial Data Structures in External Memory. - Jeffrey Scott Vitter (Handbook of Data Structures and Applications, 2004)

On competitive online read-many parallel disks scheduling. - Rahul Shah 001; Peter J. Varman; Jeffrey Scott Vitter (SPAA, 2005)

CXHist : An On-line Classification-Based Histogram for XML String Selectivity Estimation. - Lipyeow Lim; Min Wang 001; Jeffrey Scott Vitter (VLDB, 2005)

Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching. - Roberto Grossi; Jeffrey Scott Vitter (SIAM J. Comput., 2005)

Duality Between Prefetching and Queued Writing with Parallel Disks. - David A. Hutchinson; Peter Sanders 001; Jeffrey Scott Vitter (SIAM J. Comput., 2005)

The Indiana Center for Database Systems at Purdue University. - Mourad Ouzzani; Walid G. Aref; Elisa Bertino; Ann Christine Catlin; Christopher W. Clifton; Wing-Kai Hon; Ahmed K. Elmagarmid; Arif Ghafoor; Susanne E. Hambrusch; Sunil Prabhakar 001; Jeffrey Scott Vitter; Xiang Zhang (SIGMOD Rec., 2005)

Optimal Lexicographic Shaping of Aggregate Streaming Data. - Stergios V. Anastasiadis; Peter J. Varman; Jeffrey Scott Vitter; Ke Yi 001 (IEEE Trans. Computers, 2005)

Efficient join processing over uncertain data. - Reynold Cheng; Sarvjeet Singh; Sunil Prabhakar 001; Rahul Shah 001; Jeffrey Scott Vitter; Yuni Xia (CIKM, 2006)

Compressed Dictionaries: Space Measures, Data Sets, and Experiments. - Ankur Gupta 003; Wing-Kai Hon; Rahul Shah 001; Jeffrey Scott Vitter (WEA, 2006)

Algorithms and Data Structures for External Memory. - Jeffrey Scott Vitter (Found. Trends Theor. Comput. Sci., 2006)

Distribution sort with randomized cycling. - Jeffrey Scott Vitter; David A. Hutchinson (J. ACM, 2006)

Efficient Bundle Sorting. - Yossi Matias; Eran Segal; Jeffrey Scott Vitter (SIAM J. Comput., 2006)

When indexing equals compression: Experiments with compressing suffix arrays and applications. - Luca Foschini 002; Roberto Grossi; Ankur Gupta 003; Jeffrey Scott Vitter (ACM Trans. Algorithms, 2006)

Adaptive rank-aware query optimization in relational databases. - Ihab F. Ilyas; Walid G. Aref; Ahmed K. Elmagarmid; Hicham G. Elmongui; Rahul Shah 001; Jeffrey Scott Vitter (ACM Trans. Database Syst., 2006)

A Framework for Dynamizing Succinct Data Structures. - Ankur Gupta 003; Wing-Kai Hon; Rahul Shah 001; Jeffrey Scott Vitter (ICALP, 2007)

Efficient Update of Indexes for Dynamically Changing Web Documents. - Lipyeow Lim; Min Wang 001; Sriram Padmanabhan; Jeffrey Scott Vitter; Ramesh C. Agarwal (World Wide Web, 2007)

External-Memory Algorithms for Processing Line Segments in Geographic Information Systems. - Lars Arge; Darren Erik Vengroff; Jeffrey Scott Vitter (Algorithmica, 2007)

Compressed data structures: Dictionaries and data-aware measures. - Ankur Gupta 003; Wing-Kai Hon; Rahul Shah 001; Jeffrey Scott Vitter (Theor. Comput. Sci., 2007)

Nearly Tight Bounds on the Encoding Length of the Burrows-Wheeler Transform. - Ankur Gupta 003; Roberto Grossi; Jeffrey Scott Vitter (ANALCO, 2008)

Geometric Burrows-Wheeler Transform: Linking Range Searching and Text Indexing. - Yu-Feng Chien; Wing-Kai Hon; Rahul Shah 001; Jeffrey Scott Vitter (DCC, 2008)

Compressed Index for Dictionary Matching. - Wing-Kai Hon; Tak Wah Lam; Rahul Shah 001; Siu-Lung Tam; Jeffrey Scott Vitter (DCC, 2008)

The SBC-tree: an index for run-length compressed sequences. - Mohamed Y. Eltabakh; Wing-Kai Hon; Rahul Shah 001; Walid G. Aref; Jeffrey Scott Vitter (EDBT, 2008)

On searching compressed string collections cache-obliviously. - Paolo Ferragina; Roberto Grossi; Ankur Gupta 003; Rahul Shah 001; Jeffrey Scott Vitter (PODS, 2008)

Tight competitive ratios for parallel disk prefetching and caching. - Wing-Kai Hon; Rahul Shah 001; Peter J. Varman; Jeffrey Scott Vitter (SPAA, 2008)

Arithmetic Coding for Data Compression. - Paul G. Howard; Jeffrey Scott Vitter (Encyclopedia of Algorithms, 2008)

External Sorting and Permuting. - Jeffrey Scott Vitter (Encyclopedia of Algorithms, 2008)

Space-Efficient Framework for Top-k String Retrieval Problems. - Wing-Kai Hon; Rahul Shah 001; Jeffrey Scott Vitter (FOCS, 2009)

Succinct Index for Dynamic Dictionary Matching. - Wing-Kai Hon; Tak Wah Lam; Rahul Shah 001; Siu-Lung Tam; Jeffrey Scott Vitter (ISAAC, 2009)

On Entropy-Compressed Text Indexing in External Memory. - Wing-Kai Hon; Rahul Shah 001; Sharma V. Thankachan; Jeffrey Scott Vitter (SPIRE, 2009)

Time- and space-efficient maximal repeat finding using the burrows-wheeler transform and wavelet trees. - M. Oguzhan Külekci; Jeffrey Scott Vitter; Bojian Xu (BIBM, 2010)

PSI-RA: A parallel sparse index for read alignment on genomes. - M. Oguzhan Külekci; Wing-Kai Hon; Rahul Shah 001; Jeffrey Scott Vitter; Bojian Xu (BIBM, 2010)

Compression, Indexing, and Retrieval for Massive String Data. - Wing-Kai Hon; Rahul Shah 001; Jeffrey Scott Vitter (CPM, 2010)

I/O-Efficient Compressed Text Indexes: From Theory to Practice. - Sheng-Yuan Chiu; Wing-Kai Hon; Rahul Shah 001; Jeffrey Scott Vitter (DCC, 2010)

Boosting Pattern Matching Performance via k-bit Filtering. - M. Oguzhan Külekci; Jeffrey Scott Vitter; Bojian Xu (ISCIS, 2010)

String Retrieval for Multi-pattern Queries. - Wing-Kai Hon; Rahul Shah 001; Sharma V. Thankachan; Jeffrey Scott Vitter (SPIRE, 2010)

Wavelet Trees: From Theory to Practice. - Roberto Grossi; Jeffrey Scott Vitter; Bojian Xu (CCP, 2011)

Compressed Dictionary Matching with One Error. - Wing-Kai Hon; Tsung-Han Ku; Rahul Shah 001; Sharma V. Thankachan; Jeffrey Scott Vitter (DCC, 2011)

Inverted indexes for phrases and strings. - Manish Patil; Sharma V. Thankachan; Rahul Shah 001; Wing-Kai Hon; Jeffrey Scott Vitter; Sabrina Chandrasekaran (SIGIR, 2011)

Cache-oblivious index for approximate string matching. - Wing-Kai Hon; Tak Wah Lam; Rahul Shah 001; Siu-Lung Tam; Jeffrey Scott Vitter (Theor. Comput. Sci., 2011)

Compressed data structures with relevance. - Jeffrey Scott Vitter (CIKM, 2012)

Document Listing for Queries with Excluded Pattern. - Wing-Kai Hon; Rahul Shah 001; Sharma V. Thankachan; Jeffrey Scott Vitter (CPM, 2012)

Fast Pattern-Matching via k-bit Filtering Based Text Decomposition. - M. Oguzhan Külekci; Jeffrey Scott Vitter; Bojian Xu (Comput. J., 2012)

On Optimal Top-K String Retrieval - Rahul Shah 001; Cheng Sheng 001; Sharma V. Thankachan; Jeffrey Scott Vitter (CoRR, 2012)

On position restricted substring searching in succinct space. - Wing-Kai Hon; Rahul Shah 001; Sharma V. Thankachan; Jeffrey Scott Vitter (J. Discrete Algorithms, 2012)

Efficient Maximal Repeat Finding Using the Burrows-Wheeler Transform and Wavelet Tree. - M. Oguzhan Külekci; Jeffrey Scott Vitter; Bojian Xu (IEEE ACM Trans. Comput. Biol. Bioinform., 2012)

StemFinder: An efficient algorithm for searching motif stems over large alphabets. - Qiang Yu 003; Hongwei Huo; Jeffrey Scott Vitter; Jun Huan; Yakov Nekrich (BIBM, 2013)

Indexes for Document Retrieval with Relevance. - Wing-Kai Hon; Manish Patil; Rahul Shah 001; Sharma V. Thankachan; Jeffrey Scott Vitter (Space-Efficient Data Structures, Streams, and Algorithms, 2013)

Faster Compressed Top-k Document Retrieval. - Wing-Kai Hon; Sharma V. Thankachan; Rahul Shah 001; Jeffrey Scott Vitter (DCC, 2013)

Optimal Color Range Reporting in One Dimension. - Yakov Nekrich; Jeffrey Scott Vitter (ESA, 2013)

Top-k Document Retrieval in External Memory. - Rahul Shah 001; Cheng Sheng 001; Sharma V. Thankachan; Jeffrey Scott Vitter (ESA, 2013)

Compressed text indexing with wildcards. - Wing-Kai Hon; Tsung-Han Ku; Rahul Shah 001; Sharma V. Thankachan; Jeffrey Scott Vitter (J. Discrete Algorithms, 2013)

Faster compressed dictionary matching. - Wing-Kai Hon; Tsung-Han Ku; Rahul Shah 001; Sharma V. Thankachan; Jeffrey Scott Vitter (Theor. Comput. Sci., 2013)

An efficient motif finding algorithm for large DNA data sets. - Qiang Yu 003; Hongwei Huo; Xiaoyang Chen; Haitao Guo; Jeffrey Scott Vitter; Jun Huan (BIBM, 2014)

A Practical Implementation of Compressed Suffix Arrays with Applications to Self-Indexing. - Hongwei Huo; Longgang Chen; Jeffrey Scott Vitter; Yakov Nekrich (DCC, 2014)

Categorical range maxima queries. - Manish Patil; Sharma V. Thankachan; Rahul Shah 001; Yakov Nekrich; Jeffrey Scott Vitter (PODS, 2014)

Space-Efficient String Indexing for Wildcard Pattern Matching. - Moshe Lewenstein; Yakov Nekrich; Jeffrey Scott Vitter (STACS, 2014)

Space-Efficient Frameworks for Top-k String Retrieval. - Wing-Kai Hon; Rahul Shah 001; Sharma V. Thankachan; Jeffrey Scott Vitter (J. ACM, 2014)

A Data-Aware FM-index. - Hongwei Huo; Longgang Chen; Heng Zhao; Jeffrey Scott Vitter; Yakov Nekrich; Qiang Yu 003 (ALENEX, 2015)

Reference sequence selection for motif searches. - Qiang Yu 003; Hongwei Huo; Ruixing Zhao; Dazheng Feng; Jeffrey Scott Vitter; Jun Huan (BIBM, 2015)

Dynamic Data Structures for Document Collections and Graphs. - J. Ian Munro; Yakov Nekrich; Jeffrey Scott Vitter (PODS, 2015)

Geometric BWT: Compressed Text Indexing via Sparse Suffixes and Range Searching. - Yu-Feng Chien; Wing-Kai Hon; Rahul Shah 001; Sharma V. Thankachan; Jeffrey Scott Vitter (Algorithmica, 2015)

Compressing Dictionary Matching Index via Sparsification Technique. - Wing-Kai Hon; Tsung-Han Ku; Tak Wah Lam; Rahul Shah 001; Siu-Lung Tam; Sharma V. Thankachan; Jeffrey Scott Vitter (Algorithmica, 2015)

An Efficient Exact Algorithm for the Motif Stem Search Problem over Large Alphabets. - Qiang Yu 003; Hongwei Huo; Jeffrey Scott Vitter; Jun Huan; Yakov Nekrich (IEEE ACM Trans. Comput. Biol. Bioinform., 2015)

CS2A: A Compressed Suffix Array-Based Method for Short Read Alignment. - Hongwei Huo; Zhigang Sun; Shuangjiang Li; Jeffrey Scott Vitter; Xinkun Wang; Qiang Yu 003; Jun Huan (DCC, 2016)

RefSelect: a reference sequence selection algorithm for planted (l, d) motif search. - Qiang Yu 003; Hongwei Huo; Ruixing Zhao; Dazheng Feng; Jeffrey Scott Vitter; Jun Huan (BMC Bioinform., 2016)

MSQ-Index: A Succinct Index for Fast Graph Similarity Search. - Xiaoyang Chen; Hongwei Huo; Jun Huan; Jeffrey Scott Vitter (CoRR, 2016)

Fast construction of wavelet trees. - J. Ian Munro; Yakov Nekrich; Jeffrey Scott Vitter (Theor. Comput. Sci., 2016)

Arithmetic Coding for Data Compression. - Paul G. Howard; Jeffrey Scott Vitter (Encyclopedia of Algorithms, 2016)

External Sorting and Permuting. - Jeffrey Scott Vitter (Encyclopedia of Algorithms, 2016)

Efficient Graph Similarity Search in External Memory. - Xiaoyang Chen; Hongwei Huo; Jun Huan; Jeffrey Scott Vitter (IEEE Access, 2017)

Fast Computation of Graph Edit Distance. - Xiaoyang Chen; Hongwei Huo; Jun Huan; Jeffrey Scott Vitter (CoRR, 2017)

Practical Succinct Text Indexes in External Memory. - Hongwei Huo; Xiaoyang Chen; Yuhao Zhao; Xiaojin Zhu 004; Jeffrey Scott Vitter (DCC, 2018)

A non-intrusive approach for classifying residential water events using coincident electricity data. - Jeffrey Scott Vitter; Michael E. Webber (Environ. Model. Softw., 2018)

An efficient algorithm for graph edit distance computation. - Xiaoyang Chen; Hongwei Huo; Jun Huan; Jeffrey Scott Vitter (Knowl. Based Syst., 2019)

Feature reduction based on semantic similarity for graph classification. - Zhigang Sun; Hongwei Huo; Jun Huan; Jeffrey Scott Vitter (Neurocomputing, 2020)

Efficient Compression and Indexing for Highly Repetitive DNA Sequence Collections. - Hongwei Huo; Xiaoyang Chen; Xu Guo; Jeffrey Scott Vitter (IEEE ACM Trans. Comput. Biol. Bioinform., 2021)

MSQ-Index: A Succinct Index for Fast Graph Similarity Search. - Xiaoyang Chen; Hongwei Huo; Jun Huan; Jeffrey Scott Vitter; Weiguo Zheng; Lei Zou 001 (IEEE Trans. Knowl. Data Eng., 2021)

CIndex: compressed indexes for fast retrieval of FASTQ files. - Hongwei Huo; Pengfei Liu; Chenhui Wang; Hongbo Jiang; Jeffrey Scott Vitter (Bioinform., 2022)

Ranked Document Retrieval in External Memory. - Rahul Shah 001; Cheng Sheng 001; Sharma V. Thankachan; Jeffrey Vitter (ACM Trans. Algorithms, 2023)

Practical High-Order Entropy-Compressed Text Self-Indexing. - Hongwei Huo; Peng Long; Jeffrey Scott Vitter (IEEE Trans. Knowl. Data Eng., 2023)

Approximating Gromov-Hausdorff distance in Euclidean space. - Sushovan Majhi; Jeffrey Vitter; Carola Wenk (Comput. Geom., 2024)

An Efficient Heuristic for Graph Edit Distance. - Xiaoyang Chen; Yujia Wang; Hongwei Huo; Jeffrey Scott Vitter (From Strings to Graphs, and Back Again, 2025)

Wavelet Tree, Part II: Text Indexing. - Paolo Ferragina; Raffaele Giancarlo; Roberto Grossi; Giovanna Rosone; Rossano Venturini; Jeffrey Scott Vitter (The Expanding World of Compressed Data, 2025)

Wavelet Tree, Part I: A Brief History. - Paolo Ferragina; Raffaele Giancarlo; Giovanni Manzini; Giovanna Rosone; Rossano Venturini; Jeffrey Scott Vitter (From Strings to Graphs, and Back Again, 2025)

FM-Adaptive: A Practical Data-Aware FM-Index. - Hongwei Huo; Zongtao He; Pengfei Liu; Jeffrey Scott Vitter (The Expanding World of Compressed Data, 2025)

Indexing Labeled Property Multidigraphs in Entropy Space, with Applications. - Hongwei Huo; Yongze Yu; Zongtao He; Jeffrey Scott Vitter (ICDE, 2025)