{"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":"2022-05-08T22:23:42","modified_gmt":"2022-05-09T02:23:42","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\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n
Technical Reports 1987<\/td>\n

Number<\/strong><\/td>\nTitle<\/strong><\/td>\nAuthors<\/strong><\/td>\nDate<\/strong><\/td>\nDownload<\/strong><\/td>\n<\/tr>\n
TR-100<\/td>\n\n
Sums of Lexicographically Ordered Sets<\/a><\/div>\n<\/td>\n
\n
M.D. Atkinson, A. Negro, N. Santoro<\/div>\n<\/td>\n
\n
May 1987<\/div>\n<\/td>\n
TR-100.pdf<\/a><\/td>\n<\/tr>\n
TR-105<\/td>\n\n
On Adding Constraint Accumulation to Prolog<\/a><\/div>\n<\/td>\n
\n
Wilf R. LaLonde<\/div>\n<\/td>\n
\n
January 1987<\/div>\n<\/td>\n
TR-105.pdf<\/a><\/td>\n<\/tr>\n
TR-107<\/td>\n\n
On the Problem of Multiple Mobile Robots Cluttering a Workspace<\/div>\n<\/td>\n
\n
B.J. Oommen & I. Reichstein<\/div>\n<\/td>\n
\n
January 1987<\/div>\n<\/td>\n
N\/A<\/td>\n<\/tr>\n
TR-108<\/td>\n\n
\n
Designing Families of Data Types Using Exemplars<\/a><\/div>\n<\/div>\n<\/td>\n
\n
\n
Wilf R. LaLonde<\/div>\n<\/div>\n<\/td>\n
\n
\n
February 1987<\/div>\n<\/div>\n<\/td>\n
TR-108.pdf<\/a><\/td>\n<\/tr>\n
TR-109<\/td>\n\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
\n
Hagit Attiya, Nicola Santoro , Shmuel Zaks<\/div>\n<\/div>\n<\/div>\n<\/td>\n
\n
\n
\n
March 1987<\/div>\n<\/div>\n<\/div>\n<\/td>\n
N\/A<\/td>\n<\/tr>\n
TR-110<\/td>\n\n
\n
\n
\n
A Transputer Based Adaptable Pipeline<\/a><\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>\n
\n
\n
\n
\n
Anirban Basu<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>\n
\n
\n
\n
\n
March 1987<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>\n
TR-110.pdf<\/a><\/td>\n<\/tr>\n
TR-111<\/td>\n\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
\n
Anirban Basu<\/div>\n<\/div>\n<\/div>\n<\/td>\n
\n
\n
\n
\n
March 1987<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>\n
TR-111.pdf<\/a><\/td>\n<\/tr>\n
TR-112<\/td>\n\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
\n
B.J. Oommen & J.P.R. Christensen<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>\n
\n
\n
\n
\n
May 1987<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>\n
TR-112.pdf<\/a><\/td>\n<\/tr>\n
TR-113<\/td>\n\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
N. Santoro & J. Urrutia<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>\n
\n
\n
\n
\n
June 1987<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>\n
TR-113.pdf<\/a><\/td>\n<\/tr>\n
TR-115<\/td>\n\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
N. Santoro<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>\n
\n
\n
\n
\n
June 1987<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>\n
N\/A<\/td>\n<\/tr>\n
TR-116<\/td>\n\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
\n
M.D. Atkinson & N. Santoro<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>\n
\n
\n
\n
\n
June 1987<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>\n
TR-116.pdf<\/a><\/td>\n<\/tr>\n
TR-117<\/td>\n\n
\n
\n
\n
Recognizing Polygons, or How to Spy<\/a><\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>\n
\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
\n
August 1987<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>\n
TR-117.pdf<\/a><\/td>\n<\/tr>\n
TR-118<\/td>\n\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
\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
\n
August 1987<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>\n
N\/A<\/td>\n<\/tr>\n
TR-120<\/td>\n\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
\n
E.J. Otoo<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>\n
\n
\n
\n
\n
August 1987<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>\n
N\/A<\/td>\n<\/tr>\n
TR-121<\/td>\n\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
\n
Frank Dehne & Ivan Stojmenovic<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>\n
\n
\n
\n
\n
October 1987<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>\n
TR-121.pdf<\/a><\/td>\n<\/tr>\n
TR-122<\/td>\n\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
\n
Frank Dehne & Rolf Klein<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>\n
\n
\n
\n
\n
November 1987<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>\n
N\/A<\/td>\n<\/tr>\n
TR-123<\/td>\n\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
\n
Frank Dehne<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>\n
\n
\n
\n
November 1987<\/div>\n<\/div>\n<\/div>\n<\/td>\n
TR-123.pdf<\/a><\/td>\n<\/tr>\n
TR-124<\/td>\n\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
\n
B.J. Oommen, E.R. Hansen , J.I. Munro<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>\n
\n
\n
\n
\n
October 1987<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>\n
TR-124.pdf<\/a><\/td>\n<\/tr>\n
TR-125<\/td>\n\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
\n
B.J. Oommen, S. Sitharam Iyengar , Nicte Andrade<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>\n
\n
\n
\n
\n
October 1987<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>\n
TR-125.pdf<\/a><\/td>\n<\/tr>\n
TR-126<\/td>\n\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
\n
P. Cheetham, B.J. Oommen , D.T.H. Ng<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>\n
\n
\n
\n
\n
October 1987<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>\n
TR-126.pdf<\/a><\/td>\n<\/tr>\n
TR-127<\/td>\n\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
\n
A. Negro, N. Santoro, J. Urrutia<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>\n
\n
\n
\n
\n
November 1987<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>\n
TR-127.pdf<\/a><\/td>\n<\/tr>\n
\n
TR-128<\/div>\n<\/td>\n
\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
\n
D.A. Thomas, W.R. LaLonde, J. Duimovich<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>\n
\n
\n
\n
\n
November 1987<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>\n
TR-128.pdf<\/a><\/td>\n<\/tr>\n
TR-129<\/td>\n\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
\n
Jeff McAffer & Dave Thomas<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>\n
\n
\n
\n
\n
November 1987<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>\n
TR-129.pdf<\/a><\/td>\n<\/tr>\n
TR-130<\/td>\n\n
\n
\n
\n
Application Frameworks: Experience with MacApp<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>\n
\n
\n
\n
\n
John R. Pugh & Cefee Leung<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>\n
\n
\n
\n
\n
December 1987<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>\n
N\/A<\/td>\n<\/tr>\n
TR-134<\/td>\n\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
\n
Otto Nurmi & J\u00f6rg-R\u00fcdiger Sack<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>\n
\n
\n
\n
\n
December 1987<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/td>\n
TR-134.pdf<\/a><\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n","protected":false},"excerpt":{"rendered":"

Technical Reports 1987 Number Title Authors Date Download 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 […]<\/p>\n","protected":false},"author":7,"featured_media":0,"parent":11593,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"_relevanssi_hide_post":"","_relevanssi_hide_content":"","_relevanssi_pin_for_all":"","_relevanssi_pin_keywords":"","_relevanssi_unpin_keywords":"","_relevanssi_related_keywords":"","_relevanssi_related_include_ids":"","_relevanssi_related_exclude_ids":"","_relevanssi_related_no_append":"","_relevanssi_related_not_related":"","_relevanssi_related_posts":"","_relevanssi_noindex_reason":"","_mi_skip_tracking":false,"_exactmetrics_sitenote_active":false,"_exactmetrics_sitenote_note":"","_exactmetrics_sitenote_category":0,"footnotes":"","_links_to":"","_links_to_target":""},"yoast_head":"\nTechnical Reports 1987 - School of Computer Science<\/title>\n<meta name=\"description\" content=\"Technical Reports 1987 Number Title Authors Date Download TR-100 Sums of Lexicographically Ordered Sets M.D. Atkinson, A. Negro, N. Santoro May 1987\" \/>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1987\/\" \/>\n<meta name=\"twitter:label1\" content=\"Est. reading time\" \/>\n\t<meta name=\"twitter:data1\" content=\"2 minutes\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\/\/schema.org\",\"@graph\":[{\"@type\":\"WebPage\",\"@id\":\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1987\/\",\"url\":\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1987\/\",\"name\":\"Technical Reports 1987 - School of Computer Science\",\"isPartOf\":{\"@id\":\"https:\/\/carleton.ca\/scs\/#website\"},\"datePublished\":\"2021-10-19T12:59:50+00:00\",\"dateModified\":\"2022-05-09T02:23:42+00:00\",\"description\":\"Technical Reports 1987 Number Title Authors Date Download TR-100 Sums of Lexicographically Ordered Sets M.D. Atkinson, A. Negro, N. Santoro May 1987\",\"breadcrumb\":{\"@id\":\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1987\/#breadcrumb\"},\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1987\/\"]}]},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1987\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Home\",\"item\":\"https:\/\/carleton.ca\/scs\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"Research\",\"item\":\"https:\/\/carleton.ca\/scs\/research\/\"},{\"@type\":\"ListItem\",\"position\":3,\"name\":\"SCS Technical Reports\",\"item\":\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/\"},{\"@type\":\"ListItem\",\"position\":4,\"name\":\"Technical Reports 1987\"}]},{\"@type\":\"WebSite\",\"@id\":\"https:\/\/carleton.ca\/scs\/#website\",\"url\":\"https:\/\/carleton.ca\/scs\/\",\"name\":\"School of Computer Science\",\"description\":\"Carleton University\",\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"https:\/\/carleton.ca\/scs\/?s={search_term_string}\"},\"query-input\":\"required name=search_term_string\"}],\"inLanguage\":\"en-US\"}]}<\/script>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"Technical Reports 1987 - School of Computer Science","description":"Technical Reports 1987 Number Title Authors Date Download TR-100 Sums of Lexicographically Ordered Sets M.D. Atkinson, A. Negro, N. Santoro May 1987","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1987\/","twitter_misc":{"Est. reading time":"2 minutes"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"WebPage","@id":"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1987\/","url":"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1987\/","name":"Technical Reports 1987 - School of Computer Science","isPartOf":{"@id":"https:\/\/carleton.ca\/scs\/#website"},"datePublished":"2021-10-19T12:59:50+00:00","dateModified":"2022-05-09T02:23:42+00:00","description":"Technical Reports 1987 Number Title Authors Date Download TR-100 Sums of Lexicographically Ordered Sets M.D. Atkinson, A. Negro, N. Santoro May 1987","breadcrumb":{"@id":"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1987\/#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1987\/"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1987\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Home","item":"https:\/\/carleton.ca\/scs\/"},{"@type":"ListItem","position":2,"name":"Research","item":"https:\/\/carleton.ca\/scs\/research\/"},{"@type":"ListItem","position":3,"name":"SCS Technical Reports","item":"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/"},{"@type":"ListItem","position":4,"name":"Technical Reports 1987"}]},{"@type":"WebSite","@id":"https:\/\/carleton.ca\/scs\/#website","url":"https:\/\/carleton.ca\/scs\/","name":"School of Computer Science","description":"Carleton University","potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/carleton.ca\/scs\/?s={search_term_string}"},"query-input":"required name=search_term_string"}],"inLanguage":"en-US"}]}},"acf":{"banner_button":"no","banner_opacity":"dark","banner_uploaded_image":{"ID":8983,"id":8983,"title":"Coding screen","filename":"laptop-code-1600.jpg","filesize":154356,"url":"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/laptop-code-1600.jpg","link":"https:\/\/carleton.ca\/scs\/tech-support\/laptop-code-1600\/","alt":"Coding screen","author":"7","description":"Coding screen","caption":"","name":"laptop-code-1600","status":"inherit","uploaded_to":6535,"date":"2021-02-10 15:47:55","modified":"2021-11-25 20:57:39","menu_order":0,"mime_type":"image\/jpeg","type":"image","subtype":"jpeg","icon":"https:\/\/carleton.ca\/scs\/wp\/wp-includes\/images\/media\/default.png","width":1600,"height":700,"sizes":{"thumbnail":"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/laptop-code-1600-160x70.jpg","thumbnail-width":160,"thumbnail-height":70,"medium":"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/laptop-code-1600-240x105.jpg","medium-width":240,"medium-height":105,"medium_large":"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/laptop-code-1600-768x336.jpg","medium_large-width":768,"medium_large-height":336,"large":"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/laptop-code-1600-400x175.jpg","large-width":400,"large-height":175,"gallery-thumb":"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/laptop-code-1600-300x230.jpg","gallery-thumb-width":300,"gallery-thumb-height":230,"1536x1536":"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/laptop-code-1600-1536x672.jpg","1536x1536-width":1536,"1536x1536-height":672,"2048x2048":"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/laptop-code-1600.jpg","2048x2048-width":1600,"2048x2048-height":700,"banner":"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/laptop-code-1600.jpg","banner-width":1600,"banner-height":700,"people":"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/laptop-code-1600-200x200.jpg","people-width":200,"people-height":200,"post-thumb":"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/laptop-code-1600-300x230.jpg","post-thumb-width":300,"post-thumb-height":230,"rotator-image":"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/laptop-code-1600-800x600.jpg","rotator-image-width":800,"rotator-image-height":600,"video-thumb":"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/laptop-code-1600-360x158.jpg","video-thumb-width":360,"video-thumb-height":158}},"banner_image_type":"upload"},"_links":{"self":[{"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/11827"}],"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\/7"}],"replies":[{"embeddable":true,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/comments?post=11827"}],"version-history":[{"count":3,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/11827\/revisions"}],"predecessor-version":[{"id":14558,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/11827\/revisions\/14558"}],"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"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}