{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T17:01:30Z","timestamp":1787504490041,"version":"build-2736575974"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2009,5,31]],"date-time":"2009-05-31T00:00:00Z","timestamp":1243728000000},"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":[[2009,5,31]]},"DOI":"10.1145\/1536414.1536430","type":"proceedings-article","created":{"date-parts":[[2009,6,2]],"date-time":"2009-06-02T10:51:13Z","timestamp":1243939873000},"page":"93-100","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["An efficient algorithm for partial order production"],"prefix":"10.1145","author":[{"given":"Jean","family":"Cardinal","sequence":"first","affiliation":[{"name":"Universit\u00e9 Libre de Bruxelles (ULB), Brussels, Belgium"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Samuel","family":"Fiorini","sequence":"additional","affiliation":[{"name":"Universit\u00e9 Libre de Bruxelles (ULB), Brussels, Belgium"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gwena\u00ebl","family":"Joret","sequence":"additional","affiliation":[{"name":"Universit\u00e9 Libre de Bruxelles (ULB), Brussels, Belgium"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rapha\u00ebl M.","family":"Jungers","sequence":"additional","affiliation":[{"name":"Universit\u00e9 catholique de Louvain (UCL), Louvain-la-Neuve, Belgium"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"J. Ian","family":"Munro","sequence":"additional","affiliation":[{"name":"University of Waterloo, Waterloo, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2009,5,31]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(81)90197-7"},{"key":"e_1_3_2_1_2_1","series-title":"NATO Adv","first-page":"169","volume-title":"Graphs and order, Banff, Alta.","author":"Bollobas B.","year":"1984","unstructured":"B. Bollobas and P. Hell . Sorting and graphs . In Graphs and order, Banff, Alta. , 1984 , volume 147 of NATO Adv . Sci. Inst. Ser. C Math. Phys. Sci., pages 169 -- 184 , Dordrecht, 1985. Reidel . B. Bollobas and P. Hell. Sorting and graphs. In Graphs and order, Banff, Alta., 1984, volume 147 of NATO Adv. Sci. Inst. Ser. C Math. Phys. Sci., pages 169--184, Dordrecht, 1985. Reidel."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-007-9076-8"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/139404.139483"},{"key":"e_1_3_2_1_5_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1007\/BFb0049401","volume-title":"Proc. 2nd European Sympositum on Algorithms (ESA '94)","author":"Carlsson S.","year":"1994","unstructured":"S. Carlsson and J. Chen . Some lower bounds for comparison-based algorithms . In Proc. 2nd European Sympositum on Algorithms (ESA '94) , Utrecht, The Netherlands, number 855 in Lecture Notes in Computer Science , pages 106 -- 117 , Berlin, 1994 . Springer-Verlag . S. Carlsson and J. Chen. Some lower bounds for comparison-based algorithms. In Proc. 2nd European Sympositum on Algorithms (ESA '94), Utrecht, The Netherlands, number 855 in Lecture Notes in Computer Science, pages 106--117, Berlin, 1994. Springer-Verlag."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/362588.362602"},{"key":"e_1_3_2_1_7_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/3-540-58325-4_177","volume-title":"Proc. 5th International Symposium on Algorithms and Computation (ISAAC '94)","author":"Chen J.","year":"1994","unstructured":"J. Chen . Average cost to produce partial orders . In D. Du and X. Zhang, editors, Proc. 5th International Symposium on Algorithms and Computation (ISAAC '94) , Beijing, P. R. China, August 25--27, 1994 , volume 834 of Lecture Notes in Computer Science , pages 155 -- 163 . Springer , 1994. J. Chen. Average cost to produce partial orders. In D. Du and X. Zhang, editors, Proc. 5th International Symposium on Algorithms and Computation (ISAAC '94), Beijing, P. R. China, August 25--27, 1994, volume 834 of Lecture Notes in Computer Science, pages 155--163. Springer, 1994."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(75)90041-6"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02122693"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/322261.322264"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(76)90078-5"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/366622.366642"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1995.1077"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00565647"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/11523468_9"},{"key":"e_1_3_2_1_17_1","first-page":"411","volume-title":"Transactions of the 6th Prague Conference on Information Theory","author":"Korner J.","year":"1973","unstructured":"J. Korner . Coding of an information source having ambiguous alphabet and the entropy of graphs . In Transactions of the 6th Prague Conference on Information Theory , pages 411 -- 425 , 1973 . J. Korner. Coding of an information source having ambiguous alphabet and the entropy of graphs. In Transactions of the 6th Prague Conference on Information Theory, pages 411--425, 1973."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/0213049"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(72)90006-4"},{"key":"e_1_3_2_1_20_1","series-title":"SIAM Studies in Applied Mathematics","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970791","volume-title":"Interior-point polynomial algorithms in convex programming","author":"Nesterov Y.","year":"1994","unstructured":"Y. Nesterov and A. Nemirovskii . Interior-point polynomial algorithms in convex programming , volume 13 of SIAM Studies in Applied Mathematics . Society for Industrial and Applied Mathematics (SIAM) , Philadelphia, PA , 1994 . Y. Nesterov and A. Nemirovskii. Interior-point polynomial algorithms in convex programming, volume 13 of SIAM Studies in Applied Mathematics. Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA, 1994."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(02)00729-6"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(95)00150-B"},{"key":"e_1_3_2_1_23_1","series-title":"NATO Adv","first-page":"137","volume-title":"Graphs and order, Banff, Alta.","author":"Saks M. E.","year":"1984","unstructured":"M. E. Saks . The information theoretic bound for problems on ordered sets and graphs. In Graphs and order, Banff, Alta. , 1984 , volume 147 of NATO Adv . Sci. Inst. Ser. C Math. Phys. Sci., pages 137 -- 168 , Dordrecht, 1985. Reidel . M. E. Saks. The information theoretic bound for problems on ordered sets and graphs. In Graphs and order, Banff, Alta., 1984, volume 147 of NATO Adv. Sci. Inst. Ser. C Math. Phys. Sci., pages 137--168, Dordrecht, 1985. Reidel."},{"key":"e_1_3_2_1_24_1","first-page":"229","volume-title":"Ecole Norm. Sup.","author":"Schonhage A.","year":"1975","unstructured":"A. Schonhage . The production of partial orders. In Journees algorithmiques , Ecole Norm. Sup. , Paris , 1975 , pages 229 -- 246 . Asterisque, No. 38--39. Soc. Math. France, Paris, 1976. A. Schonhage. The production of partial orders. In Journees algorithmiques, Ecole Norm. Sup., Paris, 1975, pages 229--246. Asterisque, No. 38--39. Soc. Math. France, Paris, 1976."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/2805882.2806038"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1137\/0218047"}],"event":{"name":"STOC '09: Symposium on Theory of Computing","location":"Bethesda MD USA","acronym":"STOC '09","sponsor":["ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the forty-first annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1536414.1536430","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1536414.1536430","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:38:50Z","timestamp":1750239530000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1536414.1536430"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,5,31]]},"references-count":25,"alternative-id":["10.1145\/1536414.1536430","10.1145\/1536414"],"URL":"https:\/\/doi.org\/10.1145\/1536414.1536430","relation":{},"subject":[],"published":{"date-parts":[[2009,5,31]]},"assertion":[{"value":"2009-05-31","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}