See this document in CiteSeerX!

Range Searching Over Tree Cross Products (2000)  (Make Corrections)  (10 citations)
Adam L. Buchsbaum, Michael T. Goodrich, Jeffery R. Westbrook
Proc 8th European Symposium on Algorithms



  Home/Search   Context   Related

 
View or download:
att.com/~alb/biblio/rstcp.ps.Z
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  att.com/~alb/biblio/ (more)
Homepages:  A.Buchsbaum  

Rate this article: (best)
  Comment on this article  
(Enter summary)

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. (Update)

Cited by:   More
HGV: A Library for Hierarchies, Graphs, and Views - Raitner   (Correct)
Dynamic Tree Cross Products - Marcus Raitner University (2004)   (Correct)
Visual Navigation of Compound Graphs - Raitner   (Correct)

Active bibliography (related documents):   More   All
0.5:   Fully-dynamic orthogonal range reporting on RAM - Mortensen (2003)   (Correct)
0.5:   Compressed Suffix Arrays and Suffix Trees with Applications.. - Grossi, Vitter (2000)   (Correct)
0.4:   New Data Structures for Orthogonal Range Searching - Alstrup, Brodal, Rauhe (2000)   (Correct)

Similar documents based on text:   More   All
0.4:   Biased Skip Lists - Bagchi, Buchsbaum, Goodrich   (Correct)
0.4:   Three-Dimensional Layers of Maxima - Buchsbaum, Goodrich (2002)   (Correct)
0.3:   High-Order Entropy-Compressed Text Indexes - Grossi, Gupta, Vitter   (Correct)

Related documents from co-citation:   More   All
10:   Visualization of structural information: Automatic drawing of compound digraphs (context) - Sugiyama, Misue - 1991
10:   Maintaining hierarchical graph views (context) - Buchsbaum, Westbrook - 2000
8:   A graph model which supports flexible layout function - Lai, Eades - 1996

BibTeX entry:   (Update)

Adam L. Buchsbaum, Michael T. Goodrich, and Je#rey R. Westbrook. Range searching over tree cross products. In 8th ESA, 2000. http://citeseer.ist.psu.edu/buchsbaum00range.html   More

@inproceedings{ buchsbaum00range,
    author = "Adam L. Buchsbaum and Michael T. Goodrich and Jeffery Westbrook",
    title = "Range Searching Over Tree Cross Products",
    booktitle = "Proc 8th European Symposium on Algorithms",
    pages = "120--131",
    year = "2000",
    url = "citeseer.ist.psu.edu/buchsbaum00range.html" }
Citations (may not include all citations):
180   Binary codes capable of correcting deletions (context) - Levenshtein - 1966
158   Linear pattern matching algorithms (context) - Weiner - 1973
73   A space-economical sux tree construction algorithm (context) - McCreight - 1976
68   Data structures for weighted matching and nearest common anc.. (context) - Gabow - 1990
59   A functional approach to data structures and its use in mult.. (context) - Chazelle - 1988
53   Applications of path compression on balanced trees (context) - Tarjan - 1979
43   Data structures and algorithms for approximate string matchi.. (context) - Galil, Giancarlo - 1988
36   The program structure tree: Computing control regions in lin.. - Johnson, Pearson et al. - 1994
28   Fast algorithms for nding nearest common ancestors (context) - Harel, Tarjan - 1984
21   A faster algorithm for approximate string matching (context) - Baeza-Yates, Navarro - 1996
19   Maintaining hierarchical graph views (context) - Buchsbaum, Westbrook - 2000
17   Approximate multiple string search - Muth, Manber - 1996
15   Balanced aspect ratio trees and their use for drawing very l.. - Duncan, Goodrich et al. - 1998
14   Dominators in linear time - Alstrup, Harel et al. - 1999
12   An algorithm for approximate membership checking with applic.. - Manber, Wu - 1994
12   Compressed sux arrays and sux trees with applications to tex.. (context) - Grossi, Vitter - 2000
11   Multiple approximate string matching (context) - Baeza-Yates, Navarro - 1997
11   Output-sensitive generation of the perspective view of isoth.. (context) - Preparata, Vitter et al. - 1992
7   Multiple ltration and approximate pattern matching (context) - Pevzner, Waterman - 1995
6   A note on dynamic range searching (context) - Edelsbrunner - 1981
5   data structure for three-sided range queries (context) - Fries, Mehlhorn et al. - 1987
5   Multi-method dispatching: A geometric approach with applicat.. - Ferragina, Muthukrishnan et al. - 1999
4   Ecient approximate and dynamic matching of patterns using a .. (context) - Sahinalp, Vishkin - 1996
4   Distinguishing hammocks in a directed graph (context) - Kas'janov - 1975
4   Ecient data structures for range searching on a grid (context) - Overmars - 1988
4   and hashing from the perspective of the fusion tree (context) - Willard, geometry et al. - 2000
3   simpler linear-time dominators algorithm (context) - Buchsbaum, Kaplan et al. - 1998
2   Indexing and dictionary matching with one error - Amir, Keselman et al. - 1999
1   Enterprise navigator: A system for visualizing and analyzing.. (context) - Buchsbaum, Chen et al. - 1999



The graph only includes citing articles where the year of publication is known.


Documents on the same site (http://www.research.att.com/~alb/biblio/):   More
A Functional Approach to External Graph Algorithms - Abello, Buchsbaum, Westbrook (1999)   (Correct)
A New, Simpler Linear-Time Dominators Algorithm - Buchsbaum, Kaplan, Rogers.. (1999)   (Correct)
Methods for Optimal Text Selection - van Santen, Buchsbaum (1997)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC