{"id":11903,"date":"2021-10-26T10:49:53","date_gmt":"2021-10-26T14:49:53","guid":{"rendered":"https:\/\/carleton.ca\/scs\/?page_id=11903"},"modified":"2026-06-10T10:03:19","modified_gmt":"2026-06-10T14:03:19","slug":"technical-reports-1989","status":"publish","type":"page","link":"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1989\/","title":{"rendered":"Technical Reports 1989"},"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 1989\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-150<\/td><td>A General Design Methodology for Dictionary Machines<\/td><td>Frank Dehne &amp; Nicola Santoro<\/td><td>February 1989<\/td><td>N\/A<\/td><\/tr><tr><td>TR-151<\/td><td><a href=\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1989\/tr-149-smallscript-a-user-programmable-framework-based-on-smalltalk-and-postscript\/\">On Doubly Linked List ReOrganizing Heuristics<\/a><\/td><td>D.T.H. Ng &amp; B. John Oommen<\/td><td>February 1989<\/td><td><a href=\"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/sites\/260\/tr-151.pdf\" type=\"link\" id=\"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/sites\/260\/tr-151.pdf\">TR-151.p<\/a><a href=\"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/sites\/260\/tr-151.pdf\">df<\/a><\/td><\/tr><tr><td>TR-152<\/td><td>Implementing Data Structures on a Hypercube Multiprocessor, and Applications in Parallel Computational Geometry<\/td><td>Frank Dehne &amp; Andrew Rau-Chaplin<\/td><td>March 1989<\/td><td>N\/A<\/td><\/tr><tr><td>TR-153<\/td><td><a href=\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1989\/tr-153-the-use-of-chi-squared-statistics-in-determining-dependence-trees\/\">The Use of Chi-Squared Statistics in Determining Dependence Trees<\/a><\/td><td>R.S. Valiveti &amp; B.J. Oommen<\/td><td>March 1989<\/td><td><a href=\"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/sites\/260\/tr-153.pdf\">TR-153.pdf<\/a><\/td><\/tr><tr><td>TR-154<\/td><td><a href=\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1989\/tr-154-ideal-list-organization-for-stationary-environments\/\">Ideal List Organization for Stationary Environments<\/a><\/td><td>B. John Oommen &amp; David T.H. Ng<\/td><td>March 1989<\/td><td><a href=\"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/sites\/260\/tr-154.pdf\">TR-154.pdf<\/a><\/td><\/tr><tr><td>TR-155<\/td><td><a href=\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1989\/tr-155-hot-spot-contention-in-binary-hypercube-networks\/\">Hot-Spot Contention in Binary Hypercube Networks<\/a><\/td><td>Sivarama P. Dandamudi &amp; Derek L. Eager<\/td><td>April 1989<\/td><td><a href=\"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/sites\/260\/TR-155.pdf\">TR-155.pdf<\/a><\/td><\/tr><tr><td>TR-156<\/td><td><a href=\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1989\/tr-156-some-issues-in-hierarchical-interconnection-network-design\/\">Some Issues in Hierarchical Interconnection Network Design<\/a><\/td><td>Sivarama P. Dandamudi &amp; Derek L. Eager<\/td><td>April 1989<\/td><td><a href=\"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/sites\/260\/TR-156.pdf\">TR-156.pdf<\/a><\/td><\/tr><tr><td>TR-157<\/td><td><a href=\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1989\/tr-157-discretized-pursuit-linear-reward-inaction-automata\/\" type=\"link\" id=\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1989\/tr-157-discretized-pursuit-linear-reward-inaction-automata\/\">Discretized Pursuit Linear Reward-Inaction Automata<\/a><\/td><td>B.J. Oommen &amp; Joseph K. Lanctot<\/td><td>April 1989<\/td><td><a href=\"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/sites\/260\/TR-157.pdf\">TR-1<\/a><a href=\"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/sites\/260\/TR-157.pdf\">57.pdf<\/a><\/td><\/tr><tr><td>TR-158<\/td><td><a href=\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1989\/tr-158-parallel-fractional-cascading-on-a-hypercube-multiprocessor\/\">Parallel Fractional Cascading on a Hypercube Multiprocessor<\/a><\/td><td>Frank Dehne, Afonso Ferreira, Andrew Rau-Chaplin<\/td><td>April 1989<\/td><td><a href=\"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/sites\/260\/TR-158.pdf\">TR-158.pdf<\/a><\/td><\/tr><tr><td>TR-159<\/td><td><a href=\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1989\/tr-159-epsilon-optimal-stubborn-learning-mechanisms\/\">Epsilon-Optimal Stubborn Learning Mechanisms<\/a><\/td><td>J.P.R. Christensen &amp; B.J. Oommen<\/td><td>June 1989<\/td><td><a href=\"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/sites\/260\/TR-159.pdf\">TR-159.pdf<\/a><\/td><\/tr><tr><td>TR-160<\/td><td><a href=\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1989\/tr-160-disassembling-two-dimensional-composite-parts-via-translations\/\" type=\"link\" id=\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1989\/tr-160-disassembling-two-dimensional-composite-parts-via-translations\/\">Disassembling Two-Dimensional Composite Parts Via Translations<\/a><\/td><td>Doron Nussbaum &amp; J\u00f6rg-R. Sack<\/td><td>June 1989<\/td><td><a href=\"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/sites\/260\/TR-160.pdf\">TR-160.pdf<\/a><\/td><\/tr><tr><td>TR-162<\/td><td><a href=\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1989\/tr-162-an-adaptive-learning-solution-to-the-keyboard-optimization-problem\/\">An Adaptive Learning Solution to the Keyboard Optimization Problem<\/a><\/td><td>B.J. Oommen, J.S. Valiveti and J. Zgierski<\/td><td>October 1989<\/td><td><a href=\"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/sites\/260\/TR-162.pdf\">TR-162.pdf<\/a><\/td><\/tr><\/tbody><\/table><\/figure>\n","protected":false},"excerpt":{"rendered":"<p>Number Title Authors Date Download TR-150 A General Design Methodology for Dictionary Machines Frank Dehne &amp; Nicola Santoro February 1989 N\/A TR-151 On Doubly Linked List ReOrganizing Heuristics D.T.H. Ng &amp; B. John Oommen February 1989 TR-151.pdf TR-152 Implementing Data Structures on a Hypercube Multiprocessor, and Applications in Parallel Computational Geometry Frank Dehne &amp; Andrew [&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-11903","page","type-page","status-publish","hentry"],"acf":{"cu_post_thumbnail":""},"_links":{"self":[{"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/11903","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=11903"}],"version-history":[{"count":5,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/11903\/revisions"}],"predecessor-version":[{"id":24639,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/11903\/revisions\/24639"}],"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=11903"}],"wp:term":[{"taxonomy":"cu_page_type","embeddable":true,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/cu_page_type?post=11903"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}