Jeffrey S. Vitter, PhD/MBA - Publications

Affiliations: 
1980-1992 Computer Science Brown University, Providence, RI 
 1993-2002 Computer Science Duke University, Durham, NC 
 2002-2008 Computer Science Purdue University, West Lafayette, IN, United States 
 2008-2010 Computer Science and Engineering Texas A&M U. 
 2010-2015 Electrical Engineering and Computer Science University of Kansas, Lawrence, KS, United States 
 2016- Computer and Information Science University of Mississippi, Oxford, MS, United States 
Area:
Computer Science
Website:
chancellor.OleMiss.edu

172 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any innacuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2016 Yu Q, Huo H, Zhao R, Feng D, Vitter JS, Huan J. RefSelect: a reference sequence selection algorithm for planted (l, d) motif search. Bmc Bioinformatics. 17: 266. PMID 27454113 DOI: 10.1186/s12859-016-1130-6  1
2016 Ian Munro J, Nekrich Y, Vitter JS. Fast construction of wavelet trees Theoretical Computer Science. 638: 91-97. DOI: 10.1016/j.tcs.2015.11.011  1
2015 Yu Q, Huo H, Vitter JS, Huan J, Nekrich Y. An Efficient Exact Algorithm for the Motif Stem Search Problem over Large Alphabets. Ieee/Acm Transactions On Computational Biology and Bioinformatics / Ieee, Acm. 12: 384-97. PMID 26357225 DOI: 10.1109/TCBB.2014.2361668  1
2015 Yu Q, Huo H, Chen X, Guo H, Vitter JS, Huan J. An Efficient Algorithm for Discovering Motifs in Large DNA Data Sets. Ieee Transactions On Nanobioscience. PMID 25872217 DOI: 10.1109/TNB.2015.2421340  1
2015 Munro JI, Nekrich Y, Vitter JS. Dynamic Data Structures for Document Collections and Graphs Proceedings of the Acm Sigact-Sigmod-Sigart Symposium On Principles of Database Systems. 31: 277-289. DOI: 10.1145/2745754.2745778  1
2015 Yu Q, Huo H, Zhao R, Feng D, Vitter JS, Huan J. Reference sequence selection for motif searches Proceedings - 2015 Ieee International Conference On Bioinformatics and Biomedicine, Bibm 2015. 569-574. DOI: 10.1109/BIBM.2015.7359745  1
2015 Hon WK, Ku TH, Lam TW, Shah R, Tam SL, Thankachan SV, Vitter JS. Compressing Dictionary Matching Index via Sparsification Technique Algorithmica. 72: 515-538. DOI: 10.1007/s00453-013-9863-3  1
2015 Chien YF, Hon WK, Shah R, Thankachan SV, Vitter JS. Geometric BWT: Compressed Text Indexing via Sparse Suffixes and Range Searching Algorithmica. 71: 258-278. DOI: 10.1007/s00453-013-9792-1  1
2015 Huo H, Chen L, Zhao H, Vitter JS, Nekrich Y, Yu Q. A data-aware FM-index Proceedings of the Workshop On Algorithm Engineering and Experiments. 2015: 10-23.  1
2014 Lewenstein M, Nekrich Y, Vitter JS. Space-efficient string indexing for wildcard pattern matching Leibniz International Proceedings in Informatics, Lipics. 25: 506-517. DOI: 10.4230/LIPIcs.STACS.2014.506  1
2014 Patil M, Thankachan SV, Shah R, Nekrich Y, Vitter JS. Categorical Range Maxima Queries Proceedings of the Acm Sigact-Sigmod-Sigart Symposium On Principles of Database Systems. 266-277. DOI: 10.1145/2594538.2594557  1
2014 Hon WK, Shah R, Thankachan SV, Vitter JS. Space-efficient frameworks for top-κ string retrieval Journal of the Acm. 61. DOI: 10.1145/2590774  1
2014 Huo H, Chen L, Vitter JS, Nekrich Y. A practical implementation of compressed suffix arrays with applications to self-indexing Data Compression Conference Proceedings. 292-301. DOI: 10.1109/DCC.2014.49  1
2014 Yu Q, Huo H, Chen X, Guo H, Vitter JS, Huan J. An efficient motif finding algorithm for large DNA data sets Proceedings - 2014 Ieee International Conference On Bioinformatics and Biomedicine, Ieee Bibm 2014. 397-402. DOI: 10.1109/BIBM.2014.6999191  1
2013 Winslett M, Braganholo V, Vitter JS. Jeff Vitter speaks out on being a southerner, duties of a dean, and more Sigmod Record. 42: 35-45. DOI: 10.1145/2503792.2503801  1
2013 Hon WK, Shah R, Thankachan SV, Vitter JS. Faster compressed top-k document retrieval Data Compression Conference Proceedings. 341-350. DOI: 10.1109/DCC.2013.42  1
2013 Yu Q, Huo H, Vitter JS, Huan J, Nekrich Y. StemFinder: An efficient algorithm for searching motif stems over large alphabets Proceedings - 2013 Ieee International Conference On Bioinformatics and Biomedicine, Ieee Bibm 2013. 473-476. DOI: 10.1109/BIBM.2013.6732539  1
2013 Hon WK, Ku TH, Shah R, Thankachan SV, Vitter JS. Faster compressed dictionary matching Theoretical Computer Science. 475: 113-119. DOI: 10.1016/j.tcs.2012.10.050  1
2013 Hon WK, Ku TH, Shah R, Thankachan SV, Vitter JS. Compressed text indexing with wildcards Journal of Discrete Algorithms. 19: 23-29. DOI: 10.1016/j.jda.2012.12.003  1
2013 Shah R, Sheng C, Thankachan SV, Vitter JS. Top-k document retrieval in external memory Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 8125: 803-814. DOI: 10.1007/978-3-642-40450-4_68  1
2013 Nekrich Y, Vitter JS. Optimal color range reporting in one dimension Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 8125: 743-754. DOI: 10.1007/978-3-642-40450-4_63  1
2013 Hon WK, Patil M, Shah R, Thankachan SV, Vitter JS. Indexes for document retrieval with relevance Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 8066: 351-362. DOI: 10.1007/978-3-642-40273-9_22  1
2012 Külekci MO, Vitter JS, Xu B. Efficient maximal repeat finding using the burrows-wheeler transform and wavelet tree. Ieee/Acm Transactions On Computational Biology and Bioinformatics / Ieee, Acm. 9: 421-9. PMID 21968959 DOI: 10.1109/TCBB.2011.127  1
2012 Vitter JS. Compressed data structures with relevance Acm International Conference Proceeding Series. 4-5. DOI: 10.1145/2396761.2396765  1
2012 Külekci MO, Vitter JS, Xu B. Fast pattern-matching via k-bit filtering based text decomposition Computer Journal. 55: 62-68. DOI: 10.1093/comjnl/bxq090  1
2012 Hon WK, Shah R, Thankachan SV, Vitter JS. On position restricted substring searching in succinct space Journal of Discrete Algorithms. 17: 109-114. DOI: 10.1016/j.jda.2012.09.002  1
2012 Hon WK, Shah R, Thankachan SV, Vitter JS. Document listing for queries with excluded pattern Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7354: 185-195. DOI: 10.1007/978-3-642-31265-6_15  1
2011 Patil M, Thankachan SV, Shah R, Hon WK, Vitter JS, Chandrasekaran S. Inverted indexes for phrases and strings Sigir'11 - Proceedings of the 34th International Acm Sigir Conference On Research and Development in Information Retrieval. 555-564. DOI: 10.1145/2009916.2009992  1
2011 Hon WK, Ku TH, Shah R, Thankachan SV, Vitter JS. Compressed dictionary matching with one error Data Compression Conference Proceedings. 113-122. DOI: 10.1109/DCC.2011.18  1
2011 Grossi R, Vitter JS, Xu B. Wavelet trees: From theory to practice Proceedings - 1st International Conference On Data Compression, Communication, and Processing, Ccp 2011. 210-221. DOI: 10.1109/CCP.2011.16  1
2011 Hon WK, Lam TW, Shah R, Tam SL, Vitter JS. Cache-oblivious index for approximate string matching Theoretical Computer Science. 412: 3579-3588. DOI: 10.1016/j.tcs.2011.03.004  1
2011 Hon WK, Ku TH, Shah R, Thankachan SV, Vitter JS. Compressed text indexing with wildcards Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7024: 267-277. DOI: 10.1007/978-3-642-24583-1_26  1
2010 Chiu SY, Hon WK, Shah R, Vitter JS. I/O-efficient compressed text indexes: From theory to practice Data Compression Conference Proceedings. 426-434. DOI: 10.1109/DCC.2010.45  1
2010 Külekci MO, Hon WK, Shah R, Vitter JS, Xu B. PSI-RA: A parallel sparse index for read alignment on genomes Proceedings - 2010 Ieee International Conference On Bioinformatics and Biomedicine, Bibm 2010. 663-668. DOI: 10.1109/BIBM.2010.5706648  1
2010 Külekci MO, Vitter JS, Xu B. Time- and space-efficient maximal repeat finding using the burrows-wheeler transform and wavelet trees Proceedings - 2010 Ieee International Conference On Bioinformatics and Biomedicine, Bibm 2010. 622-625. DOI: 10.1109/BIBM.2010.5706641  1
2010 Külekci MO, Vitter JS, Xu B. Boosting pattern matching performance via k-bit filtering Lecture Notes in Electrical Engineering. 62: 27-32. DOI: 10.1007/978-90-481-9794-1_6  1
2010 Hon WK, Shah R, Thankachan SV, Vitter JS. String retrieval for multi-pattern queries Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6393: 55-66. DOI: 10.1007/978-3-642-16321-0_6  1
2010 Hon WK, Ku TH, Shah R, Thankachan SV, Vitter JS. Faster compressed dictionary matching Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6393: 191-200. DOI: 10.1007/978-3-642-16321-0_19  1
2010 Hon WK, Shah R, Vitter JS. Compression, indexing, and retrieval for massive string data Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6129: 260-274. DOI: 10.1007/978-3-642-13509-5_24  1
2009 Hon WK, Shah R, Vitter JS. Space-efficient framework for top-k string retrieval problems Proceedings - Annual Ieee Symposium On Foundations of Computer Science, Focs. 713-722. DOI: 10.1109/FOCS.2009.19  1
2009 Hon WK, Lam TW, Shah R, Tam SL, Vitter JS. Succinct index for dynamic dictionary matching Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5878: 1034-1043. DOI: 10.1007/978-3-642-10631-6_104  1
2009 Hon WK, Shah R, Thankachan SV, Vitter JS. On entropy-compressed text indexing in external memory Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5721: 75-89. DOI: 10.1007/978-3-642-03784-9_8  1
2008 Hon WK, Varman PJ, Shah R, Vitter JS. Tight competitive ratios for parallel disk prefetching and caching Annual Acm Symposium On Parallelism in Algorithms and Architectures. 352-361. DOI: 10.1145/1378533.1378593  1
2008 Ferragina P, Grossi R, Gupta A, Shah R, Vitter JS. On searching compressed string collections cache-obliviously Proceedings of the Acm Sigact-Sigmod-Sigart Symposium On Principles of Database Systems. 181-190. DOI: 10.1145/1376916.1376943  1
2008 Eltabakh MY, Hon WK, Shah R, Aref WG, Vitter JS. The SBC-tree: An index for run-length compressed sequences Advances in Database Technology - Edbt 2008 - 11th International Conference On Extending Database Technology, Proceedings. 523-534. DOI: 10.1145/1353343.1353407  1
2008 Chien YF, Hon WK, Shah R, Vitter JS. Geometric burrows-wheeler transform: linking range searching and text indexing Data Compression Conference Proceedings. 252-261. DOI: 10.1109/DCC.2008.67  1
2008 Hon WK, Shah R, Lam TW, Tam SL, Vitter JS. Compressed index for dictionary matching Data Compression Conference Proceedings. 23-32. DOI: 10.1109/DCC.2008.62  1
2008 Gupta A, Grossi R, Vitter JS. Nearly tight bounds on the encoding length of the burrows-wheeler transform Proceedings of the 10th Workshop On Algorithm Engineering and Experiments and the 5th Workshop On Analytic Algorithmics and Combinatorics. 191-202.  1
2007 Lim L, Wang M, Padmanabhan S, Vitter JS, Agarwal R. Efficient update of indexes for dynamically changing Web documents World Wide Web. 10: 37-69. DOI: 10.1007/s11280-006-0009-2  1
2007 Arge L, Vengroff DE, Vitter JS. External-memory algorithms for processing line segments in geographic information systems Algorithmica (New York). 47: 1-25. DOI: 10.1007/s00453-006-1208-z  1
2007 Gupta A, Hon WK, Shah R, Vitter JS. A framework for dynamizing succinct data structures Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4596: 521-532.  1
2006 Vitter JS. Algorithms and data structures for external memory Foundations and Trends in Theoretical Computer Science. 2: 305-474. DOI: 10.1561/0400000014  1
2006 Ilyas IF, Aref WG, Elmagarmid AK, Elmongui HG, Shah R, Vitter JS. Adaptive rank-aware query optimization in relational databases Acm Transactions On Database Systems. 31: 1257-1304. DOI: 10.1145/1189769.1189772  1
2006 Cheng R, Singh S, Prabhakar S, Shah R, Vitter JS, Xia Y. Efficient join processing over uncertain data International Conference On Information and Knowledge Management, Proceedings. 738-747. DOI: 10.1145/1183614.1183719  1
2006 Vitter JS, Hutchinson DA. Distribution sort with randomized cycling Journal of the Acm. 53: 656-680. DOI: 10.1145/1162349.1162352  1
2006 Matias Y, Segal E, Vitter JS. Efficient bundle sorting Siam Journal On Computing. 36: 394-410. DOI: 10.1137/S0097539704446554  1
2006 Gupta A, Hon WK, Shah R, Vitter JS. Compressed data structures: Dictionaries and data-aware measures Data Compression Conference Proceedings. 213-222. DOI: 10.1109/DCC.2006.12  1
2006 Gupta A, Hon WK, Shah R, Vitter JS. Compressed dictionaries: Space measures, data sets, and experiments Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4007: 158-169.  1
2005 Ouzzani M, Aref WG, Bertino E, Catlin AC, Clifton CW, Hon WK, Elmagarmid AK, Ghafoor A, Hambrusch SE, Prabhakar S, Vitter JS, Zhang X. The Indiana Center for Database Systems at Purdue University Sigmod Record. 34: 53-58. DOI: 10.1145/1083784.1083795  1
2005 Hutchinson DA, Sanders P, Vitter JS. Duality between prefetching and queued writing with parallel disks Siam Journal On Computing. 34: 1443-1463. DOI: 10.1137/S0097539703431573  1
2005 Anastasiadis SV, Varman P, Vitter JS, Yi K. Optimal lexicographic shaping of aggregate streaming data Ieee Transactions On Computers. 54: 398-408. DOI: 10.1109/TC.2005.67  1
2005 Shah R, Varman PJ, Vitter JS. Brief announcement: On competitive online read-many parallel disks scheduling Annual Acm Symposium On Parallelism in Algorithms and Architectures. 217.  1
2005 Lim L, Wang M, Vitter JS. CXHist: An on-line classification-based histogram for XML string selectivity estimation Vldb 2005 - Proceedings of 31st International Conference On Very Large Data Bases. 3: 1187-1198.  1
2004 Grossi R, Gupta A, Vitter JS. When Indexing Equals Compression: Experiments with Compressing Suffix Arrays and Applications Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 15: 629-638. DOI: 10.1145/1198513.1198521  1
2004 Ghanem TM, Shah R, Mokbel MF, Aref WG, Vitter JS. Bulk operations for space-partitioning trees Proceedings - International Conference On Data Engineering. 20: 29-40. DOI: 10.1109/ICDE.2004.1319982  1
2004 Muthukrishnan S, Shah R, Vitter JS. Mining deviants in time series data streams Proceedings of the International Conference On Scientific and Statistical Database Management, Ssdbm. 16: 41-50.  1
2004 Shah R, Varman PJ, Vitter JS. Online algorithms for prefetching and caching on parallel disks Annual Acm Symposium On Parallel Algorithms and Architectures. 16: 255-264.  1
2004 Foschini L, Grossit R, Gupta A, Vitter JS. Fast compression with a static model in high-order entropy Data Compression Conference Proceedings. 62-71.  1
2004 Ilyas IF, Shah R, Aref WG, Vitter JS, Elmagarmid AK. Rank-aware query optimization Proceedings of the Acm Sigmod International Conference On Management of Data. 203-214.  1
2003 Lim L, Wang M, Padmanabhan S, Vitter JS, Agarwal R. Dynamic maintenance of web indexes using landmarks Proceedings of the 12th International Conference On World Wide Web, Www 2003. 102-111. DOI: 10.1145/775152.775167  1
2003 Arge L, Vitter JS. Optimal external memory interval management Siam Journal On Computing. 32: 1488-1508. DOI: 10.1137/S009753970240481X  1
2003 Arge L, Chase JS, Halpin P, Toma L, Vitter JS, Urban D, Wickremesinghe R. Efficient flow computation on massive grid terrain datasets Geoinformatica. 7: 283-313. DOI: 10.1023/A:1025526421410  1
2003 Matias Y, Vitter JS, Ni WC. Dynamic generation of discrete random variates Theory of Computing Systems. 36: 329-357. DOI: 10.1007/s00224-003-1078-6  1
2003 Grossi R, Gupta A, Vitter JS. High-order entropy-compressed text indexes Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 841-850.  1
2003 Goldin DQ, Shvartsman AA, Smolka SA, Vitter JS, Zdonik SB. Principles of Computing and Knowledge - Paris C. Kanellakis Memorial Workshop: Preface Principles of Computing and Knowledge: Paris C. Kanellakis Memorial Workshop. iii.  0.01
2003 Procopiuc O, Agarwal PK, Arge L, Vitter JS. Bkd-tree: A dynamic scalable kd-tree Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2750: 46-65.  1
2002 Wickremesinghe R, Arge L, Chase JS, Vitter JS. Efficient sorting using register and caches Journal of Experimental Algorithmics. 7. DOI: 10.1145/944618.944627  1
2002 Wickremesinghe R, Chase JS, Vitter JS. Distributed computing with load-managed active storage Proceedings of the Ieee International Symposium On High Performance Distributed Computing. 2002: 13-23. DOI: 10.1109/HPDC.2002.1029899  1
2002 Barve RD, Vitter JS. A simple and efficient parallel disk mergesort Theory of Computing Systems. 35: 189-215.  1
2002 Grossi R, Vitter JS. Compressed Indexes for Fast Search in Sequences Proceedings of the Joint Conference On Information Sciences. 6: 44-47.  1
2002 Anastasiadis S, Varman P, Vitter JS, Yi K. Lexicographically optimal smoothing for broadband traffic multiplexing Proceedings of the Annual Acm Symposium On Principles of Distributed Computing. 68-77.  1
2002 Arge L, Procopiuc O, Vitter JS. Implementing I/O-efficient data structures using TPIE Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2461: 88-100.  1
2001 Arge L, Toma L, Vitter JS. I/O-efficient algorithms for problems on grid-based terrains Journal of Experimental Algorithmics. 6. DOI: 10.1145/945394.945395  1
2001 Natsev AP, Smith JR, Chang YC, Li CS, Vitter JS. Constrained querying of multimedia databases: Issues and approaches Proceedings of Spie - the International Society For Optical Engineering. 4315: 74-85. DOI: 10.1117/12.410976  1
2001 Natsev A, Chadha A, Soetarman B, Vitter JS. CAMEL: Concept Annotated iMagE Libraries Proceedings of Spie - the International Society For Optical Engineering. 4315: 62-73. DOI: 10.1117/12.410975  1
2001 Vitter JS. External memory algorithms and data structures: deaimg with massive data Acm Computing Surveys. 33: 209-271.  1
2001 Vitter JS, Hutchinson DA. Distribution sort with randomized cycle Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 77-86.  1
2001 Hutchinson DA, Sanders P, Vitter JS. The power of duality for prefetching and sorting with parallel disks Annual Acm Symposium On Parallel Algorithms and Architectures. 334-335.  1
2001 Arge L, Chase J, Vitter JS, Wickremesinghe R. Efficient sorting using registers and caches Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1982: 51-62.  1
2001 Wang M, Vitter JS, Lim L, Padmanabhan S. Wavelet-based cost estimation for spatial queries Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2121: 175-193.  1
2001 Natsev A, Chang YC, Smith JR, Li CS, Vitter JS. Supporting incremental join queries on ranked inputs Vldb 2001 - Proceedings of 27th International Conference On Very Large Data Bases. 281-290.  1
2001 Toma L, Wickremesinghe R, Arge L, Chase JS, Vitter JS, Halpin PN, Urban D. Flow computation on massive grids Proceedings of the Acm Workshop On Advances in Geographic Information Systems. 82-87.  1
2000 Agarwal PK, Grove EF, Murali TM, Vitter JS. Binary space partitions for fat rectangles Siam Journal On Computing. 29: 1422-1448. DOI: 10.1137/S0097539797320578  1
2000 Grossi R, Vitter JS. Compressed suffix arrays and suffix trees with applications to text indexing and string matching Conference Proceedings of the Annual Acm Symposium On Theory of Computing. 397-406. DOI: 10.1137/S0097539702402354  1
2000 Agarwal PK, Arge L, Erickson J, Franciosa PG, Vitter JS. Efficient searching with linear constraints Journal of Computer and System Sciences. 61: 194-216. DOI: 10.1006/jcss.2000.1709  1
2000 Barve R, Kallahalla M, Varman PJ, Vitter JS. Competitive Parallel Disk Prefetc Buffer Management Journal of Algorithms. 36: 152-181. DOI: 10.1006/jagm.2000.1089  1
2000 Matias Y, Vitter JS, Wang M. Dynamic maintenance of wavelet-based histograms Proceedings of the 26th International Conference On Very Large Data Bases, Vldb'00. 101-110.  1
2000 Barve RD, Grove EF, Vitter JS. Application-controlled paging for a shared cache Siam Journal On Computing. 29: 1290-1303.  1
2000 Agarwal PK, Guibas LJ, Murali TM, Vitter JS. Cylindrical static and kinetic binary space partitions Computational Geometry: Theory and Applications. 16: 103-127.  1
1999 Long PM, Natsev AI, Vitter JS. Text compression via alphabet re-representation. Neural Networks : the Official Journal of the International Neural Network Society. 12: 755-765. PMID 12662681 DOI: 10.1016/S0893-6080(99)00022-2  1
1999 Hoang DT, Long PM, Vitter JS. Dictionary selection using partial matching Information Sciences. 119: 57-72. DOI: 10.1016/S0020-0255(99)00060-2  1
1999 Vitter JS. Online data structures in external memory Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1663: 352-366.  1
1999 Vitter JS, Zaroliagis CD. Author Index Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1668: 1.  1
1999 Vitter JS, Zaroliagis CD. Algorithm Engineering Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1668.  1
1999 Vitter JS, Wang M. Approximate Computation of Multidimensional Aggregates of Sparse Data Using Wavelets Sigmod Record (Acm Special Interest Group On Management of Data). 28: 193-204.  1
1999 Krishnan P, Long PM, Vitter JS. Adaptive disk spindown via optimal rent-to-buy in probabilistic environments Algorithmica (New York). 23: 31-56.  1
1999 Grove EF, Murali TM, Vitter JS. The object complexity model for hidden-surface removal International Journal of Computational Geometry and Applications. 9: 207-217.  1
1999 Arge L, Hinrichs KH, Vahrenhold J, Vitter JS. Efficient bulk operations on dynamic r-trees Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1619: 328-347.  1
1998 Hoang DT, Long PM, Vitter JS. Efficient cost measures for motion estimation at low bit rates Ieee Transactions On Circuits and Systems For Video Technology. 8: 488-500. DOI: 10.1109/76.709413  1
1998 Krishnan P, Vitter JS. Optimal prediction for prefetching in the worst case Siam Journal On Computing. 27: 1617-1636.  1
1998 Matias Y, Vitter JS, Wang M. Wavelet-based histograms for selectivity estimation Sigmod Record. 27: 448-459.  1
1998 Murali TM, Agarwal PK, Vitter JS. Constructing binary space partitions for orthogonal rectangles in practice Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1461: 211-222.  1
1998 Barve R, Shriver E, Gibbons PB, Hillyer BK, Matias Y, Vitter JS. Modeling and optimizing I/O throughput of multiple disks on a bus (summary) Performance Evaluation Review. 26: 264-267.  1
1997 Basye K, Dean T, Vitter JS. Coping with Uncertainty in Map Learning Machine Learning. 29: 65-88.  1
1997 Barve RD, Grove EF, Vitter JS. Simple randomized mergesort on parallel disks Parallel Computing. 23: 601-631.  1
1997 Hoang DT, Linzer EL, Vitter JS. Lexicographic Bit Allocation for MPEG Video Journal of Visual Communication and Image Representation. 8: 384-404.  1
1996 Howard PG, Vitter JS. Parallel lossless image compression using Huffman and arithmetic coding Information Processing Letters. 59: 65-73. DOI: 10.1016/0020-0190(96)00090-7  1
1996 Kanellakis P, Ramaswamy S, Vengroff DE, Vitter JS. Indexing for data models with constraints and classes Journal of Computer and System Sciences. 52: 589-612. DOI: 10.1006/jcss.1996.0043  1
1996 Romanik K, Vitter JS. Using Vapnik-Chervonenkis Dimension to Analyze the Testing Complexity of Program Segments Information and Computation. 128: 87-108. DOI: 10.1006/inco.1996.0065  1
1996 Tamassia R, Vitter JS. Optimal Cooperative Search in Fractional Cascaded Data Structures Algorithmica (New York). 15: 154-171.  1
1996 Vitter JS, Krishnan P. Optimal prefetching via data compression Journal of the Acm. 43: 771-793.  1
1996 Nodine MH, Goodrich MT, Vitter JS. Blocking for External Graph Searching Algorithmica (New York). 16: 181-214.  1
1996 Krishnan P, Vitter JS, Iyer B. Estimating Alphanumeric Selectivity in the Presence of Wildcards Sigmod Record (Acm Special Interest Group On Management of Data). 25: 282-293.  1
1996 Tamassia R, Agarwal PK, Amato N, Chen DZ, Dobkin D, Drysdale S, Fortune S, Goodrich MT, Hershberger J, O'Rourke J, Preparata FP, Sack JR, Suri S, Tollis I, Vitter JS, et al. Strategic directions in computational geometry Acm Computing Surveys. 28: 591-606.  1
1996 Gibson GA, Vitter JS, Wilkes J, Choudhary A, Corbett P, Cormen TH, Ellis CS, Goodrich MT, Highnam P, Kotz D, Li K, Muntz RR, Pasquale J, Satyanarayanan M, Vengroff DE. Strategic directions in storage I/O issues in large-scale computing Acm Computing Surveys. 28: 779-793.  1
1995 Nodine MH, Vitter JS. Greed Sort: Optimal Deterministic Sorting on Parallel Disks Journal of the Acm (Jacm). 42: 919-933. DOI: 10.1145/210332.210343  1
1995 Subramanian S, Tamassia R, Vitter JS. An efficient parallel algorithm for shortest paths in planar layered digraphs Algorithmica. 14: 322-339. DOI: 10.1007/BF01294130  1
1995 Grove EF, Kao MY, Krishnan P, Vitter JS. Online perfect matching and mobile computing Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 955: 194-205. DOI: 10.1007/3-540-60220-8_62  1
1995 Arge L, Vengroff DE, Vitter JS. External-memory algorithms for processing line segments geographic information systems Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 979: 295-310.  1
1994 Howard PG, Vitter JS. Arithmetic Coding for Data Compression Proceedings of the Ieee. 82: 857-865. DOI: 10.1109/5.286189  1
1994 Lin JH, Vitter JS. A Theory for Memory-Based Learning Machine Learning. 17: 143-167. DOI: 10.1023/A:1022667616941  1
1994 Howard PG, Vitter JS. Design and analysis of fast text compression based on quasi-arithmetic coding Information Processing and Management. 30: 777-790. DOI: 10.1016/0306-4573(94)90006-X  1
1994 Miltersen PB, Subramanian S, Vitter JS, Tamassia R. Complexity models for incremental computation Theoretical Computer Science. 130: 203-236. DOI: 10.1016/0304-3975(94)90159-7  1
1994 Vitter JS, Shriver EAM. Algorithms for parallel memory, II: Hierarchical multilevel memories Algorithmica. 12: 148-169. DOI: 10.1007/BF01185208  1
1994 Vitter JS, Shriver EAM. Algorithms for parallel memory, I: Two-level memories Algorithmica. 12: 110-147. DOI: 10.1007/BF01185207  1
1994 Vitter JS. Guest editor's introduction Algorithmica. 12: 69-71. DOI: 10.1007/BF01185205  1
1993 Curewitz KM, Krishnan P, Vitter JS. Practical Prefetching via Data Compression Acm Sigmod Record. 22: 257-266. DOI: 10.1145/170036.170077  1
1993 Vitter JS, Nodine MH. Large-Scale Sorting in Uniform Memory Hierarchies Journal of Parallel and Distributed Computing. 17: 107-114. DOI: 10.1006/jpdc.1993.1008  1
1992 Vitter JS, Lin JH. Learning in parallel Information and Computation. 96: 179-202. DOI: 10.1016/0890-5401(92)90047-J  1
1992 Howard PG, Vitter JS. New methods for lossless image compression using arithmetic coding Information Processing and Management. 28: 765-779. DOI: 10.1016/0306-4573(92)90067-A  1
1992 Howard PG, Vitter JS. Analysis of arithmetic coding for data compression Information Processing and Management. 28: 749-763. DOI: 10.1016/0306-4573(92)90066-9  1
1992 Lin JH, Vitter JS. Approximation algorithms for geometric median problems Information Processing Letters. 44: 245-249. DOI: 10.1016/0020-0190(92)90208-D  1
1992 Preparata FP, Vitter JS, Yvinec M. Output-sensitive generation of the perspective view of isothetic parallelepipeds Algorithmica. 8: 257-283. DOI: 10.1007/BF01758847  1
1991 Nodine MH, Lopresti DP, Vitter JS. I/O Overhead and Parallel VLSI Architectures for Lattice Computations Ieee Transactions On Computers. 40: 843-852. DOI: 10.1109/12.83622  1
1991 Lin JH, Vitter JS. Complexity Results on Learning by Neural Nets Machine Learning. 6: 211-230. DOI: 10.1023/A:1022657626762  1
1991 Tamassia R, Tollis IG, Vitter JS. Lower bounds for planar orthogonal drawings of graphs Information Processing Letters. 39: 35-40. DOI: 10.1016/0020-0190(91)90059-Q  1
1991 Kenyon CM, Vitter JS. Maximum queue size and hashing with lazy deletion Algorithmica. 6: 597-619. DOI: 10.1007/BF01759063  1
1991 Buchsbaum AL, Kanellakis PC, Vitter JS. A data structure for arc insertion and regular path finding Annals of Mathematics and Artificial Intelligence. 3: 187-210. DOI: 10.1007/BF01530925  1
1990 Preparata FP, Vitter JS, Yvinec M. Computation of the Axial View of a Set of Isothetic Parallelepipeds Acm Transactions On Graphics (Tog). 9: 278-300. DOI: 10.1145/78964.78967  1
1989 Vitter JS. Algorithm 673: Dynamic Huffman coding Acm Transactions On Mathematical Software (Toms). 15: 158-167. DOI: 10.1145/63522.214390  1
1988 Aggarwal A, Vitter JS. The Input/Output Complexity of Sorting and Related Problems Communications of the Acm. 31: 1116-1127. DOI: 10.1145/48529.48535  1
1988 Schevon CA, Vitter JS. A parallel algorithm for recognizing unordered depth-first search Information Processing Letters. 28: 105-110. DOI: 10.1016/0020-0190(88)90172-X  1
1988 Vitter JS. Editor's foreword special issue on parallel and distributed computing, Part II Algorithmica. 3: 289-291. DOI: 10.1007/BF01762119  1
1988 Vitter JS. Editor's foreword special issue on parallel and distributed computing, Part I Algorithmica. 3: 1-3. DOI: 10.1007/BF01762107  1
1987 Vitter JS. Design and Analysis of Dynamic Huffman Codes Journal of the Acm (Jacm). 34: 825-845. DOI: 10.1145/31846.42227  1
1987 Vitter JS. An Efficient Algorithm for Sequential Random Sampling Acm Transactions On Mathematical Software (Toms). 13: 58-67. DOI: 10.1145/23002.23003  1
1987 Stasko JT, Vitter JS. Pairing heaps: Experiments and analysis Communications of the Acm. 30: 234-249. DOI: 10.1145/214748.214759  1
1986 Vitter JS, Simons RA. New Classes for Parallel Complexity: A Study of Unification and Other Complete Problems for P Ieee Transactions On Computers. 403-418. DOI: 10.1109/TC.1986.1676783  1
1986 Sedgewick R, Vitter JS. Shortest paths in euclidean graphs Algorithmica. 1: 31-48. DOI: 10.1007/BF01840435  1
1986 Van Wyk CJ, Vitter JS. The complexity of hashing with lazy deletion Algorithmica. 1: 17-29. DOI: 10.1007/BF01840434  1
1986 Chen WC, Vitter JS. DELETION ALGORITHMS FOR COALESCED HASHING Computer Journal. 29: 436-450.  1
1985 Vitter JS. An Efficient I/O Interface for Optical Disks Acm Transactions On Database Systems (Tods). 10: 129-162. DOI: 10.1145/3857.3862  1
1985 Vitter JS. Random Sampling with a Reservoir Acm Transactions On Mathematical Software (Toms). 11: 37-57. DOI: 10.1145/3147.3165  1
1985 Lindstrom EE, Vitter JS, Wong CK. Introduction — Sorting Ieee Transactions On Computers. 293-295. DOI: 10.1109/TC.1985.5009378  1
1985 Lindstrom EE, Vitter JS. The Design and Analysis of Bucket Sort for Bubble Memory Secondary Storage Ieee Transactions On Computers. 218-233. DOI: 10.1109/TC.1985.1676565  1
1984 Vitter JS. US&R: A new framework for redoing (Extended Abstract) Acm Sigplan Notices. 19: 168-176. DOI: 10.1145/390011.808262  1
1984 Vitter JS. Faster Methods for Random Sampling Communications of the Acm. 27: 703-718. DOI: 10.1145/358105.893  1
1984 Chen WC, Vitter JS. Analysis of New variants of Coalesced Hashing Acm Transactions On Database Systems (Tods). 9: 616-645. DOI: 10.1145/1994.2205  1
1983 Vitter JS. Analysis of the Search Performance of Coalesced Hashing Journal of the Acm (Jacm). 30: 231-258. DOI: 10.1145/322374.322375  1
1982 Vitter JS. Implementations for Coalesced Hashing Communications of the Acm. 25: 911-926. DOI: 10.1145/358728.358745  1
1982 Vitter JS. Deletion algorithms for hashing that preserve randomness Journal of Algorithms. 3: 261-275. DOI: 10.1016/0196-6774(82)90024-4  1
1981 Vitter JS. A shared-memory scheme for coalesced hashing Information Processing Letters. 13: 77-79. DOI: 10.1016/0020-0190(81)90037-5  1
Show low-probability matches.