| 
| |  | |  |
Approximate Computation of Multidimensional Aggregates of Sparse Data Using Wavelets
On Two-Dimensional Indexability and Optimal Range Search Indexing
Note: Links lead to the DBLP on the Web.
Jeffrey Scott Vitter
140
Lars Arge
,
Tavi Procopiuc
,
Sridhar Ramaswamy
,
Torsten Suel
,
Jan Vahrenhold
, Jeffrey Scott Vitter: A Unified Approach for Indexed and Non-Indexed Spatial Joins.
EDBT 2000
: 0-
139
Lars Arge
,
Klaus Hinrichs
,
Jan Vahrenhold
, Jeffrey Scott Vitter: Efficient Bulk Operations on Dynamic R-trees.
ALENEX 1999
: 328-348
138
Rakesh D. Barve
, Jeffrey Scott Vitter: A Theoretical Framework for Memory-Adaptive Algorithms.
FOCS 1999
: 273-284
137
Jeffrey Scott Vitter: Online Data Structures in External Memory.
ICALP 1999
: 119-133
136
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.
IOPADS 1999
: 1-9
135
Lars Arge
,
Vasilis Samoladas
, Jeffrey Scott Vitter: On Two-Dimensional Indexability and Optimal Range Search Indexing.
PODS 1999
: 346-357
134
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.
SIGMETRICS 1999
: 83-92
133
Jeffrey Scott Vitter,
Min Wang
: Approximate Computation of Multidimensional Aggregates of Sparse Data Using Wavelets.
SIGMOD Conference 1999
: 193-204
132
Pankaj K. Agarwal
,
Lars Arge
,
Gerth Stølting Brodal
, Jeffrey Scott Vitter: I/O-Efficient Dynamic Point Location in Monotone Planar Subdivisions.
SODA 1999
: 11-20
131
Rakesh D. Barve
, Jeffrey Scott Vitter: A Simple and Efficient Parallel Disk Mergesort.
SPAA 1999
: 232-241
130
Jeffrey Scott Vitter: Online Data Structures in External Memory.
WADS 1999
: 352-366
129
P. Krishnan
,
Philip M. Long
, Jeffrey Scott Vitter: Adaptive Disk Spindown via Optimal Rent-to-Buy in Probabilistic Environments.
Algorithmica 23
(1): 31-56 (1999)
128
Jeffrey Scott Vitter,
Min Wang
,
Balakrishna R. Iyer
: Data Cube Approximation and Histograms via Wavelets.
CIKM 1998
: 96-104
127
Jeffrey Scott Vitter: External Memory Algorithms.
ESA 1998
: 1-25
126
T. M. Murali
,
Pankaj K. Agarwal
, Jeffrey Scott Vitter: Constructing Binary Space Partitions for Orthogonal Rectabgles in Practice.
ESA 1998
: 211-222
125
Min Wang
,
Balakrishna R. Iyer
, Jeffrey Scott Vitter: Scalable Mining for Classification Rules in Relational Databases.
IDEAS 1998
: 58-67
124
Jeffrey Scott Vitter: External Memory Algorithms.
PODS 1998
: 119-128
123
Pankaj K. Agarwal
,
Lars Arge
,
Jeff Erickson
,
Paolo Giulio Franciosa
, Jeffrey Scott Vitter: Efficient Searching with Linear Constraints.
PODS 1998
: 169-178
122
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).
SIGMETRICS 1998
: 264-265
121
Yossi Matias
, Jeffrey Scott Vitter,
Min Wang
: Wavelet-Based Histograms for Selectivity Estimation.
SIGMOD Conference 1998
: 448-459
120
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).
SODA 1998
: 117-126
119
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).
SODA 1998
: 685-694
118
Lars Arge
,
Octavian Procopiuc
,
Sridhar Ramaswamy
,
Torsten Suel
, Jeffrey Scott Vitter: Scalable Sweeping-Based Spatial Join.
VLDB 1998
: 570-581
117
P. Krishnan
, Jeffrey Scott Vitter: Optimal Prediction for Prefetching in the Worst Case.
SIAM J. Comput. 27
(6): 1617-1636 (1998)
116
Dzung T. Hoang
,
Elliot L. Linzer
, Jeffrey Scott Vitter: A Lexicographic Framework for MPEG Rate Control.
DCC 1997
: 101-110
115
Philip M. Long
,
Apostol Natsev
, Jeffrey Scott Vitter: Text Compression Via Alphabet Re-Representation.
DCC 1997
: 161-170
114
Min Wang
, Jeffrey Scott Vitter,
Balakrishna R. Iyer
: Selectivity Estimation in the Presence of Alphanumeric Correlations.
ICDE 1997
: 169-180
113
Rakesh D. Barve
,
Mahesh Kallahalla
,
Peter J. Varman
, Jeffrey Scott Vitter: Competitive Parallel Disk Prefetching and Buffer Management.
IOPADS 1997
: 47-56
112
Lars Arge
,
Paolo Ferragina
,
Roberto Grossi
, Jeffrey Scott Vitter: On Sorting Strings in External Memory (Extended Abstract).
STOC 1997
: 540-548
111
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
110
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
109
Kenneth Basye
,
Thomas Dean
, Jeffrey Scott Vitter: Coping with Uncertainty in Map Learning.
Machine Learning 29
(1): 65-88 (1997)
108
Rakesh D. Barve
,
Edward F. Grove
, Jeffrey Scott Vitter: Simple Randomized Mergesort on Parallel Disks.
Parallel Computing 23
(4-5): 601-631 (1997)
107
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
106
Pankaj K. Agarwal
,
Edward F. Grove
,
T. M. Murali
, Jeffrey Scott Vitter: Binary Search Partitions for Fat Rectangles.
FOCS 1996
: 482-491
105
Lars Arge
, Jeffrey Scott Vitter: Optimal Dynamic Interval Management in External Memory (extended abstract).
FOCS 1996
: 560-569
104
P. Krishnan
, Jeffrey Scott Vitter,
Balakrishna R. Iyer
: Estimating Alphanumeric Selectivity in the Presence of Wildcards.
SIGMOD Conf. 1996
: 282-293
103
Rakesh D. Barve
,
Edward F. Grove
, Jeffrey Scott Vitter: Simple Randomized Mergesort on Parallel Disks.
SPAA 1996
: 109-118
102
Darren Erik Vengroff
, Jeffrey Scott Vitter: Efficient 3-D Range Searching in External Memory.
STOC 1996
: 192-201
101
Roberto Tamassia
, Jeffrey Scott Vitter: Optimal Cooperative Search in Fractional Cascaded Data Structures.
Algorithmica 15
(2): 154-171 (1996)
100
Mark H. Nodine
,
Michael T. Goodrich
, Jeffrey Scott Vitter: Blocking for External Graph Searching.
Algorithmica 16
(2): 181-214 (1996)
99
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)
98
Jeffrey Scott Vitter: Communication Issues in Large-Scale Geometric Computation.
Computing Surveys 28
(4es): 20 (1996)
97
Darren Erik Vengroff
, Jeffrey Scott Vitter: I/O-Efficient Algorithms and Environments.
Computing Surveys 28
(4es): 212 (1996)
96
Paul G. Howard
, Jeffrey Scott Vitter: Parallel Lossless Image Compression Using Huffman and Arithmetic Coding.
IPL 59
(2): 65-73 (1996)
95
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)
94
Jeffrey Scott Vitter,
P. Krishnan
: Optimal Prefetching via Data Compression.
JACM 43
(5): 771-793 (1996)
93
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)
92
Dzung T. Hoang
,
Philip M. Long
, Jeffrey Scott Vitter: Multiple-Dictionary Coding Using Partial Matching.
Data Compression Conference 1995
: 272-281
91
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
90
Rakesh D. Barve
,
Edward F. Grove
, Jeffrey Scott Vitter: Application-Controlled Paging for a Shared Cache (Extended Abstract).
FOCS 1995
: 204-213
89
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
88
P. Krishnan
,
Philip M. Long
, Jeffrey Scott Vitter: Learning to Make Rent-to-Buy Decisions with Systems Applications.
ICML 1995
: 233-330
87
Yi-Jen Chiang
,
Michael T. Goodrich
,
Edward F. Grove
,
Roberto Tamassia
,
Darren Erik Vengroff
, Jeffrey Scott Vitter: External-Memory Graph Algorithms.
SODA 1995
: 139-149
86
Edward F. Grove
,
Ming-Yang Kao
,
P. Krishnan
, Jeffrey Scott Vitter: Online Perfect Matching and Mobile Computing.
WADS 1995
: 194-205
85
Sairam Subramanian
,
Roberto Tamassia
, Jeffrey Scott Vitter: An Efficient Parallel Algorithm for Shortest Paths in Planar Layered Digraphs.
Algorithmica 14
(4): 322-339 (1995)
84
Mark H. Nodine
, Jeffrey Scott Vitter: Greed Sort: Optimal Deterministic Sorting on Parallel Disks.
JACM 42
(4): 919-933 (1995)
83
Dzung T. Hoang
,
Philip M. Long
, Jeffrey Scott Vitter: Explicit Bit Minimization for Motion-Compensated Video Coding.
Data Compression Conference 1994
: 175-184
82
Yossi Matias
, Jeffrey Scott Vitter,
Neal E. Young
: Approximate Data Structures with Applications.
SODA 1994
: 187-194
81
P. Krishnan
, Jeffrey Scott Vitter: Optimal Prediction for Prefetching in the Worst Case.
SODA 1994
: 392-401
80
Jeffrey Scott Vitter,
Elizabeth A. M. Shriver
: Algorithms for Parallel Memory I: Two-Level Memories.
Algorithmica 12
(2/3): 110-147 (1994)
79
Jeffrey Scott Vitter,
Elizabeth A. M. Shriver
: Algorithms for Parallel Memory II: Hierarchical Multilevel Memories.
Algorithmica 12
(2/3): 148-169 (1994)
78
Jeffrey Scott Vitter: Guest Editor's Introduction: Special Issue on Large-Scale Memories.
Algorithmica 12
(2/3): 69-71 (1994)
77
Jyh-Han Lin
, Jeffrey Scott Vitter: A Theory for Memory-Based Learning.
Machine Learning 17
(2-3): 143-167 (1994)
76
Peter Bro Miltersen
,
Sairam Subramanian
, Jeffrey Scott Vitter,
Roberto Tamassia
: Complexity Models for Incremental Computation.
TCS 130
(1): 203-236 (1994)
75
Paul G. Howard
, Jeffrey Scott Vitter: Fast and Efficient Lossless Image Compression.
DCC 1993
: 351-360
74
Paul G. Howard
, Jeffrey Scott Vitter: Design and Analysis of Fast Text Compression Based on Quasi-Arithmetic Coding.
DCC 1993
: 98-107
73
Michael T. Goodrich
,
Jyh-Jong Tsay
,
Darren Erik Vengroff
, Jeffrey Scott Vitter: External-Memory Computational Geometry (Preliminary Version).
FOCS 1993
: 714-723
72
Mark H. Nodine
,
Michael T. Goodrich
, Jeffrey Scott Vitter: Blocking for External Graph Searching.
PODS 1993
: 222-232
71
Paris C. Kanellakis
,
Sridhar Ramaswamy
,
Darren Erik Vengroff
, Jeffrey Scott Vitter: Indexing for Data Models with Constraints and Classes.
PODS 1993
: 233-243
70
Kenneth M. Curewitz
,
P. Krishnan
, Jeffrey Scott Vitter: Practical Prefetching via Data Compression.
SIGMOD Conference 1993
: 257-266
69
Yossi Matias
, Jeffrey Scott Vitter,
Wen-Chun Ni
: Dynamic Generation of Discrete Random Variates.
SODA 1993
: 361-370
68
Mark H. Nodine
, Jeffrey Scott Vitter: Deterministic Distribution Sort in Shared and Distributed Memory Multiprocessors.
SPAA 1993
: 120-129
67
S. Sairam
, Jeffrey Scott Vitter,
Roberto Tamassia
: A Complexity Theoretic Approach to Incremental Computation.
STACS 1993
: 640-649
66
Jeffrey Scott Vitter,
Mark H. Nodine
: Large-Scale Sorting in Uniform Memory Hierarchies.
Journal of Parallel and Distributed Computing 17
(1-2): 107-114 (1993)
65
Jyh-Han Lin
, Jeffrey Scott Vitter: A Theory for Memory-Based Learning.
COLT 1992
: 103-115
64
Jyh-Han Lin
, Jeffrey Scott Vitter: Nearly Optimal Vecot Quantization via Linear Programming.
Data Compression Conference 1992
: 22-31
63
Paul G. Howard
, Jeffrey Scott Vitter: Error Modeling for Hierarchical Lossless Image Compression.
Data Compression Conference 1992
: 269-278
62
Paul G. Howard
, Jeffrey Scott Vitter: Parallel Lossless Image Compression Using Huffman and Arithmetic Coding.
Data Compression Conference 1992
: 299-308
61
S. Sairam
,
Roberto Tamassia
, Jeffrey Scott Vitter: A Divide and Conquer Approach to Shortest Paths in Planar Layered Digraphs.
SPDP 1992
: 176-183
60
Franco P. Preparata
, Jeffrey Scott Vitter: A Simplified Technique for Hidden-Line Elimination in Terrains.
STACS 1992
: 135-146
59
Jyh-Han Lin
, Jeffrey Scott Vitter: epsilon-Approximations with Minimum Packing Constraint Violation (Extended Abstract).
STOC 1992
: 771-782
58
Franco P. Preparata
, Jeffrey Scott Vitter,
Mariette Yvinec
: Output-Sensitive Generation of the Perspective View of Isothetic Parallelepipeds.
Algorithmica 8
(4): 257-283 (1992)
57
Jyh-Han Lin
, Jeffrey Scott Vitter: Approximation Algorithms for Geometric Median Problems.
IPL 44
(5): 245-249 (1992)
56
Paul G. Howard
, Jeffrey Scott Vitter: Analysis of Arithmetic Coding for Data Compression.
Information Processing and Management 28
(6): 749-764 (1992)
55
Paul G. Howard
, Jeffrey Scott Vitter: New Methods for Lossless Image Compression Using Arithmetic Coding.
Information Processing and Management 28
(6): 765-780 (1992)
54
Jeffrey Scott Vitter,
Jyh-Han Lin
: Learning in Parallel.
Information and Computation 96
(2): 179-202 (1992)
53
Paul G. Howard
, Jeffrey Scott Vitter: New Methods for Lossless Image Compression Using Arithmetic Coding.
Data Compression Conference 1991
: 257-266
52
Paul G. Howard
, Jeffrey Scott Vitter: Analysis of Arithmetic Coding for Data Compression.
Data Compression Conference 1991
: 3-12
51
Jeffrey Scott Vitter,
P. Krishnan
: Optimal Prefetching via Data Compression (Extended Abstract).
FOCS 1991
: 121-130
50
Mark H. Nodine
, Jeffrey Scott Vitter: Large-Scale Sorting in Parallel Memories (Extended Abstract).
SPAA 1991
: 29-39
49
Jeffrey Scott Vitter: Efficient Memory Access in Large-Scale Computation.
STACS 1991
: 26-41
48
Claire Kenyon
, Jeffrey Scott Vitter: Maximum Queue Size and Hashing with Lazy Deletion.
Algorithmica 6
(4): 597-619 (1991)
47
Adam L. Buchsbaum
,
Paris C. Kanellakis
, Jeffrey Scott Vitter: A Data Dtructure for Arc Insertion and Regular Path Finding.
Annals of Mathematics and Artificial Intelligence 3
(2-4): 187-210 (1991)
46
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)
45
Roberto Tamassia
,
Ioannis G. Tollis
, Jeffrey Scott Vitter: Lower Bounds for Planar Orthogonal Drawings of Graphs.
IPL 39
(1): 35-40 (1991)
44
Jyh-Han Lin
, Jeffrey Scott Vitter: Complexity Results on Learning by Neural Nets.
Machine Learning 6
: 211-230 (1991)
43
Roberto Tamassia
, Jeffrey Scott Vitter: Parallel Transitive Closure and Point Location in Planar Structures.
SIAM J. Comput. 20
(4): 708-725 (1991)
42
Claire Kenyon-Mathieu
, Jeffrey Scott Vitter: The Maximum Size of Dynamic Data Structures.
SIAM J. Comput. 20
(5): 807-823 (1991)
41
Jeffrey Scott Vitter,
Philippe Flajolet
: Average-Case Analysis of Algorithms and Data Structures.
Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity 1990
: 431-524
40
Mark H. Nodine
,
Daniel P. Lopresti
, Jeffrey Scott Vitter: I/O Overhead and Parallel VLSI Architectures for Lattice Computations.
ICCI 1990
: 497-506
39
Adam L. Buchsbaum
,
Paris C. Kanellakis
, Jeffrey Scott Vitter: A Data Structure for Arc Insertion and Regular Path Finding.
SODA 1990
: 22-31
38
Roberto Tamassia
, Jeffrey Scott Vitter: Optimal Cooperative Search in Fractional Cascaded Data Structures.
SPAA 1990
: 307-316
37
Jeffrey Scott Vitter,
Elizabeth A. M. Shriver
: Optimal Disk I/O with Parallel Block Transfer (Extended Abstract).
STOC 1990
: 159-169
36
Franco P. Preparata
, Jeffrey Scott Vitter,
Mariette Yvinec
: Output-Sensitive Generation of the Perspective View of Isothetic Parallelepipeds.
SWAT 1990
: 71-84
35
Jyh-Han Lin
, Jeffrey Scott Vitter: Complexity Issues in Learning by Neural Nets.
COLT 1989
: 118-133
34
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
33
Roberto Tamassia
, Jeffrey Scott Vitter: Optimal Parallel Algorithms for Transitive Closure and Point Location in Planar Structures.
SPAA 1989
: 399-408
32
Jeffrey Scott Vitter,
Jyh-Han Lin
: Learning in Parallel.
COLT 1988
: 106-124
31
Jeffrey Scott Vitter: Editor's Foreword: Special Issue on Parallel and Distributed Computing, Part I.
Algorithmica 3
: 1-3 (1988)
30
Jeffrey Scott Vitter: Editor's Foreword: Special Issue on Parallel and Distributed Computing, Part II.
Algorithmica 3
: 289-291 (1988)
29
Alok Aggarwal
, Jeffrey Scott Vitter: The Input/Output Complexity of Sorting and Related Problems.
CACM 31
(9): 1116-1127 (1988)
28
Catherine A. Schevon
, Jeffrey Scott Vitter: A Parallel Algorithm for Recognizing Unordered Depth-First Search.
IPL 28
(2): 105-110 (1988)
27
Alok Aggarwal
, Jeffrey Scott Vitter: The I/O Complexity of Sorting and Related Problems (Extended Abstract).
ICALP 1987
: 467-478
26
John T. Stasko
, Jeffrey Scott Vitter: Pairing Heaps: Experiments and Analysis.
CACM 30
(3): 234-249 (1987)
25
Jeffrey Scott Vitter: Design and Analysis of Dynamic Huffman Codes.
JACM 34
(4): 825-845 (1987)
24
Christopher J. Van Wyk
, Jeffrey Scott Vitter: The Complexity of Hashing with Lazy Deletion.
Algorithmica 1
(1): 17-29 (1986)
23
Robert Sedgewick
, Jeffrey Scott Vitter: Shortest Paths in Euclidean Graphs.
Algorithmica 1
(1): 31-48 (1986)
22
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)
21
Wen-Chin Chen
, Jeffrey Scott Vitter: Deletion Algorithms for Coalesced Hashing.
The Computer Journal 29
(5): 436-450 (1986)
20
Jeffrey Scott Vitter: Design and Analysis of Dynamic Huffman Coding (Extended Abstract).
FOCS 1985
: 293-302
19
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)
18
Jeffrey Scott Vitter,
Wen-Chin Chen
: Optimum Algorithms for a Model of Direct Chaining.
SIAM J. Comput. 14
(2): 490-499 (1985)
17
Wen-Chin Chen
, Jeffrey Scott Vitter: Addendum to "Analysis of Some New Variants of Coalesced Hashing".
TODS 10
(1): 127 (1985)
16
Jeffrey Scott Vitter: An Efficient I/O Interface for Optical Disks.
TODS 10
(2): 129-162 (1985)
15
Jeffrey Scott Vitter: Random Sampling with a Reservoir.
TOMS 11
(1): 37-57 (1985)
14
Robert Sedgewick
, Jeffrey Scott Vitter: Shortest Paths in Euclidean Graphs (Extended Abstract).
FOCS 1984
: 417-424
13
Jeffrey Scott Vitter: Computational Complexity of an Optical Disk Interface (Extended Abstract).
ICALP 1984
: 490-502
12
Jeffrey Scott Vitter: USeR: A New Framework for Redoing.
Software Development Environments (SDE) 1984
: 168-176
11
Jeffrey Scott Vitter: Faster Methods for Random Sampling.
CACM 27
(7): 703-718 (1984)
10
Jeffrey Scott Vitter: US&R: A New Framework for Redoing.
IEEE Software 1
(4): 39-52 (1984)
9
Wen-Chin Chen
, Jeffrey Scott Vitter: Analysis of New Variants of Coalesced Hashing.
TODS 9
(4): 616-645 (1984)
8
Jeffrey Scott Vitter: Optimum Algorithms for Two Random Sampling Problems (Extended Abstract).
FOCS 1983
: 65-75
7
Jeffrey Scott Vitter: Analysis of the Search Performance of Coalesced Hashing.
JACM 30
(2): 231-258 (1983)
6
Wen-Chin Chen
, Jeffrey Scott Vitter: Analysis of Early-Insertion Standard Coalesced Hashing.
SIAM J. Comput. 12
(4): 667-676 (1983)
5
Jeffrey Scott Vitter: Implementations for Coalesced Hashing.
CACM 25
(12): 911-926 (1982)
4
Jeffrey Scott Vitter: Deletion Algorithms for Hashing That Preserve Randomness.
J. Algorithms 3
(3): 261-275 (1982)
3
Jeffrey Scott Vitter: Deletion Algorithms for Hashing that Preserve Randomness (detailed abstract).
FOCS 1981
: 127-132
2
Jeffrey Scott Vitter: A Shared-Memory Scheme for Coalesced Hashing.
Information Processing Letters 13
(2): 77-79 (1981)
1
Jeffrey Scott Vitter: Tuning the Coalesced Hashing Method to Obtain Optimum Performance (Detailed Abstract).
FOCS 1980
: 238-247
Copyright(C) 2000 ACM | | | | | | |
