Samuel Buss  Home/Search
Context
Related
| ucsd.edu/pub/sbuss...treeisomorphism.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: ucsd.edu/pub/sbuss/research/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . The tree isomorphism problem is the problem of determining whether two trees are isomorphic. The tree canonization problem is the problem of producing a canonical tree isomorphic to a given tree. The tree comparison problem is the problem of determining whether one tree is less than a second tree in a natural ordering on trees. We present alternating logarithmic time algorithms for the tree isomorphism problem, the tree canonization problem and the tree comparison problem. As a... (Update)
Similar documents (at the sentence level):
58.9%: Alogtime Algorithms for Tree Isomorphism, Comparison, and.. - Buss (Correct)
Active bibliography (related documents): More All
0.4: Subtree Isomorphism is in DLOG for Nested Trees - Greenlaw (1995) (Correct)
0.2: Finding Largest Subtrees and Smallest Supertrees - Gupta, Nishimura (1998) (Correct)
0.2: Completeness results for Graph Isomorphism - Jenner, Köbler, al. (2002) (Correct)
Similar documents based on text: More All
0.3: Al'orihms for Boolean Formul Evaluation nd for Tree.. - Miller And Reif (Correct)
0.2: Canonization for ...-Equivalence is Hard - Grohe (Correct)
0.2: Ptime Canonization for Two Variables with Counting - Otto (1995) (Correct)
BibTeX entry: (Update)
@misc{ buss-alogtime,
author = "Samuel Buss",
title = "Alogtime Algorithms for Tree Isomorphism, Comparison, and Canonization",
url = "citeseer.ist.psu.edu/293895.html" }
Citations (may not include all citations):1450 The Design and Analysis of Computer Algorithms (context) - Aho, Hopcroft et al. - 1974
211 Languages that capture complexity classes - Immerman - 1987
125 On uniform circuit complexity (context) - Ruzzo - 1981
114 Bounded-width polynomial-size branching programs recognize e.. (context) - Barrington - 1989
70 The Boolean formula value problem is in ALOGTIME - Buss - 1987
36 An optimal parallel algorithm for formula evaluation - Buss, Cook et al. - 1992
17 Word problems solvable in logspace (context) - Lipton, Zalcstein - 1977
10 A logspace algorithm for tree canonization (context) - Lindell - 1992
8 Parallel tree contraction part 2: Further applications (context) - Miller, Reif - 1991
8 Annals of Discrete Mathematics (context) - Matula, in - 1978
7 Subtree isomorphism is NC reducible to bipartite perfect mat.. (context) - Lingas, Karpinski - 1989
2 Subtree isomorphism in in random NC (context) - Gibbons, Karp et al. - 1990
Documents on the same site (ftp://euclid.ucsd.edu/pub/sbuss/research/): More
Ordinal Notations and Well-Orderings in Bounded Arithmetic - Beckmann, Buss, Pollett (2000) (Correct)
On the Computational Content of Intuitionistic Propositional .. - Buss, Pudlák (2000) (Correct)
Minimum Propositional Proof Length is NP-Hard to.. - Alekhnovich, Buss.. (1998) (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