{"id":"https://openalex.org/W3159367332","doi":"https://doi.org/10.1145/3517804.3524153","title":"Fast Parallel Hypertree Decompositions in Logarithmic Recursion Depth","display_name":"Fast Parallel Hypertree Decompositions in Logarithmic Recursion Depth","publication_year":2022,"publication_date":"2022-06-12","ids":{"openalex":"https://openalex.org/W3159367332","doi":"https://doi.org/10.1145/3517804.3524153","mag":"3159367332"},"language":"en","primary_location":{"id":"doi:10.1145/3517804.3524153","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3517804.3524153","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3517804.3524153","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 41st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3517804.3524153","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5050151740","display_name":"Georg Gottlob","orcid":"https://orcid.org/0000-0002-2353-5230"},"institutions":[{"id":"https://openalex.org/I40120149","display_name":"University of Oxford","ror":"https://ror.org/052gg0110","country_code":"GB","type":"education","lineage":["https://openalex.org/I40120149"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Georg Gottlob","raw_affiliation_strings":["University of Oxford, Oxford, United Kingdom"],"affiliations":[{"raw_affiliation_string":"University of Oxford, Oxford, United Kingdom","institution_ids":["https://openalex.org/I40120149"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5053864834","display_name":"Matthias Lanzinger","orcid":"https://orcid.org/0000-0002-7601-3727"},"institutions":[{"id":"https://openalex.org/I40120149","display_name":"University of Oxford","ror":"https://ror.org/052gg0110","country_code":"GB","type":"education","lineage":["https://openalex.org/I40120149"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Matthias Lanzinger","raw_affiliation_strings":["University of Oxford, Oxford, United Kingdom"],"affiliations":[{"raw_affiliation_string":"University of Oxford, Oxford, United Kingdom","institution_ids":["https://openalex.org/I40120149"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5003919374","display_name":"Cem Okulmus","orcid":"https://orcid.org/0000-0002-7742-0439"},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Cem Okulmus","raw_affiliation_strings":["TU Wien, Vienna, Austria"],"affiliations":[{"raw_affiliation_string":"TU Wien, Vienna, Austria","institution_ids":["https://openalex.org/I145847075"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5091683403","display_name":"Reinhard Pichler","orcid":"https://orcid.org/0000-0002-1760-122X"},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Reinhard Pichler","raw_affiliation_strings":["TU Wien, Vienna, Austria"],"affiliations":[{"raw_affiliation_string":"TU Wien, Vienna, Austria","institution_ids":["https://openalex.org/I145847075"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5050151740"],"corresponding_institution_ids":["https://openalex.org/I40120149"],"apc_list":null,"apc_paid":null,"fwci":0.4281,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.61239742,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"68","issue":null,"first_page":"325","last_page":"336"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.9939000010490417,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9937000274658203,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/hyperbolic-tree","display_name":"Hyperbolic tree","score":0.9535345435142517},{"id":"https://openalex.org/keywords/hypergraph","display_name":"Hypergraph","score":0.817750096321106},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7046881318092346},{"id":"https://openalex.org/keywords/recursion","display_name":"Recursion (computer science)","score":0.6801093220710754},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.6045469045639038},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5721877813339233},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.5707995891571045},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.523106575012207},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5206893682479858},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.4131298065185547},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3636338710784912},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33307093381881714},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2415507435798645},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.15403392910957336},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1528131067752838}],"concepts":[{"id":"https://openalex.org/C97654310","wikidata":"https://www.wikidata.org/wiki/Q574023","display_name":"Hyperbolic tree","level":4,"score":0.9535345435142517},{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.817750096321106},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7046881318092346},{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.6801093220710754},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.6045469045639038},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5721877813339233},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.5707995891571045},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.523106575012207},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5206893682479858},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.4131298065185547},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3636338710784912},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33307093381881714},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2415507435798645},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.15403392910957336},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1528131067752838},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C70984080","wikidata":"https://www.wikidata.org/wiki/Q2619102","display_name":"Hyperbolic manifold","level":3,"score":0.0},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0},{"id":"https://openalex.org/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","level":1,"score":0.0},{"id":"https://openalex.org/C92047909","wikidata":"https://www.wikidata.org/wiki/Q204034","display_name":"Hyperbolic function","level":2,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"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/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3517804.3524153","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3517804.3524153","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3517804.3524153","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 41st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems","raw_type":"proceedings-article"},{"id":"pmh:oai:ora.ox.ac.uk:uuid:c6159bd7-e066-45d4-be88-e63b4463de3d","is_oa":false,"landing_page_url":"https://ora.ox.ac.uk/objects/uuid:c6159bd7-e066-45d4-be88-e63b4463de3d","pdf_url":null,"source":{"id":"https://openalex.org/S4306402636","display_name":"Oxford University Research Archive (ORA) (University of Oxford)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I40120149","host_organization_name":"University of Oxford","host_organization_lineage":["https://openalex.org/I40120149"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Symplectic Elements","raw_type":"Conference item"}],"best_oa_location":{"id":"doi:10.1145/3517804.3524153","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3517804.3524153","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3517804.3524153","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 41st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3867201627","display_name":null,"funder_award_id":"P30930","funder_id":"https://openalex.org/F4320321181","funder_display_name":"Austrian Science Fund"},{"id":"https://openalex.org/G5783554875","display_name":null,"funder_award_id":"RP\\R1\\201074","funder_id":"https://openalex.org/F4320320006","funder_display_name":"Royal Society"},{"id":"https://openalex.org/G6565432183","display_name":null,"funder_award_id":"P\\R1\\201074","funder_id":"https://openalex.org/F4320320006","funder_display_name":"Royal Society"},{"id":"https://openalex.org/G6631213480","display_name":null,"funder_award_id":"P30930-N35","funder_id":"https://openalex.org/F4320321181","funder_display_name":"Austrian Science Fund"},{"id":"https://openalex.org/G8184292771","display_name":null,"funder_award_id":"Project","funder_id":"https://openalex.org/F4320321181","funder_display_name":"Austrian Science Fund"}],"funders":[{"id":"https://openalex.org/F4320320006","display_name":"Royal Society","ror":"https://ror.org/03wnrjx87"},{"id":"https://openalex.org/F4320321181","display_name":"Austrian Science Fund","ror":"https://ror.org/013tf3c58"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3159367332.pdf","grobid_xml":"https://content.openalex.org/works/W3159367332.grobid-xml"},"referenced_works_count":34,"referenced_works":["https://openalex.org/W52840101","https://openalex.org/W603445739","https://openalex.org/W1986736553","https://openalex.org/W1993667194","https://openalex.org/W2004485491","https://openalex.org/W2008536061","https://openalex.org/W2017205387","https://openalex.org/W2021989496","https://openalex.org/W2033325972","https://openalex.org/W2034674470","https://openalex.org/W2065023965","https://openalex.org/W2077814962","https://openalex.org/W2107988095","https://openalex.org/W2148317584","https://openalex.org/W2232813226","https://openalex.org/W2547902904","https://openalex.org/W2888273277","https://openalex.org/W2963068377","https://openalex.org/W2995165452","https://openalex.org/W2997686574","https://openalex.org/W3006091301","https://openalex.org/W3022709368","https://openalex.org/W3035604152","https://openalex.org/W3040087842","https://openalex.org/W3082261834","https://openalex.org/W3159367332","https://openalex.org/W3178614413","https://openalex.org/W3189930236","https://openalex.org/W4244579861","https://openalex.org/W6602175484","https://openalex.org/W6635410344","https://openalex.org/W6654627852","https://openalex.org/W6735888442","https://openalex.org/W6822517396"],"related_works":["https://openalex.org/W2933667225","https://openalex.org/W2280659633","https://openalex.org/W1979091081","https://openalex.org/W2091522522","https://openalex.org/W4302801230","https://openalex.org/W2008536061","https://openalex.org/W4308505582","https://openalex.org/W2959649007","https://openalex.org/W4288283333","https://openalex.org/W1524736198"],"abstract_inverted_index":{"Various":[0],"classic":[1],"reasoning":[2],"problems":[3],"with":[4],"natural":[5],"hypergraph":[6,54],"representations":[7],"are":[8,25],"known":[9],"to":[10,64,90],"be":[11],"tractable":[12],"when":[13],"a":[14,50,56],"hypertree":[15],"decomposition":[16,51],"(HD)":[17],"of":[18,40,47,52,74],"low":[19],"width":[20],"exists.":[21],"The":[22,72],"resulting":[23],"algorithms":[24],"attractive":[26],"for":[27,68,78],"practical":[28],"use":[29,39],"in":[30],"fields":[31],"like":[32],"databases":[33],"and":[34],"constraint":[35],"satisfaction.":[36],"However,":[37],"algorithmic":[38],"HDs":[41,80],"relies":[42],"on":[43],"the":[44,53,66,85],"difficult":[45],"task":[46],"first":[48],"computing":[49,79],"underlying":[55],"given":[57],"problem":[58,86],"instance,":[59],"which":[60],"is":[61,81],"then":[62],"used":[63],"guide":[65],"algorithm":[67],"this":[69],"particular":[70],"instance.":[71],"performance":[73],"purely":[75],"sequential":[76],"methods":[77],"inherently":[82],"limited,":[83],"yet":[84],"is,":[87],"theoretically,":[88],"amenable":[89],"parallelisation.":[91]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}