Jeffrey S. Vitter
机构: Distinguished Professor Emeritus of Computer & Information Science and Chancellor of the Univ. of
主页: olemiss.edu
每年引用次数
引用次数
引用: 26,166
H-指数: 79
I10-指数 : 210
出版物: 377
Optimal Parallel Algorithms for Transitive Closure and Point Location in Planar Structures
JeffreyScottVitter , Tamassia Roberto
情報処理学会研究報告アルゴリズム（AL） 1989 ( 98) 169 -178
1989
Geometric and Spatial Data Structures in External Memory
Jeffrey Scott Vitter
Handbook of Data Structures and Applications 419 -442
3
2018
External-Memory Graph Algorithms
Jeffrey Scott Vitter , Roberto Tamassia , Michael T. Goodrich , Yi-Feng Chian
Untitled Event 139 -149
464
1995
Algorithm Engineering: 3rd International Workshop, WAE'99 London, UK, July 19-21, 1999 Proceedings
Jeffrey Scott Vitter , Christos D. Zaloliagis
1
1999
Indexing for Data Models with Constraints and Classes.
Jeffrey Scott Vitter , Paris C. Kanellakis , Darren Erik Vengroff , Sridhar Ramaswamy
symposium on principles of database systems 233 -243
73
1993
Nearly tight bounds on the encoding length of the Burrows-Wheeler transform
Jeffrey Scott Vitter , Roberto Grossi , Ankur Gupta
analytic algorithmics and combinatorics 191 -202
6
2008
External memory algorithms and data structures
Jeffrey Scott Vitter
External memory algorithms 1 -38
56
1999
A parallel algorithm for planar orthogonal grid drawings
Jeffrey Scott Vitter , Roberto Tamassia , Ioannis G. Tollis
Parallel Processing Letters 10 ( 1) 141 -150
1
2000
High-order entropy-compressed text indexes
Jeffrey Scott Vitter , Roberto Grossi , Ankur Gupta
symposium on discrete algorithms 841 -850
649
2003
I/O-efficient algorithms for contour-line extraction and planar graph blocking
Jeffrey Scott Vitter , T. M. Murali , Pankaj K. Agarwal , Kasturi R. Varadarajan
symposium on discrete algorithms 117 -126
39
1998
Theory and practice of I/O-efficient algorithms for multidimensional batched searching problems
Jeffrey Scott Vitter , Torsten Suel , Sridhar Ramaswamy , Lars Arge
symposium on discrete algorithms 685 -694
34
1998
Average-Case Analysis of Algorithms and Data Structures.
Jeffrey Scott Vitter , Philippe Flajolet
Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (A) 431 -524
72
1990
MSQ-Index: A Succinct Index for Fast Graph Similarity Search
Xiaoyang Chen , Hongwei Huo , Jun Huan , Jeffrey Scott Vitter
arXiv: Databases
8
2016
Proceedings of the 3rd International Workshop on Algorithm Engineering
Christos D. Zaroliagis , Jeffrey Scott Vitter
2
1999
Optimal Color Range Reporting in One Dimension
Jeffrey Scott Vitter , Yakov Nekrich
arXiv: Data Structures and Algorithms
2013
Competitive Parallel Disk Prefetching and Buffer Management
Rakesh Barve , Mahesh Kallahalla , Peter J. Varman , Jeffrey Scott Vitter
Journal of Algorithms 36 ( 2) 152 -181
15
2000
An efficient algorithm for sequential random sampling
Jeffrey Scott Vitter
ACM Transactions on Mathematical Software 13 ( 1) 58 -67
65
1987
Implementations for coalesced hashing
Jeffrey Scott Vitter
Communications of The ACM 25 ( 12) 911 -926
21
1982
Faster methods for random sampling
Jeffrey Scott Vitter
Communications of the ACM 27 ( 7) 703 -718
94
1984
External-Memory Algorithms for Processing Line Segments in Geographic Information Systems
Lars Arge , Darren Erik Vengroff , Jeffrey Scott Vitter
Algorithmica 47 ( 1) 1 -25
107
2007
Rahul Shah Lars Arge Wing-Kai Hon (韓永楷) Yossi Matias Roberto Tamassia Pankaj K. Agarwal Michael T. Goodrich Philip Long Apostol (Paul) Natsev T. M. Murali Walid G. Aref Torsten Suel Reynold Cheng Paris C. Kanellakis 1953-1995 Paolo Ferragina Garth Alan Gibson John Stasko M. Oguzhan Külekci Tsung-Han Ku Manish Patil