{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:47:19Z","timestamp":1772164039814,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,10,22]],"date-time":"2011-10-22T00:00:00Z","timestamp":1319241600000},"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":[[2011,10,22]]},"DOI":"10.1145\/2048066.2048111","type":"proceedings-article","created":{"date-parts":[[2011,10,25]],"date-time":"2011-10-25T08:23:06Z","timestamp":1319530986000},"page":"575-594","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["Scalable join patterns"],"prefix":"10.1145","author":[{"given":"Aaron J.","family":"Turon","sequence":"first","affiliation":[{"name":"Northeastern University, Boston, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Claudio V.","family":"Russo","sequence":"additional","affiliation":[{"name":"Microsoft, Cambridge, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2011,10,22]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Mar.","author":"Benton N.","year":"2003","unstructured":"N. Benton . Jingle bells: Solving the Santa Claus problem in Polyphonic C#. Unpublished manuscript , Mar. 2003 . URL http:\/\/research.microsoft.com\/nick\/santa.pdf. N. Benton. Jingle bells: Solving the Santa Claus problem in Polyphonic C#. Unpublished manuscript, Mar. 2003. URL http:\/\/research.microsoft.com\/nick\/santa.pdf."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1018203.1018205"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00289519"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/237721.237805"},{"key":"e_1_3_2_1_5_1","volume-title":"APPSEM Summer School","author":"Fournet C.","year":"2000","unstructured":"C. Fournet and G. Gonthier . The join calculus: a language for distributed mobile programming . In APPSEM Summer School , Caminha, Portugal , Sept. 2000 , 2002. C. Fournet and G. Gonthier. The join calculus: a language for distributed mobile programming. In APPSEM Summer School, Caminha, Portugal, Sept. 2000, 2002."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/646732.703872"},{"key":"e_1_3_2_1_7_1","volume-title":"4th International School","author":"Fournet C.","year":"2002","unstructured":"C. Fournet , F. Le Fessant , L. Maranget , and A. Schmitt . JoCaml: a language for concurrent distributed and mobile programming. In Advanced Functional Programming , 4th International School , Oxford , Aug. 2002 , 2003. C. Fournet, F. Le Fessant, L. Maranget, and A. Schmitt. JoCaml: a language for concurrent distributed and mobile programming. In Advanced Functional Programming, 4th International School, Oxford, Aug. 2002, 2003."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1065944.1065952"},{"key":"e_1_3_2_1_9_1","volume-title":"Morgan Kaufmann","author":"Herlihy M.","year":"2008","unstructured":"M. Herlihy and N. Shavit . The Art of Multiprocessor Programming . Morgan Kaufmann , 2008 . M. Herlihy and N. Shavit. The Art of Multiprocessor Programming. Morgan Kaufmann, 2008."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/78969.78972"},{"key":"e_1_3_2_1_12_1","volume-title":"International Workshop on High-Level Concurrent Languages (HLCL)","author":"Le Fessant F.","year":"1998","unstructured":"F. Le Fessant and L. Maranget . Compiling join-patterns . In International Workshop on High-Level Concurrent Languages (HLCL) , Sept. 1998 . F. Le Fessant and L. Maranget. Compiling join-patterns. In International Workshop on High-Level Concurrent Languages (HLCL), Sept. 1998."},{"key":"e_1_3_2_1_13_1","unstructured":"D. Lea. URL http:\/\/gee.cs.oswego.edu\/dl\/concurrency-interest\/.  D. Lea. URL http:\/\/gee.cs.oswego.edu\/dl\/concurrency-interest\/."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/337449.337465"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.scico.2005.03.007"},{"key":"e_1_3_2_1_16_1","unstructured":"Y. Liu 2009. URL http:\/\/channel.sourceforge.net\/.  Y. Liu 2009. URL http:\/\/channel.sourceforge.net\/."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/103727.103729"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/248052.248106"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1998.1446"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/777412.777468"},{"key":"e_1_3_2_1_21_1","volume-title":"APPSEM Summer School","author":"Odersky M.","year":"2000","unstructured":"M. Odersky . An overview of functional nets . In APPSEM Summer School , Caminha, Portugal , Sept. 2000 , 2002. M. Odersky. An overview of functional nets. In APPSEM Summer School, Caminha, Portugal, Sept. 2000, 2002."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13414-2_5"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1596550.1596588"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-69611-7_17"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1449764.1449770"},{"key":"e_1_3_2_1_26_1","volume-title":"Synchronization and Concurrency in Object-Oriented Languages (SCOOL)","author":"Scherer W.","year":"2005","unstructured":"W. Scherer , III, D. Lea , and M. L. Scott . A scalable elimination-based exchange channel . In Synchronization and Concurrency in Object-Oriented Languages (SCOOL) , 2005 . W. Scherer, III, D. Lea, and M. L. Scott. A scalable elimination-based exchange channel. In Synchronization and Concurrency in Object-Oriented Languages (SCOOL), 2005."},{"key":"e_1_3_2_1_27_1","volume-title":"International Symposium on Distributed Computing (DISC)","author":"Scherer W. N.","year":"2004","unstructured":"W. N. Scherer , III and M. L. Scott . Nonblocking concurrent objects with condition synchronization . In International Symposium on Distributed Computing (DISC) , 2004 . W. N. Scherer, III and M. L. Scott. Nonblocking concurrent objects with condition synchronization. In International Symposium on Distributed Computing (DISC), 2004."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1122971.1122994"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/224964.224987"},{"key":"e_1_3_2_1_30_1","volume-title":"ACM SIGPLAN Workshop on Transactional Computing (TRANSACT)","author":"Singh S.","year":"2006","unstructured":"S. Singh . Higher-order combinators for join patterns using STM . ACM SIGPLAN Workshop on Transactional Computing (TRANSACT) , June 2006 . S. Singh. Higher-order combinators for join patterns using STM. ACM SIGPLAN Workshop on Transactional Computing (TRANSACT), June 2006."},{"key":"e_1_3_2_1_31_1","volume-title":"Parallel join patterns with guards and propagation. Unpublished manuscript","author":"Sulzmann M.","year":"2008","unstructured":"M. Sulzmann and E. S. L. Lam . Parallel join patterns with guards and propagation. Unpublished manuscript , 2008 . M. Sulzmann and E. S. L. Lam. Parallel join patterns with guards and propagation. Unpublished manuscript, 2008."}],"event":{"name":"SPLASH '11: Conference on Systems, Programming, and Applications: Software for Humanity","location":"Portland Oregon USA","acronym":"SPLASH '11","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"]},"container-title":["Proceedings of the 2011 ACM international conference on Object oriented programming systems languages and applications"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2048066.2048111","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2048066.2048111","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T05:48:32Z","timestamp":1750225712000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2048066.2048111"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,10,22]]},"references-count":30,"alternative-id":["10.1145\/2048066.2048111","10.1145\/2048066"],"URL":"https:\/\/doi.org\/10.1145\/2048066.2048111","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2076021.2048111","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2011,10,22]]},"assertion":[{"value":"2011-10-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}