Jeffrey Scott Vitter

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

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

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

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

M. Oguzhan Külekci, Jeffrey Scott Vitter, Bojian Xu: Efficient Maximal Repeat Finding Using the Burrows-Wheeler Transform and Wavelet Tree. IEEE/ACM Trans. Comput. Biology Bioinform. 9(2): 421-429 (2012)

Jeffrey Scott Vitter: Compressed data structures with relevance. CIKM 2012: 4-5

Wing-Kai Hon, Rahul Shah, Sharma V. Thankachan, Jeffrey Scott Vitter: Document Listing for Queries with Excluded Pattern. CPM 2012: 185-195

Rahul Shah, Cheng Sheng, Sharma V. Thankachan, Jeffrey Scott Vitter: On Optimal Top-K String Retrieval. CoRR abs/1207.2632 (2012)

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

Roberto Grossi, Jeffrey Scott Vitter, Bojian Xu: Wavelet Trees: From Theory to Practice. CCP 2011: 210-221

Wing-Kai Hon, Tsung-Han Ku, Rahul Shah, Sharma V. Thankachan, Jeffrey Scott Vitter: Compressed Dictionary Matching with One Error. DCC 2011: 113-122

Manish Patil, Sharma V. Thankachan, Rahul Shah, Wing-Kai Hon, Jeffrey Scott Vitter, Sabrina Chandrasekaran: Inverted indexes for phrases and strings. SIGIR 2011: 555-564

Wing-Kai Hon, Tsung-Han Ku, Rahul Shah, Sharma V. Thankachan, Jeffrey Scott Vitter: Compressed Text Indexing with Wildcards. SPIRE 2011: 267-277

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

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

Wing-Kai Hon, Rahul Shah, Jeffrey Scott Vitter: Compression, Indexing, and Retrieval for Massive String Data. CPM 2010: 260-274

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

M. Oguzhan Külekci, Jeffrey Scott Vitter, Bojian Xu: Boosting Pattern Matching Performance via k-bit Filtering. ISCIS 2010: 27-32

Wing-Kai Hon, Rahul Shah, Sharma V. Thankachan, Jeffrey Scott Vitter: String Retrieval for Multi-pattern Queries. SPIRE 2010: 55-66

Wing-Kai Hon, Tsung-Han Ku, Rahul Shah, Sharma V. Thankachan, Jeffrey Scott Vitter: Faster Compressed Dictionary Matching. SPIRE 2010: 191-200

Wing-Kai Hon, Rahul Shah, Jeffrey Scott Vitter: Space-Efficient Framework for Top-k String Retrieval Problems. FOCS 2009: 713-722

Wing-Kai Hon, Tak Wah Lam, Rahul Shah, Siu-Lung Tam, Jeffrey Scott Vitter: Succinct Index for Dynamic Dictionary Matching. ISAAC 2009: 1034-1043

Wing-Kai Hon, Rahul Shah, Sharma V. Thankachan, Jeffrey Scott Vitter: On Entropy-Compressed Text Indexing in External Memory. SPIRE 2009: 75-89

Ankur Gupta, Roberto Grossi, Jeffrey Scott Vitter: Nearly Tight Bounds on the Encoding Length of the Burrows-Wheeler Transform. ANALCO 2008: 191-202

Wing-Kai Hon, Tak Wah Lam, Rahul Shah, Siu-Lung Tam, Jeffrey Scott Vitter: Compressed Index for Dictionary Matching. DCC 2008: 23-32

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

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

Paolo Ferragina, Roberto Grossi, Ankur Gupta, Rahul Shah, Jeffrey Scott Vitter: On searching compressed string collections cache-obliviously. PODS 2008: 181-190

Wing-Kai Hon, Rahul Shah, Peter J. Varman, Jeffrey Scott Vitter: Tight competitive ratios for parallel disk prefetching and caching. SPAA 2008: 352-361

Paul G. Howard, Jeffrey Scott Vitter: Arithmetic Coding for Data Compression. Encyclopedia of Algorithms 2008

Jeffrey Scott Vitter: External Sorting and Permuting. Encyclopedia of Algorithms 2008

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

Ankur Gupta, Wing-Kai Hon, Rahul Shah, Jeffrey Scott Vitter: Compressed data structures: Dictionaries and data-aware measures. Theor. Comput. Sci. 387(3): 313-331 (2007)

Wing-Kai Hon, Tak Wah Lam, Rahul Shah, Siu-Lung Tam, Jeffrey Scott Vitter: Cache-Oblivious Index for Approximate String Matching. CPM 2007: 40-51

Ankur Gupta, Wing-Kai Hon, Rahul Shah, Jeffrey Scott Vitter: A Framework for Dynamizing Succinct Data Structures. ICALP 2007: 521-532

Lipyeow Lim, Min Wang, Sriram Padmanabhan, Jeffrey Scott Vitter, Ramesh C. Agarwal: Efficient Update of Indexes for Dynamically Changing Web Documents. World Wide Web 2007: 37-69

Jeffrey Scott Vitter: Algorithms and Data Structures for External Memory. Foundations and Trends in Theoretical Computer Science 2(4): 305-474 (2006)

Jeffrey Scott Vitter, David A. Hutchinson: Distribution sort with randomized cycling. J. ACM 53(4): 656-680 (2006)

Yossi Matias, Eran Segal, Jeffrey Scott Vitter: Efficient Bundle Sorting. SIAM J. Comput. 36(2): 394-410 (2006)

Luca Foschini, Roberto Grossi, Ankur Gupta, Jeffrey Scott Vitter: When indexing equals compression: Experiments with compressing suffix arrays and applications. ACM Transactions on Algorithms 2(4): 611-639 (2006)

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

Reynold Cheng, Sarvjeet Singh, Sunil Prabhakar, Rahul Shah, Jeffrey Scott Vitter, Yuni Xia: Efficient join processing over uncertain data. CIKM 2006: 738-747

Ankur Gupta, Wing-Kai Hon, Rahul Shah, Jeffrey Scott Vitter: Compressed Data Structures: Dictionaries and Data-Aware Measures. DCC 2006: 213-222

Ankur Gupta, Wing-Kai Hon, Rahul Shah, Jeffrey Scott Vitter: Compressed Dictionaries: Space Measures, Data Sets, and Experiments. WEA 2006: 158-169

David A. Hutchinson, Peter Sanders, Jeffrey Scott Vitter: Duality Between Prefetching and Queued Writing with Parallel Disks. SIAM J. Comput. 34(6): 1443-1463 (2005)

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

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, Jeffrey Scott Vitter, Xiang Zhang: The Indiana Center for Database Systems at Purdue University. SIGMOD Record 34(2): 53-58 (2005)

Stergios V. Anastasiadis, Peter J. Varman, Jeffrey Scott Vitter, Ke Yi: Optimal Lexicographic Shaping of Aggregate Streaming Data. IEEE Trans. Computers 54(4): 398-408 (2005)

Rahul Shah, Peter J. Varman, Jeffrey Scott Vitter: On competitive online read-many parallel disks scheduling. SPAA 2005: 217

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

Luca Foschini, Roberto Grossi, Ankur Gupta, Jeffrey Scott Vitter: Fast Compression with a Static Model in High-Order Entropy. Data Compression Conference 2004: 62-71

Thanaa M. Ghanem, Rahul Shah, Mohamed F. Mokbel, Walid G. Aref, Jeffrey Scott Vitter: Bulk Operations for Space-Partitioning Trees. ICDE 2004: 29-40

Ihab F. Ilyas, Rahul Shah, Walid G. Aref, Jeffrey Scott Vitter, Ahmed K. Elmagarmid: Rank-aware Query Optimization. SIGMOD Conference 2004: 203-214

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

Rahul Shah, Peter J. Varman, Jeffrey Scott Vitter: Online algorithms for prefetching and caching on parallel disks. SPAA 2004: 255-264

S. Muthukrishnan, Rahul Shah, Jeffrey Scott Vitter: Mining Deviants in Time Series Data Streams. SSDBM 2004: 41-50

Reynold Cheng, Yuni Xia, Sunil Prabhakar, Rahul Shah, Jeffrey Scott Vitter: Efficient Indexing Methods for Probabilistic Threshold Queries over Uncertain Data. VLDB 2004: 876-887

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

