{"id":"https://openalex.org/W2758930756","doi":"https://doi.org/10.1145/3129416.3129425","title":"Benchmarking optimised algorithms for transitive closure","display_name":"Benchmarking optimised algorithms for transitive closure","publication_year":2017,"publication_date":"2017-09-25","ids":{"openalex":"https://openalex.org/W2758930756","doi":"https://doi.org/10.1145/3129416.3129425","mag":"2758930756"},"language":"en","primary_location":{"id":"doi:10.1145/3129416.3129425","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3129416.3129425","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the South African Institute of Computer Scientists and Information Technologists","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/A5058226074","display_name":"Vreda Pieterse","orcid":"https://orcid.org/0000-0002-7487-2704"},"institutions":[{"id":"https://openalex.org/I69552723","display_name":"University of Pretoria","ror":"https://ror.org/00g0p6g84","country_code":"ZA","type":"education","lineage":["https://openalex.org/I69552723"]}],"countries":["ZA"],"is_corresponding":true,"raw_author_name":"Vreda Pieterse","raw_affiliation_strings":["University of Pretoria, Pretoria, South Africa"],"affiliations":[{"raw_affiliation_string":"University of Pretoria, Pretoria, South Africa","institution_ids":["https://openalex.org/I69552723"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5043799147","display_name":"Loek Cleophas","orcid":"https://orcid.org/0000-0002-7221-3676"},"institutions":[{"id":"https://openalex.org/I26092322","display_name":"Stellenbosch University","ror":"https://ror.org/05bk57929","country_code":"ZA","type":"education","lineage":["https://openalex.org/I26092322"]},{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL","ZA"],"is_corresponding":false,"raw_author_name":"Loek Cleophas","raw_affiliation_strings":["Stellenbosch University, Stellenbosch, South Africa and Eindhoven University of Technology, Eindhoven, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Stellenbosch University, Stellenbosch, South Africa and Eindhoven University of Technology, Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370","https://openalex.org/I26092322"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5058226074"],"corresponding_institution_ids":["https://openalex.org/I69552723"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.14511528,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"10"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9984999895095825,"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.9984999895095825,"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/T12162","display_name":"Cellular Automata and Applications","score":0.9979000091552734,"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9962999820709229,"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/transitive-closure","display_name":"Transitive closure","score":0.9727391004562378},{"id":"https://openalex.org/keywords/benchmarking","display_name":"Benchmarking","score":0.8140754699707031},{"id":"https://openalex.org/keywords/closure","display_name":"Closure (psychology)","score":0.7485033273696899},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.7153564095497131},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6820339560508728},{"id":"https://openalex.org/keywords/transitive-relation","display_name":"Transitive relation","score":0.6724686622619629},{"id":"https://openalex.org/keywords/transitive-reduction","display_name":"Transitive reduction","score":0.5363067388534546},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.4683712422847748},{"id":"https://openalex.org/keywords/binary-relation","display_name":"Binary relation","score":0.4453088045120239},{"id":"https://openalex.org/keywords/preorder","display_name":"Preorder","score":0.4149268567562103},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.40766268968582153},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.22863146662712097},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.10572957992553711},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.07322630286216736}],"concepts":[{"id":"https://openalex.org/C128896722","wikidata":"https://www.wikidata.org/wiki/Q1501387","display_name":"Transitive closure","level":2,"score":0.9727391004562378},{"id":"https://openalex.org/C86251818","wikidata":"https://www.wikidata.org/wiki/Q816754","display_name":"Benchmarking","level":2,"score":0.8140754699707031},{"id":"https://openalex.org/C146834321","wikidata":"https://www.wikidata.org/wiki/Q2979672","display_name":"Closure (psychology)","level":2,"score":0.7485033273696899},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.7153564095497131},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6820339560508728},{"id":"https://openalex.org/C191399111","wikidata":"https://www.wikidata.org/wiki/Q64861","display_name":"Transitive relation","level":2,"score":0.6724686622619629},{"id":"https://openalex.org/C129691609","wikidata":"https://www.wikidata.org/wiki/Q3088151","display_name":"Transitive reduction","level":5,"score":0.5363067388534546},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.4683712422847748},{"id":"https://openalex.org/C65180967","wikidata":"https://www.wikidata.org/wiki/Q130901","display_name":"Binary relation","level":2,"score":0.4453088045120239},{"id":"https://openalex.org/C2333172","wikidata":"https://www.wikidata.org/wiki/Q1425985","display_name":"Preorder","level":2,"score":0.4149268567562103},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.40766268968582153},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22863146662712097},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.10572957992553711},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.07322630286216736},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.0},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0},{"id":"https://openalex.org/C162853370","wikidata":"https://www.wikidata.org/wiki/Q39809","display_name":"Marketing","level":1,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.0},{"id":"https://openalex.org/C144133560","wikidata":"https://www.wikidata.org/wiki/Q4830453","display_name":"Business","level":0,"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":6,"locations":[{"id":"doi:10.1145/3129416.3129425","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3129416.3129425","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the South African Institute of Computer Scientists and Information Technologists","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.tue.nl:openaire_cris_publications/1760c4b2-813d-4677-bea3-a1679a6cd0e9","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/1760c4b2-813d-4677-bea3-a1679a6cd0e9","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Pieterse, V & Cleophas, L G W A 2017, Benchmarking optimised algorithms for transitive closure. in SAICSIT '17 Proceedings of the South African Institute of Computer Scientists and Information Technologists, 26-28 September 2017, Thaba 'Nchu, South Africa ., 27, Association for Computing Machinery, Inc., New York, pp. 1-10, 2017 South African Institute of Computer Scientists and Information Technologists Conference (SAICSIT 2017), Bloemfontein, South Africa, 26/09/17. https://doi.org/10.1145/3129416.3129425","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:878793","is_oa":false,"landing_page_url":"http://library.tue.nl/csp/dare/LinkToRepository.csp?recordnumber=878793","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""},{"id":"pmh:oai:library.tue.nl:869993","is_oa":false,"landing_page_url":"http://repository.tue.nl/869993","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""},{"id":"pmh:oai:library.tue.nl:878793","is_oa":false,"landing_page_url":"http://repository.tue.nl/878793","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""},{"id":"pmh:tue:oai:pure.tue.nl:publications/1760c4b2-813d-4677-bea3-a1679a6cd0e9","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/1760c4b2-813d-4677-bea3-a1679a6cd0e9","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SAICSIT '17 Proceedings of the South African Institute of Computer Scientists and Information Technologists, 26-28 September 2017, Thaba 'Nchu, South Africa, 1 - 10","raw_type":"info:eu-repo/semantics/conferencepaper"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W1549076666","https://openalex.org/W1563408427","https://openalex.org/W1589224558","https://openalex.org/W1655990431","https://openalex.org/W1970158213","https://openalex.org/W1975356194","https://openalex.org/W1979012070","https://openalex.org/W1981663184","https://openalex.org/W1992792191","https://openalex.org/W1993504147","https://openalex.org/W2005419964","https://openalex.org/W2013901208","https://openalex.org/W2031710984","https://openalex.org/W2054633003","https://openalex.org/W2059561805","https://openalex.org/W2062827220","https://openalex.org/W2098220211","https://openalex.org/W2104734478","https://openalex.org/W2136523591","https://openalex.org/W2293085049","https://openalex.org/W2611059838","https://openalex.org/W2625079793","https://openalex.org/W2744182688","https://openalex.org/W2752061190"],"related_works":["https://openalex.org/W2111304739","https://openalex.org/W2362009423","https://openalex.org/W2357069572","https://openalex.org/W2383282217","https://openalex.org/W2365750584","https://openalex.org/W2371151875","https://openalex.org/W2394135826","https://openalex.org/W2012063573","https://openalex.org/W2119876047","https://openalex.org/W1997826500"],"abstract_inverted_index":{"We":[0,35,46],"investigate":[1],"the":[2,16,44,48,54,59],"impact":[3,49],"of":[4,19,50,92],"using":[5,61,70],"different":[6,66],"algorithmic":[7],"techniques":[8,25,52],"and":[9,33,38,69,83],"data":[10,67,72],"representations":[11],"in":[12,43],"algorithms":[13],"to":[14,57],"calculate":[15],"transitive":[17,80],"closure":[18,81],"a":[20,85,88],"finite":[21],"binary":[22],"relation.":[23],"These":[24],"are":[26,41],"change":[27],"monitor,":[28],"loop":[29,31],"fusion,":[30],"tiling":[32],"short-circuiting.":[34],"explain":[36],"them":[37],"how":[39],"they":[40],"applied":[42],"algorithms.":[45,94],"measured":[47],"these":[51],"on":[53],"elapsed":[55],"time":[56],"execute":[58],"algorithms,":[60,82],"C++":[62],"implementations":[63],"with":[64],"two":[65],"representations,":[68],"various":[71],"sets.":[73],"The":[74],"investigation":[75],"also":[76],"covers":[77],"more":[78],"basic":[79],"as":[84],"result":[86],"forms":[87],"large-scale":[89],"empirical":[90],"comparison":[91],"such":[93]},"counts_by_year":[{"year":2021,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}