{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T07:20:28Z","timestamp":1730272828315,"version":"3.28.0"},"reference-count":15,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,7]]},"DOI":"10.1109\/iscc.2017.8024698","type":"proceedings-article","created":{"date-parts":[[2017,9,4]],"date-time":"2017-09-04T16:26:54Z","timestamp":1504542414000},"page":"1263-1270","source":"Crossref","is-referenced-by-count":3,"title":["Non-recursive computation of the probability of more than two people having the same birthday"],"prefix":"10.1109","author":[{"given":"Michael","family":"Kounavis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sergej","family":"Deutsch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Durham","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Saeedeh","family":"Komijani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1214\/EJP.v5-58"},{"key":"ref11","first-page":"288","article-title":"A Generalized Birthday Problem","volume":"2442","author":"wagner","year":"2002","journal-title":"Advances in Cryptology"},{"journal-title":"Handbook of Applied Cryptography","year":"1996","author":"menezes","key":"ref12"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/168588.168596"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1137\/0217022"},{"key":"ref15","first-page":"29","article-title":"Birthday Paradox for Multi-collisions","author":"suzuki","year":"2006","journal-title":"International Conference on Information Security and Cryptology"},{"key":"ref4","first-page":"377","volume":"130","author":"dasgupta","year":"2004","journal-title":"The matching birthday and the strong birthday problem a contemporary review Journal of Statistical Planning and Inference"},{"key":"ref3","first-page":"279","volume":"3","author":"klamkin","year":"1967","journal-title":"Extensions on the Birthday Surprise"},{"journal-title":"WolframAlpha Birthday Problem Calculator","year":"0","key":"ref6"},{"journal-title":"Wolfram Mathworld Birthday Problem","year":"0","key":"ref5"},{"key":"ref8","first-page":"820","volume":"64","author":"diaconis","year":"2002","journal-title":"A Bayesian Peek into Feller Volume I Sankhýa The Indian Journal of Statistics"},{"journal-title":"Keisan Online Calculator","year":"0","key":"ref7"},{"key":"ref2","first-page":"45","author":"rouse ball","year":"1960","journal-title":"Other Questions on Probability Mathematical Recreations and Essays"},{"journal-title":"Birthday Problem","year":"0","key":"ref1"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.2307\/2317022"}],"event":{"name":"2017 IEEE Symposium on Computers and Communications (ISCC)","start":{"date-parts":[[2017,7,3]]},"location":"Heraklion, Greece","end":{"date-parts":[[2017,7,6]]}},"container-title":["2017 IEEE Symposium on Computers and Communications (ISCC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8016448\/8024490\/08024698.pdf?arnumber=8024698","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,10,2]],"date-time":"2017-10-02T23:33:05Z","timestamp":1506987185000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8024698\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,7]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/iscc.2017.8024698","relation":{},"subject":[],"published":{"date-parts":[[2017,7]]}}}