Yossi Matias, Jeffrey Scott Vitter, Wen-Chun Ni: Dynamic Generation of Discrete Random Variates. Theory Comput. Syst. 36(4): 329-358 (2003)

Lars Arge, Jeffrey Scott Vitter: Optimal External Memory Interval Management. SIAM J. Comput. 32(6): 1488-1508 (2003)

Roberto Grossi, Ankur Gupta, Jeffrey Scott Vitter: High-order entropy-compressed text indexes. SODA 2003: 841-850

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

Lipyeow Lim, Min Wang, Jeffrey Scott Vitter: SASH: A Self-Adaptive Histogram Set for Dynamically Changing Workloads. VLDB 2003: 369-380

Lipyeow Lim, Min Wang, Sriram Padmanabhan, Jeffrey Scott Vitter, Ramesh C. Agarwal: Dynamic maintenance of web indexes using landmarks. WWW 2003: 102-111

Dina Q. Goldin, Alexander A. Shvartsman, Scott A. Smolka, Jeffrey Scott Vitter, Stanley B. Zdonik (Eds.): PCK50 - Principles of Computing & Knowledge, Paris C. Kanellakis Memorial Workshop, San Diego, California, USA, June 8th, 2003. ACM 2003, isbn 1-58113-604-8

Lars Arge, Klaus Hinrichs, Jan Vahrenhold, Jeffrey Scott Vitter: Efficient Bulk Operations on Dynamic R-Trees. Algorithmica 33(1): 104-128 (2002)

Rajiv Wickremesinghe, Lars Arge, Jeffrey S. Chase, Jeffrey Scott Vitter: Efficient Sorting Using Registers and Caches. ACM Journal of Experimental Algorithmics 7: 9 (2002)

Rakesh D. Barve, Jeffrey Scott Vitter: A Simple and Efficient Parallel Disk Mergesort. Theory Comput. Syst. 35(2): 189-215 (2002)

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

Lars Arge, Octavian Procopiuc, Jeffrey Scott Vitter: Implementing I/O-efficient Data Structures Using TPIE. ESA 2002: 88-100

Rajiv Wickremesinghe, Jeffrey S. Chase, Jeffrey Scott Vitter: Distributed Computing with Load-Managed Active Storage. HPDC 2002: 13-23

Jeffrey Scott Vitter, Roberto Grossi: Compressed Indexes for Fast Search in Sequences. JCIS 2002: 44-48

Stergios V. Anastasiadis, Peter J. Varman, Jeffrey Scott Vitter, Ke Yi: Lexicographically optimal smoothing for broadband traffic multiplexing. PODC 2002: 68-77

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

Yossi Matias, Jeffrey Scott Vitter, Neal E. Young: Approximate Data Structures with Applications. CoRR cs.DS/0205010 (2002)

Jeffrey Scott Vitter: External memory algorithms and data structures. ACM Comput. Surv. 33(2): 209-271 (2001)

Lars Arge, Laura Toma, Jeffrey Scott Vitter: I/O-Efficient Algorithms for Problems on Grid-Based Terrains. ACM Journal of Experimental Algorithmics 6: 1 (2001)

David A. Hutchinson, Peter Sanders, Jeffrey Scott Vitter: Duality between Prefetching and Queued Writing with Parallel Disks. ESA 2001: 62-73

Laura Toma, Rajiv Wickremesinghe, Lars Arge, Jeffrey S. Chase, Jeffrey Scott Vitter, Patrick N. Halpin, Dean Urban: Flow Computation on Massive Grids. ACM-GIS 2001: 82-87

Pankaj K. Agarwal, Lars Arge, Octavian Procopiuc, Jeffrey Scott Vitter: A Framework for Index Bulk Loading and Dynamization. ICALP 2001: 115-127

Jeffrey Scott Vitter, David A. Hutchinson: Distribution sort with randomizing cycle. SODA 2001: 77-86

David A. Hutchinson, Peter Sanders, Jeffrey Scott Vitter: The power of duality for prefetching and sorting with parallel disks. SPAA 2001: 334-335

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

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

Min Wang, Jeffrey Scott Vitter, Lipyeow Lim, Sriram Padmanabhan: Wavelet-Based Cost Estimation for Spatial Queries. SSTD 2001: 175-196

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

