Reflection-free permutations, rosary permutations, and adjacent transposition algorithms
Mohit Kumar Roy · Communications of the ACM · 1973
article Free AccessReflection-free permutations, rosary permutations, and adjacent transposition algorithms Author: Mohit Kumar Roy Jadavpur Univ., Calcutta, India Jadavpur Univ., Calcutta, IndiaView Profile Authors Info & Claims Communications of the ACMVolume 16Issue 501 May 1973pp 312–313https://doi.org/10.1145/362041.362225Published:01 May 1973Publication History 3citation276DownloadsMetricsTotal Citations3Total Downloads276Last 12 Months32Last 6 weeks3 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF