Jeffrey Scott Vitter

Generating author description...

All published works

Action	Title	Year	Authors
+ PDF Chat	Approximating Gromov-Hausdorff distance in Euclidean space	2023	Sushovan Majhi Jeffrey Scott Vitter Carola Wenk
+ PDF Chat	MSQ-Index: A Succinct Index for Fast Graph Similarity Search	2019	Xiaoyang Chen Hongwei Huo Jun Huan Jeffrey Scott Vitter Weiguo Zheng Lei Zou
+	Approximating Gromov-Hausdorff Distance in Euclidean Space	2019	Sushovan Majhi Jeffrey Scott Vitter Carola Wenk
+	Fast Computation of Graph Edit Distance	2017	Xiaoyang Chen Hongwei Huo Jun Huan Jeffrey Scott Vitter
+	MSQ-Index: A Succinct Index for Fast Graph Similarity Search	2016	Xiaoyang Chen Hongwei Huo Jun Huan Jeffrey Scott Vitter
+ PDF Chat	Dynamic Data Structures for Document Collections and Graphs	2015	Ian Munro Yakov Nekrich Jeffrey Scott Vitter
+	Dynamic Data Structures for Document Collections and Graphs	2015	J. Ian Munro Yakov Nekrich Jeffrey Scott Vitter
+	Dynamic Data Structures for Document Collections and Graphs	2015	J. Ian Munro Yakov Nekrich Jeffrey Scott Vitter
+	Space-Efficient String Indexing for Wildcard Pattern Matching	2014	Moshe Lewenstein Yakov Nekrich Jeffrey Scott Vitter
+	Optimal Color Range Reporting in One Dimension	2013	Yakov Nekrich Jeffrey Scott Vitter
+ PDF Chat	Optimal Color Range Reporting in One Dimension	2013	Yakov Nekrich Jeffrey Scott Vitter
+	Optimal Color Range Reporting in One Dimension	2013	Yakov Nekrich Jeffrey Scott Vitter
+	On Optimal Top-K String Retrieval	2012	Rahul Shah Cheng Sheng Sharma V. Thankachan Jeffrey Scott Vitter
+ PDF Chat	Binary Space Partitions for Fat Rectangles	2000	Pankaj K. Agarwal Edward F. Grove T. M. Murali Jeffrey Scott Vitter
+ PDF Chat	Approximation algorithms for geometric median problems	1992	Jyh-Han Lin Jeffrey Scott Vitter
+ PDF Chat	Maximum queue size and hashing with lazy deletion	1991	Claire M. Kenyon Jeffrey Scott Vitter
+ PDF Chat	Average-Case Analysis of Algorithms and Data Structures	1990	Jeffrey Scott Vitter Philippe Flajolet
+ PDF Chat	An efficient algorithm for sequential random sampling	1987	Jeffrey Scott Vitter
+ PDF Chat	Random sampling with a reservoir	1985	Jeffrey Scott Vitter
+	Optimum Algorithms for Two Random Sampling Problems (Extended Abstract)	1983	Jeffrey Scott Vitter

Common Coauthors