Lipyeow Lim, Min Wang, Sriram Padmanabhan, Jeffrey Scott Vitter, Ramesh C. Agarwal: Characterizing Web Document Change. WAIM 2001: 133-144

Jeffrey Scott Vitter, Paul G. Spirakis, Mihalis Yannakakis (Eds.): Proceedings on 33rd Annual ACM Symposium on Theory of Computing, July 6-8, 2001, Heraklion, Crete, Greece. ACM 2001, isbn 1-58113-349-9

Pankaj K. Agarwal, Leonidas J. Guibas, T. M. Murali, Jeffrey Scott Vitter: Cylindrical static and kinetic binary space partitions. Comput. Geom. 16(2): 103-127 (2000)

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

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

Roberto Tamassia, Ioannis G. Tollis, Jeffrey Scott Vitter: A Parallel Algorithm for Planar Orthogonal Grid Drawings. Parallel Processing Letters 10(1): 141-150 (2000)

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

Pankaj K. Agarwal, Edward F. Grove, T. M. Murali, Jeffrey Scott Vitter: Binary Space Partitions for Fat Rectangles. SIAM J. Comput. 29(5): 1422-1448 (2000)

Jeffrey Scott Vitter: ACM SIGACT 1999-2000 annual report. SIGACT News 31(3): 2-6 (2000)

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

Yossi Matias, Eran Segal, Jeffrey Scott Vitter: Efficient bundle sorting. SODA 2000: 839-848

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

Yossi Matias, Jeffrey Scott Vitter, Min Wang: Dynamic Maintenance of Wavelet-Based Histograms. VLDB 2000: 101-110

Lars Arge, Jeffrey S. Chase, Jeffrey Scott Vitter, Rajiv Wickremesinghe: Efficient Sorting Using Registers and Caches. Algorithm Engineering 2000: 51-62

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

Edward F. Grove, T. M. Murali, Jeffrey Scott Vitter: The Object Complexity Model for Hidden-Surface Removal. Int. J. Comput. Geometry Appl. 9(2): 207-217 (1999)

Dzung T. Hoang, Philip M. Long, Jeffrey Scott Vitter: Dictionary Selection Using Partial Matching. Inf. Sci. 119(1-2): 57-72 (1999)

Philip M. Long, Apostol Natsev, Jeffrey Scott Vitter: Text compression via alphabet re-representation. Neural Networks 12(4-5): 755-765 (1999)

Lars Arge, Klaus Hinrichs, Jan Vahrenhold, Jeffrey Scott Vitter: Efficient Bulk Operations on Dynamic R-trees. ALENEX 1999: 328-348

Rakesh D. Barve, Jeffrey Scott Vitter: A Theoretical Framework for Memory-Adaptive Algorithms. FOCS 1999: 273-284

Jeffrey Scott Vitter: Online Data Structures in External Memory. ICALP 1999: 119-133

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

Lars Arge, Vasilis Samoladas, Jeffrey Scott Vitter: On Two-Dimensional Indexability and Optimal Range Search Indexing. PODS 1999: 346-357

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

Jeffrey Scott Vitter, Min Wang: Approximate Computation of Multidimensional Aggregates of Sparse Data Using Wavelets. SIGMOD Conference 1999: 193-204

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

Rakesh D. Barve, Jeffrey Scott Vitter: A Simple and Efficient Parallel Disk Mergesort. SPAA 1999: 232-241

Jeffrey Scott Vitter: Online Data Structures in External Memory. WADS 1999: 352-366

Jeffrey Scott Vitter, Lawrence L. Larmore, Frank Thomson Leighton (Eds.): Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, May 1-4, 1999, Atlanta, Georgia, USA. ACM 1999, isbn 1-58113-067-8

Jeffrey Scott Vitter, Christos D. Zaroliagis (Eds.): Algorithm Engineering, 3rd International Workshop, WAE '99, London, UK, July 19-21, 1999, Proceedings. Lecture Notes in Computer Science 1668, Springer 1999, isbn 3-540-66427-0

P. Krishnan, Jeffrey Scott Vitter: Optimal Prediction for Prefetching in the Worst Case. SIAM J. Comput. 27(6): 1617-1636 (1998)

