DiSC - Author Index

Jeffrey Scott Vitter

Online DBLP entries are available for Jeffrey Scott Vitter and the following references. (The DiSC DBLP references below have been taken from the Novemember 1998 DBLP.)

Jeffrey Scott Vitter, Min Wang , Balakrishna R. Iyer : Data Cube Approximation and Histograms via Wavelets. CIKM 1998 : 96-104

Jeffrey Scott Vitter: External Memory Algorithms. ESA 1998 : 1-25

T. M. Murali , Pankaj K. Agrawal , Jeffrey Scott Vitter: Constructing Binary Space Partitions for Orthogonal Rectabgles in Practice. ESA 1998 : 211-222

Min Wang , Balakrishna R. Iyer , Jeffrey Scott Vitter: Scalable Mining for Classification Rules in Relational Databases. IDEAS 1998 : 58-67

Jeffrey Scott Vitter: External Memory Algorithms. PODS 1998 : 119-128

Pankaj K. Agarwal , Lars Arge , Jeff Erickson , Paolo Giulio Franciosa , Jeffrey Scott Vitter: Efficient Searching with Linear Constraints. PODS 1998 : 169-178

Rakesh D. Barve , Elizabeth M. A. Shriver , Phillip B. Gibbons , Bruce Hillyer , Yossi Matias , Jeffrey Scott Vitter: Modeling and Optimizing I/O Throughput of Multiple Disks on a Bus (Summary). SIGMETRICS 1998 : 264-265

Yossi Matias , Jeffrey Scott Vitter, Min Wang : Wavelet-Based Histograms for Selectivity Estimation. SIGMOD Conference 1998 : 448-459

Lars Arge , Octavian Procopiuc , Sridhar Ramaswamy , Torsten Suel , Jeffrey Scott Vitter: Scalable Sweeping-Based Spatial Join. VLDB 1998 : 570-581

P. Krishnan , Jeffrey Scott Vitter: Optimal Prediction for Prefetching in the Worst Case. SIAM J. Comput. 27 (6): 1617-1636 (1998)

Min Wang , Jeffrey Scott Vitter, Balakrishna R. Iyer : Selectivity Estimation in the Presence of Alphanumeric Correlations. ICDE 1997 : 169-180

Lars Arge , Paolo Ferragina , Roberto Grossi , Jeffrey Scott Vitter: On Sorting Strings in External Memory (Extended Abstract). STOC 1997 : 540-548

Pankaj K. Agarwal , T. M. Murali , Jeffrey Scott Vitter: Practical Techniques for Constructing Binary Space Partitions for Orthogonal Rectangles. Symposium on Computational Geometry 1997 : 382-384

Pankaj K. Agarwal , Leonidas J. Guibas , T M. Murali , Jeffrey Scott Vitter: Cylindrical Static and Kinetic Binary Space Partitions. Symposium on Computational Geometry 1997 : 39-48

Rakesh D. Barve , Edward F. Grove , Jeffrey Scott Vitter: Simple Randomized Mergesort on Parallel Disks. Parallel Computing 23 (4-5): 601-631 (1997)

Dzung T. Hoang , Philip M. Long , Jeffrey Scott Vitter: Efficient Cost Measures for Motion Compensation at Low Bit Rates (Extended Abstract). Data Compression Conference 1996 : 102-111

P. Krishnan , Jeffrey Scott Vitter, Balakrishna R. Iyer : Estimating Alphanumeric Selectivity in the Presence of Wildcards. SIGMOD Conf. 1996 : 282-293

Rakesh D. Barve , Edward F. Grove , Jeffrey Scott Vitter: Simple Randomized Mergesort on Parallel Disks. SPAA 1996 : 109-118

Darren Erik Vengroff , Jeffrey Scott Vitter: Efficient 3-D Range Searching in External Memory. STOC 1996 : 192-201

Roberto Tamassia , Jeffrey Scott Vitter: Optimal Cooperative Search in Fractional Cascaded Data Structures. Algorithmica 15 (2): 154-171 (1996)

Mark H. Nodine , Michael T. Goodrich , Jeffrey Scott Vitter: Blocking for External Graph Searching. Algorithmica 16 (2): 181-214 (1996)

