{"id":12155,"date":"2021-11-07T20:09:25","date_gmt":"2021-11-08T01:09:25","guid":{"rendered":"https:\/\/carleton.ca\/scs\/?page_id=12155"},"modified":"2021-11-23T20:16:19","modified_gmt":"2021-11-24T01:16:19","slug":"technical-reports-1996","status":"publish","type":"page","link":"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1996\/","title":{"rendered":"Technical Reports 1996"},"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\n\n\n\n\n\n\n
Technical Reports 1996<\/td>\n

Number<\/strong><\/td>\nTitle<\/strong><\/td>\nAuthors<\/strong><\/td>\nDate<\/strong><\/td>\nDownload<\/strong><\/td>\n<\/tr>\n
\n
TR-96-01<\/div>\n<\/td>\n
\n
Hierarchical Load Sharing Policies for Distributed Systems<\/a><\/div>\n<\/td>\n
\n
Sivarama P. Dandamudi & Michael Lo<\/div>\n<\/td>\n
\n
January 1996<\/div>\n<\/td>\n
TR-96-01.pdf<\/a><\/td>\n<\/tr>\n
\n
TR-96-02<\/div>\n<\/td>\n
\n
Randomized Parallel List Ranking for Distributed Memory Multiprocessors<\/a><\/div>\n<\/td>\n
\n
Frank Dehne & Siang W. Song<\/div>\n<\/td>\n
\n
January 1996<\/div>\n<\/td>\n
TR-96-02.pdf<\/a><\/td>\n<\/tr>\n
\n
TR-96-03<\/div>\n<\/td>\n
\n
Randomized Sorting on Optically Interconnected Parallel Computer<\/a><\/div>\n<\/td>\n
\n
G. Bhattacharya, J. Chrostowski, Frank Dehne, P. Palacharla<\/div>\n<\/td>\n
\n
January 1996<\/div>\n<\/td>\n
TR-96-03.pdf<\/a><\/td>\n<\/tr>\n
\n
TR-96-04<\/div>\n<\/td>\n
\n
Authenticated Multi-Party Key Agreement<\/a><\/div>\n<\/td>\n
\n
Mike Just & Serge Vaudenay<\/div>\n<\/td>\n
\n
February 1996<\/div>\n<\/td>\n
TR-96-04.pdf<\/a><\/td>\n<\/tr>\n
\n
TR-96-05<\/div>\n<\/td>\n
\n
Boolean Routing on Cayley Networks<\/a><\/div>\n<\/td>\n
\n
Evangelos Kranakis & Danny Krizanc<\/div>\n<\/td>\n
\n
February 1996<\/div>\n<\/td>\n
TR-96-05.pdf<\/a><\/td>\n<\/tr>\n
TR-96-06<\/td>\n\n
Secure Non-Interactive Electronic Cash<\/a><\/div>\n<\/td>\n
\n
Pat Morin<\/div>\n<\/td>\n
\n
February 1996<\/div>\n<\/td>\n
TR-96-06.pdf<\/a><\/td>\n<\/tr>\n
TR-96-07<\/td>\n\n
An Uppoer Bound for a Basic Hypergeometric Series<\/a><\/div>\n<\/td>\n
\n
Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc<\/div>\n<\/td>\n
\n
March 1996<\/div>\n<\/td>\n
TR-96-07.pdf<\/a><\/td>\n<\/tr>\n
\n
TR-96-08<\/div>\n<\/td>\n
\n
A Formal Theory for Optimal and Information Theoretic Syntactic Pattern Recognition<\/a><\/div>\n<\/td>\n
\n
B.J. Oommen & R.L. Kashyap<\/div>\n<\/td>\n
\n
March 1996<\/div>\n<\/td>\n
TR-96-08.pdf<\/a><\/td>\n<\/tr>\n
\n
TR-96-09<\/div>\n<\/td>\n
\n
A Better Upper Bound for the Unsatisfiability Threshold<\/a><\/div>\n<\/td>\n
\n
L. M. Kirousis, E. Kranakis, D. Krizanc<\/div>\n<\/td>\n
\n
March 1996<\/div>\n<\/td>\n
TR-96-09.pdf<\/a><\/td>\n<\/tr>\n
\n
TR-96-10<\/div>\n<\/td>\n
\n
Minimal Sense of Direction in Regular Networks<\/a><\/div>\n<\/td>\n
\n
Paola Flocchini<\/div>\n<\/td>\n
\n
March 1996<\/div>\n<\/td>\n
TR-96-10.pdf<\/a><\/td>\n<\/tr>\n
\n
TR-96-11<\/div>\n<\/td>\n
\n
A Correlation Inequality and Its Application to a Word Problem<\/a><\/div>\n<\/td>\n
\n
Dimitris Achlioptas, Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc, Michael S.O. Molloy<\/div>\n<\/td>\n
\n
March 1996<\/div>\n<\/td>\n
TR-96-11.pdf<\/a><\/td>\n<\/tr>\n
\n
TR-96-12<\/div>\n<\/td>\n
\n
On Systems with Sense of Direction<\/a><\/div>\n<\/td>\n
\n
Paola Flocchini, Alessandro Roncato, Nicola Santoro<\/div>\n<\/td>\n
\n
April 1996<\/div>\n<\/td>\n
TR-96-12.pdf<\/a><\/td>\n<\/tr>\n
TR-96-13<\/td>\n\n
Computing on Anonymous Networks with Sense of Direction<\/a><\/div>\n<\/td>\n
\n
Paola Flocchini, Alessandro Roncato, Nicola Santoro<\/div>\n<\/td>\n
\n
April 1996<\/div>\n<\/td>\n
TR-96-13.pdf<\/a><\/td>\n<\/tr>\n
TR-96-14<\/td>\n\n
Symmetries and Sense of Direction in Labeled Graphs<\/a><\/div>\n<\/td>\n
\n
Paola Flocchini, Alessandro Roncato, Nicola Santoro<\/div>\n<\/td>\n
\n
April 1996<\/div>\n<\/td>\n
TR-96-14.pdf<\/a><\/td>\n<\/tr>\n
\n
TR-96-15<\/div>\n<\/td>\n
\n
Distance Routing on Series Parallel Networks<\/a><\/div>\n<\/td>\n
\n
Paola Flocchini & Flaminia L. Luccio<\/div>\n<\/td>\n
\n
April 1996<\/div>\n<\/td>\n
TR-96-15.pdf<\/a><\/td>\n<\/tr>\n
\n
TR-96-16<\/div>\n<\/td>\n
\n
Maximal Length Common Non-Intersecting Paths<\/a><\/div>\n<\/td>\n
\n
Jurek Czyzowicz, Evangelos Kranakis, Danny Krizanc, Jorge Urrutia<\/div>\n<\/td>\n
\n
May 1996<\/div>\n<\/td>\n
TR-96-16.pdf<\/a><\/td>\n<\/tr>\n
\n
TR-96-17<\/div>\n<\/td>\n
\n
Discrete Vector Quantization for Arbitrary Distance Function Estimation<\/a><\/div>\n<\/td>\n
\n
B.J. Oommen, I. Kuban Altinel, Necati Aras<\/div>\n<\/td>\n
\n
May 1996<\/div>\n<\/td>\n
TR-96-17.pdf<\/a><\/td>\n<\/tr>\n
\n
TR-96-18<\/div>\n<\/td>\n
\n
Symmetry and Computability in Anonymous Networks: A Brief Survey<\/a><\/div>\n<\/td>\n
\n
Evangelos Kranakis<\/div>\n<\/td>\n
\n
July 1996<\/div>\n<\/td>\n
TR-96-18.pdf<\/a><\/td>\n<\/tr>\n
\n
TR-96-19<\/div>\n<\/td>\n
\n
Many-to-One Packet Routing via Matchings<\/a><\/div>\n<\/td>\n
\n
Danny Krizanc & Louxin Zhang<\/div>\n<\/td>\n
\n
July 1996<\/div>\n<\/td>\n
TR-96-19.pdf<\/a><\/td>\n<\/tr>\n
\n
TR-96-20<\/div>\n<\/td>\n
\n
Power Consumption in Packet Radio Networks<\/a><\/div>\n<\/td>\n
\n
Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc, Andrzej Pelc<\/div>\n<\/td>\n
\n
August 1996<\/div>\n<\/td>\n
TR-96-20.pdf<\/a><\/td>\n<\/tr>\n
\n
TR-96-21<\/div>\n<\/td>\n
\n
Performance of Hierarchical Processor Scheduling in Shared-Memory Multiprocessor Systems<\/a><\/div>\n<\/td>\n
\n
Sivarama P. Dandamudi & Samir Ayachi<\/div>\n<\/td>\n
\n
August 1996<\/div>\n<\/td>\n
TR-96-21.pdf<\/a><\/td>\n<\/tr>\n
\n
TR-96-22<\/div>\n<\/td>\n
\n
Performance of Hierarchical Processor Scheduling in Shared-Memory Multiprocessor Systems<\/a><\/div>\n<\/td>\n
\n
Michael Lo & Sivarama P. Dandamudi<\/div>\n<\/td>\n
\n
August 1996<\/div>\n<\/td>\n
TR-96-22.pdf<\/a><\/td>\n<\/tr>\n
\n
TR-96-23<\/div>\n<\/td>\n
\n
Performance Impact of I\/O on Sender-Initiated and Receiver-Initiated Load Sharing Policies in Distributed Systems<\/a><\/div>\n<\/td>\n
\n
Sivarama P. Dandamudi & Hamid Hadavi<\/div>\n<\/td>\n
\n
August 1996<\/div>\n<\/td>\n
TR-96-23.pdf<\/a><\/td>\n<\/tr>\n
\n
TR-96-24<\/div>\n<\/td>\n
\n
Characterization of Domino Tilings of Squares with Prescribed Number of Nonoverlapping 2×2 Squares<\/a><\/div>\n<\/td>\n
\n
Evangelos Kranakis<\/div>\n<\/td>\n
\n
September 1996<\/div>\n<\/td>\n
TR-96-24.pdf<\/a><\/td>\n<\/tr>\n
\n
TR-96-25<\/div>\n<\/td>\n
\n
On the Impact of Sense of Direction on Communication Complexity<\/a><\/div>\n<\/td>\n
\n
Paola Flocchini, Bernard Mans, Nicola Santoro<\/div>\n<\/td>\n
\n
October 1996<\/div>\n<\/td>\n
TR-96-25.pdf<\/a><\/td>\n<\/tr>\n
TR-96-26<\/td>\n\n
The Effect of Scheduling Discipline on Dynamic Load Sharing in Heterogeneous Distributed Systems<\/a><\/div>\n<\/td>\n
\n
Sivarama P. Dandamudi<\/div>\n<\/td>\n
\n
November 1996<\/div>\n<\/td>\n
TR-96-26.pdf<\/a><\/td>\n<\/tr>\n
\n
TR-96-27<\/div>\n<\/td>\n
\n
Approximating the Unsatisfiability Threshold of Random Formulas<\/a><\/div>\n<\/td>\n
\n
Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc, Yannis C. Stamatiou<\/div>\n<\/td>\n
\n
November 1996<\/div>\n<\/td>\n
TR-96-27.pdf<\/a><\/td>\n<\/tr>\n
\n
TR-96-28<\/div>\n<\/td>\n
\n
Paper foldings as chaotic dynamical systems<\/a><\/div>\n<\/td>\n
\n
Frederic Geurts<\/div>\n<\/td>\n
\n
November 1996<\/div>\n<\/td>\n
TR-96-28.pdf<\/a><\/td>\n<\/tr>\n
\n
TR-96-29<\/div>\n<\/td>\n
\n
Compositional complexity in cellular automata: a case study<\/a><\/div>\n<\/td>\n
\n
Paola Flocchini & Frederic Geurts<\/div>\n<\/td>\n
\n
November 1996<\/div>\n<\/td>\n
TR-96-29.pdf<\/a><\/td>\n<\/tr>\n
\n
TR-96-30<\/div>\n<\/td>\n
\n
Compositional complexity in dynamical systems<\/a><\/div>\n<\/td>\n
\n
Frederic Geurts<\/div>\n<\/td>\n
\n
November 1996<\/div>\n<\/td>\n
TR-96-30.pdf<\/a><\/td>\n<\/tr>\n
\n
TR-96-31<\/div>\n<\/td>\n
\n
Compositional experimental analysis of cellular automata: attraction properties and logic disjunction<\/a><\/div>\n<\/td>\n
\n
Paola Flocchini, Frederic Geurts, Nicola Santoro<\/div>\n<\/td>\n
\n
November 1996<\/div>\n<\/td>\n
TR-96-31.pdf<\/a><\/td>\n<\/tr>\n
TR-96-32<\/td>\n\n
Approximating Weighted Shortest Paths on Polyhedral Surfaces<\/a><\/div>\n<\/td>\n
\n
Mark Lanthier, Anil Maheshwari, Jorg-Rudiger Sack<\/div>\n<\/td>\n
\n
December 1996<\/div>\n<\/td>\n
TR-96-32.pdf<\/a><\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n","protected":false},"excerpt":{"rendered":"

Technical Reports 1996 Number Title Authors Date Download TR-96-01 Hierarchical Load Sharing Policies for Distributed Systems Sivarama P. Dandamudi & Michael Lo January 1996 TR-96-01.pdf TR-96-02 Randomized Parallel List Ranking for Distributed Memory Multiprocessors Frank Dehne & Siang W. Song January 1996 TR-96-02.pdf TR-96-03 Randomized Sorting on Optically Interconnected Parallel Computer G. Bhattacharya, J. Chrostowski, […]<\/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 1996 - School of Computer Science<\/title>\n<meta name=\"description\" content=\"Technical Reports 1996 Number Title Authors Date Download TR-96-01 Hierarchical Load Sharing Policies for Distributed Systems Sivarama P. Dandamudi &\" \/>\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-1996\/\" \/>\n<meta name=\"twitter:label1\" content=\"Est. reading time\" \/>\n\t<meta name=\"twitter:data1\" content=\"3 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-1996\/\",\"url\":\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1996\/\",\"name\":\"Technical Reports 1996 - School of Computer Science\",\"isPartOf\":{\"@id\":\"https:\/\/carleton.ca\/scs\/#website\"},\"datePublished\":\"2021-11-08T01:09:25+00:00\",\"dateModified\":\"2021-11-24T01:16:19+00:00\",\"description\":\"Technical Reports 1996 Number Title Authors Date Download TR-96-01 Hierarchical Load Sharing Policies for Distributed Systems Sivarama P. Dandamudi &\",\"breadcrumb\":{\"@id\":\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1996\/#breadcrumb\"},\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1996\/\"]}]},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1996\/#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 1996\"}]},{\"@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 1996 - School of Computer Science","description":"Technical Reports 1996 Number Title Authors Date Download TR-96-01 Hierarchical Load Sharing Policies for Distributed Systems Sivarama P. Dandamudi &","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-1996\/","twitter_misc":{"Est. reading time":"3 minutes"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"WebPage","@id":"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1996\/","url":"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1996\/","name":"Technical Reports 1996 - School of Computer Science","isPartOf":{"@id":"https:\/\/carleton.ca\/scs\/#website"},"datePublished":"2021-11-08T01:09:25+00:00","dateModified":"2021-11-24T01:16:19+00:00","description":"Technical Reports 1996 Number Title Authors Date Download TR-96-01 Hierarchical Load Sharing Policies for Distributed Systems Sivarama P. Dandamudi &","breadcrumb":{"@id":"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1996\/#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1996\/"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1996\/#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 1996"}]},{"@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_image_type":"upload","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_button":"no","banner_opacity":"dark"},"_links":{"self":[{"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/12155"}],"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=12155"}],"version-history":[{"count":3,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/12155\/revisions"}],"predecessor-version":[{"id":12907,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/12155\/revisions\/12907"}],"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=12155"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}