{"id":"https://openalex.org/W2296178001","doi":"https://doi.org/10.1017/s095679681500012x","title":"Evaluation of splittable pseudo-random generators","display_name":"Evaluation of splittable pseudo-random generators","publication_year":2015,"publication_date":"2015-01-01","ids":{"openalex":"https://openalex.org/W2296178001","doi":"https://doi.org/10.1017/s095679681500012x","mag":"2296178001"},"language":"en","primary_location":{"id":"doi:10.1017/s095679681500012x","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s095679681500012x","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/3EBAA9F14939C5BB5560E32D1A132637/S095679681500012Xa.pdf/div-class-title-evaluation-of-splittable-pseudo-random-generators-a-href-afn1-ref-type-fn-a-div.pdf","source":{"id":"https://openalex.org/S12266929","display_name":"Journal of Functional Programming","issn_l":"0956-7968","issn":["0956-7968","1469-7653"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Functional Programming","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/3EBAA9F14939C5BB5560E32D1A132637/S095679681500012Xa.pdf/div-class-title-evaluation-of-splittable-pseudo-random-generators-a-href-afn1-ref-type-fn-a-div.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5034898701","display_name":"Hans Georg Schaathun","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"HANS GEORG SCHAATHUN","raw_affiliation_strings":["Aalesund University College, Pb. 1517, N-6025 \u00c5lesund, Norway (e-mail:"],"affiliations":[{"raw_affiliation_string":"Aalesund University College, Pb. 1517, N-6025 \u00c5lesund, Norway (e-mail:","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5034898701"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.1841,"has_fulltext":true,"cited_by_count":8,"citation_normalized_percentile":{"value":0.61358078,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"25","issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11017","display_name":"Chaos-based Image/Signal Encryption","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T11017","display_name":"Chaos-based Image/Signal Encryption","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T11269","display_name":"Algorithms and Data Compression","score":0.9980999827384949,"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/T10951","display_name":"Cryptographic Implementations and Security","score":0.993399977684021,"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/computer-science","display_name":"Computer science","score":0.9074352979660034},{"id":"https://openalex.org/keywords/haskell","display_name":"Haskell","score":0.8885110020637512},{"id":"https://openalex.org/keywords/functional-programming","display_name":"Functional programming","score":0.6049797534942627},{"id":"https://openalex.org/keywords/pseudorandom-number-generator","display_name":"Pseudorandom number generator","score":0.5884790420532227},{"id":"https://openalex.org/keywords/parallelism","display_name":"Parallelism (grammar)","score":0.5712140202522278},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.5569705367088318},{"id":"https://openalex.org/keywords/random-number-generation","display_name":"Random number generation","score":0.4862293303012848},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.44108396768569946},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.2833315432071686},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.28211739659309387}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.9074352979660034},{"id":"https://openalex.org/C2780624054","wikidata":"https://www.wikidata.org/wiki/Q34010","display_name":"Haskell","level":3,"score":0.8885110020637512},{"id":"https://openalex.org/C42383842","wikidata":"https://www.wikidata.org/wiki/Q193076","display_name":"Functional programming","level":2,"score":0.6049797534942627},{"id":"https://openalex.org/C140642157","wikidata":"https://www.wikidata.org/wiki/Q1623338","display_name":"Pseudorandom number generator","level":2,"score":0.5884790420532227},{"id":"https://openalex.org/C2781172179","wikidata":"https://www.wikidata.org/wiki/Q853109","display_name":"Parallelism (grammar)","level":2,"score":0.5712140202522278},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.5569705367088318},{"id":"https://openalex.org/C201866948","wikidata":"https://www.wikidata.org/wiki/Q228206","display_name":"Random number generation","level":2,"score":0.4862293303012848},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.44108396768569946},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.2833315432071686},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.28211739659309387}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1017/s095679681500012x","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s095679681500012x","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/3EBAA9F14939C5BB5560E32D1A132637/S095679681500012Xa.pdf/div-class-title-evaluation-of-splittable-pseudo-random-generators-a-href-afn1-ref-type-fn-a-div.pdf","source":{"id":"https://openalex.org/S12266929","display_name":"Journal of Functional Programming","issn_l":"0956-7968","issn":["0956-7968","1469-7653"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Functional Programming","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1017/s095679681500012x","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s095679681500012x","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/3EBAA9F14939C5BB5560E32D1A132637/S095679681500012Xa.pdf/div-class-title-evaluation-of-splittable-pseudo-random-generators-a-href-afn1-ref-type-fn-a-div.pdf","source":{"id":"https://openalex.org/S12266929","display_name":"Journal of Functional Programming","issn_l":"0956-7968","issn":["0956-7968","1469-7653"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Functional Programming","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2296178001.pdf","grobid_xml":"https://content.openalex.org/works/W2296178001.grobid-xml"},"referenced_works_count":35,"referenced_works":["https://openalex.org/W114132189","https://openalex.org/W347624992","https://openalex.org/W1572027090","https://openalex.org/W1660562555","https://openalex.org/W1755575651","https://openalex.org/W1963898916","https://openalex.org/W1973725688","https://openalex.org/W1975462169","https://openalex.org/W1981336853","https://openalex.org/W1981663184","https://openalex.org/W1990752200","https://openalex.org/W2002453454","https://openalex.org/W2004742432","https://openalex.org/W2008776533","https://openalex.org/W2011398297","https://openalex.org/W2011565494","https://openalex.org/W2011998344","https://openalex.org/W2026281894","https://openalex.org/W2064655759","https://openalex.org/W2075075402","https://openalex.org/W2081709237","https://openalex.org/W2082752515","https://openalex.org/W2086804734","https://openalex.org/W2088607339","https://openalex.org/W2102329178","https://openalex.org/W2126085027","https://openalex.org/W2138018877","https://openalex.org/W2142857718","https://openalex.org/W2143511725","https://openalex.org/W2148049665","https://openalex.org/W2163035440","https://openalex.org/W2481777865","https://openalex.org/W3021014091","https://openalex.org/W4237829275","https://openalex.org/W4241596759"],"related_works":["https://openalex.org/W2112263414","https://openalex.org/W1602185604","https://openalex.org/W3004782279","https://openalex.org/W2028779182","https://openalex.org/W4242678340","https://openalex.org/W2140654465","https://openalex.org/W2129253059","https://openalex.org/W4296274916","https://openalex.org/W1504459189","https://openalex.org/W1755575651"],"abstract_inverted_index":{"Abstract":[0],"Pseudo-random":[1],"number":[2],"generation":[3],"is":[4,19,33],"a":[5],"fundamental":[6],"problem":[7,18],"in":[8,82,93],"computer":[9],"programming.":[10,65],"In":[11,66],"the":[12,17,45,91],"case":[13],"of":[14,47,75,86],"sequential":[15],"processing":[16,25],"very":[20],"well":[21],"researched,":[22],"but":[23],"parallel":[24],"raises":[26],"new":[27],"problems":[28],"whereof":[29],"far":[30],"too":[31],"little":[32],"currently":[34],"understood.":[35],"Splittable":[36],"pseudo-random":[37],"generators":[38],"(S-PRNG)":[39],"have":[40],"been":[41],"proposed":[42],"to":[43,51,58],"meet":[44],"challenges":[46],"parallelism.":[48],"While":[49],"applicable":[50],"any":[52],"programming":[53],"paradigm,":[54],"they":[55],"are":[56],"designed":[57],"be":[59],"particularly":[60],"suitable":[61],"for":[62],"pure":[63],"functional":[64],"this":[67],"paper,":[68],"we":[69,79],"review":[70],"and":[71,78,98],"evaluate":[72],"known":[73],"constructions":[74],"such":[76],"generators,":[77,87],"identify":[80],"flaws":[81],"several":[83],"large":[84],"classes":[85],"including":[88],"Lehmer":[89],"trees,":[90],"implementation":[92],"Haskell's":[94],"standard":[95],"library,":[96],"leapfrog,":[97],"subsequencing":[99],"(substreaming).":[100]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}