Differential Dataflow Aoc Day15

Advent of Code

Naiad, now available for download, is an investigation of data-parallel

This talk will cover a new computational framework,

Delight in the radiant excitement of

A 15 minute introduction to timely

We continue from the previous video, fleshing out our implementation a bit more to line up with the expectations of the test ...

We implement six graph algorithms in

We dive in to the weird and wonderful world of exotic timestamps in

See more Northwest Database Society talks here: http://db.cs.washington.edu/nwds/nwds.html.

... research through the university system no this is not really funded it's like the project itself

We start a new project to write a simple sudoku solver in

We continue with computing truss decompositions in graphs (edges that participate in lots of mutual triangles). We pick up where ...

Following up on an idea of some other folks, we explain the RGA CRDT, its casting in Datalog, and its translation into

This is the first video in an experimental online conference series to fill the time while https://gradientretreat.com/ is closed.

We make the code a bit more interesting (retracting clues, and seeing how the system works), and also a bit more idiomatic with ...

Continuing our exploration of Rust's ecosystem, I started learning Timely

a bit of a shorter explanation today since this is one of those "you know the algorithm or you don't days" -- I also show off `heapq` ...