On the public citation graph
Alternative methods for the reconstruction of trees from their traversals
0 signed · 24 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1016/0020-0190(83)90046-7openalex-snapshot
Listing and counting subtrees of equal size of a binary tree
inferredcites →https://doi.org/10.1145/322169.322171openalex-snapshot
A Note on Enumerating Binary Trees
inferredcites →https://doi.org/10.1145/359423.359434openalex-snapshot
A numbering system for binary trees
inferredcites →https://doi.org/10.2307/2283757openalex-snapshot
The Art of Computer Programming. Volume 1: Fundamental Algorithms.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/nem.1956openalex-snapshot
Security novel risk assessment framework based on reversible metrics: a case study of DDoS attacks on an E‐commerce web server
inferred← citeshttps://doi.org/10.1007/3-540-51498-8_41openalex-snapshot
Parallel general prefix computations with geometric, algebraic and other applications
inferred← citeshttps://doi.org/10.1007/bf01381719openalex-snapshot
Parallel general prefix computations with geometric, algebraic, and other applications
inferred← citeshttps://doi.org/10.1007/bf01952690openalex-snapshot
Efficient algorithms for tree reconstruction
inferred← citeshttps://doi.org/10.1007/bf02219241openalex-snapshot
Constructing a binary tree from its traversals
inferred← citeshttps://doi.org/10.1007/s11036-018-1098-8openalex-snapshot
New Engineering Method for the Risk Assessment: Case Study Signal Jamming of the M-Health Networks
inferred← citeshttps://doi.org/10.1016/0020-0190(88)90177-9openalex-snapshot
Two algorithms for constructing a binary tree from its traversals
inferred← citeshttps://doi.org/10.1016/0020-0190(90)90224-lopenalex-snapshot
Construction of a tree from its traversals in optimal time and space
inferred← citeshttps://doi.org/10.1016/0020-0190(91)90026-eopenalex-snapshot
Inversion of a recursive tree traversal
inferred← citeshttps://doi.org/10.1016/0020-0190(92)90099-hopenalex-snapshot
An optimal algorithm for reconstructing a binary tree
inferred← citeshttps://doi.org/10.1016/0020-0190(92)90100-aopenalex-snapshot
A note on the reconstruction of a binary tree from its traversals
inferred← citeshttps://doi.org/10.1016/0893-9659(89)90122-5openalex-snapshot
Efficient reconstruction of binary trees from their traversals
inferred← citeshttps://doi.org/10.1016/j.ipl.2019.03.002openalex-snapshot
Constructing a binary tree from its traversals by reversible recursion and iteration
inferred← citeshttps://doi.org/10.1080/23799927.2026.2669933openalex-snapshot
Faster construction of binary trees from their traversals
inferred← citeshttps://doi.org/10.1109/71.485530openalex-snapshot
Constant time BSR solutions to parenthesis matching, tree decoding, and tree reconstruction from its traversals
inferred← citeshttps://doi.org/10.1109/artcom.2010.88openalex-snapshot
A New Non-recursive Algorithm for Reconstructing a Binary Tree from its Traversals
inferred← citeshttps://doi.org/10.1109/cmpsac.1988.17225openalex-snapshot
Nonrecursive algorithms for reconstructing a binary tree from its traversals
inferred← citeshttps://doi.org/10.1142/s0129054112400187openalex-snapshot
CONSTANT-MEMORY ITERATIVE GENERATION OF SPECIAL STRINGS REPRESENTING BINARY TREES
inferred← citeshttps://doi.org/10.1145/101306.101308openalex-snapshot
A compendium of key search references
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.