Coauthor	Papers Together
Yakov Nekrich	7
Hongwei Huo	3
Jun Huan	3
Xiaoyang Chen	3
Sushovan Majhi	2
Carola Wenk	2
Pankaj K. Agarwal	1
Ian Munro	1
T. M. Murali	1
Weiguo Zheng	1
Cheng Sheng	1
Rahul Shah	1
J. Ian Munro	1
Claire M. Kenyon	1
Moshe Lewenstein	1
Edward F. Grove	1
Philippe Flajolet	1
Lei Zou	1
Jyh-Han Lin	1
J. Ian Munro	1
Sharma V. Thankachan	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+	On Dynamic Range Reporting in One Dimension	2005	Christian Worm Mortensen Rasmus Pagh Mihai Pătraşcu	4
+ PDF Chat	A note on sampling a tape-file	1962	Tanner Jones	3
+ PDF Chat	Succinct Representations of Dynamic Strings	2010	Meng He J. Ian Munro	2
+ PDF Chat	Efficient Fully-Compressed Sequence Representations	2012	Jérémy Barbay Francisco Claude Travis Gagie Gonzalo Navarro Yakov Nekrich	2
+ PDF Chat	Some Properties of Gromov–Hausdorff Distances	2012	Facundo Mémoli	2
+ PDF Chat	Fully Functional Static and Dynamic Succinct Trees	2014	Gonzalo Navarro Kunihiko Sadakane	2
+	On dynamic range reporting in one dimension	2005	Christian Worm Mortensen Rasmus Pagh Mihai Pǎtraçcu	2
+ PDF Chat	Dynamic ordered sets with exponential search trees	2007	Arne Andersson Mikkel Thorup	2
+ PDF Chat	A Theoretical and Computational Framework for Isometry Invariant Recognition of Point Cloud Data	2005	Facundo Mémoli Guillermo Sapiro	2
+	Gromov-Hausdorff distances in Euclidean spaces	2008	Facundo Mémoli	2
+	A Course in Metric Geometry	2001	Dmitri Burago Yuri Burago S. V. Ivanov	2
+	Metric Structures for Riemannian and Non-Riemannian Spaces	2007	Mikhael Gromov	2
+	Optimal Top-k Document Retrieval	2013	Gonzalo Navarro Yakov Nekrich	2
+	The number of registers required for evaluating arithmetic expressions	1979	Philippe Flajolet Jean -Claude Raoult Jean Vuillemin	1
+ PDF Chat	On the Altitude of Nodes in Random Trees	1978	A. Meir J. W. Moon	1
+	On random 2?3 trees	1978	Andrew Chi-Chih Yao	1
+ PDF Chat	Local graph alignment and motif search in biological networks	2004	Johannes Berg Michael Lässig	1
+	The expected linearity of a simple equivalence algorithm	1978	Donald E. Knuth Arnold Schönhage	1
+	Analytic models and ambiguity of context-free languages	1987	Philippe Flajolet	1
+	The average number of registers needed to evaluate a binary tree optimally	1979	Rainer Kemp	1
+	A note on growing binary trees	1973	Alan G. Konheim Donald J. Newman	1
+	Combinatorial aspects of continued fractions	1980	Philippe Flajolet	1
+ PDF Chat	Singularity Analysis of Generating Functions	1990	Philippe Flajolet Andrew Odlyzko	1
+	A Partial Analysis of Random Height-Balanced Trees	1979	Mark R. Brown	1
+ PDF Chat	Maximum queue size and hashing with lazy deletion	1991	Claire M. Kenyon Jeffrey Scott Vitter	1
+	Polynomial algorithms in linear programming	1980	Leonid Khachiyan	1
+	Asymptotic Methods in Enumeration	1974	Edward A. Bender	1
+ PDF Chat	A note on the height of binary search trees	1986	Luc Devroye	1
+	Periodic oscillations of coefficients of power series that satisfy functional equations	1982	Andrew Odlyzko	1
+	On some applications of formulae of Ramanujan in the analysis of algorithms	1991	Peter Kirschenhofer Helmut Prodinger	1
+	Asymptotic expansions for the coefficients of analytic generating functions	1985	Andrew Odlyzko L. Bruce Richmond	1
+ PDF Chat	Concerning sets of polynomials orthogonal simultaneously on several circles	1939	Gábor Szegő	1
+	Central and local limit theorems applied to asymptotic enumeration	1973	Edward A. Bender	1
+ PDF Chat	A unifying look at data structures	1980	Jean Vuillemin	1
+ PDF Chat	Biological network comparison using graphlet degree distribution	2007	Nataša Pržulj	1
+	Central and local limit theorems for the coefficients of polynomials of binomial type	1977	E. Rodney Canfield	1
+	The average height of binary trees and other simple trees	1982	Philippe Flajolet Andrew Odlyzko	1
+	Fifty years of graph matching, network alignment and network comparison	2016	Frank Emmert‐Streib Matthias Dehmer Yongtang Shi	1
+ PDF Chat	Computing the Gromov-Hausdorff Distance for Metric Trees	2015	Pankaj K. Agarwal Kyle Fox Abhinandan Nath Anastasios Sidiropoulos Yusu Wang	1
+ PDF Chat	I/O-Efficient Data Structures for Colored Range and Prefix Reporting	2012	Kasper Green Larsen Rasmus Pagh	1
+	More Haste, Less Waste: Lowering the Redundancy in Fully Indexable Dictionaries	2009	Roberto Grossi Alessio Orlandi Rajeev Raman Srinivasa Rao Satti	1
+ PDF Chat	Computing the Gromov-Hausdorff Distance for Metric Trees	2018	Pankaj K. Agarwal Kyle Fox Abhinandan Nath Anastasios Sidiropoulos Yusu Wang	1
+	Probabilistic construction of deterministic algorithms: Approximating packing integer programs	1988	Prabhakar Raghavan	1
+ PDF Chat	Orthogonal Polynomials	1971		1
+ PDF Chat	Cross-Document Pattern Matching	2012	Grégory Kucherov Yakov Nekrich Tatiana Starikovskaya	1
+	On the evolution of random graphs	2011	Paul Erdős A. Rényi	1
+	Mathematics for the Analysis of Algorithms	1981	Greene	1
+	Advanced Combinatorics	1974	Louis Comtet	1
+	Asymptotics and Special Functions	1974		1
+ PDF Chat	Optimal Color Range Reporting in One Dimension	2013	Yakov Nekrich Jeffrey Scott Vitter	1