Range Searching Over Tree Cross Products

Authors:
Adam L. Buchsbaum;Michael T. Goodrich;Jeffery Westbrook
Affiliations:
-;-;-
Venue:
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Year:
2000

Citing 23
Cited 12

Fast algorithms for finding nearest common ancestors

SIAM Journal on Computing
A log log n data structure for three-sided range queries

Information Processing Letters
Functional approach to data structures and its use in multidimensional searching

SIAM Journal on Computing
Efficient data structures for range searching on a grid

Journal of Algorithms
Data structures and algorithms for approximate string matching

Journal of Complexity
The program structure tree: computing control regions in linear time

PLDI '94 Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation
An algorithm for approximate membership checking with application to password security

Information Processing Letters
A new, simpler linear-time dominators algorithm

ACM Transactions on Programming Languages and Systems (TOPLAS)
Multi-method dispatching: a geometric approach with applications to string matching problems

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Data structures for weighted matching and nearest common ancestors with linking

SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
A Space-Economical Suffix Tree Construction Algorithm

Journal of the ACM (JACM)
Applications of Path Compression on Balanced Trees

Journal of the ACM (JACM)
Dominators in Linear Time

SIAM Journal on Computing
Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract)

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Examining Computational Geometry, Van Emde Boas Trees, and Hashing from the Perspective of the Fusion Tree

SIAM Journal on Computing
Maintaining hierarchical graph views

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Multiple Approximate String Matching

WADS '97 Proceedings of the 5th International Workshop on Algorithms and Data Structures
Indexing and Dictionary Matching with One Error

WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
Balanced Aspect Ratio Trees and Their Use for Drawing Very Large Graphs

GD '98 Proceedings of the 6th International Symposium on Graph Drawing
A Faster Algorithm for Approximate String Matching

CPM '96 Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching
Approximate Multiple Strings Search

CPM '96 Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching
Efficient approximate and dynamic matching of patterns using a labeling paradigm

FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Linear pattern matching algorithms

SWAT '73 Proceedings of the 14th Annual Symposium on Switching and Automata Theory (swat 1973)

HGV: A Library for Hierarchies, Graphs, and Views

GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
Compressed indexes for approximate string matching

ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Fast index for approximate string matching

Journal of Discrete Algorithms
Cache-oblivious index for approximate string matching

Theoretical Computer Science
A linear size index for approximate pattern matching

Journal of Discrete Algorithms
A linear size index for approximate pattern matching

CPM'06 Proceedings of the 17th Annual conference on Combinatorial Pattern Matching
Improved approximate string matching using compressed suffix data structures

ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Text indexing with errors

CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching
Visual navigation of compound graphs

GD'04 Proceedings of the 12th international conference on Graph Drawing
Visualizing large graphs with compound-fisheye views and treemaps

GD'04 Proceedings of the 12th international conference on Graph Drawing
Dynamic tree cross products

ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Cache-oblivious index for approximate string matching

CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce the tree cross-product problem, which abstracts a data structure common to applications in graph visualization, string matching, and software analysis. We design solutions with a variety of tradeoffs, yielding improvements and new results for these applications.