Successor rules for flipping pancakes and burnt pancakes (Q897860): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: OEIS / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2015.09.007 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1886146870 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pancake problems with restricted prefix reversals and some corresponding Cayley networks. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pancake flipping is hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \((18/11)n\) upper bound for sorting by prefix reversals / rank
 
Normal rank
Property / cites work
 
Property / cites work: On average and highest number of flips in pancake sorting / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the problem of sorting burnt pancakes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cool-lex order and \(k\)-ary Catalan structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3393448 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transforming cabbage into turnip / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Diameter of the Pancake Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shorthand universal cycles for permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ranking and unranking permutations in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: A method and two algorithms on the theory of partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Binary bubble languages and cool-lex order / rank
 
Normal rank
Property / cites work
 
Property / cites work: De Bruijn Sequences for Fixed-Weight Binary Strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: The coolest way to generate combinations / rank
 
Normal rank
Property / cites work
 
Property / cites work: An explicit universal cycle for the ( <i>n</i> -1)-permutations of an <i>n</i> -set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient oracles for generating binary bubble languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Gray code for fixed-density necklaces and Lyndon words in constant amortized time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy flipping of pancakes and burnt pancakes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A surprisingly simple de Bruijn sequence construction / rank
 
Normal rank
Property / cites work
 
Property / cites work: The coolest way to generate binary strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4443440 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4633912 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new algorithm for generation of permutations / rank
 
Normal rank

Latest revision as of 03:45, 11 July 2024

scientific article
Language Label Description Also known as
English
Successor rules for flipping pancakes and burnt pancakes
scientific article

    Statements

    Successor rules for flipping pancakes and burnt pancakes (English)
    0 references
    0 references
    8 December 2015
    0 references
    pancake sorting
    0 references
    greedy algorithm
    0 references
    permutations
    0 references
    signed-permutations
    0 references
    prefix-reversal
    0 references
    symmetric group
    0 references
    Cayley graph
    0 references
    Hamilton cycle
    0 references
    human problem solving
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references