{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T14:50:37Z","timestamp":1777647037816,"version":"3.51.4"},"reference-count":0,"publisher":"SAGE Publications","issue":"1-2","license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Fundamenta Informaticae"],"published-print":{"date-parts":[[2009,1]]},"abstract":"<jats:p>We show that any comparison based, randomized algorithm to approximate any given ranking of n items within expected Spearman's footrule distance n ^{2} \/\u03bd(n) needs at least<\/jats:p>\n                  <jats:p>n (min{log \u03bd(n), log n} \u2212 6)<\/jats:p>\n                  <jats:p>comparisons in the worst case. This bound is tight up to a constant factor since there exists a deterministic algorithm that shows that 6n log (n) comparisons are always sufficient.<\/jats:p>","DOI":"10.3233\/fi-2009-0005","type":"journal-article","created":{"date-parts":[[2019,12,2]],"date-time":"2019-12-02T22:20:05Z","timestamp":1575325205000},"page":"67-72","source":"Crossref","is-referenced-by-count":2,"title":["Approximate Sorting"],"prefix":"10.1177","volume":"90","author":[{"given":"Joachim","family":"Giesen","sequence":"first","affiliation":[{"name":"Max Plank Institute for Computer Science,\r\t\t\t Saarbr\u00fccken, Germany. jgiesen@mpi-inf.mpg.de"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eva","family":"Schuberth","sequence":"additional","affiliation":[{"name":"Institute for Theoretical Computer Science, ETH\r\t\t\t Zurich, Switzerland. eva.schuberth@inf.ethz.ch"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Milo\u0161","family":"Stojakovi\u0107","sequence":"additional","affiliation":[{"name":"Department of Mathematics and Informatics, University\r\t\t\t of Novi Sad, Serbia. smilos@inf.ethz.ch"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[2009,1,1]]},"container-title":["Fundamenta Informaticae"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/FI-2009-0005","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/FI-2009-0005","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T06:37:15Z","timestamp":1777444635000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/FI-2009-0005"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,1]]},"references-count":0,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2009,1]]}},"alternative-id":["10.3233\/FI-2009-0005"],"URL":"https:\/\/doi.org\/10.3233\/fi-2009-0005","relation":{},"ISSN":["0169-2968","1875-8681"],"issn-type":[{"value":"0169-2968","type":"print"},{"value":"1875-8681","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,1]]}}}