{"id":15069,"date":"2022-06-16T20:37:13","date_gmt":"2022-06-17T00:37:13","guid":{"rendered":"https:\/\/carleton.ca\/scs\/?page_id=15069"},"modified":"2026-06-08T15:08:38","modified_gmt":"2026-06-08T19:08:38","slug":"tr-218-a-time-randomness-tradeoff-for-selection-in-parallel","status":"publish","type":"page","link":"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1993\/tr-218-a-time-randomness-tradeoff-for-selection-in-parallel\/","title":{"rendered":"TR-218: A Time-Randomness Tradeoff for Selection in Parallel"},"content":{"rendered":"\n<section class=\"w-screen px-6 cu-section cu-section--white ml-offset-center md:px-8 lg:px-14\">\n    <div class=\"space-y-6 cu-max-w-child-5xl  md:space-y-10 cu-prose-first-last\">\n\n            <div class=\"cu-textmedia flex flex-col lg:flex-row mx-auto gap-6 md:gap-10 my-6 md:my-12 first:mt-0 max-w-5xl\">\n        <div class=\"justify-start cu-textmedia-content cu-prose-first-last\" style=\"flex: 0 0 100%;\">\n            <header class=\"font-light prose-xl cu-pageheader md:prose-2xl cu-component-updated cu-prose-first-last\">\n                                    <h1 class=\"cu-prose-first-last font-semibold !mt-2 mb-4 md:mb-6 relative after:absolute after:h-px after:bottom-0 after:bg-cu-red after:left-px text-3xl md:text-4xl lg:text-5xl lg:leading-[3.5rem] pb-5 after:w-10 text-cu-black-700 not-prose\">\n                        TR-218: A Time-Randomness Tradeoff for Selection in Parallel\n                    <\/h1>\n                \n                                \n                            <\/header>\n\n                    <\/div>\n\n            <\/div>\n\n    <\/div>\n<\/section>\n\n\n\n<p>Carleton University<br><a href=\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1993\/\">Technical Report<\/a>&nbsp;<strong>TR-218<\/strong><br>February 1993<\/p>\n\n\n\n<h2 id=\"a-time-randomness-tradeoff-for-selection-in-parallel\" class=\"wp-block-heading\">A Time-Randomness Tradeoff for Selection in Parallel<\/h2>\n\n\n\n<p>Danny&nbsp;Krizanc<\/p>\n\n\n\n<h3 id=\"abstract\" class=\"wp-block-heading\">Abstract<\/h3>\n\n\n\n<p>In this paper we study the problem finding the median on a par\u00adallel comparison tree (PCT). Results due to Valiant [Va], Meggido [Me] and Reishcuk [Re] show a provable gap between the randomized and deterministic parallel complexity of selection. We prove a tight tradeoff between the amount of randomness used by an algorithm for this problem and its performance, measured by the time it requires to complete its computation with a given failure probability. The tradeoff provides a smooth bridge between the deterministic and randomized complexity of the problem.<\/p>\n\n\n\n<p><a href=\"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/sites\/260\/TR-218.pdf\">TR-218.pdf<\/a><\/p>\n","protected":false},"excerpt":{"rendered":"<p>Carleton UniversityTechnical Report&nbsp;TR-218February 1993 A Time-Randomness Tradeoff for Selection in Parallel Danny&nbsp;Krizanc Abstract In this paper we study the problem finding the median on a par\u00adallel comparison tree (PCT). Results due to Valiant [Va], Meggido [Me] and Reishcuk [Re] show a provable gap between the randomized and deterministic parallel complexity of selection. We prove a [&hellip;]<\/p>\n","protected":false},"author":2,"featured_media":0,"parent":11912,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"_acf_changed":false,"_cu_dining_location_slug":"","footnotes":"","_links_to":"","_links_to_target":""},"cu_page_type":[],"class_list":["post-15069","page","type-page","status-publish","hentry"],"acf":{"cu_post_thumbnail":""},"_links":{"self":[{"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/15069","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/comments?post=15069"}],"version-history":[{"count":4,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/15069\/revisions"}],"predecessor-version":[{"id":24464,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/15069\/revisions\/24464"}],"up":[{"embeddable":true,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/11912"}],"wp:attachment":[{"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/media?parent=15069"}],"wp:term":[{"taxonomy":"cu_page_type","embeddable":true,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/cu_page_type?post=15069"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}