Chronological feed of everything captured from Victoria Krakovna.
(re)Assessing PiM Effectiveness for Sequence Alignment — Citations: 0.
SSSP-Del: Fully Dynamic Distributed Algorithm for Single-Source Shortest Path — Modern graphs are both large and dynamic, presenting significant challenges for fundamental queries, such as the Single-Source Shortest Path (SSSP) problem. Naively recomputing the SSSP tree after each topology change is prohibitively expensive, causing on-demand computation to suffer from high latency. Existing dynamic SSSP algorithms often cannot simultaneously handle both edge additions and deletions, operate in distributed memory, and provide low-latency query results. To address these chall — Citations: 0.