 | 2009 |
|---|
| 227 |       | Wing-Kai Hon,
Tak Wah Lam,
Rahul Shah,
Siu-Lung Tam,
Jeffrey Scott Vitter:
Succinct Index for Dynamic Dictionary Matching.
ISAAC 2009: 1034-1043 |
| 226 | | Wing-Kai Hon,
Rahul Shah,
Sharma V. Thankachan,
Jeffrey Scott Vitter:
On Entropy-Compressed Text Indexing in External Memory.
SPIRE 2009: 75-89 |
| 2008 |
|---|
| 225 | | Wing-Kai Hon,
Tak Wah Lam,
Rahul Shah,
Siu-Lung Tam,
Jeffrey Scott Vitter:
Compressed Index for Dictionary Matching.
DCC 2008: 23-32 |
| 224 | | 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 |
| 223 | | 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 |
| 222 | | Paolo Ferragina,
Roberto Grossi,
Ankur Gupta,
Rahul Shah,
Jeffrey Scott Vitter:
On searching compressed string collections cache-obliviously.
PODS 2008: 181-190 |
| 221 | | Wing-Kai Hon,
Rahul Shah,
Peter J. Varman,
Jeffrey Scott Vitter:
Tight competitive ratios for parallel disk prefetching and caching.
SPAA 2008: 352-361 |
| 220 | | Paul G. Howard,
Jeffrey Scott Vitter:
Arithmetic Coding for Data Compression.
Encyclopedia of Algorithms 2008 |
| 219 | | Jeffrey Scott Vitter:
External Sorting and Permuting.
Encyclopedia of Algorithms 2008 |
| 2007 |
|---|
| 218 | | 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 |
| 217 | | Ankur Gupta,
Wing-Kai Hon,
Rahul Shah,
Jeffrey Scott Vitter:
A Framework for Dynamizing Succinct Data Structures.
ICALP 2007: 521-532 |
| 216 | | 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 |
| 215 | | 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) |
| 214 | | 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) |
| 2006 |
|---|
| 213 | | Reynold Cheng,
Sarvjeet Singh,
Sunil Prabhakar,
Rahul Shah,
Jeffrey Scott Vitter,
Yuni Xia:
Efficient join processing over uncertain data.
CIKM 2006: 738-747 |
| 212 | | Ankur Gupta,
Wing-Kai Hon,
Rahul Shah,
Jeffrey Scott Vitter:
Compressed Data Structures: Dictionaries and Data-Aware Measures.
DCC 2006: 213-222 |
| 211 | | Ankur Gupta,
Wing-Kai Hon,
Rahul Shah,
Jeffrey Scott Vitter:
Compressed Dictionaries: Space Measures, Data Sets, and Experiments.
WEA 2006: 158-169 |
| 210 | | 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) |
| 209 | | 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) |
| 208 | | Jeffrey Scott Vitter:
Algorithms and Data Structures for External Memory.
Foundations and Trends in Theoretical Computer Science 2(4): 305-474 (2006) |
| 207 | | Jeffrey Scott Vitter,
David A. Hutchinson:
Distribution sort with randomized cycling.
J. ACM 53(4): 656-680 (2006) |
| 206 | | Yossi Matias,
Eran Segal,
Jeffrey Scott Vitter:
Efficient Bundle Sorting.
SIAM J. Comput. 36(2): 394-410 (2006) |
| 2005 |
|---|
| 205 | | Rahul Shah,
Peter J. Varman,
Jeffrey Scott Vitter:
On competitive online read-many parallel disks scheduling.
SPAA 2005: 217 |
| 204 | | Lipyeow Lim,
Min Wang,
Jeffrey Scott Vitter:
CXHist : An On-line Classification-Based Histogram for XML String Selectivity Estimation.
VLDB 2005: 1187-1198 |
| 203 | | 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) |
| 202 | | 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) |
| 201 | | 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) |
| 200 | | 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) |
| 2004 |
|---|
| 199 | | 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 |
| 198 | | Thanaa M. Ghanem,
Rahul Shah,
Mohamed F. Mokbel,
Walid G. Aref,
Jeffrey Scott Vitter:
Bulk Operations for Space-Partitioning Trees.
ICDE 2004: 29-41 |
| 197 | | Ihab F. Ilyas,
Rahul Shah,
Walid G. Aref,
Jeffrey Scott Vitter,
Ahmed K. Elmagarmid:
Rank-aware Query Optimization.
SIGMOD Conference 2004: 203-214 |
| 196 | | Roberto Grossi,
Ankur Gupta,
Jeffrey Scott Vitter:
When indexing equals compression: experiments with compressing suffix arrays and applications.
SODA 2004: 636-645 |
| 195 | | Rahul Shah,
Peter J. Varman,
Jeffrey Scott Vitter:
Online algorithms for prefetching and caching on parallel disks.
SPAA 2004: 255-264 |
| 194 | | S. Muthukrishnan,
Rahul Shah,
Jeffrey Scott Vitter:
Mining Deviants in Time Series Data Streams.
SSDBM 2004: 41-50 |
| 193 | | 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 |
| 2003 |
|---|
| 192 |  | Dina Q. Goldin,
Alexander A. Shvartsman,
Scott A. Smolka,
Jeffrey Scott Vitter,
Stanley B. Zdonik:
PCK50 - Principles of Computing & Knowledge, Paris C. Kanellakis Memorial Workshop, San Diego, California, USA, June 8th, 2003
ACM 2003 |
| 191 | | Roberto Grossi,
Ankur Gupta,
Jeffrey Scott Vitter:
High-order entropy-compressed text indexes.
SODA 2003: 841-850 |
| 190 | | Octavian Procopiuc,
Pankaj K. Agarwal,
Lars Arge,
Jeffrey Scott Vitter:
Bkd-Tree: A Dznamic Scalable kd-Tree.
SSTD 2003: 46-65 |
| 189 | | Lipyeow Lim,
Min Wang,
Jeffrey Scott Vitter:
SASH: A Self-Adaptive Histogram Set for Dynamically Changing Workloads.
VLDB 2003: 369-380 |
| 188 | | Lipyeow Lim,
Min Wang,
Sriram Padmanabhan,
Jeffrey Scott Vitter,
Ramesh C. Agarwal:
Dynamic maintenance of web indexes using landmarks.
WWW 2003: 102-111 |
| 187 | | 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) |
| 186 | | Lars Arge,
Jeffrey Scott Vitter:
Optimal External Memory Interval Management.
SIAM J. Comput. 32(6): 1488-1508 (2003) |
| 185 | | Yossi Matias,
Jeffrey Scott Vitter,
Wen-Chun Ni:
Dynamic Generation of Discrete Random Variates.
Theory Comput. Syst. 36(4): 329-358 (2003) |
| 2002 |
|---|
| 184 | | Apostol Natsev,
Gene Y. C. Fuh,
Weidong Chen,
Chi-Huang Chiu,
Jeffrey Scott Vitter:
Aggregate Predicate Support in DBMS.
Australasian Database Conference 2002 |
| 183 | | Lars Arge,
Octavian Procopiuc,
Jeffrey Scott Vitter:
Implementing I/O-efficient Data Structures Using TPIE.
ESA 2002: 88-100 |
| 182 | | Rajiv Wickremesinghe,
Jeffrey S. Chase,
Jeffrey Scott Vitter:
Distributed Computing with Load-Managed Active Storage.
HPDC 2002: 13-23 |
| 181 | | Jeffrey Scott Vitter,
Roberto Grossi:
Compressed Indexes for Fast Search in Sequences.
JCIS 2002: 44-48 |
| 180 | | Stergios V. Anastasiadis,
Peter J. Varman,
Jeffrey Scott Vitter,
Ke Yi:
Lexicographically optimal smoothing for broadband traffic multiplexing.
PODC 2002: 68-77 |
| 179 | | 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 |
| 178 | | Rajiv Wickremesinghe,
Lars Arge,
Jeffrey S. Chase,
Jeffrey Scott Vitter:
Efficient Sorting Using Registers and Caches.
ACM Journal of Experimental Algorithmics 7: 9 (2002) |
| 177 | | Lars Arge,
Klaus Hinrichs,
Jan Vahrenhold,
Jeffrey Scott Vitter:
Efficient Bulk Operations on Dynamic R-Trees.
Algorithmica 33(1): 104-128 (2002) |
| 176 | | Yossi Matias,
Jeffrey Scott Vitter,
Neal E. Young:
Approximate Data Structures with Applications
CoRR cs.DS/0205010: (2002) |
| 175 | | Rakesh D. Barve,
Jeffrey Scott Vitter:
A Simple and Efficient Parallel Disk Mergesort.
Theory Comput. Syst. 35(2): 189-215 (2002) |
| 2001 |
|---|
| 174 | | 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 |
| 173 | | David A. Hutchinson,
Peter Sanders,
Jeffrey Scott Vitter:
Duality between Prefetching and Queued Writing with Parallel Disks.
ESA 2001: 62-73 |
| 172 | | Pankaj K. Agarwal,
Lars Arge,
Octavian Procopiuc,
Jeffrey Scott Vitter:
A Framework for Index Bulk Loading and Dynamization.
ICALP 2001: 115-127 |
| 171 | | Jeffrey Scott Vitter,
David A. Hutchinson:
Distribution sort with randomizing cycle.
SODA 2001: 77-86 |
| 170 | | David A. Hutchinson,
Peter Sanders,
Jeffrey Scott Vitter:
The power of duality for prefetching and sorting with parallel disks.
SPAA 2001: 334-335 |
| 169 | | Min Wang,
Jeffrey Scott Vitter,
Lipyeow Lim,
Sriram Padmanabhan:
Wavelet-Based Cost Estimation for Spatial Queries.
SSTD 2001: 175-196 |
| 168 | | 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 |
| 167 | | Lipyeow Lim,
Min Wang,
Sriram Padmanabhan,
Jeffrey Scott Vitter,
Ramesh C. Agarwal:
Characterizing Web Document Change.
WAIM 2001: 133-144 |
| 166 | | Jeffrey Scott Vitter:
External memory algorithms and data structures.
ACM Comput. Surv. 33(2): 209-271 (2001) |
| 165 | | 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) |
| 2000 |
|---|
| 164 | | Lars Arge,
Jeffrey S. Chase,
Jeffrey Scott Vitter,
Rajiv Wickremesinghe:
Efficient Sorting Using Registers and Caches.
Algorithm Engineering 2000: 51-62 |
| 163 | | 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 |
| 162 | | Yossi Matias,
Eran Segal,
Jeffrey Scott Vitter:
Efficient bundle sorting.
SODA 2000: 839-848 |
| 161 | | 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 |
| 160 | | Yossi Matias,
Jeffrey Scott Vitter,
Min Wang:
Dynamic Maintenance of Wavelet-Based Histograms.
VLDB 2000: 101-110 |
| 159 | | 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) |
| 158 | | 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) |
| 157 | | 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) |
| 156 | | Roberto Tamassia,
Ioannis G. Tollis,
Jeffrey Scott Vitter:
A Parallel Algorithm for Planar Orthogonal Grid Drawings.
Parallel Processing Letters 10(1): 141-150 (2000) |
| 155 | | Rakesh D. Barve,
Edward F. Grove,
Jeffrey Scott Vitter:
Application-Controlled Paging for a Shared Cache.
SIAM J. Comput. 29(4): 1290-1303 (2000) |
| 154 | | 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) |
| 153 | | Jeffrey Scott Vitter:
ACM SIGACT 1999-2000 annual report.
SIGACT News 31(3): 2-6 (2000) |
| 1999 |
|---|
| 152 | | Jeffrey Scott Vitter,
Christos D. Zaroliagis:
Algorithm Engineering, 3rd International Workshop, WAE '99, London, UK, July 19-21, 1999, Proceedings
Springer 1999 |
| 151 | | Lars Arge,
Klaus Hinrichs,
Jan Vahrenhold,
Jeffrey Scott Vitter:
Efficient Bulk Operations on Dynamic R-trees.
ALENEX 1999: 328-348 |
| 150 | | Rakesh D. Barve,
Jeffrey Scott Vitter:
A Theoretical Framework for Memory-Adaptive Algorithms.
FOCS 1999: 273-284 |
| 149 | | Jeffrey Scott Vitter:
Online Data Structures in External Memory.
ICALP 1999: 119-133 |
| 148 | | 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 |
| 147 | | Lars Arge,
Vasilis Samoladas,
Jeffrey Scott Vitter:
On Two-Dimensional Indexability and Optimal Range Search Indexing.
PODS 1999: 346-357 |
| 146 | | 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 |
| 145 | | Jeffrey Scott Vitter,
Min Wang:
Approximate Computation of Multidimensional Aggregates of Sparse Data Using Wavelets.
SIGMOD Conference 1999: 193-204 |
| 144 | | 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 |
| 143 | | Rakesh D. Barve,
Jeffrey Scott Vitter:
A Simple and Efficient Parallel Disk Mergesort.
SPAA 1999: 232-241 |
| 142 | | Jeffrey Scott Vitter:
Online Data Structures in External Memory.
WADS 1999: 352-366 |
| 141 | | 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) |
| 140 | | Dzung T. Hoang,
Philip M. Long,
Jeffrey Scott Vitter:
Dictionary Selection Using Partial Matching.
Inf. Sci. 119(1-2): 57-72 (1999) |
| 139 | | 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) |
| 138 | | Philip M. Long,
Apostol Natsev,
Jeffrey Scott Vitter:
Text compression via alphabet re-representation.
Neural Networks 12(4-5): 755-765 (1999) |
| 1998 |
|---|
| 137 | | Jeffrey Scott Vitter,
Min Wang,
Balakrishna R. Iyer:
Data Cube Approximation and Histograms via Wavelets.
CIKM 1998: 96-104 |
| 136 | | Jeffrey Scott Vitter:
External Memory Algorithms.
ESA 1998: 1-25 |
| 135 | | T. M. Murali,
Pankaj K. Agarwal,
Jeffrey Scott Vitter:
Constructing Binary Space Partitions for Orthogonal Rectabgles in Practice.
ESA 1998: 211-222 |
| 134 | | Min Wang,
Balakrishna R. Iyer,
Jeffrey Scott Vitter:
Scalable Mining for Classification Rules in Relational Databases.
IDEAS 1998: 58-67 |
| 133 | | Jeffrey Scott Vitter:
External Memory Algorithms.
PODS 1998: 119-128 |
| 132 | | Pankaj K. Agarwal,
Lars Arge,
Jeff Erickson,
Paolo Giulio Franciosa,
Jeffrey Scott Vitter:
Efficient Searching with Linear Constraints.
PODS 1998: 169-178 |
| 131 | | 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 |
| 130 | | Yossi Matias,
Jeffrey Scott Vitter,
Min Wang:
Wavelet-Based Histograms for Selectivity Estimation.
SIGMOD Conference 1998: 448-459 |
| 129 | | 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 |
| 128 | | 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 |
| 127 | | Lars Arge,
Octavian Procopiuc,
Sridhar Ramaswamy,
Torsten Suel,
Jeffrey Scott Vitter:
Scalable Sweeping-Based Spatial Join.
VLDB 1998: 570-581 |
| 126 | | P. Krishnan,
Jeffrey Scott Vitter:
Optimal Prediction for Prefetching in the Worst Case.
SIAM J. Comput. 27(6): 1617-1636 (1998) |
| 1997 |
|---|
| 125 | | Dzung T. Hoang,
Elliot L. Linzer,
Jeffrey Scott Vitter:
A Lexicographic Framework for MPEG Rate Control.
Data Compression Conference 1997: 101-110 |
| 124 | | Philip M. Long,
Apostol Natsev,
Jeffrey Scott Vitter:
Text Compression Via Alphabet Re-Representation.
Data Compression Conference 1997: 161-170 |
| 123 | | Min Wang,
Jeffrey Scott Vitter,
Balakrishna R. Iyer:
Selectivity Estimation in the Presence of Alphanumeric Correlations.
ICDE 1997: 169-180 |
| 122 | | Dzung T. Hoang,
Jeffrey Scott Vitter,
Elliot L. Linzer:
Lexicographic Bit Allocation for MPEG Video Coding.
ICIP (1) 1997: 322-325 |
| 121 | | Dzung T. Hoang,
Jeffrey Scott Vitter:
Multiplexing VBR Video Sequences onto a CBR Channel with Lexicographic Optimization.
ICIP (1) 1997: 369-372 |
| 120 | | Rakesh D. Barve,
Mahesh Kallahalla,
Peter J. Varman,
Jeffrey Scott Vitter:
Competitive Parallel Disk Prefetching and Buffer Management.
IOPADS 1997: 47-56 |
| 119 | | Lars Arge,
Paolo Ferragina,
Roberto Grossi,
Jeffrey Scott Vitter:
On Sorting Strings in External Memory (Extended Abstract).
STOC 1997: 540-548 |
| 118 | | 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 |
| 117 | | 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 |
| 116 | | Kenneth Basye,
Thomas Dean,
Jeffrey Scott Vitter:
Coping with Uncertainty in Map Learning.
Machine Learning 29(1): 65-88 (1997) |
| 115 | | Rakesh D. Barve,
Edward F. Grove,
Jeffrey Scott Vitter:
Simple Randomized Mergesort on Parallel Disks.
Parallel Computing 23(4-5): 601-631 (1997) |
| 1996 |
|---|
| 114 | | 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 |
| 113 | | Pankaj K. Agarwal,
Edward F. Grove,
T. M. Murali,
Jeffrey Scott Vitter:
Binary Search Partitions for Fat Rectangles.
FOCS 1996: 482-491 |
| 112 | | Lars Arge,
Jeffrey Scott Vitter:
Optimal Dynamic Interval Management in External Memory (extended abstract).
FOCS 1996: 560-569 |
| 111 | | P. Krishnan,
Jeffrey Scott Vitter,
Balakrishna R. Iyer:
Estimating Alphanumeric Selectivity in the Presence of Wildcards.
SIGMOD Conference 1996: 282-293 |
| 110 | | Rakesh D. Barve,
Edward F. Grove,
Jeffrey Scott Vitter:
Simple Randomized Mergesort on Parallel Disks.
SPAA 1996: 109-118 |
| 109 | | Darren Erik Vengroff,
Jeffrey Scott Vitter:
Efficient 3-D Range Searching in External Memory.
STOC 1996: 192-201 |
| 108 | | 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) |
| 107 | | Jeffrey Scott Vitter:
Communication Issues in Large-Scale Geometric Computation.
ACM Comput. Surv. 28(4es): 20 (1996) |
| 106 | | Darren Erik Vengroff,
Jeffrey Scott Vitter:
I/O-Efficient Algorithms and Environments.
ACM Comput. Surv. 28(4es): 212 (1996) |
| 105 | | Roberto Tamassia,
Jeffrey Scott Vitter:
Optimal Cooperative Search in Fractional Cascaded Data Structures.
Algorithmica 15(2): 154-171 (1996) |
| 104 | | Mark H. Nodine,
Michael T. Goodrich,
Jeffrey Scott Vitter:
Blocking for External Graph Searching.
Algorithmica 16(2): 181-214 (1996) |
| 103 | | Kathleen Romanik,
Jeffrey Scott Vitter:
Using Vapnik-Chervonenkis Dimension to Analyze the Testing Complexity of Program Segments.
Inf. Comput. 128(2): 87-108 (1996) |
| 102 | | Paul G. Howard,
Jeffrey Scott Vitter:
Parallel Lossless Image Compression Using Huffman and Arithmetic Coding.
Inf. Process. Lett. 59(2): 65-73 (1996) |
| 101 | | Jeffrey Scott Vitter,
P. Krishnan:
Optimal Prefetching via Data Compression.
J. ACM 43(5): 771-793 (1996) |
| 100 | | 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) |
| 1995 |
|---|
| 99 | | Dzung T. Hoang,
Philip M. Long,
Jeffrey Scott Vitter:
Multiple-Dictionary Coding Using Partial Matching.
Data Compression Conference 1995: 272-281 |
| 98 | | 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 |
| 97 | | Rakesh D. Barve,
Edward F. Grove,
Jeffrey Scott Vitter:
Application-Controlled Paging for a Shared Cache (Extended Abstract).
FOCS 1995: 204-213 |
| 96 | | Baruch Awerbuch,
Yossi Azar,
Edward F. Grove,
Ming-Yang Kao,
P. Krishnan,
Jeffrey Scott Vitter:
Load Balancing in the Lp Norm.
FOCS 1995: 383-391 |
| 95 | | P. Krishnan,
Philip M. Long,
Jeffrey Scott Vitter:
Learning to Make Rent-to-Buy Decisions with Systems Applications.
ICML 1995: 233-330 |
| 94 | | 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 |
| 93 | | Edward F. Grove,
Ming-Yang Kao,
P. Krishnan,
Jeffrey Scott Vitter:
Online Perfect Matching and Mobile Computing.
WADS 1995: 194-205 |
| 92 | | Sairam Subramanian,
Roberto Tamassia,
Jeffrey Scott Vitter:
An Efficient Parallel Algorithm for Shortest Paths in Planar Layered Digraphs.
Algorithmica 14(4): 322-339 (1995) |
| 91 | | Mark H. Nodine,
Jeffrey Scott Vitter:
Greed Sort: Optimal Deterministic Sorting on Parallel Disks.
J. ACM 42(4): 919-933 (1995) |
| 1994 |
|---|
| 90 | | Dzung T. Hoang,
Philip M. Long,
Jeffrey Scott Vitter:
Explicit Bit Minimization for Motion-Compensated Video Coding.
Data Compression Conference 1994: 175-184 |
| 89 | | Yossi Matias,
Jeffrey Scott Vitter,
Neal E. Young:
Approximate Data Structures with Applications.
SODA 1994: 187-194 |
| 88 | | P. Krishnan,
Jeffrey Scott Vitter:
Optimal Prediction for Prefetching in the Worst Case.
SODA 1994: 392-401 |
| 87 | | Jeffrey Scott Vitter,
Elizabeth A. M. Shriver:
Algorithms for Parallel Memory I: Two-Level Memories.
Algorithmica 12(2/3): 110-147 (1994) |
| 86 | | Jeffrey Scott Vitter,
Elizabeth A. M. Shriver:
Algorithms for Parallel Memory II: Hierarchical Multilevel Memories.
Algorithmica 12(2/3): 148-169 (1994) |
| 85 | | Jeffrey Scott Vitter:
Guest Editor's Introduction: Special Issue on Large-Scale Memories.
Algorithmica 12(2/3): 69-71 (1994) |
| 84 | | 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) |
| 83 | | Jyh-Han Lin,
Jeffrey Scott Vitter:
A Theory for Memory-Based Learning.
Machine Learning 17(2-3): 143-167 (1994) |
| 82 | | Peter Bro Miltersen,
Sairam Subramanian,
Jeffrey Scott Vitter,
Roberto Tamassia:
Complexity Models for Incremental Computation.
Theor. Comput. Sci. 130(1): 203-236 (1994) |
| 1993 |
|---|
| 81 | | Paul G. Howard,
Jeffrey Scott Vitter:
Fast and Efficient Lossless Image Compression.
Data Compression Conference 1993: 351-360 |
| 80 | | Paul G. Howard,
Jeffrey Scott Vitter:
Design and Analysis of Fast Text Compression Based on Quasi-Arithmetic Coding.
Data Compression Conference 1993: 98-107 |
| 79 | | Michael T. Goodrich,
Jyh-Jong Tsay,
Darren Erik Vengroff,
Jeffrey Scott Vitter:
External-Memory Computational Geometry (Preliminary Version)
FOCS 1993: 714-723 |
| 78 | | Robert F. Cohen,
Sairam Sairam,
Roberto Tamassia,
Jeffrey Scott Vitter:
Dynamic algorithms for optimization problems in bounded tree-width graphs.
IPCO 1993: 99-112 |
| 77 | | Mark H. Nodine,
Michael T. Goodrich,
Jeffrey Scott Vitter:
Blocking for External Graph Searching.
PODS 1993: 222-232 |
| 76 | | Paris C. Kanellakis,
Sridhar Ramaswamy,
Darren Erik Vengroff,
Jeffrey Scott Vitter:
Indexing for Data Models with Constraints and Classes.
PODS 1993: 233-243 |
| 75 | | Kenneth M. Curewitz,
P. Krishnan,
Jeffrey Scott Vitter:
Practical Prefetching via Data Compression.
SIGMOD Conference 1993: 257-266 |
| 74 | | Yossi Matias,
Jeffrey Scott Vitter,
Wen-Chun Ni:
Dynamic Generation of Discrete Random Variates.
SODA 1993: 361-370 |
| 73 | | Mark H. Nodine,
Jeffrey Scott Vitter:
Deterministic Distribution Sort in Shared and Distributed Memory Multiprocessors.
SPAA 1993: 120-129 |
| 72 | | Sairam Sairam,
Jeffrey Scott Vitter,
Roberto Tamassia:
A Complexity Theoretic Approach to Incremental Computation.
STACS 1993: 640-649 |
| 71 | | 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) |
| 70 | | Jeffrey Scott Vitter,
Mark H. Nodine:
Large-Scale Sorting in Uniform Memory Hierarchies.
J. Parallel Distrib. Comput. 17(1-2): 107-114 (1993) |
| 1992 |
|---|
| 69 | | Jyh-Han Lin,
Jeffrey Scott Vitter:
A Theory for Memory-Based Learning.
COLT 1992: 103-115 |
| 68 | | Jyh-Han Lin,
Jeffrey Scott Vitter:
Nearly Optimal Vecot Quantization via Linear Programming.
Data Compression Conference 1992: 22-31 |
| 67 | | Paul G. Howard,
Jeffrey Scott Vitter:
Error Modeling for Hierarchical Lossless Image Compression.
Data Compression Conference 1992: 269-278 |
| 66 | | Paul G. Howard,
Jeffrey Scott Vitter:
Parallel Lossless Image Compression Using Huffman and Arithmetic Coding.
Data Compression Conference 1992: 299-308 |
| 65 | | Sairam Sairam,
Roberto Tamassia,
Jeffrey Scott Vitter:
A Divide and Conquer Approach to Shortest Paths in Planar Layered Digraphs.
SPDP 1992: 176-183 |
| 64 | | Franco P. Preparata,
Jeffrey Scott Vitter:
A Simplified Technique for Hidden-Line Elimination in Terrains.
STACS 1992: 135-146 |
| 63 | | Jyh-Han Lin,
Jeffrey Scott Vitter:
epsilon-Approximations with Minimum Packing Constraint Violation (Extended Abstract)
STOC 1992: 771-782 |
| 62 | | Franco P. Preparata,
Jeffrey Scott Vitter,
Mariette Yvinec:
Output-Sensitive Generation of the Perspective View of Isothetic Parallelepipeds.
Algorithmica 8(4): 257-283 (1992) |
| 61 | | Jeffrey Scott Vitter,
Jyh-Han Lin:
Learning in Parallel
Inf. Comput. 96(2): 179-202 (1992) |
| 60 | | Jyh-Han Lin,
Jeffrey Scott Vitter:
Approximation Algorithms for Geometric Median Problems.
Inf. Process. Lett. 44(5): 245-249 (1992) |
| 59 | | Paul G. Howard,
Jeffrey Scott Vitter:
Analysis of Arithmetic Coding for Data Compression.
Inf. Process. Manage. 28(6): 749-764 (1992) |
| 58 | | Paul G. Howard,
Jeffrey Scott Vitter:
New Methods for Lossless Image Compression Using Arithmetic Coding.
Inf. Process. Manage. 28(6): 765-780 (1992) |
| 1991 |
|---|
| 57 | | Paul G. Howard,
Jeffrey Scott Vitter:
New Methods for Lossless Image Compression Using Arithmetic Coding.
Data Compression Conference 1991: 257-266 |
| 56 | | Paul G. Howard,
Jeffrey Scott Vitter:
Analysis of Arithmetic Coding for Data Compression.
Data Compression Conference 1991: 3-12 |
| 55 | | Jeffrey Scott Vitter,
P. Krishnan:
Optimal Prefetching via Data Compression (Extended Abstract)
FOCS 1991: 121-130 |
| 54 | | Mark H. Nodine,
Jeffrey Scott Vitter:
Large-Scale Sorting in Parallel Memories (Extended Abstract).
SPAA 1991: 29-39 |
| 53 | | Roberto Tamassia,
Ioannis G. Tollis,
Jeffrey Scott Vitter:
Lower bounds and parallel algorithms for planar orthogonal grid drawings.
SPDP 1991: 386-393 |
| 52 | | Jeffrey Scott Vitter:
Efficient Memory Access in Large-Scale Computation.
STACS 1991: 26-41 |
| 51 | | Claire Kenyon,
Jeffrey Scott Vitter:
Maximum Queue Size and Hashing with Lazy Deletion.
Algorithmica 6(4): 597-619 (1991) |
| 50 | | 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) |
| 49 | | 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) |
| 48 | | Roberto Tamassia,
Ioannis G. Tollis,
Jeffrey Scott Vitter:
Lower Bounds for Planar Orthogonal Drawings of Graphs.
Inf. Process. Lett. 39(1): 35-40 (1991) |
| 47 | | Jyh-Han Lin,
Jeffrey Scott Vitter:
Complexity Results on Learning by Neural Nets.
Machine Learning 6: 211-230 (1991) |
| 46 | | Roberto Tamassia,
Jeffrey Scott Vitter:
Parallel Transitive Closure and Point Location in Planar Structures.
SIAM J. Comput. 20(4): 708-725 (1991) |
| 45 | | Claire Kenyon-Mathieu,
Jeffrey Scott Vitter:
The Maximum Size of Dynamic Data Structures.
SIAM J. Comput. 20(5): 807-823 (1991) |
| 1990 |
|---|
| 44 | | Mark H. Nodine,
Daniel P. Lopresti,
Jeffrey Scott Vitter:
I/O Overhead and Parallel VLSI Architectures for Lattice Computations.
ICCI 1990: 497-506 |
| 43 | | Adam L. Buchsbaum,
Paris C. Kanellakis,
Jeffrey Scott Vitter:
A Data Structure for Arc Insertion and Regular Path Finding.
SODA 1990: 22-31 |
| 42 | | Roberto Tamassia,
Jeffrey Scott Vitter:
Optimal Cooperative Search in Fractional Cascaded Data Structures.
SPAA 1990: 307-316 |
| 41 | | Jeffrey Scott Vitter,
Elizabeth A. M. Shriver:
Optimal Disk I/O with Parallel Block Transfer (Extended Abstract)
STOC 1990: 159-169 |
| 40 | | Franco P. Preparata,
Jeffrey Scott Vitter,
Mariette Yvinec:
Output-Sensitive Generation of the Perspective View of Isothetic Parallelepipeds.
SWAT 1990: 71-84 |
| 39 | | 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 |
| 38 | | 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) |
| 1989 |
|---|
| 37 | | Jyh-Han Lin,
Jeffrey Scott Vitter:
Complexity Issues in Learning by Neural Nets.
COLT 1989: 118-133 |
| 36 | | 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 |
| 35 | | Kenneth Basye,
Thomas Dean,
Jeffrey Scott Vitter:
Coping With Uncertainty in Map Learning.
IJCAI 1989: 663-668 |
| 34 | | Roberto Tamassia,
Jeffrey Scott Vitter:
Optimal Parallel Algorithms for Transitive Closure and Point Location in Planar Structures.
SPAA 1989: 399-408 |
| 1988 |
|---|
| 33 | | Jeffrey Scott Vitter,
Jyh-Han Lin:
Learning in Parallel.
COLT 1988: 106-124 |
| 32 | | Jeffrey Scott Vitter:
Editor's Foreword: Special Issue on Parallel and Distributed Computing, Part I.
Algorithmica 3: 1-3 (1988) |
| 31 | | Jeffrey Scott Vitter:
Editor's Foreword: Special Issue on Parallel and Distributed Computing, Part II.
Algorithmica 3: 289-291 (1988) |
| 30 | | Alok Aggarwal,
Jeffrey Scott Vitter:
The Input/Output Complexity of Sorting and Related Problems.
Commun. ACM 31(9): 1116-1127 (1988) |
| 29 | | Catherine A. Schevon,
Jeffrey Scott Vitter:
A Parallel Algorithm for Recognizing Unordered Depth-First Search.
Inf. Process. Lett. 28(2): 105-110 (1988) |
| 1987 |
|---|
| 28 | | Alok Aggarwal,
Jeffrey Scott Vitter:
The I/O Complexity of Sorting and Related Problems (Extended Abstract).
ICALP 1987: 467-478 |
| 27 | | John T. Stasko,
Jeffrey Scott Vitter:
Pairing Heaps: Experiments and Analysis.
Commun. ACM 30(3): 234-249 (1987) |
| 26 | | Jeffrey Scott Vitter:
Design and analysis of dynamic Huffman codes.
J. ACM 34(4): 825-845 (1987) |
| 1986 |
|---|
| 25 | | Christopher J. Van Wyk,
Jeffrey Scott Vitter:
The Complexity of Hashing with Lazy Deletion.
Algorithmica 1(1): 17-29 (1986) |
| 24 | | Robert Sedgewick,
Jeffrey Scott Vitter:
Shortest Paths in Euclidean Graphs.
Algorithmica 1(1): 31-48 (1986) |
| 23 | | Wen-Chin Chen,
Jeffrey Scott Vitter:
Deletion Algorithms for Coalesced Hashing.
Comput. J. 29(5): 436-450 (1986) |
| 22 | | 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) |
| 1985 |
|---|
| 21 | | Jeffrey Scott Vitter:
Design and Analysis of Dynamic Huffman Coding (Extended Abstract)
FOCS 1985: 293-302 |
| 20 | | Wen-Chin Chen,
Jeffrey Scott Vitter:
Addendum to "Analysis of Some New Variants of Coalesced Hashing".
ACM Trans. Database Syst. 10(1): 127 (1985) |
| 19 | | Jeffrey Scott Vitter:
An Efficient I/O Interface for Optical Disks.
ACM Trans. Database Syst. 10(2): 129-162 (1985) |
| 18 | | Jeffrey Scott Vitter:
Random Sampling with a Reservoir.
ACM Trans. Math. Softw. 11(1): 37-57 (1985) |
| 17 | | 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) |
| 16 | | Jeffrey Scott Vitter,
Wen-Chin Chen:
Optimum Algorithms for a Model of Direct Chaining.
SIAM J. Comput. 14(2): 490-499 (1985) |
| 1984 |
|---|
| 15 | | Jeffrey Scott Vitter,
Roger A. Simons:
Parallel algorithms for unification and other complete problems in p.
ACM Conference on Computer Science 1984: 75-84 |
| 14 | | Robert Sedgewick,
Jeffrey Scott Vitter:
Shortest Paths in Euclidean Graphs (Extended Abstract)
FOCS 1984: 417-424 |
| 13 | | Jeffrey Scott Vitter:
Computational Complexity of an Optical Disk Interface (Extended Abstract).
ICALP 1984: 490-502 |
| 12 | | Jeffrey Scott Vitter:
USeR: A New Framework for Redoing.
Software Development Environments (SDE) 1984: 168-176 |
| 11 | | Wen-Chin Chen,
Jeffrey Scott Vitter:
Analysis of New Variants of Coalesced Hashing.
ACM Trans. Database Syst. 9(4): 616-645 (1984) |
| 10 | | Jeffrey Scott Vitter:
Faster Methods for Random Sampling.
Commun. ACM 27(7): 703-718 (1984) |
| 9 | | Jeffrey Scott Vitter:
US&R: A New Framework for Redoing.
IEEE Software 1(4): 39-52 (1984) |
| 1983 |
|---|
| 8 | | Jeffrey Scott Vitter:
Optimum Algorithms for Two Random Sampling Problems (Extended Abstract)
FOCS 1983: 65-75 |
| 7 | | Jeffrey Scott Vitter:
Analysis of the Search Performance of Coalesced Hashing
J. ACM 30(2): 231-258 (1983) |
| 6 | | Wen-Chin Chen,
Jeffrey Scott Vitter:
Analysis of Early-Insertion Standard Coalesced Hashing.
SIAM J. Comput. 12(4): 667-676 (1983) |
| 1982 |
|---|
| 5 | | Jeffrey Scott Vitter:
Implementations for Coalesced Hashing.
Commun. ACM 25(12): 911-926 (1982) |
| 4 | | Jeffrey Scott Vitter:
Deletion Algorithms for Hashing That Preserve Randomness.
J. Algorithms 3(3): 261-275 (1982) |
| 1981 |
|---|
| 3 | | Jeffrey Scott Vitter:
Deletion Algorithms for Hashing that Preserve Randomness (detailed abstract)
FOCS 1981: 127-132 |
| 2 | | Jeffrey Scott Vitter:
A Shared-Memory Scheme for Coalesced Hashing.
Inf. Process. Lett. 13(2): 77-79 (1981) |
| 1980 |
|---|
| 1 | | Jeffrey Scott Vitter:
Tuning the Coalesced Hashing Method to Obtain Optimum Performance (Detailed Abstract)
FOCS 1980: 238-247 |
