On the public citation graph
Ranking Algorithms for Lists of Partitions
0 signed · 20 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/0001-8708(76)90164-xopenalex-snapshot
Combinatorial algorithms
inferredcites →https://doi.org/10.1145/367651.367661openalex-snapshot
Partioning algorithms for finite sets
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jcta.1999.3019openalex-snapshot
Weighted-Inversion Statistics and Their Symmetry Groups
inferred← citeshttps://doi.org/10.1007/11752578_9openalex-snapshot
A New Algorithm for Generation of Exactly M–Block Set Partitions in Associative Model
inferred← citeshttps://doi.org/10.1007/978-3-031-13257-5_2openalex-snapshot
Ranking Binary Unlabelled Necklaces in Polynomial Time
inferred← citeshttps://doi.org/10.1007/bfb0090026openalex-snapshot
On the ordering, ranking, and random generation of basic combinatorial sets
inferred← citeshttps://doi.org/10.1016/0001-8708(77)90043-3openalex-snapshot
Restricted growth functions and incidence relations of the lattice of partitions of an n-set
inferred← citeshttps://doi.org/10.1016/0001-8708(82)90032-9openalex-snapshot
Restricted growth functions, rank row matchings of partition lattices, and q-Stirling numbers
inferred← citeshttps://doi.org/10.1016/0097-3165(85)90044-5openalex-snapshot
Weighted inversion numbers, restricted growth functions, and standard young tableaux
inferred← citeshttps://doi.org/10.1016/j.aam.2019.06.007openalex-snapshot
From q-Stirling numbers to the ordered multiset partitions: A viewpoint from vincular patterns
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/03081088008817365openalex-snapshot
Construction of minimal representative systems
inferred← citeshttps://doi.org/10.1090/s0002-9947-1978-0511401-8openalex-snapshot
A 𝑞-analog of restricted growth functions, Dobinski’s equality, and Charlier polynomials
inferred← citeshttps://doi.org/10.1137/0207039openalex-snapshot
Ranking and Listing Algorithms for k -Ary Trees
inferred← citeshttps://doi.org/10.1137/s0895480192234009openalex-snapshot
Analysis of Algorithms for Listing Equivalence Classes of k -ary Strings
inferred← citeshttps://doi.org/10.4467/2353737xct.14.055.3963openalex-snapshot
A parallel dynamic programming algorithm for unranking set partitions
inferred← citeshttps://doi.org/10.48550/arxiv.1810.06052openalex-snapshot
From $q$-Stirling numbers to the Delta Conjecture: a viewpoint from vincular patterns
inferred← citeshttps://doi.org/10.48550/arxiv.2108.01990openalex-snapshot
Combinatorial Algorithms for Multidimensional Necklaces
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.