Garth A. Gibson , Jeffrey Scott Vitter, John Wilkes : Strategic Directions in Storage I/O Issues in Large-Scale Computing. Computing Surveys 28 (4): 779-793 (1996)

Jeffrey Scott Vitter: Communication Issues in Large-Scale Geometric Computation. Computing Surveys 28 (4es): 20 (1996)

Darren Erik Vengroff , Jeffrey Scott Vitter: I/O-Efficient Algorithms and Environments. Computing Surveys 28 (4es): 212 (1996)

Paul G. Howard , Jeffrey Scott Vitter: Parallel Lossless Image Compression Using Huffman and Arithmetic Coding. IPL 59 (2): 65-73 (1996)

Kathleen Romanik , Jeffrey Scott Vitter: Using Vapnik-Chervonenkis Dimension to Analyze the Testing Complexity of Program Segments. Information and Computation 128 (2): 87-108 (1996)

Jeffrey Scott Vitter, P. Krishnan : Optimal Prefetching via Data Compression. JACM 43 (5): 771-793 (1996)

Paris C. Kanellakis , Sridhar Ramaswamy , Darren Erik Vengroff , Jeffrey Scott Vitter: Indexing for Data Models with Constraints and Classes. JCSS 52 (3): 589-612 (1996)

Lars Arge , Darren Erik Vengroff , Jeffrey Scott Vitter: External-Memory Algorithms for Processing Line Segments in Geographic Information Systems (Extended Abstract). ESA 1995 : 295-310

Rakesh D. Barve , Edward F. Grove , Jeffrey Scott Vitter: Application-Controlled Paging for a Shared Cache (Extended Abstract). FOCS 1995 : 204-213

Baruch Awerbuch , Yossi Azar , Edward F. Grove , Ming-Yang Kao , P. Krishnan , Jeffrey Scott Vitter: Load Balancing in the L _p Norm. FOCS 1995 : 383-391

Edward F. Grove , Ming-Yang Kao , P. Krishnan , Jeffrey Scott Vitter: Online Perfect Matching and Mobile Computing. WADS 1995 : 194-205

Sairam Subramanian , Roberto Tamassia , Jeffrey Scott Vitter: An Efficient Parallel Algorithm for Shortest Paths in Planar Layered Digraphs. Algorithmica 14 (4): 322-339 (1995)

Mark H. Nodine , Jeffrey Scott Vitter: Greed Sort: Optimal Deterministic Sorting on Parallel Disks. JACM 42 (4): 919-933 (1995)

Jeffrey Scott Vitter, Elizabeth A. M. Shriver : Algorithms for Parallel Memory I: Two-Level Memories. Algorithmica 12 (2/3): 110-147 (1994)

Jeffrey Scott Vitter, Elizabeth A. M. Shriver : Algorithms for Parallel Memory II: Hierarchical Multilevel Memories. Algorithmica 12 (2/3): 148-169 (1994)

Jeffrey Scott Vitter: Guest Editor's Introduction: Special Issue on Large-Scale Memories. Algorithmica 12 (2/3): 69-71 (1994)

Peter Bro Miltersen , Sairam Subramanian , Jeffrey Scott Vitter, Roberto Tamassia : Complexity Models for Incremental Computation. TCS 130 (1): 203-236 (1994)

Michael T. Goodrich , Jyh-Jong Tsay , Darren Erik Vengroff , Jeffrey Scott Vitter: External-Memory Computational Geometry (Preliminary Version). FOCS 1993 : 714-723

Mark H. Nodine , Michael T. Goodrich , Jeffrey Scott Vitter: Blocking for External Graph Searching. PODS 1993 : 222-232

Paris C. Kanellakis , Sridhar Ramaswamy , Darren Erik Vengroff , Jeffrey Scott Vitter: Indexing for Data Models with Constraints and Classes. PODS 1993 : 233-243

Kenneth M. Curewitz , P. Krishnan , Jeffrey Scott Vitter: Practical Prefetching via Data Compression. SIGMOD Conference 1993 : 257-266

S. Sairam , Jeffrey Scott Vitter, Roberto Tamassia : A Complexity Theoretic Approach to Incremental Computation. STACS 1993 : 640-649

