{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T11:50:58Z","timestamp":1759146658040},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540372066"},{"type":"electronic","value":"9783540372073"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11814948_30","type":"book-chapter","created":{"date-parts":[[2006,7,18]],"date-time":"2006-07-18T10:12:38Z","timestamp":1153217558000},"page":"311-324","source":"Crossref","is-referenced-by-count":14,"title":["Implementing Survey Propagation on Graphics Processing Units"],"prefix":"10.1007","author":[{"given":"Panagiotis","family":"Manolios","sequence":"first","affiliation":[]},{"given":"Yimin","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"30_CR1","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1002\/rsa.20057","volume":"27","author":"A. Braunstein","year":"2005","unstructured":"Braunstein, A., Mezard, M., Zecchina, R.: Survey propagation: an algorithm for satisfiability. Random Structures and Algorithms\u00a027, 201\u2013226 (2005)","journal-title":"Random Structures and Algorithms"},{"key":"30_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1007\/978-3-540-24605-3_38","volume-title":"Theory and Applications of Satisfiability Testing","author":"A. Braunstein","year":"2004","unstructured":"Braunstein, A., Zecchina, R.: Survey and belief propagation on random k-SAT. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol.\u00a02919, pp. 519\u2013528. Springer, Heidelberg (2004)"},{"key":"30_CR3","doi-asserted-by":"crossref","unstructured":"Cook, S.A., Mitchell, D.G.: Finding hard instances of the satisfiability problem: A survey. In: Du, Gu, Pardalos (eds.) Satisfiability Problem: Theory and Applications, vol.\u00a035, pp. 1\u201317. American Mathematical Society (1997)","DOI":"10.1090\/dimacs\/035\/01"},{"issue":"7","key":"30_CR4","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1145\/368273.368557","volume":"5","author":"M. Davis","year":"1962","unstructured":"Davis, M., Logemann, G., Loveland, D.: A machine program for theorem proving. Communications of the ACM\u00a05(7), 394\u2013397 (1962)","journal-title":"Communications of the ACM"},{"key":"30_CR5","doi-asserted-by":"crossref","unstructured":"Dubois, O., Monasson, R., Selman, B., Zecchina, R.: Statistical mechanics methods and phase transitions in optimization problems. Theoretical Computer Science\u00a0265(3\u201367) (2001)","DOI":"10.1016\/S0304-3975(01)00149-9"},{"key":"30_CR6","unstructured":"Fan, Z., Qiu, F., Kaufman, A., Yoakum-Stover, S.: GPU cluster for high performance computing. In: SC 2004: Proceedings of the 2004 ACM\/IEEE conference on Supercomputing, pp. 47\u201347 (2004)"},{"key":"30_CR7","doi-asserted-by":"crossref","unstructured":"Fatahalian, K., Sugerman, J., Hanrahan, P.: Understanding the efficiency of GPU algorithms for matrix-matrix multiplication. In: HWWS 2004: Proceedings of the ACM SIGGRAPH\/EUROGRAPHICS conference on Graphics hardware, pp. 133\u2013138 (2004)","DOI":"10.1145\/1058129.1058148"},{"key":"30_CR8","doi-asserted-by":"crossref","unstructured":"Goldberg, E., Novikov, Y.: BerkMin: A fast and robust SAT-solver. In: Design, Automation, and Test in Europe (DATE 2002), March 2002, pp. 142\u2013149 (2002)","DOI":"10.1109\/DATE.2002.998262"},{"key":"30_CR9","unstructured":"GPGPU. General-Purpose Computation using GPUs, (2006) http:\/\/www.gpgpu.org"},{"key":"30_CR10","first-page":"733","volume-title":"GPU Gems 2: Programming Techniques for High-Performance Graphics and General-Purpose Computation","author":"P. Kipfer","year":"2005","unstructured":"Kipfer, P., Westermann, R.: Improved GPU sorting. In: GPU Gems 2: Programming Techniques for High-Performance Graphics and General-Purpose Computation, pp. 733\u2013746. Addison Wesley, Reading (2005)"},{"issue":"3","key":"30_CR11","doi-asserted-by":"publisher","first-page":"908","DOI":"10.1145\/882262.882363","volume":"22","author":"J. Kruger","year":"2003","unstructured":"Kruger, J., Westermann, R.: Linear algebra operators for GPU implementation of numerical algorithms. ACM Transactions on Graphics\u00a022(3), 908\u2013916 (2003)","journal-title":"ACM Transactions on Graphics"},{"key":"30_CR12","doi-asserted-by":"publisher","first-page":"56126","DOI":"10.1103\/PhysRevE.66.056126","volume":"66","author":"M. Mezard","year":"2002","unstructured":"Mezard, M., Zecchina, R.: The random k-satisfiability problem: from an analytic solution to an efficient algorithm. Physical Review E\u00a066, 56126 (2002)","journal-title":"Physical Review E"},{"key":"30_CR13","doi-asserted-by":"crossref","unstructured":"Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an efficient SAT solver. In: Design Automation Conference (DAC 2001), pp. 530\u2013535 (2001)","DOI":"10.1145\/378239.379017"},{"key":"30_CR14","unstructured":"Owens, J.D., Luebke, D., Govindaraju, N., Harris, M., Kr\u00fcger, J.: A survey of general-purpose computation on graphics hardware. In: Eurographics 2005, State of the Art Reports, pp. 21\u201351 (2005)"},{"key":"30_CR15","unstructured":"Payne, B.R.: Accelerating Scientific Computation in Bioinformatics by Using Graphics Processing Units as Parallel Vector Processors. PhD thesis, Georgia State University (November 2004)"},{"key":"30_CR16","unstructured":"Ryan, L.: Siege homepage. URL http:\/\/www.cs.sfu.ca\/~loryan\/-personal"},{"key":"30_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/978-3-540-24605-3_22","volume-title":"Theory and Applications of Satisfiability Testing","author":"L. Zhang","year":"2004","unstructured":"Zhang, L., Malik, S.: Cache performance of SAT solvers: A case study for efficient implementation of algorithms. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol.\u00a02919, pp. 287\u2013298. Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Satisfiability Testing - SAT 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11814948_30.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:28:02Z","timestamp":1619508482000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11814948_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540372066","9783540372073"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11814948_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}