The Boolean formula value problem is in ALOGTIME
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Languages that capture complexity classes
SIAM Journal on Computing
Query languages with express all PTIME queries for trees and unicycle graphs
MFCS '90 Proceedings on Mathematical foundations of computer science 1990
Parallel tree contraction part 2: further applications
SIAM Journal on Computing
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Dynamic tree isomorphism via first-order updates to a relational database
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Theoretical Computer Science
The Complexity of Graph Isomorphism for Colored Graphs with Color Classes of Size 2 and 3
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Typing and querying XML documents: some complexity bounds
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Completeness results for graph isomorphism
Journal of Computer and System Sciences
The complexity of XPath query evaluation and XML typing
Journal of the ACM (JACM)
The computational complexity of equivalence and isomorphism problems
The computational complexity of equivalence and isomorphism problems
The space complexity of k-tree isomorphism
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
A logspace algorithm for partial 2-tree canonization
CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
From invariants to canonization in parallel
CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
Interval graphs: canonical representation in logspace
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
How much memory is needed for leader election
DISC'10 Proceedings of the 24th international conference on Distributed computing
Storage capacity of labeled graphs
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
Graphs of bounded treewidth can be canonized in AC1
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Isomorphism of regular trees and words
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Canonizing hypergraphs under abelian group action
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Interval Graphs: Canonical Representations in Logspace
SIAM Journal on Computing
On graph isomorphism for restricted graph classes
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Testing graph isomorphism in parallel by playing a game
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Distributed tree comparison with nodes of limited memory
SIROCCO'10 Proceedings of the 17th international conference on Structural Information and Communication Complexity
The isomorphism problem for k-trees is complete for logspace
Information and Computation
Restricted space algorithms for isomorphism on bounded treewidth graphs
Information and Computation
Hardness results for tournament isomorphism and automorphism
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
On tractable parameterizations of graph isomorphism
IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
Isomorphism of regular trees and words
Information and Computation
Pure pointer programs and tree isomorphism
FOSSACS'13 Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures
Effective storage capacity of labeled graphs
Information and Computation
| Hi-index | 0.00 |
We present a solution to the problem of assigning to each directed tree T of size n a unique isomorphism invariant name for T, using only work space O(log n). Hence, tree isomorphism is computable in logspace. As another consequence, we obtain the corollary that the set of logspace computable queries (Lspace) on trees is recursively enumerable. Our results extend easily to undirected trees and even forests.