Dzung T. Hoang, Philip M. Long, Jeffrey Scott Vitter: Efficient cost measures for motion estimation at low bit rates. IEEE Trans. Circuits Syst. Video Techn. 8(4): 488-500 (1998)

Jeffrey Scott Vitter, Min Wang, Balakrishna R. Iyer: Data Cube Approximation and Histograms via Wavelets. CIKM 1998: 96-104

Jeffrey Scott Vitter: External Memory Algorithms. ESA 1998: 1-25

T. M. Murali, Pankaj K. Agarwal, Jeffrey Scott Vitter: Constructing Binary Space Partitions for Orthogonal Rectabgles in Practice. ESA 1998: 211-222

Min Wang, Balakrishna R. Iyer, Jeffrey Scott Vitter: Scalable Mining for Classification Rules in Relational Databases. IDEAS 1998: 58-67

Jeffrey Scott Vitter: External Memory Algorithms. PODS 1998: 119-128

Pankaj K. Agarwal, Lars Arge, Jeff Erickson, Paolo Giulio Franciosa, Jeffrey Scott Vitter: Efficient Searching with Linear Constraints. PODS 1998: 169-178

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

Yossi Matias, Jeffrey Scott Vitter, Min Wang: Wavelet-Based Histograms for Selectivity Estimation. SIGMOD Conference 1998: 448-459

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

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

Lars Arge, Octavian Procopiuc, Sridhar Ramaswamy, Torsten Suel, Jeffrey Scott Vitter: Scalable Sweeping-Based Spatial Join. VLDB 1998: 570-581

Jeffrey Scott Vitter (Ed.): Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, Dallas, Texas, USA, May 23-26, 1998. ACM 1998, isbn 0-89791-962-9

Kenneth Basye, Thomas L. Dean, Jeffrey Scott Vitter: Coping with Uncertainty in Map Learning. Machine Learning 29(1): 65-88 (1997)

Rakesh D. Barve, Edward F. Grove, Jeffrey Scott Vitter: Simple Randomized Mergesort on Parallel Disks. Parallel Computing 23(4-5): 601-631 (1997)

Pankaj K. Agarwal, Leonidas J. Guibas, T. M. Murali, Jeffrey Scott Vitter: Cylindrical Static and Kinetic Binary Space Partitions. Symposium on Computational Geometry 1997: 39-48

Pankaj K. Agarwal, T. M. Murali, Jeffrey Scott Vitter: Practical Techniques for Constructing Binary Space Partitions for Orthogonal Rectangles. Symposium on Computational Geometry 1997: 382-384

Dzung T. Hoang, Elliot L. Linzer, Jeffrey Scott Vitter: A Lexicographic Framework for MPEG Rate Control. Data Compression Conference 1997: 101-110

Philip M. Long, Apostol Natsev, Jeffrey Scott Vitter: Text Compression Via Alphabet Re-Representation. Data Compression Conference 1997: 161-170

Min Wang, Jeffrey Scott Vitter, Balakrishna R. Iyer: Selectivity Estimation in the Presence of Alphanumeric Correlations. ICDE 1997: 169-180

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

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

Rakesh D. Barve, Mahesh Kallahalla, Peter J. Varman, Jeffrey Scott Vitter: Competitive Parallel Disk Prefetching and Buffer Management. IOPADS 1997: 47-56

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

Roberto Tamassia, Jeffrey Scott Vitter: Optimal Cooperative Search in Fractional Cascaded Data Structures. Algorithmica 15(2): 154-171 (1996)

Mark H. Nodine, Michael T. Goodrich, Jeffrey Scott Vitter: Blocking for External Graph Searching. Algorithmica 16(2): 181-214 (1996)

Jeffrey Scott Vitter: Communication Issues in Large-Scale Geometric Computation. ACM Comput. Surv. 28(4es): 20 (1996)

Darren Erik Vengroff, Jeffrey Scott Vitter: I/O-Efficient Algorithms and Environments. ACM Comput. Surv. 28(4es): 212 (1996)

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

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

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

Jeffrey Scott Vitter, P. Krishnan: Optimal Prefetching via Data Compression. J. ACM 43(5): 771-793 (1996)

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

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

