{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T13:13:01Z","timestamp":1773148381003,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642401039","type":"print"},{"value":"9783642401046","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40104-6_46","type":"book-chapter","created":{"date-parts":[[2013,7,11]],"date-time":"2013-07-11T01:36:30Z","timestamp":1373506590000},"page":"525-536","source":"Crossref","is-referenced-by-count":27,"title":["The Greedy Gray Code Algorithm"],"prefix":"10.1007","author":[{"given":"Aaron","family":"Williams","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"46_CR1","doi-asserted-by":"publisher","first-page":"622","DOI":"10.1109\/71.159045","volume":"3","author":"P. Corbett","year":"1992","unstructured":"Corbett, P.: Rotator graphs: An efficient topology for point-to-point multiprocessor networks. IEEE Trans. on Parallel and Distributed Systems\u00a03, 622\u2013626 (1992)","journal-title":"IEEE Trans. on Parallel and Distributed Systems"},{"key":"46_CR2","unstructured":"Duckworth, R., Stedman, F.: Tintinnalogia (1668)"},{"key":"46_CR3","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/0020-0190(84)90091-7","volume":"19","author":"P. Eades","year":"1984","unstructured":"Eades, P., McKay, B.: An algorithm for generating subsets of fixed size with a strong minimal change property. Inf. Proc. Letters\u00a019, 131\u2013133 (1984)","journal-title":"Inf. Proc. Letters"},{"key":"46_CR4","unstructured":"Gray, F.: Pulse code communication. U.S. Patent 2,632,058 (1947)"},{"issue":"6","key":"46_CR5","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0020-0190(76)90014-4","volume":"5","author":"R. Kaye","year":"1976","unstructured":"Kaye, R.: A Gray code for set partitions. Information Processing Letters\u00a05(6), 171\u2013173 (1976)","journal-title":"Information Processing Letters"},{"key":"46_CR6","unstructured":"Knuth, D.E.: The Art of Computer Programming. Combinatorial Algorithms, Part 1, vol.\u00a04. Addison-Wesley (2010)"},{"key":"46_CR7","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1006\/jagm.1993.1045","volume":"15","author":"J.M. Lucas","year":"1993","unstructured":"Lucas, J.M., van Baronaigien, D.R., Ruskey, F.: On rotations and the generation of binary trees. Journal of Algorithms\u00a015, 343\u2013366 (1993)","journal-title":"Journal of Algorithms"},{"key":"46_CR8","doi-asserted-by":"publisher","first-page":"859","DOI":"10.1090\/S0002-9904-1934-05988-3","volume":"40","author":"M.H. Martin","year":"1934","unstructured":"Martin, M.H.: A problem in arrangements. Bull. Amer. Math. Soc.\u00a040, 859\u2013864 (1934)","journal-title":"Bull. Amer. Math. Soc."},{"key":"46_CR9","unstructured":"Sawada, J., Williams, A.: Greedy pancake flipping. In: Latin-American Algorithms, Graphs and Optimization Symposium, LAGOS 2013 (accepted, 2013)"},{"key":"46_CR10","unstructured":"Siegel, J.: Interconnection Networks for Large-Scale Parallel Processing: Theory and Case Studies. McGraw-Hill (1990)"},{"key":"46_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1007\/978-3-642-25011-8_26","volume-title":"Combinatorial Algorithms","author":"B. Stevens","year":"2011","unstructured":"Stevens, B., Williams, A.: Hamilton cycles in restricted rotator graphs. In: Iliopoulos, C.S., Smyth, W.F. (eds.) IWOCA 2011. LNCS, vol.\u00a07056, pp. 324\u2013336. Springer, Heidelberg (2011)"},{"key":"46_CR12","unstructured":"Wikipedia. Rotary encoder, \n                  \n                    http:\/\/en.wikipedia.org\/wiki\/Rotary_encoder"},{"issue":"2","key":"46_CR13","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/BF01937486","volume":"24","author":"S. Zaks","year":"1984","unstructured":"Zaks, S.: A new algorithm for generation of permutations. BIT Numerical Mathematics\u00a024(2), 196\u2013204 (1984)","journal-title":"BIT Numerical Mathematics"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40104-6_46","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T14:42:56Z","timestamp":1557931376000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40104-6_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642401039","9783642401046"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40104-6_46","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}