2013 is coming to an end, and many papers have been published this year. My recommendations for the next holidays follow: deep, imaginative, mixing the practical and theoretical, and perfect to inspire hope for a better future.<\/p>\n
A Simple Algorithm for the Graph Minor Decomposition<\/a>. A quadratic time algorithm for computing graph minor decompositions is presented, improving from the previous cubic lower bound. It\u2019s very intuitive and easy to understand, so I bet it will appear on future books on algorithms, turning it into a classic.<\/p>\n<\/li>\n Dynamic graph connectivity in polylogarithmic worst case time<\/a>. The classic problem of whether there is a path between two nodes on a dynamically changing graph has a poly-logarithmic algorithm: a theoretical advance with multiple nice applications in practice (routing, transportation, robotics\u2026)<\/p>\n<\/li>\n Ambient backscatter: wireless communication out of thin air<\/a>. Imagine devices communicating wirelessly using ambient radio-frequency as the only source of power, by backscattering ambient RF<\/span> signals: the Internet of Things (IoT) must surely run over this in the future.<\/p>\n<\/li>\n Automatic patch generation learned from human-written patches<\/a>: although the rate of successfully generated patches is still quite low, it\u2019s interesting to learn that there are progresses on this frankly quite boring area of software maintenance.<\/p>\n<\/li>\n F10<\/span>, A Fault-Tolerant Engineered Network<\/a>: a novel way to successfully attack the commonplace problem of network reliability and performance in datacenters by re-examining all the involved parts: network topology, routing algorithm and failure detection.<\/p>\n<\/li>\n Pinocchio, Nearly Practical Veri\ufb01able Computation<\/a>: amazing improvements in the generation of proofs of general computations and their verification, rendering into the practical this basic necessity of the next cloud computing landscape. Combine this with Pepper<\/a> and you\u2019re surely gaining knowledge of the most important advances of this year on the future of cloud computing.<\/p>\n<\/li>\n<\/ol>\n","protected":false},"excerpt":{"rendered":" 2013 is coming to an end, and many papers have been published this year. My recommendations for the next holidays follow: deep, imaginative, mixing the practical and theoretical, and perfect to inspire hope for a better future. A Simple Algorithm for the Graph Minor Decomposition. A quadratic time algorithm for computing graph minor decompositions is [\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":"https:\/\/cerezo.name\/blog\/wp-json\/wp\/v2\/posts\/1364"}],"collection":[{"href":"https:\/\/cerezo.name\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/cerezo.name\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/cerezo.name\/blog\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/cerezo.name\/blog\/wp-json\/wp\/v2\/comments?post=1364"}],"version-history":[{"count":3,"href":"https:\/\/cerezo.name\/blog\/wp-json\/wp\/v2\/posts\/1364\/revisions"}],"predecessor-version":[{"id":1540,"href":"https:\/\/cerezo.name\/blog\/wp-json\/wp\/v2\/posts\/1364\/revisions\/1540"}],"wp:attachment":[{"href":"https:\/\/cerezo.name\/blog\/wp-json\/wp\/v2\/media?parent=1364"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/cerezo.name\/blog\/wp-json\/wp\/v2\/categories?post=1364"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/cerezo.name\/blog\/wp-json\/wp\/v2\/tags?post=1364"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}