{"id":11825,"date":"2021-10-18T13:25:45","date_gmt":"2021-10-18T17:25:45","guid":{"rendered":"https:\/\/carleton.ca\/scs\/?page_id=11825"},"modified":"2026-06-10T10:02:08","modified_gmt":"2026-06-10T14:02:08","slug":"technical-reports-1986","status":"publish","type":"page","link":"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1986\/","title":{"rendered":"Technical Reports 1986"},"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 1986\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-086<\/td><td><a href=\"http:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1986\/tr-86-robot-navigation-in-unknown-terrains-using-learned-visiblity-graphs-part-i-the-disjoint-convex-obstacles-case\/\">Robot Navigation in Unknown Terrains Using Learned Visibility Graphs. Part I: The Disjoint Convex Obstacles Case<\/a><\/td><td>B. J. Oommen, S.S. Iyengar, S.V.N. Rao, R.L. Kashyap<\/td><td>February 1986<\/td><td><a href=\"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/sites\/260\/TR-086.pdf\">TR-086.pdf<\/a><\/td><\/tr><tr><td>TR-087<\/td><td>Breaking Symmetry in Synchronous Networks<\/td><td>Greg N. Frederickson &amp; Nicola Santoro<\/td><td>April 1986<\/td><td>N\/A<\/td><\/tr><tr><td>TR-088<\/td><td>Data Structures and Data Types: An Object-Oriented Approach<\/td><td>John R. Pugh, Wilf R. LaLonde , David A. Thomas<\/td><td>April 1986<\/td><td>N\/A<\/td><\/tr><tr><td>TR-089<\/td><td><a href=\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1986\/tr-89-ergodic-learning-automata-capable-of-incorporating-apriori-information\/\">Ergodic Learning Automata Capable of Incorporating Apriori Information<\/a><\/td><td>B. J. Oommen<\/td><td>May 1986<\/td><td><a href=\"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/sites\/260\/TR-89.pdf\" type=\"link\" id=\"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/sites\/260\/TR-89.pdf\">TR-089.pdf<\/a><\/td><\/tr><tr><td>TR-090<\/td><td><a href=\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1986\/tr-90-iterative-decomposition-of-digital-systems-and-its-applications\/\">Iterative Decomposition of Digital Systems and Its Applications<\/a><\/td><td>Vaclav Dvorak<\/td><td>May 1986<\/td><td><a href=\"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/sites\/260\/TR-90.pdf\">TR-90.pdf<\/a><\/td><\/tr><tr><td>TR-091<\/td><td>Actors in a Smalltalk Multiprocessor: A Case for Limited Parallelism<\/td><td>Wilf R. LaLonde, Dave A. Thomas , John R. Pugh<\/td><td>May 1986<\/td><td>N\/A<\/td><\/tr><tr><td>TR-092<\/td><td>ACTRA \u2013 A Multitasking\/Multiprocessing Smalltalk<\/td><td>David A. Thomas, Wilf R. LaLonde, John R. Pugh<\/td><td>May 1986<\/td><td>N\/A<\/td><\/tr><tr><td>TR-093<\/td><td>Why Exemplars are Better Than Classes<\/td><td>Wilf R. LaLonde<\/td><td>May 1986<\/td><td>N\/A<\/td><\/tr><tr><td>TR-094<\/td><td><a href=\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1986\/tr-94-an-exemplar-based-smalltalk\/\">An Exemplar Based Smalltalk<\/a><\/td><td>Wilf R. LaLonde, Dave A. Thomas , John R. Pugh<\/td><td>May 1986<\/td><td><a href=\"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/sites\/260\/TR-094.pdf\">TR-094.pdf<\/a><\/td><\/tr><tr><td>TR-095<\/td><td><a href=\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1986\/tr-95-recognition-of-noisy-subsequences-using-constrained-edit-distances\/\">Recognition of Noisy Subsequences Using Constrained Edit Distances<\/a><\/td><td>B. John Oommen<\/td><td>June 1986<\/td><td><a href=\"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/sites\/260\/TR-095.pdf\">TR-095.pdf<\/a><\/td><\/tr><tr><td>TR-096<\/td><td>Guessing Games and Distributed Computations in Synchronous Networks<\/td><td>J. van Leeuwen, N. Santoro, J. Urrutia , S. Zaks<\/td><td>June 1986<\/td><td>N\/A<\/td><\/tr><tr><td>TR-097<\/td><td>Bit vs. Time Tradeoffs for Synchronous Elections<\/td><td>M. Overmars &amp; N. Santoro<\/td><td>June 1986<\/td><td>N\/A<\/td><\/tr><tr><td>TR-098<\/td><td>Reduction Techniques for Distributed Selection<\/td><td>N. Santoro &amp; E. Suen<\/td><td>June 1986<\/td><td>N\/A<\/td><\/tr><tr><td>TR-099<\/td><td>A Note on Lower Bounds for Min-Max Heaps<\/td><td>A. Hasham &amp; J.-R. Sack<\/td><td>June 1986<\/td><td>N\/A<\/td><\/tr><tr><td>TR-102<\/td><td>Computing on a Systolic Screen: Hulls, Contours, and Applications<\/td><td>Frank Dehne, J.-R. Sack, N. Santoro<\/td><td>October 1986<\/td><td>N\/A<\/td><\/tr><tr><td>TR-103<\/td><td><a href=\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1986\/tr-103-stochastic-automata-solutions-to-the-object-partitioning-problem\/\" type=\"link\" id=\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1986\/tr-103-stochastic-automata-solutions-to-the-object-partitioning-problem\/\">Stochastic Automata Solutions to the Object Partitioning Problem<\/a><\/td><td>B.J. Oommen &amp; D.C.Y. Ma<\/td><td>November 1986<\/td><td><a href=\"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/sites\/260\/TR-103.pdf\">TR-103<\/a><\/td><\/tr><tr><td>TR-104<\/td><td>Parallel Computational Geometry and Clustering Methods<\/td><td>Frank Dehne<\/td><td>December 1986<\/td><td>N\/A<\/td><\/tr><tr><td>TR-114<\/td><td><a href=\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1986\/tr-114-an-optimal-algorithm-for-detecting-weak-visibility-of-a-polygon\/\">An Optimal Algorithm for Detecting Weak Visibility of a Polygon<\/a><\/td><td>J\u00f6rg-R. Sack &amp; Subhash Suri<\/td><td>December 1986<\/td><td><a href=\"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/sites\/260\/tr-114.pdf\">TR-114.pdf<\/a><\/td><\/tr><\/tbody><\/table><\/figure>\n","protected":false},"excerpt":{"rendered":"<p>Number Title Authors Date Download TR-086 Robot Navigation in Unknown Terrains Using Learned Visibility Graphs. Part I: The Disjoint Convex Obstacles Case B. J. Oommen, S.S. Iyengar, S.V.N. Rao, R.L. Kashyap February 1986 TR-086.pdf TR-087 Breaking Symmetry in Synchronous Networks Greg N. Frederickson &amp; Nicola Santoro April 1986 N\/A TR-088 Data Structures and Data Types: [&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-11825","page","type-page","status-publish","hentry"],"acf":{"cu_post_thumbnail":""},"_links":{"self":[{"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/11825","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=11825"}],"version-history":[{"count":5,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/11825\/revisions"}],"predecessor-version":[{"id":24636,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/11825\/revisions\/24636"}],"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=11825"}],"wp:term":[{"taxonomy":"cu_page_type","embeddable":true,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/cu_page_type?post=11825"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}