{"id":"https://openalex.org/W2021790219","doi":"https://doi.org/10.1017/s0956796899003287","title":"Parallelization of divide-and-conquer by translation to nested loops","display_name":"Parallelization of divide-and-conquer by translation to nested loops","publication_year":1999,"publication_date":"1999-05-01","ids":{"openalex":"https://openalex.org/W2021790219","doi":"https://doi.org/10.1017/s0956796899003287","mag":"2021790219"},"language":"en","primary_location":{"id":"doi:10.1017/s0956796899003287","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0956796899003287","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/1FCD1927A7690BC9E370C847BF3E804C/S0956796899003287a.pdf/div-class-title-parallelization-of-divide-and-conquer-by-translation-to-nested-loops-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":null,"license_id":null,"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":"bronze","oa_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/1FCD1927A7690BC9E370C847BF3E804C/S0956796899003287a.pdf/div-class-title-parallelization-of-divide-and-conquer-by-translation-to-nested-loops-div.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5048548441","display_name":"Christoph Herrmann","orcid":"https://orcid.org/0000-0002-5621-1822"},"institutions":[{"id":"https://openalex.org/I186354981","display_name":"University of Passau","ror":"https://ror.org/05ydjnb78","country_code":"DE","type":"education","lineage":["https://openalex.org/I186354981"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"CHRISTOPH A. HERRMANN","raw_affiliation_strings":["Fakult\u00e4t f\u00fcr Mathematik und Informatik, Universit\u00e4t Passau, Germany (e-mail:","Fakult\u00e4t f\u00fcr Mathematik und Informatik, Universit\u00e4t Passau, Germany (e-mail: herrmann@fmi.uni-passau.de lengauer@fmi.uni-passau.de)#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Fakult\u00e4t f\u00fcr Mathematik und Informatik, Universit\u00e4t Passau, Germany (e-mail:","institution_ids":["https://openalex.org/I186354981"]},{"raw_affiliation_string":"Fakult\u00e4t f\u00fcr Mathematik und Informatik, Universit\u00e4t Passau, Germany (e-mail: herrmann@fmi.uni-passau.de lengauer@fmi.uni-passau.de)#TAB#","institution_ids":["https://openalex.org/I186354981"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5001151726","display_name":"Christian Lengauer","orcid":"https://orcid.org/0000-0002-2717-3417"},"institutions":[{"id":"https://openalex.org/I186354981","display_name":"University of Passau","ror":"https://ror.org/05ydjnb78","country_code":"DE","type":"education","lineage":["https://openalex.org/I186354981"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"CHRISTIAN LENGAUER","raw_affiliation_strings":["Fakult\u00e4t f\u00fcr Mathematik und Informatik, Universit\u00e4t Passau, Germany (e-mail:","Fakult\u00e4t f\u00fcr Mathematik und Informatik, Universit\u00e4t Passau, Germany (e-mail: herrmann@fmi.uni-passau.de lengauer@fmi.uni-passau.de)#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Fakult\u00e4t f\u00fcr Mathematik und Informatik, Universit\u00e4t Passau, Germany (e-mail:","institution_ids":["https://openalex.org/I186354981"]},{"raw_affiliation_string":"Fakult\u00e4t f\u00fcr Mathematik und Informatik, Universit\u00e4t Passau, Germany (e-mail: herrmann@fmi.uni-passau.de lengauer@fmi.uni-passau.de)#TAB#","institution_ids":["https://openalex.org/I186354981"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I186354981"],"apc_list":null,"apc_paid":null,"fwci":4.8622,"has_fulltext":true,"cited_by_count":16,"citation_normalized_percentile":{"value":0.94997644,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":null,"biblio":{"volume":"9","issue":"3","first_page":"279","last_page":"310"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9955000281333923,"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.9955000281333923,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9944999814033508,"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/T10948","display_name":"Advanced Combinatorial Mathematics","score":0.9878000020980835,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/divide-and-conquer-algorithms","display_name":"Divide and conquer algorithms","score":0.9063982367515564},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8675908446311951},{"id":"https://openalex.org/keywords/strassen-algorithm","display_name":"Strassen algorithm","score":0.8190145492553711},{"id":"https://openalex.org/keywords/haskell","display_name":"Haskell","score":0.6091965436935425},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.5996799468994141},{"id":"https://openalex.org/keywords/recursion","display_name":"Recursion (computer science)","score":0.5200535655021667},{"id":"https://openalex.org/keywords/division","display_name":"Division (mathematics)","score":0.5044268369674683},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4930677115917206},{"id":"https://openalex.org/keywords/nested-loop-join","display_name":"Nested loop join","score":0.45963460206985474},{"id":"https://openalex.org/keywords/matrix-multiplication","display_name":"Matrix multiplication","score":0.45393311977386475},{"id":"https://openalex.org/keywords/compiler","display_name":"Compiler","score":0.43920445442199707},{"id":"https://openalex.org/keywords/functional-programming","display_name":"Functional programming","score":0.4020160734653473},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.3737807273864746},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3457614779472351},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.15664803981781006},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.14195126295089722}],"concepts":[{"id":"https://openalex.org/C71559656","wikidata":"https://www.wikidata.org/wiki/Q671298","display_name":"Divide and conquer algorithms","level":2,"score":0.9063982367515564},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8675908446311951},{"id":"https://openalex.org/C39096654","wikidata":"https://www.wikidata.org/wiki/Q728507","display_name":"Strassen algorithm","level":4,"score":0.8190145492553711},{"id":"https://openalex.org/C2780624054","wikidata":"https://www.wikidata.org/wiki/Q34010","display_name":"Haskell","level":3,"score":0.6091965436935425},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.5996799468994141},{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.5200535655021667},{"id":"https://openalex.org/C60798267","wikidata":"https://www.wikidata.org/wiki/Q1226939","display_name":"Division (mathematics)","level":2,"score":0.5044268369674683},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4930677115917206},{"id":"https://openalex.org/C1306188","wikidata":"https://www.wikidata.org/wiki/Q4060687","display_name":"Nested loop join","level":2,"score":0.45963460206985474},{"id":"https://openalex.org/C17349429","wikidata":"https://www.wikidata.org/wiki/Q1049914","display_name":"Matrix multiplication","level":3,"score":0.45393311977386475},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.43920445442199707},{"id":"https://openalex.org/C42383842","wikidata":"https://www.wikidata.org/wiki/Q193076","display_name":"Functional programming","level":2,"score":0.4020160734653473},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.3737807273864746},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3457614779472351},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.15664803981781006},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.14195126295089722},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1017/s0956796899003287","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0956796899003287","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/1FCD1927A7690BC9E370C847BF3E804C/S0956796899003287a.pdf/div-class-title-parallelization-of-divide-and-conquer-by-translation-to-nested-loops-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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Functional Programming","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.29.6364","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.29.6364","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://ftp.uni-passau.de/pub/local/parallel/papers/MIP9705.ps.gz","raw_type":"text"},{"id":"pmh:oai:aleph.bib-bvb.de:BVB01-007628262","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"doi:10.1017/s0956796899003287","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0956796899003287","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/1FCD1927A7690BC9E370C847BF3E804C/S0956796899003287a.pdf/div-class-title-parallelization-of-divide-and-conquer-by-translation-to-nested-loops-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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Functional Programming","raw_type":"journal-article"},"sustainable_development_goals":[{"display_name":"Reduced inequalities","score":0.4300000071525574,"id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320320875","display_name":"Deutscher Akademischer Austauschdienst","ror":"https://ror.org/039djdh30"},{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2021790219.pdf","grobid_xml":"https://content.openalex.org/works/W2021790219.grobid-xml"},"referenced_works_count":36,"referenced_works":["https://openalex.org/W114614391","https://openalex.org/W177749522","https://openalex.org/W1483567557","https://openalex.org/W1489689515","https://openalex.org/W1515448847","https://openalex.org/W1554451661","https://openalex.org/W1559314111","https://openalex.org/W1607380961","https://openalex.org/W1655990431","https://openalex.org/W1776654319","https://openalex.org/W1853328183","https://openalex.org/W1883860172","https://openalex.org/W1967321130","https://openalex.org/W1967952826","https://openalex.org/W2003017309","https://openalex.org/W2009603783","https://openalex.org/W2021790219","https://openalex.org/W2035476608","https://openalex.org/W2045202108","https://openalex.org/W2051228988","https://openalex.org/W2055893308","https://openalex.org/W2062950667","https://openalex.org/W2069911640","https://openalex.org/W2075222258","https://openalex.org/W2087977509","https://openalex.org/W2094174039","https://openalex.org/W2097755092","https://openalex.org/W2112708371","https://openalex.org/W2118549063","https://openalex.org/W2124154640","https://openalex.org/W2156568841","https://openalex.org/W2752061190","https://openalex.org/W2752853835","https://openalex.org/W4210880890","https://openalex.org/W4232206602","https://openalex.org/W6601144588"],"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":{"We":[0,72],"present":[1],"a":[2,16,31,38,42],"hierarchical":[3],"classification":[4],"of":[5,7,18,45,54,76,83],"specializations":[6,36],"the":[8,46,74,77],"divide-and-conquer":[9,19],"paradigm.":[10],"The":[11,35,52],"aim":[12],"is":[13,58,85],"to":[14],"identify":[15],"subclass":[17],"algorithms":[20],"with":[21],"an":[22],"efficient":[23],"parallel":[24],"implementation":[25],"which":[26,84],"can":[27],"be":[28],"viewed":[29],"as":[30],"static":[32],"space-time":[33],"mapping.":[34],"impose":[37],"balanced":[39],"call":[40],"tree,":[41],"fixed":[43],"degree":[44],"problem":[47],"division,":[48],"and":[49,66],"elementwise":[50],"operations.":[51],"correctness":[53],"our":[55],"compile-time":[56],"transformations":[57],"proved":[59],"by":[60,70,79],"equational":[61],"reasoning":[62],"in":[63],"Haskell;":[64],"recursion":[65],"iteration":[67],"are":[68],"handled":[69],"induction.":[71],"demonstrate":[73],"practicality":[75],"skeleton":[78],"some":[80],"examples,":[81],"one":[82],"Strassen's":[86],"matrix":[87],"multiplication.":[88]},"counts_by_year":[],"updated_date":"2026-08-04T08:18:43.703281","created_date":"2025-10-10T00:00:00"}