{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T19:40:45Z","timestamp":1725997245041},"publisher-location":"Cham","reference-count":35,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030027377"},{"type":"electronic","value":"9783030027384"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-02738-4_2","type":"book-chapter","created":{"date-parts":[[2018,10,16]],"date-time":"2018-10-16T08:53:34Z","timestamp":1539680014000},"page":"16-26","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Towards the Succinct Representation of m Out of n"],"prefix":"10.1007","author":[{"given":"Victor","family":"Parque","sequence":"first","affiliation":[]},{"given":"Tomoyuki","family":"Miyashita","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,10,17]]},"reference":[{"issue":"3","key":"2_CR1","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1109\/TR.2007.903229","volume":"56","author":"AF Myers","year":"2007","unstructured":"Myers, A.F.: k-out-of-n: G system reliability with imperfect fault coverage. IEEE Trans. Reliab. 56(3), 464\u2013473 (2007)","journal-title":"IEEE Trans. Reliab."},{"key":"2_CR2","first-page":"2437","volume":"12","author":"Y Tamada","year":"2011","unstructured":"Tamada, Y., Imoto, S., Miyano, S.: Parallel algorithm for learning optimal bayesian network structure. J. Mach. Learn. Res. 12, 2437\u20132459 (2011)","journal-title":"J. Mach. Learn. Res."},{"key":"2_CR3","doi-asserted-by":"publisher","first-page":"910","DOI":"10.1007\/s10910-010-9789-9","volume":"49","author":"T Imada","year":"2010","unstructured":"Imada, T., Ota, S., Nagamochi, H., Akutsu, T.: Enumerating stereoisomers of tree structured molecules using dynamic programming. J. Math. Chem. 49, 910\u2013970 (2010)","journal-title":"J. Math. Chem."},{"key":"2_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/3-540-36504-4_4","volume-title":"Financial Cryptography","author":"K Suzuki","year":"2003","unstructured":"Suzuki, K., Yokoo, M.: Secure combinatorial auctions by dynamic programming with polynomial secret sharing. In: Blaze, M. (ed.) FC 2002. LNCS, vol. 2357, pp. 44\u201356. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36504-4_4"},{"key":"2_CR5","unstructured":"Agrawal, R., Mannila, H., Srikant, R., Toivonen, H., Verkamo, A.I.: Fast discovery of association rules. In: Advances in Knowledge Discovery and Data Mining, pp. 307\u2013328 (1996)"},{"key":"2_CR6","doi-asserted-by":"publisher","first-page":"325","DOI":"10.15807\/jorsj.50.325","volume":"50","author":"L Khachiyan","year":"2007","unstructured":"Khachiyan, L., Boros, E., Borys, K., Elbassioni, K., Gurvich, V., Makino, K.: Enumerating spanning and connected subsets in graphs and matroids. J. Oper. Res. Soc. Jpn. 50, 325\u2013338 (2007)","journal-title":"J. Oper. Res. Soc. Jpn."},{"issue":"1","key":"2_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11998-007-9000-9","volume":"4","author":"BJ Chisholm","year":"2007","unstructured":"Chisholm, B.J., Webster, D.C.: The development of coatings using combinatorial\/high throughput methods: a review of the current status. J. Coat. Technol. Res. 4(1), 1\u201312 (2007)","journal-title":"J. Coat. Technol. Res."},{"issue":"88","key":"2_CR8","doi-asserted-by":"publisher","first-page":"20130520","DOI":"10.1098\/rsif.2013.0520","volume":"10","author":"T. C. Scott-Phillips","year":"2013","unstructured":"Scott-Phillips, T.C., Blythe, R.A.: Why is combinatorial communication rare in the natural world, and why is language an exception to this trend? J. R. Soc. Interface 10(88) (2013)","journal-title":"Journal of The Royal Society Interface"},{"key":"2_CR9","volume-title":"Generating All Combinations and Partitions: The Art of Computer Programming, Fascicle 3","author":"DE Knuth","year":"1968","unstructured":"Knuth, D.E.: Generating All Combinations and Partitions: The Art of Computer Programming, Fascicle 3. Addison Wesley, Reading (1968)"},{"issue":"3","key":"2_CR10","first-page":"103","volume":"6","author":"CJ Mifsud","year":"1963","unstructured":"Mifsud, C.J.: Algorithm 154: combination in lexicographical order. Commun. ACM 6(3), 103 (1963)","journal-title":"Commun. ACM"},{"issue":"6","key":"2_CR11","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1145\/362384.362502","volume":"13","author":"PJ Chase","year":"1970","unstructured":"Chase, P.J.: Algorithm 382: combinations of m out of n objects. Commun. ACM 13(6), 368 (1970)","journal-title":"Commun. ACM"},{"issue":"1","key":"2_CR12","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1145\/355934.355937","volume":"7","author":"SG Akl","year":"1981","unstructured":"Akl, S.G.: A comparison of combination generation methods. ACM Trans. Mathe. Softw. 7(1), 42\u201345 (1981)","journal-title":"ACM Trans. Mathe. Softw."},{"key":"2_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1007\/978-3-540-24838-5_25","volume-title":"Experimental and Efficient Algorithms","author":"C Mart\u00ednez","year":"2004","unstructured":"Mart\u00ednez, C., Molinero, X.: An experimental study of unranking algorithms. In: Ribeiro, C.C., Martins, S.L. (eds.) WEA 2004. LNCS, vol. 3059, pp. 326\u2013340. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24838-5_25"},{"key":"2_CR14","doi-asserted-by":"publisher","first-page":"5305","DOI":"10.1016\/j.disc.2007.11.048","volume":"309","author":"F Ruskey","year":"2009","unstructured":"Ruskey, F., Williams, A.: The coolest way to generate combinations. Discret. Math. 309, 5305\u20135320 (2009)","journal-title":"Discret. Math."},{"issue":"4","key":"2_CR15","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1093\/comjnl\/44.4.292","volume":"44","author":"L Xiang","year":"2001","unstructured":"Xiang, L., Ushijima, K.: On o(1) time algorithms for combinatorial generation. Comput. J. 44(4), 292\u2013302 (2001)","journal-title":"Comput. J."},{"key":"2_CR16","volume-title":"Combinatorial Algorithms for Computers and Calculators","author":"A Nihenjuis","year":"1978","unstructured":"Nihenjuis, A., Wilf, H.S.: Combinatorial Algorithms for Computers and Calculators. Academic Press, New York (1978)"},{"issue":"6","key":"2_CR17","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1145\/367766.368162","volume":"5","author":"J Kurtzberg","year":"1962","unstructured":"Kurtzberg, J.: Algorithm 94: combination. Commun. ACM 5(6), 344 (1962)","journal-title":"Commun. ACM"},{"issue":"1","key":"2_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(94)90226-7","volume":"132","author":"P Flajolet","year":"1994","unstructured":"Flajolet, P., Zimmerman, P., Van Cutsem, B.: A calculus for the random generation of combinatorial structures. Theor. Comput. Sci. 132(1), 1\u201335 (1994)","journal-title":"Theor. Comput. Sci."},{"key":"2_CR19","volume-title":"The Art of Computing Programming: Volume 2 Seminumerical Algorithms","author":"DE Knuth","year":"1968","unstructured":"Knuth, D.E.: The Art of Computing Programming: Volume 2 Seminumerical Algorithms. Addison Wesley, Reading (1968)"},{"issue":"2","key":"2_CR20","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1145\/355732.355739","volume":"3","author":"BP Buckles","year":"1977","unstructured":"Buckles, B.P., Lybanon, M.: Algorithm 515: generation of a vector from the lexicographical index. ACM Trans. Math. Softw. 3(2), 180\u2013182 (1977)","journal-title":"ACM Trans. Math. Softw."},{"issue":"2","key":"2_CR21","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1145\/1236463.1236470","volume":"33","author":"DF Crouse","year":"2007","unstructured":"Crouse, D.F.: Remark on algorithm 515: generation of a vector from the lexicographical index combinations. ACM Trans. Math. Softw. 33(2), 15 (2007)","journal-title":"ACM Trans. Math. Softw."},{"key":"2_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/978-3-642-19475-7_21","volume-title":"Reconfigurable Computing: Architectures, Tools and Applications","author":"JT Butler","year":"2011","unstructured":"Butler, J.T., Sasao, T.: Index to constant weight codeword converter. In: Koch, A., Krishnamurthy, R., McAllister, J., Woods, R., El-Ghazawi, T. (eds.) ARC 2011. LNCS, vol. 6578, pp. 193\u2013205. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-19475-7_21"},{"key":"2_CR23","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1080\/00207168508803468","volume":"17","author":"MC Er","year":"1985","unstructured":"Er, M.C.: Lexicographic ordering, ranking and unranking of combinations. Int. J. Comput. Mathe. 17, 277\u2013283 (1985)","journal-title":"Int. J. Comput. Mathe."},{"key":"2_CR24","unstructured":"Tang, C., Du, M., Lee, R.: Unranking combinations in parallel. In: Proceedings of International Computer Symposium, pp. 1006\u20131010 (1984)"},{"key":"2_CR25","volume-title":"Design and Analysis of Parallel Algorithms","author":"S Akl","year":"1989","unstructured":"Akl, S.: Design and Analysis of Parallel Algorithms. Prentice Hall, Upper Saddle River (1989)"},{"key":"2_CR26","unstructured":"Kokosinski\u0144ski, Z.: Unranking combinations in parallel. In: Second International Conference Parallel and Distributed Processing Techniques and Applications, pp. 79\u201382 (1996)"},{"key":"2_CR27","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1006\/jpdc.1993.1030","volume":"17","author":"A Kapralski","year":"1993","unstructured":"Kapralski, A.: New methods for generation permutations, combinations and other combinatorial objects in parallel. J. Parallel Distrib. Comput. 17, 315\u2013326 (1993)","journal-title":"J. Parallel Distrib. Comput."},{"key":"2_CR28","unstructured":"Kokosinski\u0144ski, Z.: Algorithms for unranking combinations and other related choice functions. Report 95-1-006, The University of Aizu (1995)"},{"key":"2_CR29","volume-title":"Combinatorial Algorithms: Generation Enumeration and Search","author":"D Kreher","year":"1998","unstructured":"Kreher, D., Stinson, D.: Combinatorial Algorithms: Generation Enumeration and Search. CRC Press, Boca Raton (1998)"},{"key":"2_CR30","doi-asserted-by":"publisher","DOI":"10.1002\/9780470175668","volume-title":"Handbook of Applied Algorithms: Solving Scientific, Engineering and Practical Problems","author":"A Nayak","year":"2008","unstructured":"Nayak, A., Stojmenovic, I.: Handbook of Applied Algorithms: Solving Scientific, Engineering and Practical Problems. Wiley-Blackwell, Hoboken (2008)"},{"key":"2_CR31","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. 39, 605\u2013629 (1997)","journal-title":"SIAM Rev."},{"issue":"2","key":"2_CR32","first-page":"176","volume":"C\u201322","author":"CN Liu","year":"1973","unstructured":"Liu, C.N., Tang, D.T.: Distance-2 cyclic chaining of constant-weight codes. IEEE Trans. Comput. C\u201322(2), 176\u2013180 (1973)","journal-title":"IEEE Trans. Comput."},{"issue":"5","key":"2_CR33","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1016\/j.jda.2014.07.004","volume":"29","author":"T Shimizu","year":"2014","unstructured":"Shimizu, T., Fukunaga, T., Nagamochi, H.: Unranking of small combinations from large sets. J. Discret. Algorithms 29(5), 8\u201320 (2014)","journal-title":"J. Discret. Algorithms"},{"key":"2_CR34","doi-asserted-by":"crossref","unstructured":"Woodward, J.R., Bai, R.: Canonical representation genetic programming. In: Proceedings of the First ACM\/SIGEVO Summit on Genetic and Evolutionary Computation. GEC 2009, New York, NY, USA, pp. 585\u2013592. ACM (2009)","DOI":"10.1145\/1543834.1543914"},{"key":"2_CR35","unstructured":"Harris, M.: Optimizing parallel reduction in CUDA. NVIDIA Developer Technology. Accessed 20 June 20 2018"}],"container-title":["Lecture Notes in Computer Science","Internet and Distributed Computing Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-02738-4_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,26]],"date-time":"2019-10-26T20:09:17Z","timestamp":1572120557000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-02738-4_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030027377","9783030027384"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-02738-4_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"IDCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Internet and Distributed Computing Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tokyo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 October 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 October 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"idcs2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.idcs2018.net\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}