Franco P. Preparata , Jeffrey Scott Vitter: A Simplified Technique for Hidden-Line Elimination in Terrains. STACS 1992 : 135-146

Jyh-Han Lin , Jeffrey Scott Vitter: epsilon-Approximations with Minimum Packing Constraint Violation (Extended Abstract). STOC 1992 : 771-782

Franco P. Preparata , Jeffrey Scott Vitter, Mariette Yvinec : Output-Sensitive Generation of the Perspective View of Isothetic Parallelepipeds. Algorithmica 8 (4): 257-283 (1992)

Jyh-Han Lin , Jeffrey Scott Vitter: Approximation Algorithms for Geometric Median Problems. IPL 44 (5): 245-249 (1992)

Paul G. Howard , Jeffrey Scott Vitter: Analysis of Arithmetic Coding for Data Compression. Information Processing and Management 28 (6): 749-764 (1992)

Paul G. Howard , Jeffrey Scott Vitter: New Methods for Lossless Image Compression Using Arithmetic Coding. Information Processing and Management 28 (6): 765-780 (1992)

Jeffrey Scott Vitter, Jyh-Han Lin : Learning in Parallel. Information and Computation 96 (2): 179-202 (1992)

Jeffrey Scott Vitter, P. Krishnan : Optimal Prefetching via Data Compression (Extended Abstract). FOCS 1991 : 121-130

Jeffrey Scott Vitter: Efficient Memory Access in Large-Scale Computation. STACS 1991 : 26-41

Claire Kenyon , Jeffrey Scott Vitter: Maximum Queue Size and Hashing with Lazy Deletion. Algorithmica 6 (4): 597-619 (1991)

Mark H. Nodine , Daniel P. Lopresti , Jeffrey Scott Vitter: I/O Overhead and Parallel VLSI Architectures for Lattice Computations. IEEE Transactions on Computers 40 (7): 843-852 (1991)

Roberto Tamassia , Ioannis G. Tollis , Jeffrey Scott Vitter: Lower Bounds for Planar Orthogonal Drawings of Graphs. IPL 39 (1): 35-40 (1991)

Roberto Tamassia , Jeffrey Scott Vitter: Parallel Transitive Closure and Point Location in Planar Structures. SIAM J. Comput. 20 (4): 708-725 (1991)

Claire Kenyon-Mathieu , Jeffrey Scott Vitter: The Maximum Size of Dynamic Data Structures. SIAM J. Comput. 20 (5): 807-823 (1991)

Mark H. Nodine , Daniel P. Lopresti , Jeffrey Scott Vitter: I/O Overhead and Parallel VLSI Architectures for Lattice Computations. ICCI 1990 : 497-506

Adam L. Buchsbaum , Paris C. Kanellakis , Jeffrey Scott Vitter: A Data Structure for Arc Insertion and Regular Path Finding. SODA 1990 : 22-31

Jeffrey Scott Vitter, Elizabeth A. M. Shriver : Optimal Disk I/O with Parallel Block Transfer (Extended Abstract). STOC 1990 : 159-169

Franco P. Preparata , Jeffrey Scott Vitter, Mariette Yvinec : Output-Sensitive Generation of the Perspective View of Isothetic Parallelepipeds. SWAT 1990 : 71-84

Claire Kenyon-Mathieu , Jeffrey Scott Vitter: General Methods for the Analysis of the Maximum Size of Dynamic Data Structures (Extended Abstract). ICALP 1989 : 473-487

Jeffrey Scott Vitter: Editor's Foreword: Special Issue on Parallel and Distributed Computing, Part I. Algorithmica 3 : 1-3 (1988)

Jeffrey Scott Vitter: Editor's Foreword: Special Issue on Parallel and Distributed Computing, Part II. Algorithmica 3 : 289-291 (1988)

Alok Aggarwal , Jeffrey Scott Vitter: The Input/Output Complexity of Sorting and Related Problems. CACM 31 (9): 1116-1127 (1988)

Catherine A. Schevon , Jeffrey Scott Vitter: A Parallel Algorithm for Recognizing Unordered Depth-First Search. IPL 28 (2): 105-110 (1988)

