On the public citation graph
A simplified loop-free algorithm for generating permutations
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.
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.1090/s0025-5718-1963-0159764-2openalex-snapshot
Generation of Permutations by Adjacent Transposition
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/355611.362541openalex-snapshot
Algorithm 466: four combinatorial algorithm [G6]
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jagm.1997.0863openalex-snapshot
Gray Codes for the Ideals of Interval Orders
inferred← citeshttps://doi.org/10.1006/jagm.1999.1059openalex-snapshot
Multiset Permutations and Loopless Generation of Ordered Trees with Specified Degree Sequence
inferred← citeshttps://doi.org/10.1007/978-1-4471-0717-0_19openalex-snapshot
A Loopless Generation of Bitstrings without p Consecutive Ones
inferred← citeshttps://doi.org/10.1007/978-3-7091-2748-3_3openalex-snapshot
A Recursive Approach to the Implementation of Enumerative Methods
inferred← citeshttps://doi.org/10.1007/bf01937486openalex-snapshot
A new algorithm for generation of permutations
inferred← citeshttps://doi.org/10.1007/s00453-019-00640-2openalex-snapshot
A Constant-Time Algorithm for Middle Levels Gray Codes
inferred← citeshttps://doi.org/10.1016/0166-218x(92)90204-nopenalex-snapshot
Generating permutations with given ups and downs
inferred← citeshttps://doi.org/10.1093/comjnl/bxab181openalex-snapshot
A Unified Framework to Discover Permutation Generation Algorithms
inferred← citeshttps://doi.org/10.1109/date.2002.998303openalex-snapshot
Reducing test application time through test data mutation encoding
inferred← citeshttps://doi.org/10.1109/icsmc.2005.1571186openalex-snapshot
General 3D Acquisition and Tracking of Dot Targets on a Mars Rover Prototype
inferred← citeshttps://doi.org/10.1109/isit.2010.5513597openalex-snapshot
Partial rank modulation for flash memories
inferred← citeshttps://doi.org/10.1145/360336.360343openalex-snapshot
Efficient generation of the binary reflected gray code and its applications
inferred← citeshttps://doi.org/10.15439/2023f5568openalex-snapshot
A short note on computing permutations
inferred← citeshttps://doi.org/10.31142/ijtsrd22925openalex-snapshot
Implementation of Combinatorial Algorithms using Optimization Techniques
inferred← citeshttps://doi.org/10.5555/882452.874346openalex-snapshot
Reducing Test Application Time Through Test Data Mutation Encoding
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.