{"id":11736,"date":"2021-10-14T15:12:52","date_gmt":"2021-10-14T19:12:52","guid":{"rendered":"https:\/\/carleton.ca\/scs\/?page_id=11736"},"modified":"2026-06-10T10:04:06","modified_gmt":"2026-06-10T14:04:06","slug":"technical-reports-1995","status":"publish","type":"page","link":"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1995\/","title":{"rendered":"Technical Reports 1995"},"content":{"rendered":"\n<section class=\"w-screen px-6 cu-section cu-section--white ml-offset-center md:px-8 lg:px-14\">\n    <div class=\"space-y-6 cu-max-w-child-5xl  md:space-y-10 cu-prose-first-last\">\n\n            <div class=\"cu-textmedia flex flex-col lg:flex-row mx-auto gap-6 md:gap-10 my-6 md:my-12 first:mt-0 max-w-5xl\">\n        <div class=\"justify-start cu-textmedia-content cu-prose-first-last\" style=\"flex: 0 0 100%;\">\n            <header class=\"font-light prose-xl cu-pageheader md:prose-2xl cu-component-updated cu-prose-first-last\">\n                                    <h1 class=\"cu-prose-first-last font-semibold !mt-2 mb-4 md:mb-6 relative after:absolute after:h-px after:bottom-0 after:bg-cu-red after:left-px text-3xl md:text-4xl lg:text-5xl lg:leading-[3.5rem] pb-5 after:w-10 text-cu-black-700 not-prose\">\n                        Technical Reports 1995\n                    <\/h1>\n                \n                                \n                                    \n\n<div class=\"wp-block-buttons is-layout-flex wp-block-buttons-is-layout-flex\">\n<div class=\"wp-block-button\"><a class=\"wp-block-button__link wp-element-button\" href=\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/\">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<figure class=\"wp-block-table\"><table class=\"has-fixed-layout\"><thead><tr><th>Number<\/th><th>Title<\/th><th>Authors<\/th><th>Date<\/th><th>Download<\/th><\/tr><\/thead><tbody><tr><td>TR-95-01<\/td><td>\n<div class=\"tr_t1\"><a href=\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1995\/tr-95-01-pattern-recognition-of-strings-with-substitution-insertions-deletions\/\">Pattern Recognition of Strings with Substitution, Insertions, Deletions<\/a><\/div>\n<\/td><td>\n<div class=\"tr_t3\">B.J. Oommen &amp; R.K.S. Loke<\/div>\n<\/td><td>\n<div class=\"tr_t3\">January 1995<\/div>\n<\/td><td><a href=\"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/sites\/260\/TR-95-01.pdf\">TR-95-01.pdf<\/a><\/td><\/tr><tr><td>\n<div class=\"tr_t1\">TR-95-02<\/div>\n<\/td><td>\n<div class=\"tr_t1\"><a href=\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1995\/tr-95-02-stochastic-searching-on-the-line-and-its-applications-to-parameter-learning-in-nonlinear-optimization\/\">Stochastic Searching on the Line and its Applications to Parameter Learning in Nonlinear Optimization<\/a><\/div>\n<\/td><td>\n<div class=\"tr_t3\">B.J. Oommen<\/div>\n<\/td><td>\n<div class=\"tr_t3\">January 1995<\/div>\n<\/td><td><a href=\"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/sites\/260\/TR-95-02.pdf\">TR-95-02.pdf<\/a><\/td><\/tr><tr><td>TR-95-03<\/td><td>\n<div class=\"tr_t1\"><a href=\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1995\/tr-95-03-red-black-balanced-trie-hashing\/\">Red-Black Balanced Trie Hashing<\/a><\/div>\n<\/td><td>\n<div class=\"tr_t3\">E. J. Otoo<\/div>\n<\/td><td>\n<div class=\"tr_t3\">February 1995<\/div>\n<\/td><td><a href=\"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/sites\/260\/TR-95-03.pdf\">TR-95-03.pdf<\/a><\/td><\/tr><tr><td>\n<div class=\"tr_t1\">TR-95-04<\/div>\n<\/td><td>\n<div class=\"tr_t1\">\n<div class=\"tr_t1\"><a href=\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1995\/tr-95-04-hop-congestion-tradeoffs-for-atm-networks\/\">Hop-Congestion Tradeoffs for ATM Networks<\/a><\/div>\n<\/div>\n<\/td><td>\n<div class=\"tr_t3\">\n<div class=\"tr_t3\">Evangelos Kranakis, Danny Krizanc, Andrzej Pelc<\/div>\n<\/div>\n<\/td><td>\n<div class=\"tr_t3\">\n<div class=\"tr_t3\">March 1995<\/div>\n<\/div>\n<\/td><td><a href=\"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/sites\/260\/TR-95-04.pdf\">TR-95-04.pdf<\/a><\/td><\/tr><tr><td>\n<div class=\"tr_t1\">TR-95-05<\/div>\n<\/td><td>\n<div class=\"tr_t1\">\n<div class=\"tr_t1\"><a href=\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1995\/tr-95-05-noisy-subsequence-recognition-using-constrained-string-editing-involving-arbitrary-operations\/\">Noisy Subsequence Recognition using Constrained String Editing involving Arbitrary Operations<\/a><\/div>\n<\/div>\n<\/td><td>\n<div class=\"tr_t3\">\n<div class=\"tr_t3\">B. J. Oommen &amp; R.K.S. Loke<\/div>\n<\/div>\n<\/td><td>\n<div class=\"tr_t3\">\n<div class=\"tr_t3\">March 1995<\/div>\n<\/div>\n<\/td><td><a href=\"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/sites\/260\/TR-95-05.pdf\">TR-95-05.pdf<\/a><\/td><\/tr><tr><td>\n<div class=\"tr_t1\">TR-95-06<\/div>\n<\/td><td>\n<div class=\"tr_t1\">\n<div class=\"tr_t1\"><a href=\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1995\/tr-95-06-planar-stage-graphs-characterizations-and-applications\/\">Planar Stage Graphs: Characterizations and Applications<\/a><\/div>\n<\/div>\n<\/td><td>\n<div class=\"tr_t3\">\n<div class=\"tr_t3\">Frank Bauernoppel, Evangelos Kranakis,, Danny Krizanc, Anil Maheshwari, Jorg-Rudiger Sack, Jorge Urrutia<\/div>\n<\/div>\n<\/td><td>\n<div class=\"tr_t3\">\n<div class=\"tr_t3\">March 1995<\/div>\n<\/div>\n<\/td><td><a href=\"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/sites\/260\/TR-95-06.pdf\">TR-95-06.pdf<\/a><\/td><\/tr><tr><td>\n<div class=\"tr_t1\">TR-95-07<\/div>\n<\/td><td>\n<div class=\"tr_t1\">\n<div class=\"tr_t1\"><a href=\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1995\/tr-95-07-stage-graph-representations\/\">Stage-Graph Representations<\/a><\/div>\n<\/div>\n<\/td><td>\n<div class=\"tr_t3\">\n<div class=\"tr_t3\">Evangelos Kranakis, Danny Krizanc, Anil Maheshwari, Marc Noy, Jorg-Rudiger Sack, Jorge Urrutia<\/div>\n<\/div>\n<\/td><td>\n<div class=\"tr_t3\">\n<div class=\"tr_t3\">March 1995<\/div>\n<\/div>\n<\/td><td><a href=\"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/sites\/260\/TR-95-07.pdf\">TR-95-07.pdf<\/a><\/td><\/tr><tr><td>\n<div class=\"tr_t1\">TR-95-08<\/div>\n<\/td><td>\n<div class=\"tr_t1\">\n<div class=\"tr_t1\"><a href=\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1995\/tr-95-08-implicit-routing-and-shortest-path-information\/\">Implicit Routing and Shortest Path Information<\/a><\/div>\n<\/div>\n<\/td><td>\n<div class=\"tr_t3\">\n<div class=\"tr_t3\">Evangelos Kranakis, Danny Krizanc, Jorge Urrutia<\/div>\n<\/div>\n<\/td><td>\n<div class=\"tr_t3\">\n<div class=\"tr_t3\">April 1995<\/div>\n<\/div>\n<\/td><td><a href=\"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/sites\/260\/TR-95-08.pdf\">TR-95-08.pdf<\/a><\/td><\/tr><tr><td>\n<div class=\"tr_t1\">TR-95-09<\/div>\n<\/td><td>\n<div class=\"tr_t1\">\n<div class=\"tr_t1\"><a href=\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1995\/tr-95-09-ray-shooting-from-convex-ranges\/\">Ray Shooting from Convex Ranges<\/a><\/div>\n<\/div>\n<\/td><td>\n<div class=\"tr_t3\">\n<div class=\"tr_t3\">Evangelos Kranakis, Danny Krizanc, A. Maheshwari, J.R. Sack, J. Urrutia<\/div>\n<\/div>\n<\/td><td>\n<div class=\"tr_t3\">\n<div class=\"tr_t3\">April 1995<\/div>\n<\/div>\n<\/td><td><a href=\"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/sites\/260\/TR-95-09.pdf\">TR-95-09.pdf<\/a><\/td><\/tr><tr><td>\n<div class=\"tr_t1\">TR-95-10<\/div>\n<\/td><td>\n<div class=\"tr_t1\">\n<div class=\"tr_t1\"><a href=\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1995\/tr-95-10-sense-of-direction-definitions-properties-and-classes\/\">Sense of Direction: Definitions, Properties, and Classes<\/a><\/div>\n<\/div>\n<\/td><td>\n<div class=\"tr_t3\">\n<div class=\"tr_t3\">Paola Flocchini, Bernard Mans, Nicola Santoro<\/div>\n<\/div>\n<\/td><td>\n<div class=\"tr_t3\">\n<div class=\"tr_t3\">May 1995<\/div>\n<\/div>\n<\/td><td><a href=\"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/sites\/260\/TR-95-10.pdf\">TR-95-10.pdf<\/a><\/td><\/tr><tr><td>\n<div class=\"tr_t1\">TR-95-11<\/div>\n<\/td><td>\n<div class=\"tr_t1\">\n<div class=\"tr_t1\"><a href=\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1995\/tr-95-11-sense-of-direction-minimizing-congestion-of-layouts-for-atm-networks-with-faulty-links\/\">Minimizing Congestion of Layouts for ATM Networks with Faulty Links<\/a><\/div>\n<\/div>\n<\/td><td>\n<div class=\"tr_t3\">\n<div class=\"tr_t3\">Leszek Gasieniec, Evangelos Kranakis, Danny Krizanc, Andrzej Pelc<\/div>\n<\/div>\n<\/td><td>\n<div class=\"tr_t3\">\n<div class=\"tr_t3\">May 1995<\/div>\n<\/div>\n<\/td><td><a href=\"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/sites\/260\/TR-95-11.pdf\">TR-95-11.pdf<\/a><\/td><\/tr><tr><td>\n<div class=\"tr_t1\">TR-95-12<\/div>\n<\/td><td>\n<div class=\"tr_t1\">\n<div class=\"tr_t1\"><a href=\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1995\/tr-95-12-an-improved-maximum-matching-algorithm-in-a-permutation-graph\/\">An Improved Maximum Matching Algorithm in a Permutation Graph<\/a><\/div>\n<\/div>\n<\/td><td>\n<div class=\"tr_t3\">\n<div class=\"tr_t3\">Frank Bauernoppel, Evangelos Kranakis, Danny Krizanc, Anil Maheshwari, Jorg-Rudiger Sack, Jorge Urrutia<\/div>\n<\/div>\n<\/td><td>\n<div class=\"tr_t3\">\n<div class=\"tr_t3\">May 1995<\/div>\n<\/div>\n<\/td><td><a href=\"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/sites\/260\/TR-95-12.pdf\">TR-95-12.pdf<\/a><\/td><\/tr><tr><td>\n<div class=\"tr_t1\">TR-95-13<\/div>\n<\/td><td>\n<div class=\"tr_t1\">\n<div class=\"tr_t1\"><a href=\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1995\/tr-95-13-efficient-computation-of-implicit-representations-of-sparse-graph\/\">Efficient Computation of Implicit Representations of Sparse Graph<\/a><\/div>\n<\/div>\n<\/td><td>\n<div class=\"tr_t3\">\n<div class=\"tr_t3\">Srinivasa R. Arikati, Anil Maheshwari, Christos D. Zaroliagis<\/div>\n<\/div>\n<\/td><td>\n<div class=\"tr_t3\">\n<div class=\"tr_t3\">May 1995<\/div>\n<\/div>\n<\/td><td><a href=\"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/sites\/260\/TR-95-13.pdf\">TR-95-13.pdf<\/a><\/td><\/tr><tr><td>\n<div class=\"tr_t1\">TR-95-14<\/div>\n<\/td><td>\n<div class=\"tr_t1\">\n<div class=\"tr_t1\"><a href=\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1995\/tr-95-14-a-randomized-parallel-3d-convex-hull-algorithm-for-coarse-grained-multicomputers\/\">A Randomized Parallel 3D Convex Hull Algorithm for Coarse Grained Multicomputers<\/a><\/div>\n<\/div>\n<\/td><td>\n<div class=\"tr_t3\">\n<div class=\"tr_t3\">Frank Dehne, Xiaotie Deng, Patrick Dymond, Andreas Fabri, Ashfaq A. Khokhar<\/div>\n<\/div>\n<\/td><td>\n<div class=\"tr_t3\">\n<div class=\"tr_t3\">June 1995<\/div>\n<\/div>\n<\/td><td><a href=\"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/sites\/260\/TR-95-14.pdf\">TR-95-14.pdf<\/a><\/td><\/tr><tr><td>\n<div class=\"tr_t1\">TR-95-15<\/div>\n<\/td><td>\n<div class=\"tr_t1\">\n<div class=\"tr_t1\"><a href=\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1995\/tr-95-15-pas-a-printer-accounting-system-for-linux\/\">PAS: A Printer Accounting System for Linux<\/a><\/div>\n<\/div>\n<\/td><td>\n<div class=\"tr_t3\">\n<div class=\"tr_t3\">Murali Thiyagarajah<\/div>\n<\/div>\n<\/td><td>\n<div class=\"tr_t3\">\n<div class=\"tr_t3\">June 1995<\/div>\n<\/div>\n<\/td><td><a href=\"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/sites\/260\/TR-95-15.pdf\">TR-95-15.pdf<\/a><\/td><\/tr><tr><td>\n<div class=\"tr_t1\">TR-95-16<\/div>\n<\/td><td>\n<div class=\"tr_t1\">\n<div class=\"tr_t1\"><a href=\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1995\/tr-95-16-multipacket-hot-potato-routing-on-processor-arrays\/\">Multipacket Hot-Potato Routing on Processor Arrays<\/a><\/div>\n<\/div>\n<\/td><td>\n<div class=\"tr_t3\">\n<div class=\"tr_t3\">Christos Kaklamanis &amp; Danny Krizanc<\/div>\n<\/div>\n<\/td><td>\n<div class=\"tr_t3\">\n<div class=\"tr_t3\">June 1995<\/div>\n<\/div>\n<\/td><td><a href=\"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/sites\/260\/TR-95-16_0.pdf\">TR-95-16.pdf<\/a><\/td><\/tr><tr><td>\n<div class=\"tr_t1\">TR-95-17<\/div>\n<\/td><td>\n<div class=\"tr_t1\">\n<div class=\"tr_t1\"><a href=\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1995\/tr-95-17-complexity-of-boolean-routing\/\">Complexity of Boolean Routing<\/a><\/div>\n<\/div>\n<\/td><td>\n<div class=\"tr_t3\">\n<div class=\"tr_t3\">Evangelos Kranakis, Danny Krizanc, Jorge Urrutia<\/div>\n<\/div>\n<\/td><td>\n<div class=\"tr_t3\">\n<div class=\"tr_t3\">July 1995<\/div>\n<\/div>\n<\/td><td><a href=\"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/sites\/260\/TR-95-17.pdf\">TR-95-17.pdf<\/a><\/td><\/tr><tr><td>\n<div class=\"tr_t1\">TR-95-18<\/div>\n<\/td><td>\n<div class=\"tr_t1\">\n<div class=\"tr_t1\"><a href=\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1995\/tr-95-18-lower-bounds-for-compact-routing\/\">Lower Bounds for Compact Routing<\/a><\/div>\n<\/div>\n<\/td><td>\n<div class=\"tr_t3\">\n<div class=\"tr_t3\">Evangelos Kranakis &amp; Danny Krizanc<\/div>\n<\/div>\n<\/td><td>\n<div class=\"tr_t3\">\n<div class=\"tr_t3\">July 1995<\/div>\n<\/div>\n<\/td><td><a href=\"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/sites\/260\/TR-95-18.pdf\">TR-95-18.pdf<\/a><\/td><\/tr><tr><td>TR-95-19<\/td><td>\n<div class=\"tr_t1\">\n<div class=\"tr_t1\"><a href=\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1995\/tr-95-19-vector-quantization-for-arbitrary-distance-function-estimation\/\">Vector Quantization for Arbitrary Distance Function Estimation<\/a><\/div>\n<\/div>\n<\/td><td>\n<div class=\"tr_t3\">\n<div class=\"tr_t3\">I. Kuban Altinel, John Oommen, Necati Aras<\/div>\n<\/div>\n<\/td><td>\n<div class=\"tr_t3\">\n<div class=\"tr_t3\">July 1995<\/div>\n<\/div>\n<\/td><td><a href=\"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/sites\/260\/TR-95-19.pdf\">TR-95-19.pdf<\/a><\/td><\/tr><tr><td>\n<div class=\"tr_t1\">TR-95-20<\/div>\n<\/td><td>\n<div class=\"tr_t1\">\n<div class=\"tr_t1\">Multi-Dimensional Spatial Index Encoding Device<\/div>\n<\/div>\n<\/td><td>\n<div class=\"tr_t3\">\n<div class=\"tr_t3\">Y. Gao, E.J. Otoo, M. Thiyagarajah<\/div>\n<\/div>\n<\/td><td>\n<div class=\"tr_t3\">\n<div class=\"tr_t3\">October 1995<\/div>\n<\/div>\n<\/td><td>N\/A<\/td><\/tr><tr><td>\n<div class=\"tr_t1\">TR-95-21<\/div>\n<\/td><td>\n<div class=\"tr_t1\">\n<div class=\"tr_t1\"><a href=\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1995\/tr-95-21-reducing-contention-for-run-queue-in-shared-memory-multiprocessor-systems\/\">Reducing Contention for Run Queue in Shared-Memory Multiprocessor Systems<\/a><\/div>\n<\/div>\n<\/td><td>\n<div class=\"tr_t3\">\n<div class=\"tr_t3\">Sivarama P. Dandamudi<\/div>\n<\/div>\n<\/td><td>\n<div class=\"tr_t3\">\n<div class=\"tr_t3\">October 1995<\/div>\n<\/div>\n<\/td><td><a href=\"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/sites\/260\/TR-95-21.pdf\">TR-95-21.pdf<\/a><\/td><\/tr><tr><td>\n<div class=\"tr_t1\">TR-95-22<\/div>\n<\/td><td>\n<div class=\"tr_t1\">\n<div class=\"tr_t1\"><a href=\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1995\/tr-95-22-approximate-maxima-finding-of-continuous-functions-under-restricted-budget\/\">Approximate Maxima Finding of Continuous Functions under Restricted Budget<\/a><\/div>\n<\/div>\n<\/td><td>\n<div class=\"tr_t3\">\n<div class=\"tr_t3\">Evangelos Kranakis, Danny Krizanc, Andrzej Pelc, David Peleg<\/div>\n<\/div>\n<\/td><td>\n<div class=\"tr_t3\">\n<div class=\"tr_t3\">November 1995<\/div>\n<\/div>\n<\/td><td><a href=\"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/sites\/260\/TR-95-22.pdf\">TR-95-22.pdf<\/a><\/td><\/tr><tr><td>\n<div class=\"tr_t1\">TR-95-23<\/div>\n<\/td><td>\n<div class=\"tr_t1\">\n<div class=\"tr_t1\"><a href=\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1995\/tr-95-23-performance-impact-of-run-queue-organization-and-synchronization-on-large-scale-numa-multiprocessor-systems\/\">Performance Impact of Run Queue Organization and Synchronization on Large-Scale NUMA Multiprocessor Systems<\/a><\/div>\n<\/div>\n<\/td><td>\n<div class=\"tr_t3\">\n<div class=\"tr_t3\">Sivarama P. Dandamudi &amp; S. P. Cheng<\/div>\n<\/div>\n<\/td><td>\n<div class=\"tr_t3\">\n<div class=\"tr_t3\">November 1995<\/div>\n<\/div>\n<\/td><td><a href=\"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/sites\/260\/TR-95-23.pdf\">TR-95-23.pdf<\/a><\/td><\/tr><tr><td>\n<div class=\"tr_t1\">TR-95-24<\/div>\n<\/td><td>\n<div class=\"tr_t1\">\n<div class=\"tr_t1\"><a href=\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1995\/tr-95-24-the-impact-of-program-structure-on-the-performance-of-scheduling-policies-in-multiprocessor-systems\/\">The Impact of Program Structure on the Performance of Scheduling Policies in Multiprocessor Systems<\/a><\/div>\n<\/div>\n<\/td><td>\n<div class=\"tr_t3\">\n<div class=\"tr_t3\">Sivarama P.Dandamudi<\/div>\n<\/div>\n<\/td><td>\n<div class=\"tr_t3\">\n<div class=\"tr_t3\">November 1995<\/div>\n<\/div>\n<\/td><td><a href=\"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/sites\/260\/TR-95-24.pdf\">TR-95-24.pdf<\/a><\/td><\/tr><tr><td>\n<div class=\"tr_t1\">TR-95-25<\/div>\n<\/td><td>\n<div class=\"tr_t1\">\n<div class=\"tr_t1\"><a href=\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1995\/tr-95-25-the-effect-of-scheduling-discipline-on-sender-initiated-and-receiver-initiated-adaptive-load-sharing-in-homogeneous-distributed-systems\/\">The Effect of Scheduling Discipline on Sender-Initiated and Receiver-Initiated Adaptive Load Sharing in Homogeneous Distributed Systems<\/a><\/div>\n<\/div>\n<\/td><td>\n<div class=\"tr_t3\">\n<div class=\"tr_t3\">Sivarama P. Dandamudi<\/div>\n<\/div>\n<\/td><td>\n<div class=\"tr_t3\">\n<div class=\"tr_t3\">December 1995<\/div>\n<\/div>\n<\/td><td><a href=\"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/sites\/260\/TR-95-25.pdf\">TR-95-25.pdf<\/a><\/td><\/tr><tr><td>\n<div class=\"tr_t1\">TR-95-26<\/div>\n<\/td><td>\n<div class=\"tr_t1\">\n<div class=\"tr_t1\"><a href=\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1995\/tr-95-26-approximating-the-unsatisfiability-threshold-of-random-formulas\/\">Approximating the Unsatisfiability Threshold of Random Formulas<\/a><\/div>\n<\/div>\n<\/td><td>\n<div class=\"tr_t3\">\n<div class=\"tr_t3\">Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc<\/div>\n<\/div>\n<\/td><td>\n<div class=\"tr_t3\">\n<div class=\"tr_t3\">December 1995<\/div>\n<\/div>\n<\/td><td><a href=\"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/sites\/260\/TR-95-26.pdf\">TR-95-26.pdf<\/a><\/td><\/tr><\/tbody><\/table><\/figure>\n","protected":false},"excerpt":{"rendered":"<p>Number Title Authors Date Download TR-95-01 Pattern Recognition of Strings with Substitution, Insertions, Deletions B.J. Oommen &amp; R.K.S. Loke January 1995 TR-95-01.pdf TR-95-02 Stochastic Searching on the Line and its Applications to Parameter Learning in Nonlinear Optimization B.J. Oommen January 1995 TR-95-02.pdf TR-95-03 Red-Black Balanced Trie Hashing E. J. Otoo February 1995 TR-95-03.pdf TR-95-04 Hop-Congestion [&hellip;]<\/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-11736","page","type-page","status-publish","hentry"],"acf":{"cu_post_thumbnail":""},"_links":{"self":[{"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/11736","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=11736"}],"version-history":[{"count":5,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/11736\/revisions"}],"predecessor-version":[{"id":24645,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/11736\/revisions\/24645"}],"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=11736"}],"wp:term":[{"taxonomy":"cu_page_type","embeddable":true,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/cu_page_type?post=11736"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}