Pankaj K. Agarwal, Edward F. Grove, T. M. Murali, Jeffrey Scott Vitter: Binary Search Partitions for Fat Rectangles. FOCS 1996: 482-491

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

P. Krishnan, Jeffrey Scott Vitter, Balakrishna R. Iyer: Estimating Alphanumeric Selectivity in the Presence of Wildcards. SIGMOD Conference 1996: 282-293

Rakesh D. Barve, Edward F. Grove, Jeffrey Scott Vitter: Simple Randomized Mergesort on Parallel Disks. SPAA 1996: 109-118

Darren Erik Vengroff, Jeffrey Scott Vitter: Efficient 3-D Range Searching in External Memory. STOC 1996: 192-201

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

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

Dzung T. Hoang, Philip M. Long, Jeffrey Scott Vitter: Multiple-Dictionary Coding Using Partial Matching. Data Compression Conference 1995: 272-281

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

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

Baruch Awerbuch, Yossi Azar, Edward F. Grove, Ming-Yang Kao, P. Krishnan, Jeffrey Scott Vitter: Load Balancing in the L_p Norm. FOCS 1995: 383-391

P. Krishnan, Philip M. Long, Jeffrey Scott Vitter: Learning to Make Rent-to-Buy Decisions with Systems Applications. ICML 1995: 233-330

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

Edward F. Grove, Ming-Yang Kao, P. Krishnan, Jeffrey Scott Vitter: Online Perfect Matching and Mobile Computing. WADS 1995: 194-205

Jeffrey Scott Vitter: Guest Editor's Introduction: Special Issue on Large-Scale Memories. Algorithmica 12(2/3): 69-71 (1994)

Jeffrey Scott Vitter, Elizabeth A. M. Shriver: Algorithms for Parallel Memory I: Two-Level Memories. Algorithmica 12(2/3): 110-147 (1994)

Jeffrey Scott Vitter, Elizabeth A. M. Shriver: Algorithms for Parallel Memory II: Hierarchical Multilevel Memories. Algorithmica 12(2/3): 148-169 (1994)

Paul G. Howard, Jeffrey Scott Vitter: Design and Analysis of Fast Text Compression Based on Quasi-Arithmetic Coding. Inf. Process. Manage. 30(6): 777-790 (1994)

Jyh-Han Lin, Jeffrey Scott Vitter: A Theory for Memory-Based Learning. Machine Learning 17(2-3): 143-167 (1994)

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

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

Yossi Matias, Jeffrey Scott Vitter, Neal E. Young: Approximate Data Structures with Applications. SODA 1994: 187-194

P. Krishnan, Jeffrey Scott Vitter: Optimal Prediction for Prefetching in the Worst Case. SODA 1994: 392-401

Franco P. Preparata, Jeffrey Scott Vitter: A Simplified Technique for Hidden-Line Elimination in Terrains. Int. J. Comput. Geometry Appl. 3(2): 167-181 (1993)

Jeffrey Scott Vitter, Mark H. Nodine: Large-Scale Sorting in Uniform Memory Hierarchies. J. Parallel Distrib. Comput. 17(1-2): 107-114 (1993)

Paul G. Howard, Jeffrey Scott Vitter: Design and Analysis of Fast Text Compression Based on Quasi-Arithmetic Coding. Data Compression Conference 1993: 98-107

Paul G. Howard, Jeffrey Scott Vitter: Fast and Efficient Lossless Image Compression. Data Compression Conference 1993: 351-360

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

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

Mark H. Nodine, Michael T. Goodrich, Jeffrey Scott Vitter: Blocking for External Graph Searching. PODS 1993: 222-232

Paris C. Kanellakis, Sridhar Ramaswamy, Darren Erik Vengroff, Jeffrey Scott Vitter: Indexing for Data Models with Constraints and Classes. PODS 1993: 233-243

Kenneth M. Curewitz, P. Krishnan, Jeffrey Scott Vitter: Practical Prefetching via Data Compression. SIGMOD Conference 1993: 257-266

Yossi Matias, Jeffrey Scott Vitter, Wen-Chun Ni: Dynamic Generation of Discrete Random Variates. SODA 1993: 361-370

Mark H. Nodine, Jeffrey Scott Vitter: Deterministic Distribution Sort in Shared and Distributed Memory Multiprocessors. SPAA 1993: 120-129

