A probabilistic analysis of an error-correcting algorithm for the Towers of Hanoi puzzle (Q791323): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0020-0190(84)90031-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1982130308 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The cyclic towers of Hanoi / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5784990 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient generation of the binary reflected gray code and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Towers of Hanoi Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discussion and correspondence: A note on the Towers of Hanoi problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A family of rules for recursion removal / 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: Iteration strikes back - at the cyclic Towers of Hanoi / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3946175 / rank
 
Normal rank

Latest revision as of 11:21, 14 June 2024

scientific article
Language Label Description Also known as
English
A probabilistic analysis of an error-correcting algorithm for the Towers of Hanoi puzzle
scientific article

    Statements

    A probabilistic analysis of an error-correcting algorithm for the Towers of Hanoi puzzle (English)
    0 references
    0 references
    0 references
    1984
    0 references
    algorithm analysis
    0 references
    Towers of Hanoi
    0 references
    error correction
    0 references

    Identifiers