{"id":"https://openalex.org/W2009971409","doi":"https://doi.org/10.1137/0217024","title":"Efficient Parallel Pseudorandom Number Generation","display_name":"Efficient Parallel Pseudorandom Number Generation","publication_year":1988,"publication_date":"1988-04-01","ids":{"openalex":"https://openalex.org/W2009971409","doi":"https://doi.org/10.1137/0217024","mag":"2009971409"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1137/0217024","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_indexed_in_scopus":true,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"journal-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/A5007364145","display_name":"John H. Reif","orcid":"https://orcid.org/0000-0002-9096-2056"},"institutions":[{"id":"https://openalex.org/I170897317","display_name":"Duke University","ror":"https://ror.org/00py81415","country_code":"US","type":"funder","lineage":["https://openalex.org/I170897317"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"J. H. Reif","raw_affiliation_strings":["Duke University Durham NC."],"affiliations":[{"raw_affiliation_string":"Duke University Durham NC.","institution_ids":["https://openalex.org/I170897317"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5113907559","display_name":"J. D. Tygar","orcid":null},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"funder","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"J. D. Tygar","raw_affiliation_strings":["Carnegie-Mellon University, Pittsburgh, PA."],"affiliations":[{"raw_affiliation_string":"Carnegie-Mellon University, Pittsburgh, PA.","institution_ids":["https://openalex.org/I74973139"]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.733,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":7,"citation_normalized_percentile":{"value":0.697286,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":75,"max":76},"biblio":{"volume":"17","issue":"2","first_page":"404","last_page":"411"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.9999,"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/T10237","display_name":"Cryptography and Data Security","score":0.9999,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9997,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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.9989,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized Algorithm","score":0.5257662}],"concepts":[{"id":"https://openalex.org/C140642157","wikidata":"https://www.wikidata.org/wiki/Q1623338","display_name":"Pseudorandom number generator","level":2,"score":0.85576606},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6640901},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6177838},{"id":"https://openalex.org/C92913381","wikidata":"https://www.wikidata.org/wiki/Q7255474","display_name":"Pseudorandom generator","level":3,"score":0.61296463},{"id":"https://openalex.org/C207467116","wikidata":"https://www.wikidata.org/wiki/Q4385666","display_name":"Inverse","level":2,"score":0.6085711},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.59989995},{"id":"https://openalex.org/C42747912","wikidata":"https://www.wikidata.org/wiki/Q1048447","display_name":"Multiplicative function","level":2,"score":0.5977441},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.54599404},{"id":"https://openalex.org/C2780992000","wikidata":"https://www.wikidata.org/wiki/Q17016113","display_name":"Generator (circuit theory)","level":3,"score":0.53487396},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.5257662},{"id":"https://openalex.org/C201866948","wikidata":"https://www.wikidata.org/wiki/Q228206","display_name":"Random number generation","level":2,"score":0.5200207},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4990418},{"id":"https://openalex.org/C19086982","wikidata":"https://www.wikidata.org/wiki/Q2115856","display_name":"Pseudorandomness","level":3,"score":0.47477385},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.44327328},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32264102},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.082734466},{"id":"https://openalex.org/C163258240","wikidata":"https://www.wikidata.org/wiki/Q25342","display_name":"Power (physics)","level":2,"score":0.07711664},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1137/0217024","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_indexed_in_scopus":true,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[],"grants":[],"datasets":[],"versions":[],"referenced_works_count":11,"referenced_works":["https://openalex.org/W1558316751","https://openalex.org/W2042587503","https://openalex.org/W2069919161","https://openalex.org/W2075488055","https://openalex.org/W2081256023","https://openalex.org/W2083368929","https://openalex.org/W2087115651","https://openalex.org/W2126466445","https://openalex.org/W2128531813","https://openalex.org/W2164284862","https://openalex.org/W3150645827"],"related_works":["https://openalex.org/W44435986","https://openalex.org/W4312279389","https://openalex.org/W4242117757","https://openalex.org/W4241950541","https://openalex.org/W3111658143","https://openalex.org/W2988803943","https://openalex.org/W2077146536","https://openalex.org/W2062045810","https://openalex.org/W2025294130","https://openalex.org/W1503711153"],"abstract_inverted_index":{"We":[0,58],"present":[1],"a":[2,10,80,158,167,173,203],"parallel":[3,76,169,181,204],"algorithm":[4,24,67,170,205],"for":[5,18,30,50,117,133,163,228],"pseudorandom":[6,28,62,119],"number":[7,82,120,159],"generation.":[8],"Given":[9,166],"seed":[11],"of":[12,83,154,160,176,256],"$n^\\varepsilon":[13,223],"$":[14,27,42,49,224,271,278],"truly":[15,72,138,225],"random":[16,73,139,226],"bits":[17,29,63,74,227],"any":[19,31,229],"$\\varepsilon":[20,45,230],">":[21,33,56,231,274],"0$,":[22],"our":[23,66,155],"generates":[25],"$n^c":[26],"$c":[32],"1$.":[34,57],"This":[35],"takes":[36],"poly-log":[37,77,261],"time":[38,78,188,207],"using":[39,79,222],"$n^{\\varepsilon":[40],"'}":[41,218],"processors":[43,84],"where":[44],"'":[46],"=":[47],"k\\varepsilon":[48],"some":[51],"fixed":[52,184],"small":[53],"constant":[54],"$k":[55],"show":[59,196,235],"that":[60,197,236],"the":[61,94,145,152,238,249,254],"output":[64,128],"by":[65,202,259],"cannot":[68,100],"be":[69,101,200],"distinguished":[70],"from":[71,114],"in":[75,103,148,246],"polynomial":[81],"with":[85,187,206,264],"probability":[86],"$\\frac{1}{2}":[87],"+":[88,210],"{1":[89],"/":[90],"{n^{O(1)}":[91],"}}$":[92],"if":[93,237],"Multiplicative":[95,239],"Inverse":[96,240],"Problem":[97,241],"almost":[98,243],"always":[99,244],"solved":[102],"${\\bf":[104,134,247,250],"RNC}$.":[105],"The":[106],"proof":[107],"is":[108,111,124,129,242,252],"interesting":[109],"and":[110,126,183,191,220,267],"quite":[112],"different":[113],"previous":[115],"proofs":[116],"sequential":[118],"generators.":[121],"Our":[122,141],"generator":[123,142,156],"fast":[125],"its":[127],"provably":[130],"as":[131,137,180],"effective":[132],"RNC}$":[135,251],"algorithms":[136],"bits.":[140],"passes":[143],"all":[144],"statistical":[146],"tests":[147],"Knuth":[149],"[14].":[150],"Moreover,":[151],"existence":[153],"has":[157],"central":[161],"consequences":[162],"complexity":[164],"theory.":[165],"randomized":[168],"$\\mathcal{A}$":[171,198],"(over":[172],"wide":[174],"class":[175,255],"machine":[177],"models":[178],"such":[179],"RAMs":[182],"connection":[185],"networks)":[186],"bound":[189,193,208,216],"$T(n)$":[190],"processor":[192,215],"$P(n)$,":[194],"we":[195,234],"can":[199],"simulated":[201],"$T(n)":[209],"O((\\log":[211],"n)(\\log":[212],"\\log":[213],"n))$,":[214],"$P(n)n^{\\varepsilon":[217],"$,":[219],"only":[221],"0$.":[232],"Also,":[233],"not":[245],"RNC}$,":[248],"within":[253],"languages":[257],"accepted":[258],"uniform":[260],"depth":[262],"circuits":[263],"unbounded":[265],"fan-in":[266],"strictly":[268],"subexponential":[269],"size":[270],"\\cap":[272],"_{\\varepsilon":[273],"0}":[275],"2^{n^\\varepsilon":[276],"}":[277],".":[279]},"abstract_inverted_index_v3":null,"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2009971409","counts_by_year":[{"year":2014,"cited_by_count":1}],"updated_date":"2025-03-22T03:46:06.092541","created_date":"2016-06-24"}