☰

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 University, College Station, TX, United States 
 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
Tree Info Similar researchers PubMed Report error

85 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, 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
2020 Huo H, Chen X, Guo X, Vitter JS. Efficient compression and indexing for highly repetitive DNA sequence collections. Ieee/Acm Transactions On Computational Biology and Bioinformatics. PMID 31985436 DOI: 10.1109/Tcbb.2020.2968323  0.338
2020 Sun Z, Huo H, Huan J, Vitter JS. Feature reduction based on semantic similarity for graph classification Neurocomputing. 397: 114-126. DOI: 10.1016/J.Neucom.2020.02.047  0.327
2019 Chen X, Huo H, Huan J, Vitter JS, Zheng W, Zou L. MSQ-Index: A Succinct Index for Fast Graph Similarity Search Ieee Transactions On Knowledge and Data Engineering. 1-1. DOI: 10.1109/Tkde.2019.2954527  0.378
2019 Chen X, Huo H, Huan J, Vitter JS. An efficient algorithm for graph edit distance computation Knowledge-Based Systems. 163: 762-775. DOI: 10.1016/J.Knosys.2018.10.002  0.392
2017 Chen X, Huo H, Huan J, Vitter JS. Efficient Graph Similarity Search in External Memory Ieee Access. 5: 4551-4560. DOI: 10.1109/Access.2017.2682107  0.357
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  0.306
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  0.372
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  0.338
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  0.333
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  0.382
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  0.373
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  0.368
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  0.338
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  0.349
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  0.337
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.1016/J.Jda.2012.12.003  0.325
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.1016/J.Tcs.2012.10.050  0.336
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  0.307
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.7146/Brics.V3I12.19975  0.363
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  0.604
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. DOI: 10.1007/978-3-540-73420-8_46  0.355
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  0.337
2006 Vitter JS, Hutchinson DA. Distribution sort with randomized cycling Journal of the Acm. 53: 656-680. DOI: 10.1145/1162349.1162352  0.403
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  0.412
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  0.323
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  0.347
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  0.312
2003 Arge L, Vitter JS. Optimal external memory interval management Siam Journal On Computing. 32: 1488-1508. DOI: 10.1137/S009753970240481X  0.325
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  0.395
2002 Barve RD, Vitter JS. A simple and efficient parallel disk mergesort Theory of Computing Systems. 35: 189-215. DOI: 10.1007/S00224-002-1031-0  0.311
2002 Wickremesinghe R, Arge L, Chase JS, Vitter JS. Efficient sorting using register and caches Journal of Experimental Algorithmics. 7. DOI: 10.1007/3-540-44691-5_5  0.371
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  0.423
2001 Vitter JS. External memory algorithms and data structures: deaimg with massive data Acm Computing Surveys. 33: 209-271. DOI: 10.1145/384192.384193  0.401
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  0.341
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  0.657
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.  0.326
2000 Barve RD, Grove EF, Vitter JS. Application-controlled paging for a shared cache Siam Journal On Computing. 29: 1290-1303. DOI: 10.1137/S0097539797324278  0.355
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  0.317
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  0.352
2000 Agarwal PK, Guibas LJ, Murali TM, Vitter JS. Cylindrical static and kinetic binary space partitions Computational Geometry: Theory and Applications. 16: 103-127. DOI: 10.1016/S0925-7721(00)00005-5  0.355
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  0.41
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  0.685
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. DOI: 10.1142/S0218195999000145  0.357
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  0.321
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.  0.311
1997 Arge L, Ferragina P, Grossi R, Vitter JS. Sequence sorting in secondary storage Sequence. 331. DOI: 10.1109/Sequen.1997.666927  0.339
1997 Hoang DT, Linzer EL, Vitter JS. Lexicographic Bit Allocation for MPEG Video Journal of Visual Communication and Image Representation. 8: 384-404. DOI: 10.1006/Jvci.1997.0376  0.323
1997 Barve RD, Grove EF, Vitter JS. Simple randomized mergesort on parallel disks Parallel Computing. 23: 601-631.  0.336
1996 Vengroff DE, Vitter JS. I/O-efficient algorithms and environments Acm Computing Surveys. 28: 212-es. DOI: 10.1145/242224.242495  0.358
1996 Vitter JS, Krishnan P. Optimal prefetching via data compression Journal of the Acm. 43: 771-793. DOI: 10.1145/234752.234753  0.384
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  0.31
1996 Tamassia R, Vitter JS. Optimal Cooperative Search in Fractional Cascaded Data Structures Algorithmica (New York). 15: 154-171. DOI: 10.1007/Bf01941686  0.384
1996 Nodine MH, Goodrich MT, Vitter JS. Blocking for External Graph Searching Algorithmica (New York). 16: 181-214. DOI: 10.1007/Bf01940646  0.326
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  0.414
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  0.35
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  0.311
1994 Vitter JS, Shriver EAM. Algorithms for parallel memory, II: Hierarchical multilevel memories Algorithmica. 12: 148-169. DOI: 10.1007/Bf01185208  0.352
1994 Vitter JS, Shriver EAM. Algorithms for parallel memory, I: Two-level memories Algorithmica. 12: 110-147. DOI: 10.1007/Bf01185207  0.389
1993 PREPARATA FP, VITTER JS. A SIMPLIFIED TECHNIQUE FOR HIDDEN-LINE ELIMINATION IN TERRAINS International Journal of Computational Geometry & Applications. 3: 167-181. DOI: 10.1142/S0218195993000117  0.408
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  0.383
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  0.31
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  0.383
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  0.354
1991 Kenyon-Mathieu CM, Vitter JS. The Maximum Size of Dynamic Data Structures Siam Journal On Computing. 20: 807-823. DOI: 10.1137/0220050  0.352
1991 Tamassia R, Vitter JS. Parallel Transitive Closure and Point Location in Planar Structures Siam Journal On Computing. 20: 708-725. DOI: 10.1137/0220045  0.382
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  0.338
1991 Kenyon CM, Vitter JS. Maximum queue size and hashing with lazy deletion Algorithmica. 6: 597-619. DOI: 10.1007/Bf01759063  0.312
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  0.337
1989 Vitter JS. Algorithm 673: Dynamic Huffman coding Acm Transactions On Mathematical Software (Toms). 15: 158-167. DOI: 10.1145/63522.214390  0.393
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  0.379
1987 Vitter JS. Design and Analysis of Dynamic Huffman Codes Journal of the Acm (Jacm). 34: 825-845. DOI: 10.1145/31846.42227  0.405
1987 Vitter JS. An Efficient Algorithm for Sequential Random Sampling Acm Transactions On Mathematical Software (Toms). 13: 58-67. DOI: 10.1145/23002.23003  0.4
1987 Stasko JT, Vitter JS. Pairing heaps: Experiments and analysis Communications of the Acm. 30: 234-249. DOI: 10.1145/214748.214759  0.378
1986 Chen WC, Vitter JS. DELETION ALGORITHMS FOR COALESCED HASHING Computer Journal. 29: 436-450. DOI: 10.1093/Comjnl/29.5.436  0.403
1986 Sedgewick R, Vitter JS. Shortest paths in euclidean graphs Algorithmica. 1: 31-48. DOI: 10.1007/Bf01840435  0.336
1986 Van Wyk CJ, Vitter JS. The complexity of hashing with lazy deletion Algorithmica. 1: 17-29. DOI: 10.1007/Bf01840434  0.358
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  0.304
1985 Vitter JS. Random Sampling with a Reservoir Acm Transactions On Mathematical Software (Toms). 11: 37-57. DOI: 10.1145/3147.3165  0.395
1985 Vitter JS, Chen W. Optimum Algorithms for a Model of Direct Chaining Siam Journal On Computing. 14: 490-499. DOI: 10.1137/0214036  0.343
1984 Vitter JS. Faster Methods for Random Sampling Communications of the Acm. 27: 703-718. DOI: 10.1145/358105.893  0.402
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  0.334
1983 Vitter JS. Analysis of the Search Performance of Coalesced Hashing Journal of the Acm (Jacm). 30: 231-258. DOI: 10.1145/322374.322375  0.348
1983 Chen W, Vitter JS. Analysis of Early-Insertion Standard Coalesced Hashing Siam Journal On Computing. 12: 667-676. DOI: 10.1137/0212046  0.371
1982 Vitter JS. Implementations for Coalesced Hashing Communications of the Acm. 25: 911-926. DOI: 10.1145/358728.358745  0.403
1982 Vitter JS. Deletion algorithms for hashing that preserve randomness Journal of Algorithms. 3: 261-275. DOI: 10.1016/0196-6774(82)90024-4  0.411
Show low-probability matches.