{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T07:32:10Z","timestamp":1725521530209},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540928584"},{"type":"electronic","value":"9783540928591"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"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":[[2008]]},"DOI":"10.1007\/978-3-540-92859-1_2","type":"book-chapter","created":{"date-parts":[[2008,12,15]],"date-time":"2008-12-15T04:45:28Z","timestamp":1229316328000},"page":"2-12","source":"Crossref","is-referenced-by-count":0,"title":["Parallelization of Sphere-Decoding Methods"],"prefix":"10.1007","author":[{"given":"Rafael A.","family":"Trujillo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antonio M.","family":"Vidal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V\u00edctor M.","family":"Garc\u00eda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alberto","family":"Gonz\u00e1lez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"2_CR1","doi-asserted-by":"publisher","first-page":"2201","DOI":"10.1109\/TIT.2002.800499","volume":"48","author":"E. Agrell","year":"2002","unstructured":"Agrell, E., Eriksson, T., Vardy, A., Zeger, K.: Closest point search in lattices. IEEE Transactions on Information Theory\u00a048, 2201\u20132214 (2002)","journal-title":"IEEE Transactions on Information Theory"},{"key":"2_CR2","volume-title":"Parallel Programming in OpenMP","author":"R. Chandra","year":"2000","unstructured":"Chandra, R., Dagun, L., Kohr, D., Maydan, D., McDonald, J., Menon, R.: Parallel Programming in OpenMP. Morgan Kaufmann Publishers, San Francisco (2000)"},{"issue":"170","key":"2_CR3","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1090\/S0025-5718-1985-0777278-8","volume":"44","author":"U. Fincke","year":"1985","unstructured":"Fincke, U., Pohst, M.: Improved methods for calculating vectors of short length in a lattice, including a complexity analysis. Mathematics of Computation\u00a044(170), 463\u2013471 (1985)","journal-title":"Mathematics of Computation"},{"key":"2_CR4","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1002\/bltj.2015","volume":"1","author":"G.J. Foschini","year":"1996","unstructured":"Foschini, G.J.: Layered space-time architecture for wireless communication in a fading environment when using multi-element antennas. Bell Labs Technical Journal\u00a01, 41\u201359 (1996)","journal-title":"Bell Labs Technical Journal"},{"key":"2_CR5","volume-title":"Introduction to Parallel Computing","author":"A. Grama","year":"2003","unstructured":"Grama, A., Gupta, A., Karypis, G., Kumar, V.: Introduction to Parallel Computing. Addison-Wesley, Reading (2003)"},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"Hammarling, S., Dongarra, J., Du Croz, J., Hanson, R.J.: An extended set of fortran basic linear algebra subroutines. ACM Trans. Mat. Software (1988)","DOI":"10.1145\/50063.356256"},{"key":"2_CR7","doi-asserted-by":"publisher","first-page":"2806","DOI":"10.1109\/TSP.2005.850352","volume":"53","author":"B. Hassibi","year":"2005","unstructured":"Hassibi, B., Vikalo, H.: On sphere decoding algorithm. i. expected complexity. IEEE Transactions on Signal Processing\u00a053, 2806\u20132818 (2005)","journal-title":"IEEE Transactions on Signal Processing"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Kannan, R.: Improved algorithms for integer programming and related lattice problems. ACM Symp. Theory of Computing (1983)","DOI":"10.1145\/800061.808749"},{"key":"2_CR9","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/BF01581144","volume":"66","author":"C.P. Schnorr","year":"1994","unstructured":"Schnorr, C.P., Euchner, M.: Lattice basis reduction: Improved practical algorithms and solving subset sum problems. Math. Programming\u00a066, 181\u2013191 (1994)","journal-title":"Math. Programming"},{"key":"2_CR10","volume-title":"MPI: The Complete Reference","author":"M. Snir","year":"1996","unstructured":"Snir, M., Otto, S., Huss-Lederman, S., Walker, D., Dongarra, J.: MPI: The Complete Reference. MIT Press, Cambridge (1996)"},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"Telater, I.E.: Capacity of multi-antenna gaussian channels. Europ. Trans. Telecommun., 585\u2013595 (1999)","DOI":"10.1002\/ett.4460100604"}],"container-title":["Lecture Notes in Computer Science","High Performance Computing for Computational Science - VECPAR 2008"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-92859-1_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T04:12:08Z","timestamp":1557979928000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-92859-1_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540928584","9783540928591"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-92859-1_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}