Daily Archives: 18/02/2013

Assorted Links (Algorithms)

Leave a reply
    1. 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.
    2. Dynamic Graph Connectivity in Polylogarithmic Worst Case Time: simpler algorithm with many applications.
    3. Strongly Universal String Hashing is Fast: just 0.2 cycles per byte to achieve strong universality (implementation).
    4. A Randomized Parallel Algorithm with Run Time O(n^2) for Solving an NxN System of Linear Equations: Extending Raghavendra’s algorithm for linear equations over finite fields, over the reals.