{"id":11906,"date":"2021-10-26T10:50:36","date_gmt":"2021-10-26T14:50:36","guid":{"rendered":"https:\/\/carleton.ca\/scs\/?page_id=11906"},"modified":"2026-06-10T10:03:27","modified_gmt":"2026-06-10T14:03:27","slug":"technical-reports-1990","status":"publish","type":"page","link":"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1990\/","title":{"rendered":"Technical Reports 1990"},"content":{"rendered":"\n
\n
\n\n
\n
\n
\n

\n Technical Reports 1990\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>
TR-161<\/td>\n
Recognizing Sources of Random Strings<\/a><\/div>\n<\/td>
\n
R.S. Valiveti and B.J. Oommen<\/div>\n<\/td>
\n
January 1990<\/div>\n<\/td>
TR-161.pdf<\/a><\/td><\/tr>
TR-164<\/td>\n
A Survey of Algorithms for Handling Permutation Groups<\/div>\n<\/td>
\n
M.D. Atkinson<\/div>\n<\/td>
\n
January 1990<\/div>\n<\/td>
N\/A<\/td><\/tr>
\n
TR-165<\/div>\n<\/td>
\n
Key Exchange Using Chebychev Polynomials<\/a><\/div>\n<\/td>
\n
M.D. Atkinson & Vincenzo Acciaro<\/div>\n<\/td>
\n
January 1990<\/div>\n<\/td>
TR-165.pdf<\/a><\/td><\/tr>
\n
TR-166<\/div>\n<\/td>
\n
Efficient Concurrency Control Protocols for B-tree Indexes<\/a><\/div>\n<\/td>
\n
\n
Ekow J. Otoo<\/div>\n<\/div>\n<\/td>
January 1990<\/td>TR-166.pdf<\/a><\/td><\/tr>
\n
TR-167<\/div>\n<\/td>
\n
A Hierarchical Stochastic Automaton Solution to the Object Partitioning Problem<\/a><\/div>\n<\/td>
\n
\n
B.J. Oommen<\/div>\n<\/div>\n<\/td>
January 1990<\/td>TR-167.pdf<\/a><\/td><\/tr>
TR-168<\/td>\n
Adaptive List Organizing for Non-stationary Query Distributions. Part I: The Move-to-Front Rule<\/a><\/div>\n<\/td>
\n
\n
R.S. Valiveti & B.J. Oommen<\/div>\n<\/div>\n<\/td>
January 1990<\/td>TR-168.pdf<\/a><\/td><\/tr>
TR-169<\/td>\n
Trade-Offs in Non-Reversing Diameter<\/a><\/div>\n<\/td>
\n
\n
Hans L. Bodlaender, Gerard Tel, Nicola Santoro<\/div>\n<\/div>\n<\/td>
January 1990<\/td>TR-169.pdf<\/a><\/td><\/tr>
\n
TR-170<\/div>\n<\/td>
\n
A Massively Parallel Knowledge-Base Server using a Hypercube Multiprocessor<\/a><\/div>\n<\/td>
\n
\n
Frank Dehne, Afonso Ferreira, Andrew Rau-Chaplin<\/div>\n<\/div>\n<\/td>
\n
April 1990<\/div>\n<\/td>
TR-170.pdf<\/a><\/td><\/tr>
\n
TR-171<\/div>\n<\/td>
\n
Parallel Processing of Quad Trees on the Hypercube (and PRAM)<\/div>\n<\/td>
\n
\n
Frank Dehne, Afonso Ferreira, Andrew Rau-Chaplin<\/div>\n<\/div>\n<\/td>
\n
April 1990<\/div>\n<\/td>
N\/A<\/td><\/tr>
\n
TR-172<\/div>\n<\/td>
\n
A Note on the Load Balancing Problem for Coarse Grained Hypercube Dictionary Machines<\/a><\/div>\n<\/td>
\n
\n
Frank Dehne & Michel Gastaldo,<\/div>\n<\/div>\n<\/td>
\n
May 1990<\/div>\n<\/td>
TR-172.pdf<\/a><\/td><\/tr>
\n
TR-173<\/div>\n<\/td>
\n
Self-Organizing Doubly-Linked Lists<\/div>\n<\/td>
\n
\n
R.S. Valiveti & B.J. Oommen<\/div>\n<\/div>\n<\/td>
\n
May 1990<\/div>\n<\/td>
N\/A<\/td><\/tr>
TR-174<\/td>\n
A Presortedness Metric for Ensembles of Data Sequences<\/a><\/div>\n<\/td>
\n
\n
R.S. Valiveti & B.J. Oommen<\/div>\n<\/div>\n<\/td>
\n
May 1990<\/div>\n<\/td>
TR-174.pdf<\/a><\/td><\/tr>
TR-175<\/td>\n
Separation of Graphs of Bounded Genus<\/a><\/div>\n<\/td>
\n
\n
Ljudmil G. Aleksandrov & Hristo N. Djidjev<\/div>\n<\/div>\n<\/td>
\n
May 1990<\/div>\n<\/td>
TR-175.pdf<\/a><\/td><\/tr>
TR-176<\/td>\n
Edge Separators of Planar and Outerplanar Graphs with Applications<\/a><\/div>\n<\/td>
\n
\n
Krzystof Diks, Hristo N. Djidjev, Ondrej Sykora , Imrich Vrto<\/div>\n<\/div>\n<\/td>
\n
May 1990<\/div>\n<\/td>
TR-176.pdf<\/a><\/td><\/tr>
\n
TR-177<\/div>\n<\/td>
\n
Representing Partial Orders by Polygons and Circles in the Plane<\/a><\/div>\n<\/td>
\n
\n
Jeffrey B. Sidney & Stuart J. Sidney<\/div>\n<\/div>\n<\/td>
\n
July 1990<\/div>\n<\/td>
TR-177.pdf<\/a><\/td><\/tr>
TR-178<\/td>\n
Determining Stochastic Dependence for Normally Distributed Vectors Using the Chi-squared Metric<\/a><\/div>\n<\/td>
\n
\n
R.S. Valiveti & B.J. Oommen<\/div>\n<\/div>\n<\/td>
\n
July 1990<\/div>\n<\/td>
TR-178.pdf<\/a><\/td><\/tr>
\n
TR-179<\/div>\n<\/td>
\n
Parallel Algorithms for Determining K-width- Connectivity in Binary Images<\/a><\/div>\n<\/td>
\n
\n
Frank Dehne & Susanne E. Hambrusch<\/div>\n<\/div>\n<\/td>
\n
September 1990<\/div>\n<\/td>
TR-179.pdf<\/a><\/td><\/tr>
TR-180<\/td>\n
A Workbench for Computational Geometry (WOCG)<\/a><\/div>\n<\/td>
\n
\n
P. Epstein, A. Knight, J. May, T. Nguyen, J\u00f6rg-R. Sack<\/div>\n<\/div>\n<\/td>
\n
September 1990<\/div>\n<\/td>
TR-180.pdf<\/a><\/td><\/tr>
TR-181<\/td>\n
Adaptive Linear List Reorganization under a Generalized Query System<\/a><\/div>\n<\/td>
\n
\n
R.S. Valiveti, B.J. Oommen , J.R. Zgierski<\/div>\n<\/div>\n<\/td>
\n
October 1990<\/div>\n<\/td>
TR-181.pdf<\/a><\/td><\/tr>
\n
TR-182<\/div>\n<\/td>
\n
\n
Breaking Substitution Cyphers using Stochastic Automata<\/a><\/div>\n<\/div>\n<\/td>
\n
\n
\n
B.J. Oommen & J.R. Zgierski<\/div>\n<\/div>\n<\/div>\n<\/td>
\n
\n
October 1990<\/div>\n<\/div>\n<\/td>
TR-182.pdf<\/a><\/td><\/tr>
\n
TR-183<\/div>\n<\/td>
\n
\n
A New Algorithm for Testing the Regularity of a Permutation Group<\/a><\/div>\n<\/div>\n<\/td>
\n
\n
\n
V. Acciaro & M.D. Atkinson<\/div>\n<\/div>\n<\/div>\n<\/td>
\n
\n
November 1990<\/div>\n<\/div>\n<\/td>
TR-183.pdf<\/a><\/td><\/tr>
TR-184<\/td>\n
\n
Generating Binary Trees at Random<\/a><\/div>\n<\/div>\n<\/td>
\n
\n
\n
M.D. Atkinson & J\u00f6rg-R\u00fcdiger Sack<\/div>\n<\/div>\n<\/div>\n<\/td>
\n
\n
December 1990<\/div>\n<\/div>\n<\/td>
TR-184.pdf<\/a><\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n

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

Number Title Authors Date Download TR-161 Recognizing Sources of Random Strings R.S. Valiveti and B.J. Oommen January 1990 TR-161.pdf TR-164 A Survey of Algorithms for Handling Permutation Groups M.D. Atkinson January 1990 N\/A TR-165 Key Exchange Using Chebychev Polynomials M.D. Atkinson & Vincenzo Acciaro January 1990 TR-165.pdf TR-166 Efficient Concurrency Control Protocols for B-tree Indexes […]<\/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-11906","page","type-page","status-publish","hentry"],"acf":{"cu_post_thumbnail":""},"_links":{"self":[{"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/11906","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=11906"}],"version-history":[{"count":5,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/11906\/revisions"}],"predecessor-version":[{"id":24640,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/11906\/revisions\/24640"}],"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=11906"}],"wp:term":[{"taxonomy":"cu_page_type","embeddable":true,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/cu_page_type?post=11906"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}