{"id":"https://openalex.org/W2752138724","doi":"https://doi.org/10.1109/iscc.2017.8024698","title":"Non-recursive computation of the probability of more than two people having the same birthday","display_name":"Non-recursive computation of the probability of more than two people having the same birthday","publication_year":2017,"publication_date":"2017-07-01","ids":{"openalex":"https://openalex.org/W2752138724","doi":"https://doi.org/10.1109/iscc.2017.8024698","mag":"2752138724"},"language":"en","primary_location":{"id":"doi:10.1109/iscc.2017.8024698","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iscc.2017.8024698","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE Symposium on Computers and Communications (ISCC)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5063555801","display_name":"Michael E. Kounavis","orcid":null},"institutions":[{"id":"https://openalex.org/I1343180700","display_name":"Intel (United States)","ror":"https://ror.org/01ek73717","country_code":"US","type":"company","lineage":["https://openalex.org/I1343180700"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Michael Kounavis","raw_affiliation_strings":["Intel Labs, Intel Corporation, Hillsboro, OR"],"affiliations":[{"raw_affiliation_string":"Intel Labs, Intel Corporation, Hillsboro, OR","institution_ids":["https://openalex.org/I1343180700"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5090151761","display_name":"Sergej Deutsch","orcid":null},"institutions":[{"id":"https://openalex.org/I1343180700","display_name":"Intel (United States)","ror":"https://ror.org/01ek73717","country_code":"US","type":"company","lineage":["https://openalex.org/I1343180700"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sergej Deutsch","raw_affiliation_strings":["Intel Labs, Intel Corporation, Hillsboro, OR"],"affiliations":[{"raw_affiliation_string":"Intel Labs, Intel Corporation, Hillsboro, OR","institution_ids":["https://openalex.org/I1343180700"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5042631292","display_name":"David Durham","orcid":null},"institutions":[{"id":"https://openalex.org/I1343180700","display_name":"Intel (United States)","ror":"https://ror.org/01ek73717","country_code":"US","type":"company","lineage":["https://openalex.org/I1343180700"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"David Durham","raw_affiliation_strings":["Intel Labs, Intel Corporation, Hillsboro, OR"],"affiliations":[{"raw_affiliation_string":"Intel Labs, Intel Corporation, Hillsboro, OR","institution_ids":["https://openalex.org/I1343180700"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5066294505","display_name":"Saeedeh Komijani","orcid":null},"institutions":[{"id":"https://openalex.org/I1343180700","display_name":"Intel (United States)","ror":"https://ror.org/01ek73717","country_code":"US","type":"company","lineage":["https://openalex.org/I1343180700"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Saeedeh Komijani","raw_affiliation_strings":["Intel Labs, Intel Corporation, Hillsboro, OR"],"affiliations":[{"raw_affiliation_string":"Intel Labs, Intel Corporation, Hillsboro, OR","institution_ids":["https://openalex.org/I1343180700"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5063555801"],"corresponding_institution_ids":["https://openalex.org/I1343180700"],"apc_list":null,"apc_paid":null,"fwci":0.39,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.70552279,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"2442","issue":null,"first_page":"1263","last_page":"1270"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9962000250816345,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9962000250816345,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9941999912261963,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11797","display_name":"graph theory and CDMA systems","score":0.991599977016449,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.7046849131584167},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6892324686050415},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.40491342544555664},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.353441059589386},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.26766324043273926}],"concepts":[{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.7046849131584167},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6892324686050415},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.40491342544555664},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.353441059589386},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.26766324043273926}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iscc.2017.8024698","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iscc.2017.8024698","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE Symposium on Computers and Communications (ISCC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1548701190","https://openalex.org/W1660562555","https://openalex.org/W1975462169","https://openalex.org/W1976289561","https://openalex.org/W2052267638","https://openalex.org/W2077300005","https://openalex.org/W2329445361","https://openalex.org/W3159346169","https://openalex.org/W4230574424","https://openalex.org/W4285719527","https://openalex.org/W6632760396","https://openalex.org/W6660612422"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2748952813","https://openalex.org/W2390279801","https://openalex.org/W2358668433","https://openalex.org/W4396701345","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W4396696052","https://openalex.org/W4402327032","https://openalex.org/W2477549100"],"abstract_inverted_index":{"We":[0,211],"address":[1],"a":[2,16,33,88,149,250],"well":[3,51],"known":[4,52,71],"problem":[5,10,45,105],"of":[6,11,19,32,36,92,102,106,111,140,161,179,187,200,215,225,229,231,254,265],"computer":[7],"science,":[8],"the":[9,13,25,30,59,75,84,100,103,108,119,127,136,154,174,177,185,213,219,236,255,263,266],"computing":[12,107,218],"probability":[14,156,221,268],"that":[15,168,176,202],"given":[17],"number":[18,110,178,186,242],"people":[20,112,117],"m":[21,47,66,116,162,201],">":[22,163],"1":[23],"have":[24],"same":[26,120],"birthday":[27,82,86,121,137,155,220,267],"from":[28],"among":[29],"members":[31],"larger":[34,183,206],"set":[35],"cardinality":[37],"n":[38],"\u2265":[39],"m.":[40],"The":[41],"solution":[42,64,101,246],"to":[43,57,99,113,158,193,198],"this":[44,145],"for":[46,65,153,222,262],"=":[48,67],"2":[49,208],"is":[50,54,69,181,191,247],"and":[53,72,83,95,132,196,270],"usually":[55],"referred":[56],"as":[58],"\u2018birthday":[60],"surprise":[61],"probability\u2019.":[62],"A":[63],"3":[68],"also":[70],"appears":[73],"in":[74,126],"2004":[76],"paper":[77,146],"by":[78,130],"DasGupta":[79],"[The":[80],"matching,":[81],"strong":[85],"problem:":[87],"contemporary":[89],"review,":[90],"Journal":[91,139],"Statistical":[93],"Planning":[94],"Inference].":[96],"Further":[97],"approximations":[98],"related":[104],"minimum":[109],"interview":[114],"until":[115],"with":[118],"are":[122,124,169],"found":[123],"presented":[125],"seminal":[128],"work":[129],"Klamkin":[131],"Newman":[133],"[Extensions":[134],"on":[135,249],"surprise,":[138],"Combinatorial":[141],"Theory,":[142],"1967].":[143],"In":[144],"we":[147],"present":[148],"new":[150],"non-recursive":[151],"approximation":[152],"applicable":[157,197],"any":[159],"value":[160],"1,":[164],"which":[165],"yields":[166],"results":[167],"experimentally":[170],"proven":[171],"accurate":[172],"under":[173],"assumption":[175],"birthdays":[180],"significantly":[182],"than":[184,207],"people.":[188],"Our":[189,245],"expression":[190],"easy":[192],"compute,":[194],"non-recursive,":[195],"values":[199,224,233],"can":[203],"be":[204],"arbitrarily":[205],"or":[209,274],"3.":[210],"verify":[212],"validity":[214],"our":[216],"result":[217],"different":[223],"m,":[226],"over":[227],"billions":[228],"sets":[230],"random":[232,241],"generated":[234],"using":[235],"Intel":[237],"\u00ae":[238],"RDRAND":[239],"hardware":[240],"generation":[243],"instruction.":[244],"based":[248],"novel":[251],"tree-based":[252],"description":[253],"event":[256],"space":[257],"which,":[258],"if":[259],"used,":[260],"allows":[261],"computation":[264],"efficiently":[269],"without":[271],"involving":[272],"recursions":[273],"multinomial":[275],"distributions.":[276]},"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}