{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,19]],"date-time":"2026-01-19T00:15:37Z","timestamp":1768781737647,"version":"3.49.0"},"reference-count":14,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1109\/icpp.2003.1240626","type":"proceedings-article","created":{"date-parts":[[2004,6,22]],"date-time":"2004-06-22T16:27:43Z","timestamp":1087921663000},"page":"581-588","source":"Crossref","is-referenced-by-count":3,"title":["A parallel algorithm for enumerating combinations"],"prefix":"10.1109","author":[{"given":"M.","family":"Torres","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Goldman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"Barrera","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","author":"nijenhuis","year":"1978","journal-title":"Combinatorial Algorithms for Computers and Calculators"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1006\/eujc.1996.0043"},{"key":"ref12","author":"snir","year":"1996","journal-title":"MPI The Complete Reference"},{"key":"ref13","doi-asserted-by":"crossref","DOI":"10.1145\/366349.366432","article-title":"Combinatorial of m thins taken n at a time (algorithm 160)","volume":"6","author":"wolfson","year":"1963","journal-title":"Communications of the ACM"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.1996.539062"},{"key":"ref4","author":"grandlund","year":"0","journal-title":"GNU MP"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1137\/0117039"},{"key":"ref6","first-page":"1229","article-title":"Identification of combination gene sets of glioma classifications","volume":"1","author":"kim","year":"2002","journal-title":"Mol Cancer Therapeutics"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(74)80026-7"},{"key":"ref8","first-page":"216","article-title":"Algorithms for unranking combinations and their applications","author":"kokosinski","year":"1995","journal-title":"International Conference Parallel and Distributed Computing and Systems"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/360767.360811"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(89)90192-0"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/30.5.433"},{"key":"ref9","article-title":"Combination in lexicographic order (algorithm 154)","author":"misfud","year":"1963","journal-title":"Communications of the ACM 6 103"}],"event":{"name":"2003 International Conference on Parallel Processing, 2003. Proceedings.","location":"Kaohsiung, Taiwan","start":{"date-parts":[[2003,10,9]]},"end":{"date-parts":[[2003,10,9]]}},"container-title":["2003 International Conference on Parallel Processing, 2003. Proceedings."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8782\/27813\/01240626.pdf?arnumber=1240626","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,16]],"date-time":"2017-06-16T04:16:29Z","timestamp":1497586589000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1240626\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/icpp.2003.1240626","relation":{},"subject":[],"published":{"date-parts":[[2003]]}}}