{"id":12272,"date":"2021-11-08T20:59:50","date_gmt":"2021-11-09T01:59:50","guid":{"rendered":"https:\/\/carleton.ca\/scs\/?page_id=12272"},"modified":"2026-06-10T10:05:16","modified_gmt":"2026-06-10T14:05:16","slug":"technical-reports-2001","status":"publish","type":"page","link":"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-2001\/","title":{"rendered":"Technical Reports 2001"},"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 2001\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>\n<div class=\"tr_t1\">TR-01-01<\/div>\n<\/td><td>\n<div class=\"tr_t1\"><a href=\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-2001\/tr-01-01-coarse-grained-parallel-fixed-parameter-tractable-algorithms\/\">Coarse Grained Parallel Fixed-Parameter Tractable Algorithms<\/a><\/div>\n<\/td><td>\n<div class=\"tr_t3\">Frank Dehne, Andrew Rau-Chaplin, Ulrike Stege, Peter J. Taillon<\/div>\n<\/td><td>\n<div class=\"tr_t3\">March 2001<\/div>\n<\/td><td><a href=\"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/sites\/260\/TR-01-01.pdf\">TR-01-01.pdf<\/a><\/td><\/tr><tr><td>\n<div class=\"tr_t1\">TR-01-02<\/div>\n<\/td><td>\n<div class=\"tr_t1\"><a href=\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-2001\/tr-01-02-i-o-efficient-planar-separators-and-applications\/\">I\/O-Efficient Planar Separators and Applications<\/a><\/div>\n<\/td><td>\n<div class=\"tr_t3\">Norbert Zeh<\/div>\n<\/td><td>\n<div class=\"tr_t3\">May 2001<\/div>\n<\/td><td><a href=\"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/sites\/260\/TR-01-02.pdf\">TR-01-02.pdf<\/a><\/td><\/tr><tr><td>\n<div class=\"tr_t1\">TR-01-03<\/div>\n<\/td><td>\n<div class=\"tr_t1\"><a href=\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-2001\/tr-01-03-on-opitmal-pairwise-linear-classifiers-for-normal-distributions-the-d-dimensional-case\/\">On Opitmal Pairwise Linear Classifiers for Normal Distributions: The d-Dimensional Case<\/a><\/div>\n<\/td><td>\n<div class=\"tr_t3\">Luis Rueda &amp; B. John Oommen<\/div>\n<\/td><td>\n<div class=\"tr_t3\">January 2001<\/div>\n<\/td><td><a href=\"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/sites\/260\/TR-01-03.pdf\">TR-01-03.pdf<\/a><\/td><\/tr><tr><td>\n<div class=\"tr_t1\">TR-01-04<\/div>\n<\/td><td>\n<div class=\"tr_t1\"><a href=\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-2001\/tr-01-04-a-formal-analysis-of-why-heuristics-work\/\">A Formal Analysis of Why Heuristics Work<\/a><\/div>\n<\/td><td>\n<div class=\"tr_t3\">B. John Oommen &amp; Luis G. Rueda<\/div>\n<\/td><td>\n<div class=\"tr_t3\">July 2001<\/div>\n<\/td><td><a href=\"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/sites\/260\/TR-01-04.pdf\">TR-01-04.pdf<\/a><\/td><\/tr><tr><td>\n<div class=\"tr_t1\">TR-01-05<\/div>\n<\/td><td>\n<div class=\"tr_t1\"><a href=\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-2001\/tr-01-05-nearly-optimal-fano-based-canonical-codes\/\">Nearly-Optimal Fano-Based Canonical Codes<\/a><\/div>\n<\/td><td>\n<div class=\"tr_t3\">Luis G. Rueda &amp; B. John Oommen<\/div>\n<\/td><td>\n<div class=\"tr_t3\">July 2001<\/div>\n<\/td><td><a href=\"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/sites\/260\/TR-01-05.pdf\">TR-01-05.pdf<\/a><\/td><\/tr><tr><td>\n<div class=\"tr_t1\">TR-01-06<\/div>\n<\/td><td>\n<div class=\"tr_t1\"><a href=\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-2001\/tr-01-06-the-efficiency-of-modern-day-histogram-like-techniques-for-query-optimization\/\">The Efficiency of Modern-Day Histogram-Like Techniques for Query Optimization<\/a><\/div>\n<\/td><td>\n<div class=\"tr_t3\">B. John Oommen &amp; Luis G. Rueda<\/div>\n<\/td><td>\n<div class=\"tr_t3\">July 2001<\/div>\n<\/td><td><a href=\"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/sites\/260\/TR-01-06.pdf\">TR-01-06.pdf<\/a><\/td><\/tr><tr><td>\n<div class=\"tr_t1\">TR-01-07<\/div>\n<\/td><td>\n<div class=\"tr_t1\"><a href=\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-2001\/tr-01-07-o-optimal-planar-embedding-using-graph-seperators\/\">O-Optimal Planar Embedding using Graph Seperators<\/a><\/div>\n<\/td><td>\n<div class=\"tr_t3\">Norbert Zeh<\/div>\n<\/td><td>\n<div class=\"tr_t3\">September 2001<\/div>\n<\/td><td><a href=\"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/sites\/260\/TR-01-07.pdf\">TR-01-07.pdf<\/a><\/td><\/tr><\/tbody><\/table><\/figure>\n","protected":false},"excerpt":{"rendered":"<p>Number Title Authors Date Download TR-01-01 Coarse Grained Parallel Fixed-Parameter Tractable Algorithms Frank Dehne, Andrew Rau-Chaplin, Ulrike Stege, Peter J. Taillon March 2001 TR-01-01.pdf TR-01-02 I\/O-Efficient Planar Separators and Applications Norbert Zeh May 2001 TR-01-02.pdf TR-01-03 On Opitmal Pairwise Linear Classifiers for Normal Distributions: The d-Dimensional Case Luis Rueda &amp; B. John Oommen January 2001 [&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-12272","page","type-page","status-publish","hentry"],"acf":{"cu_post_thumbnail":""},"_links":{"self":[{"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/12272","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=12272"}],"version-history":[{"count":5,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/12272\/revisions"}],"predecessor-version":[{"id":24651,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/12272\/revisions\/24651"}],"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=12272"}],"wp:term":[{"taxonomy":"cu_page_type","embeddable":true,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/cu_page_type?post=12272"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}