{"id":11912,"date":"2021-10-26T10:52:19","date_gmt":"2021-10-26T14:52:19","guid":{"rendered":"https:\/\/carleton.ca\/scs\/?page_id=11912"},"modified":"2026-06-10T10:03:50","modified_gmt":"2026-06-10T14:03:50","slug":"technical-reports-1993","status":"publish","type":"page","link":"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1993\/","title":{"rendered":"Technical Reports 1993"},"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                        Technical Reports 1993\n                    <\/h1>\n                \n                                \n                                    \n\n<div class=\"wp-block-buttons is-layout-flex wp-block-buttons-is-layout-flex\">\n<div class=\"wp-block-button\"><a class=\"wp-block-button__link wp-element-button\" href=\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/\">Search Reports by Year<\/a><\/div>\n<\/div>\n\n\n                            <\/header>\n\n                    <\/div>\n\n            <\/div>\n\n    <\/div>\n<\/section>\n\n\n\n<figure class=\"wp-block-table\"><table class=\"has-fixed-layout\"><thead><tr><th>Number<\/th><th>Title<\/th><th>Authors<\/th><th>Date<\/th><th>Download<\/th><\/tr><\/thead><tbody><tr><td>TR-218<\/td><td><a href=\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1993\/tr-218-a-time-randomness-tradeoff-for-selection-in-parallel\/\" type=\"link\" id=\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1993\/tr-218-a-time-randomness-tradeoff-for-selection-in-parallel\/\">A Time-Randomness Tradeoff for Selection in Parallel<\/a><\/td><td>Danny&nbsp;Krizanc<\/td><td>February 1993<\/td><td><a href=\"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/sites\/260\/TR-218.pdf\" type=\"link\" id=\"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/sites\/260\/TR-218.pdf\">TR-218<\/a><a href=\"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/sites\/260\/TR-218.pdf\">.pdf<\/a><\/td><\/tr><tr><td>TR-219<\/td><td><a href=\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1993\/tr-219-three-algorithms-for-selection-on-the-reconfigurable-mesh\/\">Three Algorithms for Selection on the Reconfigurable Mesh<\/a><\/td><td>Dipak Pravin Doctor &amp; Danny Krizanc<\/td><td>February 1993<\/td><td><a href=\"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/sites\/260\/TR-219.pdf\">TR-219.pdf<\/a><\/td><\/tr><tr><td>TR-220<\/td><td><a href=\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1993\/tr-220-on-multi-label-linear-interval-routing-schemes\/\" type=\"link\" id=\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1993\/tr-220-on-multi-label-linear-interval-routing-schemes\/\">On Multi-label Linear Interval Routing Schemes<\/a><\/td><td>Evangelos Kranakis, Danny Krizanc, S.S. Ravi<\/td><td>March 1993<\/td><td><a href=\"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/sites\/260\/TR-220.pdf\">TR-220.pdf<\/a><\/td><\/tr><tr><td>TR-221<\/td><td><a href=\"http:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1993\/tr-221-note-on-systems-of-polynomial-equations-over-finite-fields\/\" type=\"link\" id=\"carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1993\/tr-221-note-on-systems-of-polynomial-equations-over-finite-fields\/\">Note on Systems of Polynomial Equations over Finite Fields<\/a><\/td><td>Vincenzo Acciaro<\/td><td>March 1993<\/td><td><a href=\"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/sites\/260\/TR-221.pdf\" type=\"link\" id=\"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/sites\/260\/TR-221.pdf\">TR-221.pdf<\/a><\/td><\/tr><tr><td>TR-222<\/td><td><a href=\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1993\/tr-222-time-message-trade-offs-for-the-weak-unison-problem\/\" type=\"link\" id=\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1993\/tr-222-time-message-trade-offs-for-the-weak-unison-problem\/\">Time-Message Trade-Offs for the Weak Unison Problem<\/a><\/td><td>Amos Israeli, Evangelos Kranakis, Danny Krizanc, Nicola Santoro<\/td><td>March 1993<\/td><td><a href=\"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/sites\/260\/TR-222.pdf\" type=\"link\" id=\"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/sites\/260\/TR-222.pdf\">TR-222.pdf<\/a><\/td><\/tr><tr><td>TR-223<\/td><td><a href=\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1993\/tr-223-anonymous-wireless-rings\/\" type=\"link\" id=\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1993\/tr-223-anonymous-wireless-rings\/\">Anonymous Wireless Rings<\/a><\/td><td>Krzysztof Diks, Evangelos Kranakis, Adam Malinowski, Andrzej Pelc<\/td><td>April 1993<\/td><td><a href=\"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/sites\/260\/TR-223.pdf\">TR-223.pdf<\/a><\/td><\/tr><tr><td>TR-224<\/td><td><a href=\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1993\/tr-224-a-consistent-model-for-noisy-channels-permitting-arbitrarily-distributed-substitutions-insertions-and-deletions\/\" type=\"link\" id=\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1993\/tr-224-a-consistent-model-for-noisy-channels-permitting-arbitrarily-distributed-substitutions-insertions-and-deletions\/\">A consistent model for noisy channels permitting arbitrarily distributed substitutions, insertions and deletions<\/a><\/td><td>B.J. Oommen &amp; R.L. Kashyap<\/td><td>June 1993<\/td><td><a href=\"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/sites\/260\/TR-224.pdf\" type=\"link\" id=\"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/sites\/260\/TR-224.pdf\">TR-224.pdf<\/a><\/td><\/tr><tr><td>TR-225<\/td><td><a href=\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1993\/tr-225-mixture-decomposition-for-distributions-from-the-exponential-family-using-a-generalized-method-of-moments\/\">Mixture Decomposition for Distributions from the Exponential Family Using a Generalized Method of Moments<\/a><\/td><td>S.T. Sum &amp; B.J. Oommen<\/td><td>June 1993<\/td><td><a href=\"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/sites\/260\/TR225.pdf\">TR-225.pdf<\/a><\/td><\/tr><tr><td>TR-226<\/td><td><a href=\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1993\/tr-226-switching-models-for-non-stationary-random-environments\/\" type=\"link\" id=\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1993\/tr-226-switching-models-for-non-stationary-random-environments\/\">Switching Models for Non-Stationary Random Environments<\/a><\/td><td>B. John Oommen &amp; Hassan Masum<\/td><td>July 1993<\/td><td><a href=\"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/sites\/260\/TR226.pdf\" type=\"link\" id=\"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/sites\/260\/TR226.pdf\">TR-226.pdf<\/a><\/td><\/tr><tr><td>TR-227<\/td><td><a href=\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1993\/tr-227-the-probability-of-generating-some-common-families-of-finite-groups\/\" type=\"link\" id=\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1993\/tr-227-the-probability-of-generating-some-common-families-of-finite-groups\/\">The Probability of Generating Some Common Families of Finite Groups<\/a><\/td><td>Vincenzo Acciaro<\/td><td>November 1993<\/td><td><a href=\"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/sites\/260\/TR-227.pdf\" type=\"link\" id=\"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/sites\/260\/TR-227.pdf\">TR-227.pdf<\/a><\/td><\/tr><tr><td>TR-228<\/td><td><a href=\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1993\/tr-228-power-roots-of-polynomials-over-arbitrary-fields\/\" type=\"link\" id=\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1993\/tr-228-power-roots-of-polynomials-over-arbitrary-fields\/\">Power Roots of Polynomials over Arbitrary Fields<\/a><\/td><td>Vincenzo Acciaro<\/td><td>September 1993<\/td><td><a href=\"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/sites\/260\/TR-228.pdf\" type=\"link\" id=\"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/sites\/260\/TR-228.pdf\">TR-228.pdf<\/a><\/td><\/tr><tr><td>TR-229<\/td><td><a href=\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1993\/tr-229-optimal-parallel-algorithms-for-direct-dominance-problems\/\" type=\"link\" id=\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1993\/tr-229-optimal-parallel-algorithms-for-direct-dominance-problems\/\">Optimal Parallel Algorithms for Direct Dominance Problems<\/a><\/td><td>Amitava Datta, Anil Maheshwari , J\u00f6rg-R\u00fcdiger Sack<\/td><td>October 1993<\/td><td><a href=\"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/sites\/260\/TR-229.pdf\" type=\"link\" id=\"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/sites\/260\/TR-229.pdf\">TR-229.pdf<\/a><\/td><\/tr><tr><td>TR-230<\/td><td><a href=\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1993\/tr-230-uniform-generation-of-forests-of-restricted-height\/\">Uniform Generation of Forests of Restricted Height<\/a><\/td><td>M.D. Atkinson &amp; J.-R. Sack<\/td><td>October 1993<\/td><td><a href=\"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/sites\/260\/TR-230.pdf\" type=\"link\" id=\"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/sites\/260\/TR-230.pdf\">TR-230.pdf<\/a><\/td><\/tr><tr><td>TR-231<\/td><td><a href=\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1993\/tr-231-optimal-elections-in-labeled-hypercubes\/\" type=\"link\" id=\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1993\/tr-231-optimal-elections-in-labeled-hypercubes\/\">Optimal Elections in Labeled Hypercubes<\/a><\/td><td>Paola Flocchini &amp; Bernard Mans<\/td><td>December 1993<\/td><td><a href=\"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/sites\/260\/TR-231.pdf\" type=\"link\" id=\"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/sites\/260\/TR-231.pdf\">TR-231.pdf<\/a><\/td><\/tr><tr><td>TR-232<\/td><td><a href=\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1993\/tr-232-on-the-complexity-of-computing-grobner-bases-in-characteristic-2\/\" type=\"link\" id=\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1993\/tr-232-on-the-complexity-of-computing-grobner-bases-in-characteristic-2\/\">On the Complexity of Computing Gr\u00f6bner Bases in Characteristic 2<\/a><\/td><td>Vincenzo Acciaro<\/td><td>December 1993<\/td><td><a href=\"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/sites\/260\/TR-232.pdf\" type=\"link\" id=\"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/sites\/260\/TR-232.pdf\">TR-232.pdf<\/a><\/td><\/tr><\/tbody><\/table><\/figure>\n","protected":false},"excerpt":{"rendered":"<p>Number Title Authors Date Download TR-218 A Time-Randomness Tradeoff for Selection in Parallel Danny&nbsp;Krizanc February 1993 TR-218.pdf TR-219 Three Algorithms for Selection on the Reconfigurable Mesh Dipak Pravin Doctor &amp; Danny Krizanc February 1993 TR-219.pdf TR-220 On Multi-label Linear Interval Routing Schemes Evangelos Kranakis, Danny Krizanc, S.S. Ravi March 1993 TR-220.pdf TR-221 Note on Systems [&hellip;]<\/p>\n","protected":false},"author":2,"featured_media":0,"parent":11593,"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-11912","page","type-page","status-publish","hentry"],"acf":{"cu_post_thumbnail":""},"_links":{"self":[{"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/11912","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=11912"}],"version-history":[{"count":5,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/11912\/revisions"}],"predecessor-version":[{"id":24643,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/11912\/revisions\/24643"}],"up":[{"embeddable":true,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/11593"}],"wp:attachment":[{"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/media?parent=11912"}],"wp:term":[{"taxonomy":"cu_page_type","embeddable":true,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/cu_page_type?post=11912"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}