| Random sampling with a reservoir JS Vitter ACM Transactions on Mathematical Software (TOMS) 11 (1), 37-57, 1985 | 2583 | 1985 |
| The input/output complexity of sorting and related problems A Aggarwal, JS Vitter Communications of the ACM 31 (9), 1116-1127, 1988 | 1866 | 1988 |
| High-order entropy-compressed text indexes R Grossi, A Gupta, JS Vitter Society for Industrial and Applied Mathematics Philadelphia, 2003 | 1074 | 2003 |
| External memory algorithms and data structures: dealing with massive data JS Vitter ACM Computing surveys (CsUR) 33 (2), 209-271, 2001 | 953 | 2001 |
| Compressed suffix arrays and suffix trees with applications to text indexing and string matching R Grossi, JS Vitter Proceedings of the thirty-second annual ACM symposium on Theory of computing …, 2000 | 931 | 2000 |
| Design and analysis of dynamic Huffman codes JS Vitter Journal of the ACM (JACM) 34 (4), 825-845, 1987 | 638 | 1987 |
| Wavelet-based histograms for selectivity estimation Y Matias, JS Vitter, M Wang Proceedings of the 1998 ACM SIGMOD international conference on Management of …, 1998 | 627 | 1998 |
| Algorithms for parallel memory, I: Two-level memories JS Vitter, EAM Shriver Algorithmica 12 (2), 110-147, 1994 | 536 | 1994 |
| Approximate computation of multidimensional aggregates of sparse data using wavelets JS Vitter, M Wang Acm Sigmod Record 28 (2), 193-204, 1999 | 531 | 1999 |
| Arithmetic coding for data compression PG Howard, JS Vitter Proceedings of the IEEE 82 (6), 857-865, 2002 | 504 | 2002 |
| External-memory graph algorithms YJ Chiang, MT Goodrich, EF Grove, R Tamassia, DE Vengroff, JS Vitter Society for Industrial and Applied Mathematics, 1995 | 489 | 1995 |
| Efficient indexing methods for probabilistic threshold queries over uncertain data R Cheng, Y Xia, S Prabhakar, R Shah, JS Vitter Proceedings of the Thirtieth international conference on Very large data …, 2004 | 396 | 2004 |
| Practical prefetching via data compression KM Curewitz, P Krishnan, JS Vitter ACM SIGMOD Record 22 (2), 257-266, 1993 | 364 | 1993 |
| Scalable sweeping-based spatial join L Arge, O Procopiuc, S Ramaswamy, T Suel, JS Vitter VLDB 98, 570-581, 1998 | 350 | 1998 |
| Optimal prefetching via data compression JS Vitter, P Krishnan Journal of the ACM (JACM) 43 (5), 771-793, 1996 | 347 | 1996 |
| Average-Case Analysis of Algorithms and Data Structures JS Vitter, P Flajolet Handbook of Theoretical Computer Science, 1990 | 345 | 1990 |
| Data cube approximation and histograms via wavelets JS Vitter, M Wang, B Iyer Proceedings of the seventh international conference on Information and …, 1998 | 339 | 1998 |
| Fast and efficient lossless image compression PG Howard, JS Vitter [Proceedings] DCC93: Data Compression Conference, 351-360, 1993 | 334 | 1993 |
| e-Approximations with minimum packing constraint violation JH Lin, JS Vitter Proceedings of the twenty-fourth annual ACM symposium on Theory of computing …, 1992 | 329 | 1992 |
| External-memory computational geometry MT Goodrich, JJ Tsay, DE Vengroff, JS Vitter Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science, 714-723, 1993 | 320 | 1993 |
Rahul ShahProfessor of Computer Science, Louisiana State UniversityVerified email at csc.lsu.edu