Sairam Sairam, Jeffrey Scott Vitter, Roberto Tamassia: A Complexity Theoretic Approach to Incremental Computation. STACS 1993: 640-649

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

Jeffrey Scott Vitter, Jyh-Han Lin: Learning in Parallel. Inf. Comput. 96(2): 179-202 (1992)

Jyh-Han Lin, Jeffrey Scott Vitter: Approximation Algorithms for Geometric Median Problems. Inf. Process. Lett. 44(5): 245-249 (1992)

Paul G. Howard, Jeffrey Scott Vitter: Analysis of Arithmetic Coding for Data Compression. Inf. Process. Manage. 28(6): 749-764 (1992)

Paul G. Howard, Jeffrey Scott Vitter: New Methods for Lossless Image Compression Using Arithmetic Coding. Inf. Process. Manage. 28(6): 765-780 (1992)

Jyh-Han Lin, Jeffrey Scott Vitter: A Theory for Memory-Based Learning. COLT 1992: 103-115

Jyh-Han Lin, Jeffrey Scott Vitter: Nearly Optimal Vecot Quantization via Linear Programming. Data Compression Conference 1992: 22-31

Paul G. Howard, Jeffrey Scott Vitter: Error Modeling for Hierarchical Lossless Image Compression. Data Compression Conference 1992: 269-278

Paul G. Howard, Jeffrey Scott Vitter: Parallel Lossless Image Compression Using Huffman and Arithmetic Coding. Data Compression Conference 1992: 299-308

Sairam Sairam, Roberto Tamassia, Jeffrey Scott Vitter: A Divide and Conquer Approach to Shortest Paths in Planar Layered Digraphs. SPDP 1992: 176-183

Franco P. Preparata, Jeffrey Scott Vitter: A Simplified Technique for Hidden-Line Elimination in Terrains. STACS 1992: 135-146

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

Claire Kenyon, Jeffrey Scott Vitter: Maximum Queue Size and Hashing with Lazy Deletion. Algorithmica 6(4): 597-619 (1991)

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

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

Jyh-Han Lin, Jeffrey Scott Vitter: Complexity Results on Learning by Neural Nets. Machine Learning 6: 211-230 (1991)

Roberto Tamassia, Jeffrey Scott Vitter: Parallel Transitive Closure and Point Location in Planar Structures. SIAM J. Comput. 20(4): 708-725 (1991)

Claire Kenyon-Mathieu, Jeffrey Scott Vitter: The Maximum Size of Dynamic Data Structures. SIAM J. Comput. 20(5): 807-823 (1991)

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

Paul G. Howard, Jeffrey Scott Vitter: Analysis of Arithmetic Coding for Data Compression. Data Compression Conference 1991: 3-12

Paul G. Howard, Jeffrey Scott Vitter: New Methods for Lossless Image Compression Using Arithmetic Coding. Data Compression Conference 1991: 257-266

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

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

Roberto Tamassia, Ioannis G. Tollis, Jeffrey Scott Vitter: Lower bounds and parallel algorithms for planar orthogonal grid drawings. SPDP 1991: 386-393

Jeffrey Scott Vitter: Efficient Memory Access in Large-Scale Computation. STACS 1991: 26-41

Cris Koutsougeras, Jeffrey Scott Vitter (Eds.): Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, May 5-8, 1991, New Orleans, Louisiana, USA. ACM 1991, isbn 0-89791-397-3

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

Mark H. Nodine, Daniel P. Lopresti, Jeffrey Scott Vitter: I/O Overhead and Parallel VLSI Architectures for Lattice Computations. ICCI 1990: 497-506

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

Roberto Tamassia, Jeffrey Scott Vitter: Optimal Cooperative Search in Fractional Cascaded Data Structures. SPAA 1990: 307-316

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

Franco P. Preparata, Jeffrey Scott Vitter, Mariette Yvinec: Output-Sensitive Generation of the Perspective View of Isothetic Parallelepipeds. SWAT 1990: 71-84

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

Jeffrey Scott Vitter: Algorithm 673: Dynamic Huffman coding. ACM Trans. Math. Softw. 15(2): 158-167 (1989)

