Back to Results
First PageMeta Content
Computing / L / Tree / B-tree / R-tree / Rope / Backtracking / T-tree / Binary search tree / Binary trees / Graph theory / Mathematics


A Logspace Algorithm for Tree Canonization (Extended Abstract) Steven Lindell †
Add to Reading List

Document Date: 2012-03-28 11:42:08


Open Document

File Size: 64,57 KB

Share Result on Facebook

Company

MIT Press / J. Comp / /

/

IndustryTerm

direct solution / polytime graph canonization algorithm / depth-first search / logarithmic space algorithm / linear time isomorphism algorithm / comparison algorithm / parallel time algorithm / deterministic space algorithm / /

Organization

Haverford College / National Science Foundation / MIT / STOC committee / /

Person

Loren Rosen / Mark Fulk / Steven Lindell / Steve Tate / Suzanne / Dave Barrington / Neil Immerman / Sam Buss / /

/

Position

author / /

ProvinceOrState

New Foundland and Labrador / Pennsylvania / North Carolina / /

PublishedMedium

Elsevier / the Theory of Computing / Theoretical Computer Science / /

Technology

linear time isomorphism algorithm / polytime graph canonization algorithm / logarithmic space algorithm / Logspace Tree Traversal The algorithm / comparison algorithm / parallel time algorithm / PDA / deterministic space algorithm / Computer Algorithms / /

SocialTag