On the public citation graph
Ranking and Unranking of 2-3 Trees
0 signed · 22 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.1007/bfb0090026openalex-snapshot
On the ordering, ranking, and random generation of basic combinatorial sets
inferredcites →https://doi.org/10.1016/0001-8708(77)90059-7openalex-snapshot
A unified setting for sequencing, ranking, and selection algorithms for combinatorial objects
inferredcites →https://doi.org/10.1016/0304-3975(80)90073-0openalex-snapshot
Lexicographic generation of ordered trees
inferredcites →https://doi.org/10.1016/0898-1221(78)90043-3openalex-snapshot
Combinatorial algorithms: Theory and practice
inferredcites →https://doi.org/10.1080/00401706.1965.10490279openalex-snapshot
Applied Combinatorial Mathematics
inferredcites →https://doi.org/10.1137/0206055openalex-snapshot
Generating Binary Trees Lexicographically
inferredcites →https://doi.org/10.1137/0207034openalex-snapshot
Generating t -Ary Trees Lexicographically
inferredcites →https://doi.org/10.1137/0207039openalex-snapshot
Ranking and Listing Algorithms for k -Ary Trees
inferredcites →https://doi.org/10.1137/0208006openalex-snapshot
Generating Trees and Other Combinatorial Objects Lexicographically
inferredcites →https://doi.org/10.1137/0209055openalex-snapshot
Constant Time Generation of Rooted Trees
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-58907-4_22openalex-snapshot
Uniformly-distributed random generation of join orders
inferred← citeshttps://doi.org/10.1007/3-540-60922-9_47openalex-snapshot
Ranking and unranking trees using regular reductions
inferred← citeshttps://doi.org/10.1007/978-94-011-4122-2_1openalex-snapshot
Trees and their Properties
inferred← citeshttps://doi.org/10.1007/978-94-011-4122-2_2openalex-snapshot
Computational Models. Complexity and Fundamental Algorithms
inferred← citeshttps://doi.org/10.1007/bf00288468openalex-snapshot
Generating binary trees of bounded height
inferred← citeshttps://doi.org/10.1016/0020-0190(94)90050-7openalex-snapshot
On generating B-trees with constant average delay and in lexicographic order
inferred← citeshttps://doi.org/10.1016/j.dam.2024.05.010openalex-snapshot
Ranking and unranking restricted permutations
inferred← citeshttps://doi.org/10.1016/j.ipl.2023.106452openalex-snapshot
Ranking and unranking bordered and unbordered words
inferred← citeshttps://doi.org/10.1016/j.jda.2017.01.003openalex-snapshot
Practical algorithms to rank necklaces, Lyndon words, and de Bruijn sequences
inferred← citeshttps://doi.org/10.1080/02522667.1988.10698906openalex-snapshot
Ranking and Unranking of Non-regular Trees
inferred← citeshttps://doi.org/10.1145/101306.101308openalex-snapshot
A compendium of key search references
inferred← citeshttps://doi.org/10.48550/arxiv.1602.05032openalex-snapshot
Enumerating all the Irreducible Polynomials over Finite Field
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.