Jyh-Han Lin, Jeffrey Scott Vitter: Complexity Issues in Learning by Neural Nets. COLT 1989: 118-133

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

Kenneth Basye, Thomas L. Dean, Jeffrey Scott Vitter: Coping With Uncertainty in Map Learning. IJCAI 1989: 663-668

Roberto Tamassia, Jeffrey Scott Vitter: Optimal Parallel Algorithms for Transitive Closure and Point Location in Planar Structures. SPAA 1989: 399-408

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

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

Alok Aggarwal, Jeffrey Scott Vitter: The Input/Output Complexity of Sorting and Related Problems. Commun. ACM 31(9): 1116-1127 (1988)

Catherine A. Schevon, Jeffrey Scott Vitter: A Parallel Algorithm for Recognizing Unordered Depth-First Search. Inf. Process. Lett. 28(2): 105-110 (1988)

Jeffrey Scott Vitter, Jyh-Han Lin: Learning in Parallel. COLT 1988: 106-124

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

Jeffrey Scott Vitter: Design and analysis of dynamic Huffman codes. J. ACM 34(4): 825-845 (1987)

Jeffrey Scott Vitter: An efficient algorithm for sequential random sampling. ACM Trans. Math. Softw. 13(1): 58-67 (1987)

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

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

Robert Sedgewick, Jeffrey Scott Vitter: Shortest Paths in Euclidean Graphs. Algorithmica 1(1): 31-48 (1986)

Wen-Chin Chen, Jeffrey Scott Vitter: Deletion Algorithms for Coalesced Hashing. Comput. J. 29(5): 436-450 (1986)

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

Jeffrey Scott Vitter, Wen-Chin Chen: Optimum Algorithms for a Model of Direct Chaining. SIAM J. Comput. 14(2): 490-499 (1985)

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

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

Jeffrey Scott Vitter: An Efficient I/O Interface for Optical Disks. ACM Trans. Database Syst. 10(2): 129-162 (1985)

Jeffrey Scott Vitter: Random Sampling with a Reservoir. ACM Trans. Math. Softw. 11(1): 37-57 (1985)

Jeffrey Scott Vitter: Design and Analysis of Dynamic Huffman Coding (Extended Abstract). FOCS 1985: 293-302

Jeffrey Scott Vitter: Faster Methods for Random Sampling. Commun. ACM 27(7): 703-718 (1984)

Jeffrey Scott Vitter: US&R: A New Framework for Redoing. IEEE Software 1(4): 39-52 (1984)

Wen-Chin Chen, Jeffrey Scott Vitter: Analysis of New Variants of Coalesced Hashing. ACM Trans. Database Syst. 9(4): 616-645 (1984)

Jeffrey Scott Vitter, Roger A. Simons: Parallel algorithms for unification and other complete problems in p. ACM Conference on Computer Science 1984: 75-84

Robert Sedgewick, Jeffrey Scott Vitter: Shortest Paths in Euclidean Graphs (Extended Abstract). FOCS 1984: 417-424

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

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

Jeffrey Scott Vitter: Analysis of the Search Performance of Coalesced Hashing. J. ACM 30(2): 231-258 (1983)

Wen-Chin Chen, Jeffrey Scott Vitter: Analysis of Early-Insertion Standard Coalesced Hashing. SIAM J. Comput. 12(4): 667-676 (1983)

Jeffrey Scott Vitter: Optimum Algorithms for Two Random Sampling Problems (Extended Abstract). FOCS 1983: 65-75

Jeffrey Scott Vitter: Implementations for Coalesced Hashing. Commun. ACM 25(12): 911-926 (1982)

Jeffrey Scott Vitter: Deletion Algorithms for Hashing That Preserve Randomness. J. Algorithms 3(3): 261-275 (1982)

Jeffrey Scott Vitter: A Shared-Memory Scheme for Coalesced Hashing. Inf. Process. Lett. 13(2): 77-79 (1981)

Jeffrey Scott Vitter: Deletion Algorithms for Hashing that Preserve Randomness (detailed abstract). FOCS 1981: 127-132

Jeffrey Scott Vitter: Tuning the Coalesced Hashing Method to Obtain Optimum Performance (Detailed Abstract). FOCS 1980: 238-247