{"id":11787,"date":"2021-10-15T12:12:25","date_gmt":"2021-10-15T16:12:25","guid":{"rendered":"https:\/\/carleton.ca\/scs\/?page_id=11787"},"modified":"2026-06-10T10:00:57","modified_gmt":"2026-06-10T14:00:57","slug":"technical-reports-1984","status":"publish","type":"page","link":"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1984\/","title":{"rendered":"Technical Reports 1984"},"content":{"rendered":"\n
\n
\n\n
\n
\n
\n

\n Technical Reports 1984\n <\/h1>\n \n \n \n\n
\n
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
Number<\/th>Title<\/th>Authors<\/th>Date<\/th>Download<\/th><\/tr><\/thead>
\n
TR-36<\/div>\n<\/td>
\n
The Asymptotic Optimality of Discretized Linear Reward-Inaction Learning Automata<\/div>\n<\/td>
B.J. Oommen & Eldon Hansen<\/td>\n
January 1984<\/div>\n<\/td>
N\/A<\/td><\/tr>
TR-37<\/td>Geometric Containment is Not Reducible to Pareto Dominance<\/a><\/td>N. Santoro, J.B. Sidney, S.J. Sidney, J. Urrutia<\/td>\n
January 1984<\/div>\n<\/td>
TR-37.pdf<\/a><\/td><\/tr>
TR-38<\/td>An Improved Algorithm for Boolean Matrix Multiplication<\/a><\/td>N. Santoro & J. Urrutia<\/td>January 1984<\/td>TR-38.pdf<\/a><\/td><\/tr>
\n
TR-39<\/div>\n<\/td>
Containment of Elementary Geometric Objects<\/a><\/td>\n
J\u00f6rg-R. Sack, N. Santoro, J. Urrutia<\/div>\n<\/td>
\n
February 1984<\/div>\n<\/td>
TR-39.pdf<\/a><\/td><\/tr>
\n
TR-40<\/div>\n<\/td>
SADE: A Programming Environment for Designing and Testing Systolic Algorithms<\/a><\/td>\n
J.P. Corriveau & N. Santoro<\/div>\n<\/td>
February 1984<\/td>TR-40.pdf<\/a><\/td><\/tr>
TR-41<\/td>Intersection Graphs, {B1}-Orientable Graphs and Proper Circular Arc Graphs<\/a><\/td>Jorge Urrutia<\/td>\n
February 1984<\/div>\n<\/td>
TR-41.pdf<\/a><\/td><\/tr>
\n
TR-42<\/div>\n<\/td>
Minimum Decompositions of Polygonal Objects<\/a><\/td>\n
J. Mark Keil & J\u00f6rg-R\u00fcdiger Sack<\/div>\n<\/td>
\n
\n
March 1984<\/div>\n<\/div>\n<\/td>
TR-42.pdf<\/a><\/td><\/tr>
\n
TR-43<\/div>\n<\/td>
An Algorithm for Merging Heaps<\/td>J\u00f6rg-R. Sack & Thomas Strothotte<\/td>\n
\n
March 1984<\/div>\n<\/div>\n<\/td>
N\/A<\/td><\/tr>
\n
TR-44<\/div>\n<\/td>
A Digital Hashing Scheme for Dynamic Multiattribute Files<\/td>E.J. Otoo<\/td>\n
March 1984<\/div>\n<\/td>
N\/A<\/td><\/tr>
\n
TR-45<\/div>\n<\/td>
Symmetric Index Maintenance Using Multidimensional Linear Hashing<\/td>E.J. Otoo<\/td>\n
\n
March 1984<\/div>\n<\/div>\n<\/td>
N\/A<\/td><\/tr>
\n
TR-46<\/div>\n<\/td>
A Mapping Function for the Directory of a Multidimensional Extendible Hashing<\/a><\/td>E.J. Otoo<\/td>\n
\n
\n
March 1984<\/div>\n<\/div>\n<\/div>\n<\/td>
TR-46.pdf<\/a><\/td><\/tr>
\n
TR-47<\/div>\n<\/td>
\n
Translating Polygons in the Plane<\/div>\n<\/td>
\n
J\u00f6rg-R. Sack & G.T. Toussaint<\/div>\n<\/td>
\n
\n
\n
March 1984<\/div>\n<\/div>\n<\/div>\n<\/td>
N\/A<\/td><\/tr>
\n
TR-48<\/div>\n<\/td>
\n
Constrained String Editing<\/a><\/div>\n<\/td>
\n
J. Oommen<\/div>\n<\/td>
\n
\n
\n
May 1984<\/div>\n<\/div>\n<\/div>\n<\/td>
TR-48.pdf<\/a><\/td><\/tr>
\n
\n
TR-49<\/div>\n<\/div>\n<\/td>
\n
O(N) Election Algorithms in Complete Networks with Global Sense of Orientation<\/div>\n<\/td>
\n
J\u00f6rg-R. Sack, Nicola Santoro, Jorge Urrutia<\/div>\n<\/td>
\n
\n
\n
May 1984<\/div>\n<\/div>\n<\/div>\n<\/td>
N\/A<\/td><\/tr>
\n
\n
\n
TR-50<\/div>\n<\/div>\n<\/div>\n<\/td>
\n
\n
The Design of a Program Editor Based on Constraints<\/div>\n<\/div>\n<\/td>
\n
\n
Christopher A. Carter & Wilf R. LaLonde<\/div>\n<\/div>\n<\/td>
\n
\n
\n
\n
May 1984<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>
N\/A<\/td><\/tr>
\n
\n
TR-51<\/div>\n<\/div>\n<\/td>
\n
\n
Discretized Linear Inaction-Penalty Learning Automata<\/div>\n<\/div>\n<\/td>
\n
\n
B.J. Oommen & Eldon Hansen<\/div>\n<\/div>\n<\/td>
\n
\n
\n
\n
May 1984<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>
N\/A<\/td><\/tr>
\n
\n
TR-52<\/div>\n<\/div>\n<\/td>
\n
Sense of Direction, Topological Awareness and Communication Complexity<\/div>\n<\/td>
\n
\n
Nicola Santoro<\/div>\n<\/div>\n<\/td>
\n
\n
\n
\n
May 1984<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>
N\/A<\/td><\/tr>
\n
\n
\n
TR-53<\/div>\n<\/div>\n<\/div>\n<\/td>
\n
\n
Optimal List Organizing Strategy Which Uses Stochastic Move-to-Front Operations<\/a><\/div>\n<\/div>\n<\/td>
\n
\n
B.J. Oommen<\/div>\n<\/div>\n<\/td>
\n
\n
\n
\n
June 1984<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>
TR-53.pdf<\/a><\/td><\/tr>
\n
\n
\n
\n
TR-54<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>
\n
\n
Rectilinear Computational Geometry<\/div>\n<\/div>\n<\/td>
\n
\n
\n
J\u00f6rg-R. Sack<\/div>\n<\/div>\n<\/div>\n<\/td>
\n
\n
\n
\n
\n
June 1984<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>
N\/A<\/td><\/tr>
\n
\n
\n
\n
TR-55<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>
\n
\n
\n
An Efficient, Implicit Double-Ended Priority Queue<\/a><\/div>\n<\/div>\n<\/div>\n<\/td>
\n
\n
\n
M.D. Atkinson,, J\u00f6rg-R\u00fcdiger Sack, Nicola Santoro, T. Strothotte<\/div>\n<\/div>\n<\/div>\n<\/td>
\n
\n
\n
\n
\n
July 1984<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>
TR-55.pdf<\/a><\/td><\/tr>
\n
\n
\n
\n
TR-56<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>
\n
\n
\n
Dynamic Multipaging: A Multidimensional Structure for Fast Associative Searching<\/div>\n<\/div>\n<\/div>\n<\/td>
\n
\n
\n
E. Otoo & T.H. Merrett<\/div>\n<\/div>\n<\/div>\n<\/td>
\n
\n
\n
\n
\n
August 1984<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>
N\/A<\/td><\/tr>
\n
\n
\n
\n
TR-57<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>
\n
\n
\n
Specialization, Generalization and Inheritance<\/a><\/div>\n<\/div>\n<\/div>\n<\/td>
\n
\n
Wilf R. LaLonde & John R. Pugh<\/div>\n<\/div>\n<\/td>
\n
\n
\n
\n
\n
August 1984<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>
TR-57.pdf<\/a><\/td><\/tr>
\n
\n
\n
\n
TR-58<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>
\n
\n
\n
Computer Access Methods for Extendible Arrays of Varying Dimensions<\/a><\/div>\n<\/div>\n<\/div>\n<\/td>
\n
\n
\n
E. Otoo<\/div>\n<\/div>\n<\/div>\n<\/td>
\n
\n
\n
\n
\n
August 1984<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>
TR-58.pdf<\/a><\/td><\/tr>
\n
\n
\n
TR-59<\/div>\n<\/div>\n<\/div>\n<\/td>
\n
\n
\n
Area-Efficient Embeddings of Trees<\/div>\n<\/div>\n<\/div>\n<\/td>
\n
\n
\n
J.P. Corriveau & Nicola Santoro<\/div>\n<\/div>\n<\/div>\n<\/td>
\n
\n
\n
\n
\n
August 1984<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>
N\/A<\/td><\/tr>
\n
\n
\n
\n
TR-60<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>
\n
\n
\n
Uniquely Colourable m-Dichromatic Oriented Graphs<\/a><\/div>\n<\/div>\n<\/div>\n<\/td>
\n
\n
\n
V. Neumann-Lara, N. Santoro, J. Urrutia<\/div>\n<\/div>\n<\/div>\n<\/td>
\n
\n
\n
\n
\n
August 1984<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>
TR-60.pdf<\/a><\/td><\/tr>
\n
\n
\n
TR-61<\/div>\n<\/div>\n<\/div>\n<\/td>
\n
\n
\n
Analysis of Distributed Algorithms for Extrema Finding in a Ring<\/a><\/div>\n<\/div>\n<\/div>\n<\/td>
\n
\n
D. Rotem, E. Korach, N. Santoro<\/div>\n<\/div>\n<\/td>
\n
\n
\n
\n
\n
August 1984<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>
TR-61.pdf<\/a><\/td><\/tr>
\n
\n
\n
TR-62<\/div>\n<\/div>\n<\/div>\n<\/td>
\n
\n
On Zigzag Permutations and Comparisons of Adjacent Elements<\/a><\/div>\n<\/div>\n<\/td>
\n
\n
M.D. Atkinson<\/div>\n<\/div>\n<\/td>
\n
\n
\n
\n
\n
October 1984<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>
TR-62.pdf<\/a><\/td><\/tr>
\n
\n
\n
TR-63<\/div>\n<\/div>\n<\/div>\n<\/td>
\n
\n
Sets of Integers with Distinct Differences<\/a><\/div>\n<\/div>\n<\/td>
\n
\n
M.D. Atkinson & A. Hassenklover<\/div>\n<\/div>\n<\/td>
\n
\n
\n
\n
October 1984<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>
TR-63.pdf<\/a><\/td><\/tr>
\n
\n
\n
\n
TR-64<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>
\n
\n
\n
Teaching Fifth Generation Computing: The Importance of Small Talk<\/a><\/div>\n<\/div>\n<\/div>\n<\/td>
\n
\n
\n
Wilf R. LaLonde, Dave A. Thomas, John R. Pugh<\/div>\n<\/div>\n<\/div>\n<\/td>
\n
\n
\n
\n
\n
October 1984<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>
TR-64.pdf<\/a><\/td><\/tr>
\n
\n
\n
\n
TR-65<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>
\n
\n
\n
An Extremely Fast Minimum Spanning Circle Algorithm<\/a><\/div>\n<\/div>\n<\/div>\n<\/td>
\n
\n
\n
B.J. Oommen<\/div>\n<\/div>\n<\/div>\n<\/td>
\n
\n
\n
\n
\n
October 1984<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>
TR-65.pdf<\/a><\/td><\/tr>
\n
\n
\n
\n
TR-66<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>
\n
\n
\n
On the Futility of Arbitrarily Increasing Memory Capabilities of Stochastic Learning Automata<\/a><\/div>\n<\/div>\n<\/div>\n<\/td>
\n
\n
\n
B.J. Oommen<\/div>\n<\/div>\n<\/div>\n<\/td>
\n
\n
\n
\n
\n
October 1984<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>
TR-66.pdf<\/a><\/td><\/tr>
\n
\n
\n
\n
TR-67<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>
\n
\n
\n
Heaps in Heaps<\/div>\n<\/div>\n<\/div>\n<\/td>
\n
\n
\n
T. Strothotte & J\u00f6rg-R\u00fcdiger Sack<\/div>\n<\/div>\n<\/div>\n<\/td>
\n
\n
\n
\n
\n
November 1984<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>
N\/A<\/td><\/tr>
\n
\n
\n
TR-68<\/div>\n<\/div>\n<\/div>\n<\/td>
\n
\n
Partial Orders and Comparison Problems<\/div>\n<\/div>\n<\/td>
\n
\n
\n
M.D. Atkinson<\/div>\n<\/div>\n<\/div>\n<\/td>
\n
\n
\n
\n
\n
November 1984<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>
N\/A<\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n

 <\/p>\n","protected":false},"excerpt":{"rendered":"

Number Title Authors Date Download TR-36 The Asymptotic Optimality of Discretized Linear Reward-Inaction Learning Automata B.J. Oommen & Eldon Hansen January 1984 N\/A TR-37 Geometric Containment is Not Reducible to Pareto Dominance N. Santoro, J.B. Sidney, S.J. Sidney, J. Urrutia January 1984 TR-37.pdf TR-38 An Improved Algorithm for Boolean Matrix Multiplication N. Santoro & J. […]<\/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":[89],"class_list":["post-11787","page","type-page","status-publish","hentry","cu_page_type-technical-reports-by-year"],"acf":{"cu_post_thumbnail":""},"_links":{"self":[{"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/11787","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=11787"}],"version-history":[{"count":5,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/11787\/revisions"}],"predecessor-version":[{"id":24634,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/11787\/revisions\/24634"}],"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=11787"}],"wp:term":[{"taxonomy":"cu_page_type","embeddable":true,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/cu_page_type?post=11787"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}