{"id":11827,"date":"2021-10-19T08:59:50","date_gmt":"2021-10-19T12:59:50","guid":{"rendered":"https:\/\/carleton.ca\/scs\/?page_id=11827"},"modified":"2026-06-10T10:02:25","modified_gmt":"2026-06-10T14:02:25","slug":"technical-reports-1987","status":"publish","type":"page","link":"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1987\/","title":{"rendered":"Technical Reports 1987"},"content":{"rendered":"\n
\n
\n\n
\n
\n
\n

\n Technical Reports 1987\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>Downlad<\/th><\/tr><\/thead>
TR-100<\/td>\n
Sums of Lexicographically Ordered Sets<\/a><\/div>\n<\/td>
\n
M.D. Atkinson, A. Negro, N. Santoro<\/div>\n<\/td>
\n
May 1987<\/div>\n<\/td>
TR-100.pdf<\/a><\/td><\/tr>
TR-105<\/td>\n
On Adding Constraint Accumulation to Prolog<\/a><\/div>\n<\/td>
\n
Wilf R. LaLonde<\/div>\n<\/td>
\n
January 1987<\/div>\n<\/td>
TR-105.pdf<\/a><\/td><\/tr>
TR-107<\/td>\n
On the Problem of Multiple Mobile Robots Cluttering a Workspace<\/div>\n<\/td>
\n
B.J. Oommen & I. Reichstein<\/div>\n<\/td>
\n
January 1987<\/div>\n<\/td>
N\/A<\/td><\/tr>
TR-108<\/td>\n
\n
Designing Families of Data Types Using Exemplars<\/a><\/div>\n<\/div>\n<\/td>
\n
\n
Wilf R. LaLonde<\/div>\n<\/div>\n<\/td>
\n
\n
February 1987<\/div>\n<\/div>\n<\/td>
TR-108.pdf<\/a><\/td><\/tr>
TR-109<\/td>\n
\n
\n
From Rings to Complete Graphs – O(n logn) to O(n) Distributed Leader Election<\/div>\n<\/div>\n<\/div>\n<\/td>
\n
\n
\n
Hagit Attiya, Nicola Santoro , Shmuel Zaks<\/div>\n<\/div>\n<\/div>\n<\/td>
\n
\n
\n
March 1987<\/div>\n<\/div>\n<\/div>\n<\/td>
N\/A<\/td><\/tr>
TR-110<\/td>\n
\n
\n
\n
A Transputer Based Adaptable Pipeline<\/a><\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>
\n
\n
\n
\n
Anirban Basu<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>
\n
\n
\n
\n
March 1987<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>
TR-110.pdf<\/a><\/td><\/tr>
TR-111<\/td>\n
\n
\n
\n
Impact of Prediction Accuracy on the Performance of a Pipeline Computer<\/a><\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>
\n
\n
\n
Anirban Basu<\/div>\n<\/div>\n<\/div>\n<\/td>
\n
\n
\n
\n
March 1987<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>
TR-111.pdf<\/a><\/td><\/tr>
TR-112<\/td>\n
\n
\n
\n
E-Optimal Discretized Linear Reward-Penalty Learning Automata<\/a><\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>
\n
\n
\n
\n
B.J. Oommen & J.P.R. Christensen<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>
\n
\n
\n
\n
May 1987<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>
TR-112.pdf<\/a><\/td><\/tr>
TR-113<\/td>\n
\n
\n
\n
Angle Orders, Regular n-gon Orders and the Crossing Number of a Partial Order<\/a><\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>
\n
\n
\n
\n
N. Santoro & J. Urrutia<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>
\n
\n
\n
\n
June 1987<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>
TR-113.pdf<\/a><\/td><\/tr>
TR-115<\/td>\n
\n
\n
\n
Time is Not a Healer: Impossibility of Distributed Agreement in Synchronous Systems with Random Omissions<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>
\n
\n
\n
\n
N. Santoro<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>
\n
\n
\n
\n
June 1987<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>
N\/A<\/td><\/tr>
TR-116<\/td>\n
\n
\n
\n
A Practical Algorithm for Boolean Matrix Multiplication<\/a><\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>
\n
\n
\n
\n
M.D. Atkinson & N. Santoro<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>
\n
\n
\n
\n
June 1987<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>
TR-116.pdf<\/a><\/td><\/tr>
TR-117<\/td>\n
\n
\n
\n
Recognizing Polygons, or How to Spy<\/a><\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>
\n
\n
\n
\n
James A. Dean, Andrzej Lingas, J\u00f6rg-R\u00fcdiger Sack<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>
\n
\n
\n
\n
August 1987<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>
TR-117.pdf<\/a><\/td><\/tr>
TR-118<\/td>\n
\n
\n
\n
Stochastic Rendezvous Network Performance – Fast, First-Order Approximations<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>
\n
\n
\n
\n
J.E. Neilson, C.M. Woodside, J.W. Miernik, D.C. Petriu<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>
\n
\n
\n
\n
August 1987<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>
N\/A<\/td><\/tr>
TR-120<\/td>\n
\n
\n
\n
Searching on Alphanumeric Keys Using Local Balanced Tree Hashing<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>
\n
\n
\n
\n
E.J. Otoo<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>
\n
\n
\n
\n
August 1987<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>
N\/A<\/td><\/tr>
TR-121<\/td>\n
\n
\n
\n
n O(\u221an) Algorithm for the ECDF Searching Problem for Arbitrary Dimensions on a Mesh-of-Processors<\/a><\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>
\n
\n
\n
\n
Frank Dehne & Ivan Stojmenovic<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>
\n
\n
\n
\n
October 1987<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>
TR-121.pdf<\/a><\/td><\/tr>
TR-122<\/td>\n
\n
\n
\n
An Optimal Algorithm for Computing the Voronoi Diagram on a Cone<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>
\n
\n
\n
\n
Frank Dehne & Rolf Klein<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>
\n
\n
\n
\n
November 1987<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>
N\/A<\/td><\/tr>
TR-123<\/td>\n
\n
\n
\n
Solving Visibility and Separability Problems on a Mesh-of-Processors<\/a><\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>
\n
\n
\n
\n
Frank Dehne<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>
\n
\n
\n
November 1987<\/div>\n<\/div>\n<\/div>\n<\/td>
TR-123.pdf<\/a><\/td><\/tr>
TR-124<\/td>\n
\n
\n
\n
Deterministic Optimal and Expedient Move-to-Rear List Organizing Strategies<\/a><\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>
\n
\n
\n
\n
B.J. Oommen, E.R. Hansen , J.I. Munro<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>
\n
\n
\n
\n
October 1987<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>
TR-124.pdf<\/a><\/td><\/tr>
TR-125<\/td>\n
\n
\n
\n
Trajectory Planning of Robot Manipulators in Noisy Workspaces Using Stochastic Automata<\/a><\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>
\n
\n
\n
\n
B.J. Oommen, S. Sitharam Iyengar , Nicte Andrade<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>
\n
\n
\n
\n
October 1987<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>
TR-125.pdf<\/a><\/td><\/tr>
TR-126<\/td>\n
\n
\n
\n
Adaptive Structuring of Binary Search Trees Using Conditional Rotations<\/a><\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>
\n
\n
\n
\n
P. Cheetham, B.J. Oommen , D.T.H. Ng<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>
\n
\n
\n
\n
October 1987<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>
TR-126.pdf<\/a><\/td><\/tr>
TR-127<\/td>\n
\n
\n
\n
On the Packet Complexity of Distributed Selection<\/a><\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>
\n
\n
\n
\n
A. Negro, N. Santoro, J. Urrutia<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>
\n
\n
\n
\n
November 1987<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>
TR-127.pdf<\/a><\/td><\/tr>
\n
TR-128<\/div>\n<\/td>
\n
\n
\n
\n
Efficient Support for Object Mutation and Transparent Forwarding<\/a><\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>
\n
\n
\n
\n
D.A. Thomas, W.R. LaLonde, J. Duimovich<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>
\n
\n
\n
\n
November 1987<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>
TR-128.pdf<\/a><\/td><\/tr>
TR-129<\/td>\n
\n
\n
\n
Eva: An Event Driven Framework for Building User Interfaces in Smalltalk<\/a><\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>
\n
\n
\n
\n
Jeff McAffer & Dave Thomas<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>
\n
\n
\n
\n
November 1987<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>
TR-129.pdf<\/a><\/td><\/tr>
TR-130<\/td>\n
\n
\n
\n
Application Frameworks: Experience with MacApp<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>
\n
\n
\n
\n
John R. Pugh & Cefee Leung<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>
\n
\n
\n
\n
December 1987<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>
N\/A<\/td><\/tr>
TR-134<\/td>\n
\n
\n
\n
Separating a Polyhedron by One Translation from a Set of Obstacles<\/a><\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>
\n
\n
\n
\n
Otto Nurmi & J\u00f6rg-R\u00fcdiger Sack<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>
\n
\n
\n
\n
December 1987<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>
TR-134.pdf<\/a><\/td><\/tr><\/tbody><\/table><\/figure>\n","protected":false},"excerpt":{"rendered":"

Number Title Authors Date Downlad TR-100 Sums of Lexicographically Ordered Sets M.D. Atkinson, A. Negro, N. Santoro May 1987 TR-100.pdf TR-105 On Adding Constraint Accumulation to Prolog Wilf R. LaLonde January 1987 TR-105.pdf TR-107 On the Problem of Multiple Mobile Robots Cluttering a Workspace B.J. Oommen & I. Reichstein January 1987 N\/A TR-108 Designing Families […]<\/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-11827","page","type-page","status-publish","hentry"],"acf":{"cu_post_thumbnail":""},"_links":{"self":[{"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/11827","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=11827"}],"version-history":[{"count":5,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/11827\/revisions"}],"predecessor-version":[{"id":24637,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/11827\/revisions\/24637"}],"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=11827"}],"wp:term":[{"taxonomy":"cu_page_type","embeddable":true,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/cu_page_type?post=11827"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}