Nonrecursive solution to parallel multipeg towers of Hanoi: A decomposition approach (Q1816622): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Parallelism for multipeg towers of Hanoi / rank
 
Normal rank
Property / cites work
 
Property / cites work: A loopless approach to the multipeg towers of hanoi / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Representation Approach to the Tower of Hanoi Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A loopless approach for constructing a fastest algorithm for the towers of hanoi problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An iterative algorithm for the Tower of Hanoi with four pegs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The towers of Hanoi revisited: Moving the rings by counting the moves / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on parallelism for the towers of Hanoi / rank
 
Normal rank
Property / cites work
 
Property / cites work: The towers of Hanoi problem with parallel moves / rank
 
Normal rank

Latest revision as of 14:53, 24 May 2024

scientific article
Language Label Description Also known as
English
Nonrecursive solution to parallel multipeg towers of Hanoi: A decomposition approach
scientific article

    Statements

    Identifiers