{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T07:57:41Z","timestamp":1761292661177},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642102165"},{"type":"electronic","value":"9783642102172"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-10217-2_20","type":"book-chapter","created":{"date-parts":[[2009,11,9]],"date-time":"2009-11-09T10:52:03Z","timestamp":1257763923000},"page":"183-193","source":"Crossref","is-referenced-by-count":3,"title":["Gray Code Compression"],"prefix":"10.1007","author":[{"given":"Darko","family":"Dimitrov","sequence":"first","affiliation":[]},{"given":"Tom\u00e1\u0161","family":"Dvo\u0159\u00e1k","sequence":"additional","affiliation":[]},{"given":"Petr","family":"Gregor","sequence":"additional","affiliation":[]},{"given":"Riste","family":"\u0160krekovski","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"20_CR1","doi-asserted-by":"crossref","unstructured":"Bultena, B., Ruskey, F.: Transition restricted Gray codes. Electron. J. Combin.\u00a03, #R11 (1996)","DOI":"10.37236\/1235"},{"key":"20_CR2","unstructured":"Ernvall, J., Katajainen, J., Penttonen, M.: NP-completeness of the Hamming salesman problem\u00a0 BIT 25, 289\u2013292 (1985)"},{"key":"20_CR3","series-title":"Fascicle 2: Generating All Tuples and Permutations","volume-title":"The Art of Computer Programming","author":"D.E. Knuth","year":"2005","unstructured":"Knuth, D.E.: The Art of Computer Programming. Fascicle 2: Generating All Tuples and Permutations, vol.\u00a04. Addison-Wesley Professional, Reading (2005)"},{"key":"20_CR4","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1109\/ICDE.2005.35","volume-title":"Proc. 21st Int. Conf. Data Engineering (ICDE 2005)","author":"A. Pinar","year":"2005","unstructured":"Pinar, A., Tao, T., Ferhatosmanoglu, H.: Compressing bitmap indices by data reorganization. In: Proc. 21st Int. Conf. Data Engineering (ICDE 2005), pp. 310\u2013321. IEEE Computer Society, Los Alamitos (2005)"},{"key":"20_CR5","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/0020-0190(86)90029-3","volume":"22","author":"D. Richards","year":"1986","unstructured":"Richards, D.: Data compression and Gray-code sorting. Inform. Process. Lett.\u00a022, 201\u2013205 (1986)","journal-title":"Inform. Process. Lett."},{"key":"20_CR6","volume-title":"Data Compression: The Complete Reference","author":"D. Salomon","year":"2006","unstructured":"Salomon, D.: Data Compression: The Complete Reference, 4th edn. Springer, Berlin (2006)","edition":"4"},{"key":"20_CR7","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, 605\u2013629 (1997)","journal-title":"SIAM Rev."},{"key":"20_CR8","unstructured":"Slater, P.J.: Open problem. In: Proc. 10th Southeastern Conf. on Combinatorics, Graph Theory, and Computing, Congress. Utilitas Math., Winnipeg, vol.\u00a0XXIV, pp. 918\u2013919 (1979)"},{"key":"20_CR9","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/0012-365X(89)90330-0","volume":"76","author":"P.J. Slater","year":"1989","unstructured":"Slater, P.J.: Research Problems 109 and 110. Discrete Math.\u00a076, 293\u2013294 (1989)","journal-title":"Discrete Math."},{"key":"20_CR10","doi-asserted-by":"publisher","first-page":"4124","DOI":"10.1016\/j.disc.2007.07.116","volume":"308","author":"I.N. Suparta","year":"2008","unstructured":"Suparta, I.N., van Zanten, A.J.: A construction of Gray codes inducing complete graphs. Discrete Math.\u00a0308, 4124\u20134132 (2008)","journal-title":"Discrete Math."},{"key":"20_CR11","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1016\/S0012-365X(02)00516-2","volume":"257","author":"E.L. Wilmer","year":"2002","unstructured":"Wilmer, E.L., Ernst, M.D.: Graphs induced by Gray codes. Discrete Math.\u00a0257, 585\u2013598 (2002)","journal-title":"Discrete Math."},{"key":"20_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1132863.1132864","volume":"31","author":"K. Wu","year":"2006","unstructured":"Wu, K., Otoo, E.J., Shoshani, A.: Optimizing bitmap indices with efficient compression. ACM Trans. Database Syst.\u00a031, 1\u201338 (2006)","journal-title":"ACM Trans. Database Syst."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-10217-2_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T21:52:17Z","timestamp":1606168337000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-10217-2_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642102165","9783642102172"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-10217-2_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}