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

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, Frank Dehne, P. […]<\/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-12155","page","type-page","status-publish","hentry"],"acf":{"cu_post_thumbnail":""},"_links":{"self":[{"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/12155","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=12155"}],"version-history":[{"count":5,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/12155\/revisions"}],"predecessor-version":[{"id":24646,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/12155\/revisions\/24646"}],"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"}],"wp:term":[{"taxonomy":"cu_page_type","embeddable":true,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/cu_page_type?post=12155"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}