On the public citation graph

On the ordering, ranking, and random generation of basic combinatorial sets

0 signed · 25 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bfb0060799openalex-snapshot
Théorie Géométrique des Polynômes Eulériens
inferredcites →https://doi.org/10.1016/0097-3165(77)90069-3openalex-snapshot
On the sequential and random selection of subspaces over a finite field
inferredcites →https://doi.org/10.1137/0203004openalex-snapshot
On Backtracking: A Combinatorial Description of the Algorithm
inferredcites →https://doi.org/10.1137/0205023openalex-snapshot
Ranking Algorithms: The Symmetries and Colorations of the n -Cube
inferredcites →https://doi.org/10.1137/0205039openalex-snapshot
Ranking Algorithms for Lists of Partitions
inferredcites →https://doi.org/10.1145/321765.321781openalex-snapshot
Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations
inferredcites →https://doi.org/10.1145/359997.360002openalex-snapshot
Permutation enumeration
inferredcites →https://doi.org/10.2307/2284007openalex-snapshot
Applied Combinatorial Mathematics.
inferredcites →https://doi.org/10.2307/2343475openalex-snapshot
Applied Combinatorial Mathematics.

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-60922-9_47openalex-snapshot
Ranking and unranking trees using regular reductions
inferred← citeshttps://doi.org/10.1007/978-94-009-5315-4_26openalex-snapshot
Introduction
inferred← citeshttps://doi.org/10.1007/bf00288468openalex-snapshot
Generating binary trees of bounded height
inferred← citeshttps://doi.org/10.1007/bfb0090008openalex-snapshot
Combinatoire et Représentation du Groupe Symétrique
inferred← citeshttps://doi.org/10.1016/0012-365x(79)90080-3openalex-snapshot
Enumeration des tableaux standards
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/0166-218x(92)90204-nopenalex-snapshot
Generating permutations with given ups and downs
inferred← citeshttps://doi.org/10.1016/0196-6774(83)90034-2openalex-snapshot
Ranking and unranking of B-trees
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.1051/ro/1979130403791openalex-snapshot
Énumération de classes de permutations
inferred← citeshttps://doi.org/10.1080/00207169408804251openalex-snapshot
On the listing and random generation of hybrid binary trees
inferred← citeshttps://doi.org/10.1137/0207039openalex-snapshot
Ranking and Listing Algorithms for k -Ary Trees
inferred← citeshttps://doi.org/10.1137/0208006openalex-snapshot
Generating Trees and Other Combinatorial Objects Lexicographically
inferred← citeshttps://doi.org/10.1137/0209013openalex-snapshot
Combinatorial Gray Codes
inferred← citeshttps://doi.org/10.1137/0210011openalex-snapshot
Listing and Counting Subtrees of a Tree
inferred← citeshttps://doi.org/10.1137/0211049openalex-snapshot
Ranking and Unranking of 2-3 Trees
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.