{"id":"https://openalex.org/W2028159002","doi":"https://doi.org/10.1145/1806689.1806740","title":"Sorting under partial information (without the ellipsoid algorithm)","display_name":"Sorting under partial information (without the ellipsoid algorithm)","publication_year":2010,"publication_date":"2010-06-05","ids":{"openalex":"https://openalex.org/W2028159002","doi":"https://doi.org/10.1145/1806689.1806740","mag":"2028159002"},"language":"en","primary_location":{"id":"doi:10.1145/1806689.1806740","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1806689.1806740","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-second ACM symposium on Theory of computing","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5011369568","display_name":"Jean Cardinal","orcid":"https://orcid.org/0000-0002-2312-0967"},"institutions":[{"id":"https://openalex.org/I132053463","display_name":"Universit\u00e9 Libre de Bruxelles","ror":"https://ror.org/01r9htc13","country_code":"BE","type":"education","lineage":["https://openalex.org/I132053463"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"Jean Cardinal","raw_affiliation_strings":["Universit\u00e9 Libre de Bruxelles (ULB), Brussels, Belgium"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e9 Libre de Bruxelles (ULB), Brussels, Belgium","institution_ids":["https://openalex.org/I132053463"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5001781037","display_name":"Samuel Fiorini","orcid":"https://orcid.org/0000-0002-6845-9008"},"institutions":[{"id":"https://openalex.org/I132053463","display_name":"Universit\u00e9 Libre de Bruxelles","ror":"https://ror.org/01r9htc13","country_code":"BE","type":"education","lineage":["https://openalex.org/I132053463"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"Samuel Fiorini","raw_affiliation_strings":["Universit\u00e9 Libre de Bruxelles (ULB), Brussels, Belgium"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e9 Libre de Bruxelles (ULB), Brussels, Belgium","institution_ids":["https://openalex.org/I132053463"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5038947183","display_name":"Gwena\u00ebl Joret","orcid":"https://orcid.org/0000-0002-7157-6694"},"institutions":[{"id":"https://openalex.org/I132053463","display_name":"Universit\u00e9 Libre de Bruxelles","ror":"https://ror.org/01r9htc13","country_code":"BE","type":"education","lineage":["https://openalex.org/I132053463"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"Gwena\u00ebl Joret","raw_affiliation_strings":["Universit\u00e9 Libre de Bruxelles (ULB), Brussels, Belgium"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e9 Libre de Bruxelles (ULB), Brussels, Belgium","institution_ids":["https://openalex.org/I132053463"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5056625594","display_name":"Rapha\u00ebl M. Jungers","orcid":"https://orcid.org/0000-0002-7789-0940"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Rapha\u00ebl M. Jungers","raw_affiliation_strings":["Massachusetts Institute of Technology (MIT), Cambridge, MA, USA","Massachusetts Institute of Technology (MIT), Cambridge, MA, USA;"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology (MIT), Cambridge, MA, USA","institution_ids":["https://openalex.org/I63966007"]},{"raw_affiliation_string":"Massachusetts Institute of Technology (MIT), Cambridge, MA, USA;","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5108095454","display_name":"J. Ian Munro","orcid":null},"institutions":[{"id":"https://openalex.org/I151746483","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68","country_code":"CA","type":"education","lineage":["https://openalex.org/I151746483"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"J. Ian Munro","raw_affiliation_strings":["University of Waterloo, Waterloo, ON, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Waterloo, Waterloo, ON, Canada","institution_ids":["https://openalex.org/I151746483"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"359","last_page":"368"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9995999932289124,"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"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9995999932289124,"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/T10948","display_name":"Advanced Combinatorial Mathematics","score":0.9979000091552734,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9977999925613403,"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/sorting","display_name":"Sorting","score":0.6908813714981079},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.6703425645828247},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6350476145744324},{"id":"https://openalex.org/keywords/pairwise-comparison","display_name":"Pairwise comparison","score":0.6327073574066162},{"id":"https://openalex.org/keywords/ellipsoid","display_name":"Ellipsoid","score":0.6267024278640747},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.5589355230331421},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5538983941078186},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.520102858543396},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5167721509933472},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5054628849029541},{"id":"https://openalex.org/keywords/linear-extension","display_name":"Linear extension","score":0.5044668912887573},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.49831628799438477},{"id":"https://openalex.org/keywords/sorting-algorithm","display_name":"Sorting algorithm","score":0.49779796600341797},{"id":"https://openalex.org/keywords/sort","display_name":"sort","score":0.4718964993953705},{"id":"https://openalex.org/keywords/ellipsoid-method","display_name":"Ellipsoid method","score":0.44844821095466614},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4258619546890259},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.41645175218582153},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.29619717597961426},{"id":"https://openalex.org/keywords/partially-ordered-set","display_name":"Partially ordered set","score":0.1129339337348938},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.09212541580200195},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.07330048084259033}],"concepts":[{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.6908813714981079},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.6703425645828247},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6350476145744324},{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.6327073574066162},{"id":"https://openalex.org/C57489055","wikidata":"https://www.wikidata.org/wiki/Q190046","display_name":"Ellipsoid","level":2,"score":0.6267024278640747},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.5589355230331421},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5538983941078186},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.520102858543396},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5167721509933472},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5054628849029541},{"id":"https://openalex.org/C129393996","wikidata":"https://www.wikidata.org/wiki/Q6553442","display_name":"Linear extension","level":3,"score":0.5044668912887573},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.49831628799438477},{"id":"https://openalex.org/C108094655","wikidata":"https://www.wikidata.org/wiki/Q181593","display_name":"Sorting algorithm","level":3,"score":0.49779796600341797},{"id":"https://openalex.org/C88548561","wikidata":"https://www.wikidata.org/wiki/Q347599","display_name":"sort","level":2,"score":0.4718964993953705},{"id":"https://openalex.org/C205451395","wikidata":"https://www.wikidata.org/wiki/Q378574","display_name":"Ellipsoid method","level":5,"score":0.44844821095466614},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4258619546890259},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.41645175218582153},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.29619717597961426},{"id":"https://openalex.org/C180645754","wikidata":"https://www.wikidata.org/wiki/Q474715","display_name":"Partially ordered set","level":2,"score":0.1129339337348938},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.09212541580200195},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.07330048084259033},{"id":"https://openalex.org/C1276947","wikidata":"https://www.wikidata.org/wiki/Q333","display_name":"Astronomy","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C111110010","wikidata":"https://www.wikidata.org/wiki/Q2627315","display_name":"Convex combination","level":4,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.0},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/1806689.1806740","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1806689.1806740","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-second ACM symposium on Theory of computing","raw_type":"proceedings-article"},{"id":"pmh:oai:dial.uclouvain.be:boreal:94183","is_oa":false,"landing_page_url":"http://hdl.handle.net/2078.1/94183","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":"","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:oai:dipot.ulb.ac.be:2013/70572","is_oa":false,"landing_page_url":"http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/70572","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":"Proceedings of the annual ACM Symposium on Theory of Computing","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W86626612","https://openalex.org/W144954708","https://openalex.org/W1971496971","https://openalex.org/W1974745849","https://openalex.org/W1977529491","https://openalex.org/W1979423085","https://openalex.org/W1984115717","https://openalex.org/W1997998268","https://openalex.org/W2007732780","https://openalex.org/W2029773437","https://openalex.org/W2031966632","https://openalex.org/W2041563000","https://openalex.org/W2056461053","https://openalex.org/W2057647623","https://openalex.org/W2061329886","https://openalex.org/W2069153338","https://openalex.org/W2072370430","https://openalex.org/W2074450708","https://openalex.org/W2074512843","https://openalex.org/W2082319307","https://openalex.org/W2091505308","https://openalex.org/W2093744170","https://openalex.org/W2143474538","https://openalex.org/W2171349910","https://openalex.org/W2296319761","https://openalex.org/W2568492033","https://openalex.org/W2623873233","https://openalex.org/W3098381999","https://openalex.org/W3105866818","https://openalex.org/W4213266528"],"related_works":["https://openalex.org/W2235431948","https://openalex.org/W2031732959","https://openalex.org/W7739709","https://openalex.org/W2016090484","https://openalex.org/W1500330311","https://openalex.org/W2562629174","https://openalex.org/W2061711344","https://openalex.org/W2169170556","https://openalex.org/W2034124193","https://openalex.org/W2993619238"],"abstract_inverted_index":{"We":[0],"revisit":[1],"the":[2,15,34,53,59,65,69,96,109,117],"well-known":[3],"problem":[4,35,97],"of":[5,17,22,43,55,68,71,74],"sorting":[6],"under":[7],"partial":[8],"information:":[9],"sort":[10],"a":[11,27,77,92,103],"finite":[12],"set":[13,30],"given":[14],"outcomes":[16],"comparisons":[18,56],"between":[19],"some":[20],"pairs":[21],"elements.":[23],"The":[24,48],"input":[25],"is":[26,62],"partially":[28],"ordered":[29],"$P$,":[31],"and":[32,82],"solving":[33],"amounts":[36],"to":[37,102],"discovering":[38],"an":[39],"unknown":[40],"linear":[41,72],"extension":[42],"P,":[44],"using":[45],"pairwise":[46],"comparisons.":[47],"information-theoretic":[49],"lower":[50],"bound":[51,100],"on":[52],"number":[54,70],"needed":[57],"in":[58],"worst":[60],"case":[61],"log":[63],"e(P),":[64],"binary":[66],"logarithm":[67],"extensions":[73],"$P$.":[75],"In":[76],"breakthrough":[78],"paper,":[79],"Jeff":[80],"Kahn":[81],"Jeong":[83],"Han":[84],"Kim":[85],"(STOC":[86],"1992)":[87],"showed":[88],"that":[89],"there":[90],"exists":[91],"polynomial-time":[93],"algorithm":[94,107,111],"for":[95,115],"achieving":[98],"this":[99],"up":[101],"constant":[104],"factor.":[105],"Their":[106],"invokes":[108],"ellipsoid":[110],"at":[112],"each":[113],"iteration":[114],"determining":[116],"next":[118],"comparison,":[119],"making":[120],"it":[121],"impractical.":[122]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":3}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}