{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:08:05Z","timestamp":1750306085053,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,9,26]],"date-time":"2017-09-26T00:00:00Z","timestamp":1506384000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,9,26]]},"DOI":"10.1145\/3129416.3129425","type":"proceedings-article","created":{"date-parts":[[2017,9,25]],"date-time":"2017-09-25T13:14:14Z","timestamp":1506345254000},"page":"1-10","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Benchmarking optimised algorithms for transitive closure"],"prefix":"10.1145","author":[{"given":"Vreda","family":"Pieterse","sequence":"first","affiliation":[{"name":"University of Pretoria, Pretoria, South Africa"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Loek","family":"Cleophas","sequence":"additional","affiliation":[{"name":"Stellenbosch University, Stellenbosch, South Africa and Eindhoven University of Technology, Eindhoven, The Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2017,9,26]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/88636.88888"},{"volume-title":"Proceedings of the 13th International Conference on Very Large Data Bases (VLDB '87)","author":"Agrawal Rakesh","key":"e_1_3_2_1_2_1","unstructured":"Rakesh Agrawal and H. V. Jagadish . 1987. Direct Algorithms for Computing the Transitive Closure of Database Relations . In Proceedings of the 13th International Conference on Very Large Data Bases (VLDB '87) . Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, 255--266. http:\/\/0-dl.acm.org.innopac.up.ac.za\/citation.cfm?id=645914.671624 Rakesh Agrawal and H. V. Jagadish. 1987. Direct Algorithms for Computing the Transitive Closure of Database Relations. In Proceedings of the 13th International Conference on Very Large Data Bases (VLDB '87). Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, 255--266. http:\/\/0-dl.acm.org.innopac.up.ac.za\/citation.cfm?id=645914.671624"},{"key":"e_1_3_2_1_3_1","volume-title":"Ullman","author":"Aho Alfred V.","year":"1974","unstructured":"Alfred V. Aho , John E. Hopcroft , and Jeffrey D . Ullman . 1974 . The design and analysis of computer algorithms. Addison-Wesley Longman Publishing Co. , Inc., Boston, MA, USA. Alfred V. Aho, John E. Hopcroft, and Jeffrey D. Ullman. 1974. The design and analysis of computer algorithms. Addison-Wesley Longman Publishing Co., Inc., Boston, MA, USA."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/366792.366825"},{"key":"e_1_3_2_1_5_1","volume-title":"http:\/\/guest.engelschall.com\/-sb\/download\/Bit-Vector\/. (2009). [Online","author":"Beyer Steffen","year":"2014","unstructured":"Steffen Beyer . 2009. Bit::Vector. http:\/\/guest.engelschall.com\/-sb\/download\/Bit-Vector\/. (2009). [Online ; accessed 2014 -08-23]. Steffen Beyer. 2009. Bit::Vector. http:\/\/guest.engelschall.com\/-sb\/download\/Bit-Vector\/. (2009). [Online; accessed 2014-08-23]."},{"key":"e_1_3_2_1_6_1","unstructured":"Stephen M. Blackburn Amer Diwan Matthias Hauswirth Peter F. Sweeney Jos\u00e9 Nelson Amaral Vlastimil Babka Walter Binder Tim Brecht Lubom\u00edr Bulej Lieven Eeckhout Sebastian Fischmeister Daniel Frampton Robin Garner Andy Georges Laurie J. Hendren Michael Hind Antony L. Hosking Richard Jones Tomas Kalibera Philippe Moret Nathaniel Nystrom Victor Pankratius and Petr Tuma. 2012. Evaluate Collaboratory Technical Report #1: Can you trust your experimental results? (Feb 2012). http:\/\/evaluate.inf.usi.ch\/technical-reports\/1.  Stephen M. Blackburn Amer Diwan Matthias Hauswirth Peter F. Sweeney Jos\u00e9 Nelson Amaral Vlastimil Babka Walter Binder Tim Brecht Lubom\u00edr Bulej Lieven Eeckhout Sebastian Fischmeister Daniel Frampton Robin Garner Andy Georges Laurie J. Hendren Michael Hind Antony L. Hosking Richard Jones Tomas Kalibera Philippe Moret Nathaniel Nystrom Victor Pankratius and Petr Tuma. 2012. Evaluate Collaboratory Technical Report #1: Can you trust your experimental results? (Feb 2012). http:\/\/evaluate.inf.usi.ch\/technical-reports\/1."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-63141-0_10"},{"key":"e_1_3_2_1_8_1","volume-title":"Proceedings of the Prague Stringology Conference 2009","author":"Cleophas Loek","year":"2009","unstructured":"Loek Cleophas and Kees Hemerik . 2009 . Taxonomies of Regular Tree Algorithms . In Proceedings of the Prague Stringology Conference 2009 , Prague, Czech Republic, August 31 - September 2, 2009, Jan Holub and Jan Zd\u00e1rek (Eds.). Prague Stringology Club, Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University in Prague. Loek Cleophas and Kees Hemerik. 2009. Taxonomies of Regular Tree Algorithms. In Proceedings of the Prague Stringology Conference 2009, Prague, Czech Republic, August 31 - September 2, 2009, Jan Holub and Jan Zd\u00e1rek (Eds.). Prague Stringology Club, Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University in Prague."},{"key":"e_1_3_2_1_9_1","unstructured":"Digia. n.d.. Qt - A cross-platform application and UI framework. http:\/\/qt.digia.com\/.(n.d.). [Online; accessed 2014-08-23].  Digia. n.d.. Qt - A cross-platform application and UI framework. http:\/\/qt.digia.com\/.(n.d.). [Online; accessed 2014-08-23]."},{"key":"e_1_3_2_1_10_1","volume-title":"http:\/\/michael.dipperstein.com\/bitlibs\/. (June","author":"Dipperstein Michael","year":"2008","unstructured":"Michael Dipperstein . 2008. ANSI C and C++ Bit Manipulation Libraries . http:\/\/michael.dipperstein.com\/bitlibs\/. (June 2008 ). [Online; accessed 2014-08-23]. Michael Dipperstein. 2008. ANSI C and C++ Bit Manipulation Libraries. http:\/\/michael.dipperstein.com\/bitlibs\/. (June 2008). [Online; accessed 2014-08-23]."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.2478\/v10175-012-0009-6"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(81)90067-0"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(00)00304-8"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2464157.2464160"},{"key":"e_1_3_2_1_15_1","volume-title":"The Art of Computer Programming","author":"Knuth Donald E.","unstructured":"Donald E. Knuth . 1997. The Art of Computer Programming , Volume 2 ( 3 rd Ed.): Seminumerical Algorithms. Addison-Wesley Longman Publishing Co. , Inc., Boston, MA, USA. Donald E. Knuth. 1997. The Art of Computer Programming, Volume 2 (3rd Ed.): Seminumerical Algorithms. Addison-Wesley Longman Publishing Co., Inc., Boston, MA, USA.","edition":"3"},{"key":"e_1_3_2_1_16_1","unstructured":"Anatoliy Kuznetsov Maxim Shemanarev Igor Tolstoy Emmie Lewis and Oleg Khovayko. n.d.. BitMagic. http:\/\/bmagic.sourceforge.net\/. (n.d.). [Online: Accessed 2004-08-23].  Anatoliy Kuznetsov Maxim Shemanarev Igor Tolstoy Emmie Lewis and Oleg Khovayko. n.d.. BitMagic. http:\/\/bmagic.sourceforge.net\/. (n.d.). [Online: Accessed 2004-08-23]."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/106972.106981"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/0041-5553(63)90546-9"},{"key":"e_1_3_2_1_19_1","unstructured":"Hatem Mostafa. 2004. Bits Array Encapsulation. http:\/\/www.codeproject.com\/Articles\/9034\/Bits-Array-Encapsulation. (December 2004). [Online; accessed 2014-08-23].  Hatem Mostafa. 2004. Bits Array Encapsulation. http:\/\/www.codeproject.com\/Articles\/9034\/Bits-Array-Encapsulation. (December 2004). [Online; accessed 2014-08-23]."},{"key":"e_1_3_2_1_20_1","unstructured":"David Robert Nadeau. 2012. C\/C++ tip: How to measure elapsed real time for benchmarking. http:\/\/nadeausoftware.com\/articles\/2012\/04\/c_c_tip_how_measure_elapsed_real_time_benchmarking. (April 2012). [Online; accessed 2014-11-23].  David Robert Nadeau. 2012. C\/C++ tip: How to measure elapsed real time for benchmarking. http:\/\/nadeausoftware.com\/articles\/2012\/04\/c_c_tip_how_measure_elapsed_real_time_benchmarking. (April 2012). [Online; accessed 2014-11-23]."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1899503.1899530"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1460299.1460314"},{"key":"e_1_3_2_1_25_1","unstructured":"Rene Rivera. n.d.. Boost C++ Libraries. http:\/\/www.boost.org\/. (n.d.). [Online; accessed 2014-08-11].  Rene Rivera. n.d.. Boost C++ Libraries. http:\/\/www.boost.org\/. (n.d.). [Online; accessed 2014-08-11]."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1147\/rd.256.0848"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/602220.602225"},{"volume-title":"The Algorithm Design Manual: Text","author":"Skiena Steven S.","key":"e_1_3_2_1_28_1","unstructured":"Steven S. Skiena . 1998. The Algorithm Design Manual: Text . TELOS-the Electronic Library of Science . Steven S. Skiena. 1998. The Algorithm Design Manual: Text. TELOS-the Electronic Library of Science."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/360715.360746"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/321105.321107"},{"volume-title":"The Free Encyclopedia","key":"e_1_3_2_1_31_1","unstructured":"Wikipedia. 2014. Transitive closure --- Wikipedia , The Free Encyclopedia . http:\/\/en.wikipedia.org\/w\/index.php?title=Transitive_closure&oldid=633219302. (2014). [Online; accessed 2014-11-20]. Wikipedia. 2014. Transitive closure --- Wikipedia, The Free Encyclopedia. http:\/\/en.wikipedia.org\/w\/index.php?title=Transitive_closure&oldid=633219302. (2014). [Online; accessed 2014-11-20]."},{"key":"e_1_3_2_1_32_1","volume-title":"Algorithmic Profiling. In Proceedings of the 33rd ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI '12)","author":"Zaparanuks Dmitrijs","year":"2012","unstructured":"Dmitrijs Zaparanuks and Matthias Hauswirth . 2012 . Algorithmic Profiling. In Proceedings of the 33rd ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI '12) . ACM, New York, NY, USA, 67--76. Dmitrijs Zaparanuks and Matthias Hauswirth. 2012. Algorithmic Profiling. In Proceedings of the 33rd ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI '12). ACM, New York, NY, USA, 67--76."}],"event":{"name":"SAICSIT '17: South African Institute of Computer Scientists and Information Technologists","acronym":"SAICSIT '17","location":"Thaba 'Nchu South Africa"},"container-title":["Proceedings of the South African Institute of Computer Scientists and Information Technologists"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3129416.3129425","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3129416.3129425","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:30:15Z","timestamp":1750217415000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3129416.3129425"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,9,26]]},"references-count":30,"alternative-id":["10.1145\/3129416.3129425","10.1145\/3129416"],"URL":"https:\/\/doi.org\/10.1145\/3129416.3129425","relation":{},"subject":[],"published":{"date-parts":[[2017,9,26]]},"assertion":[{"value":"2017-09-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}