The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Jeffrey Scott Vitter: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  210. Parallel algorithms for unification and other complete problems in p. [Citation Graph (, )][DBLP]


  211. Compression, Indexing, and Retrieval for Massive String Data. [Citation Graph (, )][DBLP]


  212. Compressed Index for Dictionary Matching. [Citation Graph (, )][DBLP]


  213. Geometric Burrows-Wheeler Transform: Linking Range Searching and Text Indexing. [Citation Graph (, )][DBLP]


  214. I/O-Efficient Compressed Text Indexes: From Theory to Practice. [Citation Graph (, )][DBLP]


  215. The SBC-tree: an index for run-length compressed sequences. [Citation Graph (, )][DBLP]


  216. Space-Efficient Framework for Top-k String Retrieval Problems. [Citation Graph (, )][DBLP]


  217. Succinct Index for Dynamic Dictionary Matching. [Citation Graph (, )][DBLP]


  218. On searching compressed string collections cache-obliviously. [Citation Graph (, )][DBLP]


  219. Tight competitive ratios for parallel disk prefetching and caching. [Citation Graph (, )][DBLP]


  220. Lower bounds and parallel algorithms for planar orthogonal grid drawings. [Citation Graph (, )][DBLP]


  221. Constrained querying of multimedia databases: issues and approaches. [Citation Graph (, )][DBLP]


  222. CAMEL: concept annotated image libraries. [Citation Graph (, )][DBLP]


  223. On Entropy-Compressed Text Indexing in External Memory. [Citation Graph (, )][DBLP]


Search in 0.010secs, Finished in 1.058secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002