{"id":1271,"date":"2013-02-18T21:38:42","date_gmt":"2013-02-18T20:38:42","guid":{"rendered":"http:\/\/cerezo.name\/blog\/?p=1271"},"modified":"2024-10-14T13:39:31","modified_gmt":"2024-10-14T11:39:31","slug":"assorted-links-algorithms","status":"publish","type":"post","link":"http:\/\/cerezo.name\/blog\/2013\/02\/18\/assorted-links-algorithms\/","title":{"rendered":"Assorted Links (Algorithms)"},"content":{"rendered":"<ol>\n<li style=\"list-style-type: none;\">\n<ol>\n<li style=\"text-align: justify;\"><a href=\"http:\/\/www.automata.rwth-aachen.de\/~grohe\/pub\/grokawree13.pdf\" target=\"_blank\" rel=\"noopener\" class=\"broken_link\">A Simple Algorithm for the Graph Minor Decomposition: Logic Meets Structural Graph Theory<\/a>. A simple and elegant quadratic time algorithm for computing graph minor decompositions.<\/li>\n<li style=\"text-align: justify;\"><a href=\"http:\/\/webhome.cs.uvic.ca\/~val\/Publications\/SODA13slides.pdf\" target=\"_blank\" rel=\"noopener\">Dynamic Graph Connectivity in Polylogarithmic Worst Case Time<\/a>: simpler algorithm with many applications.<\/li>\n<li style=\"text-align: justify;\"><a href=\"http:\/\/arxiv.org\/abs\/1202.4961\" target=\"_blank\" rel=\"noopener\">Strongly Universal String Hashing is Fast<\/a>:&nbsp;just 0.2 cycles per byte to achieve strong universality (<a href=\"http:\/\/code.google.com\/p\/variablelengthstringhashing\/\" target=\"_blank\" rel=\"noopener\">implementation<\/a>).<\/li>\n<li style=\"text-align: justify;\"><a href=\"http:\/\/arxiv.org\/abs\/1209.3995\" target=\"_blank\" rel=\"noopener\">A Randomized Parallel Algorithm with Run Time O(n^2) for Solving an NxN System of Linear Equations<\/a>:&nbsp;Extending Raghavendra\u2019s algorithm for linear equations over finite fields, over the&nbsp;reals.<\/li>\n<\/ol>\n<\/li>\n<\/ol>\n","protected":false},"excerpt":{"rendered":"<p>A Simple Algorithm for the Graph Minor Decomposition: Logic Meets Structural Graph Theory. A simple and elegant quadratic time algorithm for computing graph minor decompositions. Dynamic Graph Connectivity in Polylogarithmic Worst Case Time: simpler algorithm with many applications. Strongly Universal String Hashing is Fast:&nbsp;just 0.2 cycles per byte to achieve strong universality (implementation). A Randomized&nbsp;[\u2026]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"wp_typography_post_enhancements_disabled":false,"ngg_post_thumbnail":0},"categories":[18],"tags":[],"_links":{"self":[{"href":"http:\/\/cerezo.name\/blog\/wp-json\/wp\/v2\/posts\/1271"}],"collection":[{"href":"http:\/\/cerezo.name\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"http:\/\/cerezo.name\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"http:\/\/cerezo.name\/blog\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"http:\/\/cerezo.name\/blog\/wp-json\/wp\/v2\/comments?post=1271"}],"version-history":[{"count":4,"href":"http:\/\/cerezo.name\/blog\/wp-json\/wp\/v2\/posts\/1271\/revisions"}],"predecessor-version":[{"id":1554,"href":"http:\/\/cerezo.name\/blog\/wp-json\/wp\/v2\/posts\/1271\/revisions\/1554"}],"wp:attachment":[{"href":"http:\/\/cerezo.name\/blog\/wp-json\/wp\/v2\/media?parent=1271"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"http:\/\/cerezo.name\/blog\/wp-json\/wp\/v2\/categories?post=1271"},{"taxonomy":"post_tag","embeddable":true,"href":"http:\/\/cerezo.name\/blog\/wp-json\/wp\/v2\/tags?post=1271"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}