On the public citation graph

Generating Combinations by Prefix Shifts

https://doi.org/10.1007/11533719_58
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.
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/3-540-57568-5_250openalex-snapshot
Simple combinatorial Gray codes constructed by reversing sublists
inferredcites →https://doi.org/10.1007/978-1-4612-4968-9openalex-snapshot
Constructive Combinatorics
inferredcites →https://doi.org/10.1007/bf00156752openalex-snapshot
Gray codes for randomization procedures
inferredcites →https://doi.org/10.1016/0012-365x(94)90023-xopenalex-snapshot
Determining the hamilton-connectedness of certain vertex-transitive graphs
inferredcites →https://doi.org/10.1016/0020-0190(84)90091-7openalex-snapshot
An algorithm for generating subsets of fixed size with a strong minimal change property
inferredcites →https://doi.org/10.1109/71.159045openalex-snapshot
Rotator graphs: an efficient topology for point-to-point multiprocessor networks
inferredcites →https://doi.org/10.1109/t-c.1973.223681openalex-snapshot
Distance-2 Cyclic Chaining of Constant-Weight Codes
inferredcites →https://doi.org/10.1145/2422.322413openalex-snapshot
Some Hamilton Paths and a Minimal Change Algorithm
inferredcites →https://doi.org/10.1145/321765.321781openalex-snapshot
Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/cpe.3969openalex-snapshot
Coalition structure generation problems: optimization and parallelization of the IDP algorithm in multicore systems
inferred← citeshttps://doi.org/10.1007/978-3-031-06678-8_28openalex-snapshot
A Shift Gray Code for Fixed-Content Łukasiewicz Words
inferred← citeshttps://doi.org/10.1007/978-3-540-77294-1_11openalex-snapshot
Combinatorial Algorithms for Listing Paths in Minimal Change Order
inferred← citeshttps://doi.org/10.1007/s11390-007-9094-7openalex-snapshot
Generating Combinations by Three Basic Operations
inferred← citeshttps://doi.org/10.1016/j.dam.2008.06.018openalex-snapshot
Gray codes for non-crossing partitions and dissections of a convex polygon
inferred← citeshttps://doi.org/10.1016/j.disc.2007.11.048openalex-snapshot
The coolest way to generate combinations
inferred← citeshttps://doi.org/10.1016/j.jcta.2011.07.005openalex-snapshot
Binary bubble languages and cool-lex order
inferred← citeshttps://doi.org/10.1016/j.jda.2012.04.015openalex-snapshot
Cool-lex order and k-ary Catalan structures
inferred← citeshttps://doi.org/10.48550/arxiv.1601.02683openalex-snapshot
Software for enumerative and analytic combinatorics
inferred← citeshttps://doi.org/10.5555/1496770.1496877openalex-snapshot
Loopless generation of multiset permutations using a constant number of variables by prefix shifts
inferred← citeshttps://doi.org/10.70675/faa4dde0z33baz4c03z93bdzf7d87ba7879eopenalex-snapshot
Gray codes and efficient exhaustive generation for several classes of restricted words
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.