Alok Aggarwal , Jeffrey Scott Vitter: The I/O Complexity of Sorting and Related Problems (Extended Abstract). ICALP 1987 : 467-478

John T. Stasko , Jeffrey Scott Vitter: Pairing Heaps: Experiments and Analysis. CACM 30 (3): 234-249 (1987)

Jeffrey Scott Vitter: Design and Analysis of Dynamic Huffman Codes. JACM 34 (4): 825-845 (1987)

Christopher J. Van Wyk , Jeffrey Scott Vitter: The Complexity of Hashing with Lazy Deletion. Algorithmica 1 (1): 17-29 (1986)

Robert Sedgewick , Jeffrey Scott Vitter: Shortest Paths in Euclidean Graphs. Algorithmica 1 (1): 31-48 (1986)

Jeffrey Scott Vitter, Roger A. Simons : New Classes for Parallel Complexity: A Study of Unification and Other Complete Problems for P . IEEE Transactions on Computers 35 (5): 403-418 (1986)

Wen-Chin Chen , Jeffrey Scott Vitter: Deletion Algorithms for Coalesced Hashing. The Computer Journal 29 (5): 436-450 (1986)

Jeffrey Scott Vitter: Design and Analysis of Dynamic Huffman Coding (Extended Abstract). FOCS 1985 : 293-302

Eugene E. Lindstrom , Jeffrey Scott Vitter: The Design and Analysis of BucketSort for Bubble Memory Secondary Storage. IEEE Transactions on Computers 34 (3): 218-233 (1985)

Jeffrey Scott Vitter, Wen-Chin Chen : Optimum Algorithms for a Model of Direct Chaining. SIAM J. Comput. 14 (2): 490-499 (1985)

Wen-Chin Chen , Jeffrey Scott Vitter: Addendum to "Analysis of Some New Variants of Coalesced Hashing". TODS 10 (1): 127 (1985)

Jeffrey Scott Vitter: An Efficient I/O Interface for Optical Disks. TODS 10 (2): 129-162 (1985)

Jeffrey Scott Vitter: Random Sampling with a Reservoir. TOMS 11 (1): 37-57 (1985)

Robert Sedgewick , Jeffrey Scott Vitter: Shortest Paths in Euclidean Graphs (Extended Abstract). FOCS 1984 : 417-424

Jeffrey Scott Vitter: Computational Complexity of an Optical Disk Interface (Extended Abstract). ICALP 1984 : 490-502

Jeffrey Scott Vitter: USeR: A New Framework for Redoing. Software Development Environments (SDE) 1984 : 168-176

Jeffrey Scott Vitter: Faster Methods for Random Sampling. CACM 27 (7): 703-718 (1984)

Wen-Chin Chen , Jeffrey Scott Vitter: Analysis of New Variants of Coalesced Hashing. TODS 9 (4): 616-645 (1984)

Jeffrey Scott Vitter: Optimum Algorithms for Two Random Sampling Problems (Extended Abstract). FOCS 1983 : 65-75

Jeffrey Scott Vitter: Analysis of the Search Performance of Coalesced Hashing. JACM 30 (2): 231-258 (1983)

Wen-Chin Chen , Jeffrey Scott Vitter: Analysis of Early-Insertion Standard Coalesced Hashing. SIAM J. Comput. 12 (4): 667-676 (1983)

Jeffrey Scott Vitter: Implementations for Coalesced Hashing. CACM 25 (12): 911-926 (1982)

Jeffrey Scott Vitter: Deletion Algorithms for Hashing That Preserve Randomness. J. Algorithms 3 (3): 261-275 (1982)

Jeffrey Scott Vitter: Deletion Algorithms for Hashing that Preserve Randomness (detailed abstract). FOCS 1981 : 127-132

Jeffrey Scott Vitter: A Shared-Memory Scheme for Coalesced Hashing. Information Processing Letters 13 (2): 77-79 (1981)

Jeffrey Scott Vitter: Tuning the Coalesced Hashing Method to Obtain Optimum Performance (Detailed Abstract). FOCS 1980 : 238-247

DBLP: Copyright ©1999 by Michael Ley (ley@uni-trier.de).