{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:22:01Z","timestamp":1750220521093,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":29,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,11,15]],"date-time":"2020-11-15T00:00:00Z","timestamp":1605398400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100003130","name":"Fonds Wetenschappelijk Onderzoek","doi-asserted-by":"publisher","award":["1S93820N1, 1S95318N"],"award-info":[{"award-number":["1S93820N1, 1S95318N"]}],"id":[{"id":"10.13039\/501100003130","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,11,16]]},"DOI":"10.1145\/3427763.3428316","type":"proceedings-article","created":{"date-parts":[[2020,11,25]],"date-time":"2020-11-25T01:15:11Z","timestamp":1606266911000},"page":"38-50","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Reactive sorting networks"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2100-4559","authenticated-orcid":false,"given":"Bjarno","family":"Oeyen","sequence":"first","affiliation":[{"name":"Vrije Universiteit Brussel, Belgium"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sam","family":"Van den Vonder","sequence":"additional","affiliation":[{"name":"Vrije Universiteit Brussel, Belgium"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wolfgang","family":"De Meuter","sequence":"additional","affiliation":[{"name":"Vrije Universiteit Brussel, Belgium"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,11,15]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1468075.1468121"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/289423.289440"},{"volume-title":"Optimal-depth sorting networks. J. Comput. Syst. Sci. 84 ( 2017 ), 185-204. htps:\/\/doi.org\/10.1016\/j.jcss","year":"2016","author":"Bundala Daniel","key":"e_1_3_2_1_3_1"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10009-002-0089-y"},{"volume-title":"Proceedings of the 15th European Conference on Programming Languages and Systems, ESOP' 06","year":"2006","author":"Gregory","key":"e_1_3_2_1_5_1"},{"volume-title":"Asynchronous Functional Reactive Programming for GUIs. SIGPLAN Not. 48, 6 (","year":"2013","author":"Czaplicki Evan","key":"e_1_3_2_1_6_1"},{"key":"e_1_3_2_1_7_1","volume-title":"Tackling the Awkward Squad for Reactive Programming: The Actor Reactor Model. In 34th European Conference on Object-Oriented Programming, ECOOP 2020 (LIPIcs","volume":"166","author":"den Vonder Sam Van","year":"2020"},{"key":"e_1_3_2_1_8_1","unstructured":"Bert Dobbelaere. 2020. Smallest and fastest sorting networks for a given number of inputs. htp:\/\/web.archive.org\/web\/20200715102935\/htp: \/\/users.telenet.be\/bertdobbelaere\/SorterHunter\/sorting_networks. html. Accessed: 2020-07-15.  Bert Dobbelaere. 2020. Smallest and fastest sorting networks for a given number of inputs. htp:\/\/web.archive.org\/web\/20200715102935\/htp: \/\/users.telenet.be\/bertdobbelaere\/SorterHunter\/sorting_networks. html. Accessed: 2020-07-15."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3276477"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/258948.258973"},{"volume-title":"Jacquard's web: how a hand-loom led to the birth of the information age","author":"Essinger James","key":"e_1_3_2_1_11_1"},{"key":"e_1_3_2_1_12_1","unstructured":"Matthew Flatt and Robert Bruce Findler. 2014. The Racket Guide.  Matthew Flatt and Robert Bruce Findler. 2014. The Racket Guide."},{"key":"e_1_3_2_1_13_1","first-page":"17","volume-title":"Rete: A Fast Algorithm for the Many Patterns\/Many Objects Match Problem. Artif. Intell. 19, 1 ( 1982 )","author":"Forgy Charles","year":"1982"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2034773.2034812"},{"volume-title":"Advanced Functional Programming, 4th International School, AFP","year":"2002","author":"Hudak Paul","key":"e_1_3_2_1_15_1"},{"key":"e_1_3_2_1_16_1","unstructured":"Richard Kelsey William D. Clinger and Jonathan Rees. 1998. Revised5 Report on the Algorithmic Language Scheme. ACM SIGPLAN Notices 33 9 ( 1998 ) 26-76. htps:\/\/doi.org\/10.1145\/290229.290234  Richard Kelsey William D. Clinger and Jonathan Rees. 1998. Revised5 Report on the Algorithmic Language Scheme. ACM SIGPLAN Notices 33 9 ( 1998 ) 26-76. htps:\/\/doi.org\/10.1145\/290229.290234"},{"edition":"2","volume-title":"The Art of Computer Programming, Volume III: Sorting and Searching","author":"Knuth Donald E.","key":"e_1_3_2_1_17_1"},{"volume-title":"Plugging a Space Leak with an Arrow. Electron. Notes Theor. Comput. Sci. 193 ( 2007 ), 29-45. htps:\/\/doi.org\/ 10.1016\/j.entcs","year":"2007","author":"Liu Hai","key":"e_1_3_2_1_18_1"},{"volume-title":"International Edition","author":"Mitchell Tom M.","key":"e_1_3_2_1_19_1"},{"key":"e_1_3_2_1_20_1","unstructured":"Florian Myter Christophe Scholliers and Wolfgang De Meuter. 2019. Distributed Reactive Programming for Reactive Distributed Systems. Art Sci. Eng. Program. 3 3 ( 2019 ) 5. htps:\/\/doi.org\/10.22152\/ programming-journal.org\/ 2019 \/3\/5  Florian Myter Christophe Scholliers and Wolfgang De Meuter. 2019. Distributed Reactive Programming for Reactive Distributed Systems. Art Sci. Eng. Program. 3 3 ( 2019 ) 5. htps:\/\/doi.org\/10.22152\/ programming-journal.org\/ 2019 \/3\/5"},{"volume-title":"Sam Van den Vonder, and Wolfgang De Meuter","year":"2020","author":"Oeyen Bjarno","key":"e_1_3_2_1_21_1"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3281278.3281284"},{"key":"e_1_3_2_1_23_1","unstructured":"Ian Parberry. 1992. The Pairwise Sorting Network. Parallel Process. Lett. 2 ( 1992 ) 205-211. htps:\/\/doi.org\/10.1142\/S0129626492000337  Ian Parberry. 1992. The Pairwise Sorting Network. Parallel Process. Lett. 2 ( 1992 ) 205-211. htps:\/\/doi.org\/10.1142\/S0129626492000337"},{"volume-title":"Introduction to parallel processing : algorithms and architectures","author":"Parhami Behrooz","key":"e_1_3_2_1_24_1"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2012.30"},{"volume-title":"Gpu gems 2: programming techniques for high-performance graphics and general-purpose computation","author":"Pharr Matt","key":"e_1_3_2_1_26_1"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2577080.2577083"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2892664.2892670"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.21236\/ADA555162"}],"event":{"name":"SPLASH '20: Conference on Systems, Programming, Languages, and Applications, Software for Humanity","acronym":"SPLASH '20","location":"Virtual USA"},"container-title":["Proceedings of the 7th ACM SIGPLAN International Workshop on Reactive and Event-Based Languages and Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3427763.3428316","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3427763.3428316","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:24:40Z","timestamp":1750195480000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3427763.3428316"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,11,15]]},"references-count":29,"alternative-id":["10.1145\/3427763.3428316","10.1145\/3427763"],"URL":"https:\/\/doi.org\/10.1145\/3427763.3428316","relation":{},"subject":[],"published":{"date-parts":[[2020,11,15]]},"assertion":[{"value":"2020-11-15","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}