{"id":"https://openalex.org/W2091364485","doi":"https://doi.org/10.1137/090759860","title":"An Efficient Algorithm for Partial Order Production","display_name":"An Efficient Algorithm for Partial Order Production","publication_year":2010,"publication_date":"2010-01-01","ids":{"openalex":"https://openalex.org/W2091364485","doi":"https://doi.org/10.1137/090759860","mag":"2091364485"},"language":"en","primary_location":{"id":"doi:10.1137/090759860","is_oa":false,"landing_page_url":"https://doi.org/10.1137/090759860","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/0811.2572","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Jean Cardinal","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jean Cardinal","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Samuel Fiorini","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Samuel Fiorini","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Gwena\u00ebl Joret","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Gwena\u00ebl Joret","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Rapha\u00ebl M. Jungers","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Rapha\u00ebl M. Jungers","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"J. Ian Munro","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"J. Ian Munro","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.3531,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.81511266,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"39","issue":"7","first_page":"2927","last_page":"2940"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.3046000003814697,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.3046000003814697,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.07500000298023224,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.061799999326467514,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5722000002861023},{"id":"https://openalex.org/keywords/entropy","display_name":"Entropy (arrow of time)","score":0.45489999651908875},{"id":"https://openalex.org/keywords/sorting","display_name":"Sorting","score":0.4496999979019165},{"id":"https://openalex.org/keywords/efficient-algorithm","display_name":"Efficient algorithm","score":0.4325999915599823},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.43209999799728394},{"id":"https://openalex.org/keywords/base","display_name":"Base (topology)","score":0.41600000858306885},{"id":"https://openalex.org/keywords/heap","display_name":"Heap (data structure)","score":0.3935000002384186},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.39149999618530273}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6355000138282776},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5722000002861023},{"id":"https://openalex.org/C106301342","wikidata":"https://www.wikidata.org/wiki/Q4117933","display_name":"Entropy (arrow of time)","level":2,"score":0.45489999651908875},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.4496999979019165},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.4325999915599823},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.43209999799728394},{"id":"https://openalex.org/C42058472","wikidata":"https://www.wikidata.org/wiki/Q810214","display_name":"Base (topology)","level":2,"score":0.41600000858306885},{"id":"https://openalex.org/C134757568","wikidata":"https://www.wikidata.org/wiki/Q274089","display_name":"Heap (data structure)","level":2,"score":0.3935000002384186},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.39149999618530273},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38920000195503235},{"id":"https://openalex.org/C144901957","wikidata":"https://www.wikidata.org/wiki/Q369377","display_name":"Total order","level":3,"score":0.3634999990463257},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3587999939918518},{"id":"https://openalex.org/C180645754","wikidata":"https://www.wikidata.org/wiki/Q474715","display_name":"Partially ordered set","level":2,"score":0.3538999855518341},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3402000069618225},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.334199994802475},{"id":"https://openalex.org/C182359184","wikidata":"https://www.wikidata.org/wiki/Q1756942","display_name":"Partial function","level":2,"score":0.32899999618530273},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3253999948501587},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.296999990940094},{"id":"https://openalex.org/C75553542","wikidata":"https://www.wikidata.org/wiki/Q178161","display_name":"A priori and a posteriori","level":2,"score":0.28600001335144043},{"id":"https://openalex.org/C184264201","wikidata":"https://www.wikidata.org/wiki/Q21199","display_name":"Natural number","level":2,"score":0.28459998965263367},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.28139999508857727},{"id":"https://openalex.org/C188521023","wikidata":"https://www.wikidata.org/wiki/Q6795644","display_name":"Maximal set","level":3,"score":0.2799000144004822},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.26649999618530273},{"id":"https://openalex.org/C2987642246","wikidata":"https://www.wikidata.org/wiki/Q5452196","display_name":"First order","level":2,"score":0.2628999948501587},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.260699987411499},{"id":"https://openalex.org/C108094655","wikidata":"https://www.wikidata.org/wiki/Q181593","display_name":"Sorting algorithm","level":3,"score":0.2556999921798706}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1137/090759860","is_oa":false,"landing_page_url":"https://doi.org/10.1137/090759860","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:0811.2572","is_oa":true,"landing_page_url":"http://arxiv.org/abs/0811.2572","pdf_url":"https://arxiv.org/pdf/0811.2572","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:dial.uclouvain.be:boreal:33598","is_oa":false,"landing_page_url":"http://hdl.handle.net/2078.1/33598","pdf_url":null,"source":{"id":"https://openalex.org/S4306401902","display_name":"Digital Access to Libraries (Universit\u00e9 catholique de Louvain (UCL), l'Universit\u00e9 de Namur (UNamur) and the Universit\u00e9 Saint-Louis (USL-B))","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I95674353","host_organization_name":"UCLouvain","host_organization_lineage":["https://openalex.org/I95674353"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SIAM Journal on Computing, Vol. 39, no. 7, p. 2927-2940 (2010)","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:dipot.ulb.ac.be:2013/49952","is_oa":false,"landing_page_url":"http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/49952","pdf_url":null,"source":{"id":"https://openalex.org/S4306401063","display_name":"D\u00e9p\u00f4t institutionnel de l'Universit\u00e9 libre de Bruxelles (Universit\u00e9 Libre de Bruxelles)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I132053463","host_organization_name":"Universit\u00e9 Libre de Bruxelles","host_organization_lineage":["https://openalex.org/I132053463"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SIAM journal on computing, 39 (7","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:0811.2572","is_oa":true,"landing_page_url":"http://arxiv.org/abs/0811.2572","pdf_url":"https://arxiv.org/pdf/0811.2572","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320320994","display_name":"Canada Research Chairs","ror":"https://ror.org/0517h6h17"},{"id":"https://openalex.org/F4320321390","display_name":"Fonds De La Recherche Scientifique - FNRS","ror":"https://ror.org/03q83t159"},{"id":"https://openalex.org/F4320321584","display_name":"F\u00e9d\u00e9ration Wallonie-Bruxelles","ror":"https://ror.org/04q01pf08"},{"id":"https://openalex.org/F4320334593","display_name":"Natural Sciences and Engineering Research Council of Canada","ror":"https://ror.org/01h531d29"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1969562600","https://openalex.org/W1974618846","https://openalex.org/W1974745849","https://openalex.org/W1977529491","https://openalex.org/W1979423085","https://openalex.org/W1983854113","https://openalex.org/W1997998268","https://openalex.org/W2000337320","https://openalex.org/W2007732780","https://openalex.org/W2058408846","https://openalex.org/W2065949117","https://openalex.org/W2072370430","https://openalex.org/W2082357899","https://openalex.org/W2169744769","https://openalex.org/W2914578136","https://openalex.org/W4213266528"],"related_works":[],"abstract_inverted_index":{"We":[0,46,118,151],"consider":[1],"the":[2,9,54,60,63,75,82,91,112,121,156,159,176],"problem":[3,122],"of":[4,11,30,62,77,133,142,158,175],"partial":[5,84,93,102,161],"order":[6,94,98,103],"production:":[7],"arrange":[8],"elements":[10],"an":[12,48,125],"unknown":[13],"totally":[14],"ordered":[15,22],"set":[16,23],"T":[17],"into":[18],"a":[19,27,69,96,101,105,140,163,172],"target":[20,83,92,160],"partially":[21],"S":[24],"by":[25,38,95,123],"comparing":[26],"minimum":[28],"number":[29,76],"pairs":[31],"in":[32,53],"T.":[33],"Special":[34],"cases":[35],"include":[36],"sorting":[37],"comparisons,":[39],"selection,":[40,42],"multiple":[41,127],"and":[43,66,170],"heap":[44],"construction.":[45],"give":[47],"algorithm":[49,135],"performing":[50],"$ITLB+o(ITLB)+O(n)$":[51],"comparisons":[52,78],"worst":[55],"case.":[56],"Here,":[57],"n":[58],"denotes":[59,68],"size":[61],"ground":[64],"sets,":[65],"$ITLB$":[67],"natural":[70],"information-theoretic":[71,113,177],"lower":[72,114,178],"bound":[73,115],"on":[74,155],"needed":[79],"to":[80,89],"produce":[81],"order.":[85],"Our":[86],"approach":[87],"is":[88,136],"replace":[90],"weak":[97],"(that":[99],"is,":[100],"with":[104],"layered":[106],"structure)":[107],"extending":[108],"it,":[109],"without":[110],"increasing":[111],"too":[116],"much.":[117],"then":[119],"solve":[120],"applying":[124],"efficient":[126],"selection":[128],"algorithm.":[129],"The":[130],"overall":[131],"complexity":[132],"our":[134,153],"polynomial.":[137],"This":[138],"answers":[139],"question":[141],"Yao":[143],"[SIAM":[144],"J.":[145],"Comput.,":[146],"18":[147],"(1989),":[148],"pp.":[149],"679\u2013689].":[150],"base":[152],"analysis":[154],"entropy":[157],"order,":[162],"quantity":[164],"that":[165],"can":[166],"be":[167],"efficiently":[168],"computed":[169],"provides":[171],"good":[173],"estimate":[174],"bound.":[179]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2016-06-24T00:00:00"}