Comments on A Neighborhood of Infinity: An Approach to Algorithm Parallelisation

If you are looking for a more typeful derivation o...

2008-12-02T07:07:00.000-08:00

If you are looking for a more typeful derivation of this sort of thing, Dana Xu of ESC/Haskell fame wrote something similiar for her Masters' thesis. A paper based, which I believe is based on that thesis or formed the basis for it:

http://citeseer.ist.psu.edu/old/xu03typebased.html

Cristian,

That prefix sum article is great....

2008-11-30T13:32:00.000-08:00

Cristian,

That prefix sum article is great. There's a bunch of stuff in there I'm interested in. Thanks.

Very nice article. Thank you so much!

It re...

2008-11-30T13:25:00.000-08:00

Very nice article. Thank you so much!

It reminds me of Guy Blelloch, Prefix Sums and Their Applications

http://www.cs.cmu.edu/~guyb/papers/Ble93.pdf

This is extraordinarily cool, thanks for posting t...

2008-11-30T01:42:00.000-08:00

This is extraordinarily cool, thanks for posting this. Regretfully, I have nothing else substantial to add, but still :)

Yes, the Floyd-Warshall algorithm fits into the sa...

2008-11-29T21:50:00.000-08:00

Yes, the Floyd-Warshall algorithm fits into the same general framework.

Incidentally, I wrote about how you can use a monad to implement a very general version of Floyd-Warshall here. This current problem can be implemented with that monad too - but it might be very hard to keep it efficient.

This reminds me of how the Floyd-Warshall algorith...

2008-11-29T20:22:00.000-08:00

This reminds me of how the Floyd-Warshall algorithm can be used to compute shortest path, maximum flow, number of paths, probability of reaching destination, and many other things, depending on the weight semiring you use.