The complexity of the generalised cyclic Towers of Hanoi problem-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

The complexity of the generalised cyclic Towers of Hanoi problem

Published:1985-09 Issue:3 Volume:6 Page:351-358
ISSN:0196-6774
Container-title:Journal of Algorithms
language:en
Short-container-title:Journal of Algorithms

Author:

Er M.C

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Computational Mathematics,Control and Optimization

Reference8 articles.

1. The cyclic Towers of Hanoi;Atkinson;Inform. Process. Lett.,1981

2. The Towers of Hanoi problem;Buneman;Inform. Process. Lett.,1980

3. A Short Introduction to the Art of Programming;Dijkstra;EWD 316,1971

4. A representation approach to the Tower of Hanoi problem;Er;Comput. J.,1982

5. An Iterative Solution to the Cyclic Towers of Hanoi Problem;Er,1982

Cited by 10 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A tour of general Hanoi graphs;Theoretical Computer Science;2024-02

2. The Cyclic Towers of Antwerpen problem—A challenging Hanoi variant;Discrete Applied Mathematics;2014-12

3. The Tower of Hanoi problem on Pathh graphs;Discrete Applied Mathematics;2012-07

4. On an infinite family of solvable Hanoi graphs;ACM Transactions on Algorithms;2008-11

5. On a question of Leiss regarding the Hanoi Tower problem;Theoretical Computer Science;2006-12

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP