{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T23:32:11Z","timestamp":1781134331772,"version":"3.54.1"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540462675","type":"print"},{"value":"9783540462682","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11889205_51","type":"book-chapter","created":{"date-parts":[[2006,9,28]],"date-time":"2006-09-28T12:07:42Z","timestamp":1159445262000},"page":"685-689","source":"Crossref","is-referenced-by-count":12,"title":["A Note on Low Autocorrelation Binary Sequences"],"prefix":"10.1007","author":[{"given":"Iv\u00e1n","family":"Dot\u00fa","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pascal","family":"Van Hentenryck","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"51_CR1","first-page":"289","volume":"40","author":"G. Beenker","year":"1985","unstructured":"Beenker, G., Claasen, T., Hermens, P.: Binary Sequences with a Maximally Flat Amplitude Spectrum. Philips Journal of Research\u00a040, 289\u2013304 (1985)","journal-title":"Philips Journal of Research"},{"key":"51_CR2","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1051\/jphys:01987004804055900","volume":"48","author":"J. Bernasconi","year":"1987","unstructured":"Bernasconi, J.: Low Autocorrelation Binary Sequences: Statistical Mechanics and Configuration Space Analysis. Physique\u00a048, 559 (1987)","journal-title":"Physique"},{"key":"51_CR3","unstructured":"Brglez, F., Li, X., Stallman, M., Militzer, B.: Reliable Cost Prediction for Finding Optimal Solutions to LABS Problem: Evolutionary and Alternative Algorithms. In: Fifth International Workshop on Frontiers in Evolutionary Algorithms, Cary, NC, USA (2003)"},{"key":"51_CR4","unstructured":"Gent, I., Walsh, T.: CSPLIB: A Benchmark Library for Constraints, \n                    \n                      http:\/\/csplib.org"},{"key":"51_CR5","unstructured":"Gent, I., Smith, B.: Symmetry Breaking During Search in Constraint Programming. Research Report, 99.02 (1999)"},{"key":"51_CR6","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1109\/TIT.1977.1055653","volume":"23","author":"M.J. Golay","year":"1977","unstructured":"Golay, M.J.: Sieves for Low Autocorrelation Binary Sequences. IEEE Transactions on Information Theory\u00a023, 41\u201343 (1977)","journal-title":"IEEE Transactions on Information Theory"},{"key":"51_CR7","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1109\/TIT.1982.1056505","volume":"28","author":"M.J. Golay","year":"1982","unstructured":"Golay, M.J.: The Merit Factor of Long Low Autocorrelation Binary Sequences. IEEE Transactions on Information Theory\u00a028, 543\u2013549 (1982)","journal-title":"IEEE Transactions on Information Theory"},{"key":"51_CR8","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1080\/02331939208843771","volume":"23","author":"C. Groot de","year":"1992","unstructured":"de Groot, C., Wurtz, D., Hoffmann, K.: Low Autocorrelation Binary Sequences: Exact Enumeration and Optimization by Evolutionary Strategies. Optimization\u00a023, 369\u2013384 (1992)","journal-title":"Optimization"},{"key":"51_CR9","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1088\/0305-4470\/29\/18\/005","volume":"29","author":"S. Mertens","year":"1996","unstructured":"Mertens, S.: Exhaustive Search for Low Autocorrelation Binary Sequences. J. Phys. A: Math.\u00a029, 473\u2013481 (1996)","journal-title":"J. Phys. A: Math."},{"key":"51_CR10","unstructured":"Prestwich, S.D.: A Hybrid Local Search for Low Autocorrelation Binary Sequences. Technical Report, TR-00-01 (2000)"},{"key":"51_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/3-540-45349-0_25","volume-title":"Principles and Practice of Constraint Programming - CP 2000","author":"S.D. Prestwich","year":"2000","unstructured":"Prestwich, S.D.: A Hybrid Search Architecture Applied to Hard Random 3-SAT and Low-Autocorrelation Binary Sequences. In: Dechter, R. (ed.) CP 2000. LNCS, vol.\u00a01894, pp. 337\u2013352. Springer, Heidelberg (2000)"},{"key":"51_CR12","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1023\/A:1021809724362","volume":"118","author":"S.D. Prestwich","year":"2003","unstructured":"Prestwich, S.D.: Negative Effects of Modeling Techniques on Search Performance. Annals of Operations Research\u00a0118, 137\u2013150 (2003)","journal-title":"Annals of Operations Research"},{"key":"51_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/11493853_21","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"S.D. Prestwich","year":"2005","unstructured":"Prestwich, S.D., Roli, A.: Symmetry breaking and local search spaces. In: Bart\u00e1k, R., Milano, M. (eds.) CPAIOR 2005. LNCS, vol.\u00a03524, pp. 273\u2013287. Springer, Heidelberg (2005)"},{"key":"51_CR14","first-page":"137","volume-title":"Number theory in Science and Communication","author":"M.R. Schroeder","year":"2003","unstructured":"Schroeder, M.R.: Number theory in Science and Communication, vol.\u00a0118, pp. 137\u2013150. Springer, Berlin (2003)"},{"key":"51_CR15","doi-asserted-by":"publisher","first-page":"1265","DOI":"10.1103\/PhysRevLett.20.1265","volume":"20","author":"I. Shapiro","year":"1968","unstructured":"Shapiro, I., Pettengil, G., Ash, M., Stone, M., Smith, W., Ingalls, R., Brockelman, R.: Fourth Test of General Relativity. Phys. rev. Lett.\u00a020, 1265\u20131269 (1968)","journal-title":"Phys. rev. Lett."},{"key":"51_CR16","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/BF00318719","volume":"57","author":"Q. Wang","year":"1987","unstructured":"Wang, Q.: Optimization by Simulating Molecular Evolution. Biol. Cybern.\u00a057, 95\u2013101 (1987)","journal-title":"Biol. Cybern."}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming - CP 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11889205_51","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,11]],"date-time":"2019-03-11T02:36:14Z","timestamp":1552271774000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11889205_51"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540462675","9783540462682"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11889205_51","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}