{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,24]],"date-time":"2025-08-24T01:37:52Z","timestamp":1755999472702,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":28,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,1,4]],"date-time":"2023-01-04T00:00:00Z","timestamp":1672790400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CNS-1812349"],"award-info":[{"award-number":["CNS-1812349"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,1,4]]},"DOI":"10.1145\/3571306.3571318","type":"proceedings-article","created":{"date-parts":[[2023,1,3]],"date-time":"2023-01-03T16:17:12Z","timestamp":1672762632000},"page":"2-11","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Keynote Talk: Lattice Linear Predicate Algorithms for the Constrained Stable Marriage Problem with Ties\u2731"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5797-4389","authenticated-orcid":false,"given":"Vijay Kumar","family":"Garg","sequence":"first","affiliation":[{"name":"Electrical and Computer Engineering Department, The University of Texas at Austin, United States"}]}],"member":"320","published-online":{"date-parts":[[2023,1,4]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Proc. Parallel and Distributed Combinatorics and Optimization (PDCO)","author":"R.","year":"2022","unstructured":"David\u00a0 R. Alves and Vijay\u00a0K. Garg. 2022. Parallel Minimum Spanning Tree Algorithms via Lattice Linear Predicate Detection . In Proc. Parallel and Distributed Combinatorics and Optimization (PDCO) , June 2022 . Lyon, France. David\u00a0R. Alves and Vijay\u00a0K. Garg. 2022. Parallel Minimum Spanning Tree Algorithms via Lattice Linear Predicate Detection. In Proc. Parallel and Distributed Combinatorics and Optimization (PDCO), June 2022. Lyon, France."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/4221.4227"},{"key":"e_1_3_2_1_3_1","first-page":"152","article-title":"Distributed stable matching problems","volume":"2005","author":"Brito Ismel","year":"2005","unstructured":"Ismel Brito and Pedro Meseguer . 2005 . Distributed stable matching problems . Principles and Practice of Constraint Programming-CP 2005 (2005), 152 \u2013 166 . Ismel Brito and Pedro Meseguer. 2005. Distributed stable matching problems. Principles and Practice of Constraint Programming-CP 2005 (2005), 152\u2013166.","journal-title":"Principles and Practice of Constraint Programming-CP"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/s004460050049"},{"volume-title":"Introduction to Lattices and Order","author":"Davey A.","key":"e_1_3_2_1_5_1","unstructured":"B.\u00a0 A. Davey and H.\u00a0 A. Priestley . 1990. Introduction to Lattices and Order . Cambridge University Press , Cambridge, UK . B.\u00a0A. Davey and H.\u00a0A. Priestley. 1990. Introduction to Lattices and Order. Cambridge University Press, Cambridge, UK."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"Manlove David. 2013. Algorithmics of matching under preferences. Vol.\u00a02. World Scientific.  Manlove David. 2013. Algorithmics of matching under preferences. Vol.\u00a02. World Scientific.","DOI":"10.1142\/8591"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/2780722.2781470"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(80)90021-6"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1080\/00029890.1962.11989827"},{"volume-title":"Lattice Theory with Computer Science Applications","author":"Garg K","key":"e_1_3_2_1_10_1","unstructured":"Vijay\u00a0 K Garg . 2015. Lattice Theory with Computer Science Applications . Wiley , New York, NY . Vijay\u00a0K Garg. 2015. Lattice Theory with Computer Science Applications. Wiley, New York, NY."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.DISC.2017.52"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3350755.3400235"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-91081-5_8"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3491003.3491019"},{"key":"e_1_3_2_1_15_1","unstructured":"Vijay\u00a0K. Garg. 2023. A Systematic Approach to Parallel Algorithms. http:\/\/users.ece.utexas.edu\/\u00a0garg\/algo.html.  Vijay\u00a0K. Garg. 2023. A Systematic Approach to Parallel Algorithms. http:\/\/users.ece.utexas.edu\/\u00a0garg\/algo.html."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.2007.07121"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-91081-5_24"},{"volume-title":"The stable marriage problem: structure and algorithms","author":"Gusfield Dan","key":"e_1_3_2_1_18_1","unstructured":"Dan Gusfield and Robert\u00a0 W Irving . 1989. The stable marriage problem: structure and algorithms . MIT press . Dan Gusfield and Robert\u00a0W Irving. 1989. The stable marriage problem: structure and algorithms. MIT press."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-83508-8_35"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(92)00179-P"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICKS.2008.7"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2009.69"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-010-0105-5"},{"key":"e_1_3_2_1_24_1","unstructured":"Donald\u00a0Ervin Knuth. 1997. Stable marriage and its relation to other combinatorial problems: An introduction to the mathematical analysis of algorithms. Vol.\u00a010. American Mathematical Soc.  Donald\u00a0Ervin Knuth. 1997. Stable marriage and its relation to other combinatorial problems: An introduction to the mathematical analysis of algorithms. Vol.\u00a010. American Mathematical Soc."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2805789.2805800"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(01)00322-5"},{"volume-title":"A study of stable marriage problems with ties","author":"Scott Sandy","key":"e_1_3_2_1_27_1","unstructured":"Sandy Scott . 2005. A study of stable marriage problems with ties . University of Glasgow (United Kingdom) . Sandy Scott. 2005. A study of stable marriage problems with ties. University of Glasgow (United Kingdom)."},{"key":"e_1_3_2_1_28_1","volume-title":"The set of super-stable marriages forms a distributive lattice. Discrete applied mathematics 58, 1","author":"Spieker Boris","year":"1995","unstructured":"Boris Spieker . 1995. The set of super-stable marriages forms a distributive lattice. Discrete applied mathematics 58, 1 ( 1995 ), 79\u201384. Boris Spieker. 1995. The set of super-stable marriages forms a distributive lattice. Discrete applied mathematics 58, 1 (1995), 79\u201384."}],"event":{"name":"ICDCN 2023: 24th International Conference on Distributed Computing and Networking","acronym":"ICDCN 2023","location":"Kharagpur India"},"container-title":["Proceedings of the 24th International Conference on Distributed Computing and Networking"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3571306.3571318","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/abs\/10.1145\/3571306.3571318","content-type":"text\/html","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3571306.3571318","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3571306.3571318","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T18:07:53Z","timestamp":1750183673000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3571306.3571318"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1,4]]},"references-count":28,"alternative-id":["10.1145\/3571306.3571318","10.1145\/3571306"],"URL":"https:\/\/doi.org\/10.1145\/3571306.3571318","relation":{},"subject":[],"published":{"date-parts":[[2023,1,4]]},"assertion":[{"value":"2023-01-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}