{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T20:55:33Z","timestamp":1725828933099},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662483497"},{"type":"electronic","value":"9783662483503"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-48350-3_76","type":"book-chapter","created":{"date-parts":[[2015,8,31]],"date-time":"2015-08-31T21:40:34Z","timestamp":1441057234000},"page":"915-927","source":"Crossref","is-referenced-by-count":1,"title":["Efficient Computation of Middle Levels Gray Codes"],"prefix":"10.1007","author":[{"given":"Torsten","family":"M\u00fctze","sequence":"first","affiliation":[]},{"given":"Jerri","family":"Nummenpalo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,11,12]]},"reference":[{"key":"76_CR1","unstructured":"Currently. \n                    \n                      http:\/\/www.as.inf.ethz.ch\/muetze\n                    \n                    \n                   and \n                    \n                      http:\/\/people.inf.ethz.ch\/njerri"},{"issue":"9","key":"76_CR2","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1145\/360336.360343","volume":"19","author":"J. Bitner","year":"1976","unstructured":"Bitner, J., Ehrlich, G., Reingold, E.: Efficient generation of the binary reflected gray code and its applications. Commun. ACM\u00a019(9), 517\u2013521 (1976)","journal-title":"Commun. ACM"},{"issue":"2-3","key":"76_CR3","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/0012-365X(84)90179-1","volume":"48","author":"M. Buck","year":"1984","unstructured":"Buck, M., Wiedemann, D.: Gray codes with restricted density. Discrete Math.\u00a048(2-3), 163\u2013171 (1984)","journal-title":"Discrete Math."},{"issue":"7","key":"76_CR4","doi-asserted-by":"publisher","first-page":"1328","DOI":"10.1016\/j.disc.2007.03.068","volume":"308","author":"Y. Chen","year":"2008","unstructured":"Chen, Y.: The Chung\u2013Feller theorem revisited. Discrete Math.\u00a0308(7), 1328\u20131329 (2008)","journal-title":"Discrete Math."},{"issue":"1","key":"76_CR5","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1109\/TCT.1966.1082546","volume":"13","author":"R. Cummins","year":"1966","unstructured":"Cummins, R.: Hamilton circuits in tree graphs. IEEE Trans. Circuit Theory\u00a013(1), 82\u201390 (1966)","journal-title":"IEEE Trans. Circuit Theory"},{"issue":"2","key":"76_CR6","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1016\/0097-3165(94)90030-2","volume":"65","author":"D. Duffus","year":"1994","unstructured":"Duffus, D., Kierstead, H., Snevily, H.: An explicit 1-factorization in the middle of the Boolean lattice. J. Combin. Theory Ser. A\u00a065(2), 334\u2013342 (1994)","journal-title":"J. Combin. Theory Ser. A"},{"issue":"3","key":"76_CR7","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. Process. Lett.\u00a019(3), 131\u2013133 (1984)","journal-title":"Inf. Process. Lett."},{"issue":"1\u20133","key":"76_CR8","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/0012-365X(94)00283-O","volume":"144","author":"S. Felsner","year":"1995","unstructured":"Felsner, S., Trotter, W.: Colorings of diagrams of interval orders and \u03b1-sequences of sets. Discrete Math.\u00a0144(1\u20133), 23\u201331 (1995)","journal-title":"Discrete Math."},{"key":"76_CR9","unstructured":"Havel, I.: Semipaths in directed cubes. In: Graphs and Other Combinatorial Topics (Prague, 1982). Teubner-Texte Math., vol.\u00a059, pp. 101\u2013108. Teubner, Leipzig (1983)"},{"issue":"2","key":"76_CR10","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/j.jcta.2003.11.004","volume":"105","author":"R. Johnson","year":"2004","unstructured":"Johnson, R.: Long cycles in the middle two layers of the discrete cube. J. Combin. Theory Ser. A\u00a0105(2), 255\u2013271 (2004)","journal-title":"J. Combin. Theory Ser. A"},{"key":"76_CR11","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1090\/S0025-5718-1963-0159764-2","volume":"17","author":"S. Johnson","year":"1963","unstructured":"Johnson, S.: Generation of permutations by adjacent transposition. Math. Comp.\u00a017, 282\u2013285 (1963)","journal-title":"Math. Comp."},{"issue":"2","key":"76_CR12","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/BF00337621","volume":"5","author":"H. Kierstead","year":"1988","unstructured":"Kierstead, H., Trotter, W.: Explicit matchings in the middle levels of the Boolean lattice. Order\u00a05(2), 163\u2013171 (1988)","journal-title":"Order"},{"key":"76_CR13","unstructured":"Knuth, D.: The Art of Computer Programming, vol.\u00a04A. Addison-Wesley (2011)"},{"issue":"3","key":"76_CR14","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1006\/jagm.1993.1045","volume":"15","author":"J. Lucas","year":"1993","unstructured":"Lucas, J., van Baronaigien, D.R., Ruskey, F.: On rotations and the generation of binary trees. J. Algorithms\u00a015(3), 343\u2013366 (1993)","journal-title":"J. Algorithms"},{"key":"76_CR15","unstructured":"M\u00fctze, T.: Proof of the middle levels conjecture, arXiv:1404.4442, August 2014"},{"key":"76_CR16","doi-asserted-by":"crossref","unstructured":"M\u00fctze, T., Nummenpalo, J.: Efficient computation of middle levels Gray codes, arXiv:1506.07898, June 2015","DOI":"10.1007\/978-3-662-48350-3_76"},{"issue":"8","key":"76_CR17","doi-asserted-by":"publisher","first-page":"1832","DOI":"10.1016\/j.jcta.2012.06.005","volume":"119","author":"T. M\u00fctze","year":"2012","unstructured":"M\u00fctze, T., Weber, F.: Construction of 2-factors in the middle layer of the discrete cube. J. Combin. Theory Ser. A\u00a0119(8), 1832\u20131855 (2012)","journal-title":"J. Combin. Theory Ser. A"},{"issue":"2","key":"76_CR18","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1016\/0196-6774(88)90036-3","volume":"9","author":"F. Ruskey","year":"1988","unstructured":"Ruskey, F.: Adjacent interchange generation of combinations. J. Algorithms\u00a09(2), 162\u2013180 (1988)","journal-title":"J. Algorithms"},{"issue":"4","key":"76_CR19","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1137\/S0036144595295272","volume":"39","author":"C. Savage","year":"1997","unstructured":"Savage, C.: A survey of combinatorial Gray codes. SIAM Rev.\u00a039(4), 605\u2013629 (1997)","journal-title":"SIAM Rev."},{"issue":"2","key":"76_CR20","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1016\/0097-3165(95)90091-8","volume":"70","author":"C. Savage","year":"1995","unstructured":"Savage, C., Winkler, P.: Monotone Gray codes and the middle levels problem. J. Combin. Theory Ser. A\u00a070(2), 230\u2013248 (1995)","journal-title":"J. Combin. Theory Ser. A"},{"issue":"17","key":"76_CR21","doi-asserted-by":"publisher","first-page":"5271","DOI":"10.1016\/j.disc.2007.11.010","volume":"309","author":"I. Shields","year":"2009","unstructured":"Shields, I., Shields, B., Savage, C.: An update on the middle levels problem. Discrete Math.\u00a0309(17), 5271\u20135277 (2009)","journal-title":"Discrete Math."},{"key":"76_CR22","unstructured":"Shimada, M., Amano, K.: A note on the middle levels conjecture, arXiv:0912.4564, September 2011"},{"issue":"8","key":"76_CR23","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1145\/368637.368660","volume":"5","author":"H. Trotter","year":"1962","unstructured":"Trotter, H.: Algorithm 115: Perm. Commun. ACM\u00a05(8), 434\u2013435 (1962)","journal-title":"Commun. ACM"}],"container-title":["Lecture Notes in Computer Science","Algorithms - ESA 2015"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-48350-3_76","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T16:08:54Z","timestamp":1559232534000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-48350-3_76"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662483497","9783662483503"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-48350-3_76","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}