Full metadata record
DC FieldValueLanguage
dc.contributor.authorWU, JSen_US
dc.contributor.authorCHEN, RJen_US
dc.date.accessioned2014-12-08T15:04:33Z-
dc.date.available2014-12-08T15:04:33Z-
dc.date.issued1993-04-29en_US
dc.identifier.issn0020-0190en_US
dc.identifier.urihttp://dx.doi.org/10.1016/0020-0190(93)90187-Een_US
dc.identifier.urihttp://hdl.handle.net/11536/3043-
dc.description.abstractThis paper discusses a variant of the towers of Hanoi problem with cyclic parallel moves. We propose an algorithm for this problem and show that the algorithm is optimal.en_US
dc.language.isoen_USen_US
dc.subjectTOWERS OF HANOIen_US
dc.subjectRECURRENCE RELATIONSen_US
dc.subjectALGORITHMSen_US
dc.titleTHE TOWERS OF HANOI PROBLEM WITH CYCLIC PARALLEL MOVESen_US
dc.typeArticleen_US
dc.identifier.doi10.1016/0020-0190(93)90187-Een_US
dc.identifier.journalINFORMATION PROCESSING LETTERSen_US
dc.citation.volume46en_US
dc.citation.issue1en_US
dc.citation.spage1en_US
dc.citation.epage6en_US
dc.contributor.department交大名義發表zh_TW
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentNational Chiao Tung Universityen_US
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.identifier.wosnumberWOS:A1993LA61800001-
dc.citation.woscount2-
Appears in Collections:Articles


Files in This Item:

  1. A1993LA61800001.pdf