tag:blogger.com,1999:blog-11295132.post7373595230260409306..comments2016-06-24T21:01:07.789-07:00Comments on A Neighborhood of Infinity: An Approach to Algorithm ParallelisationDan Piponihttps://plus.google.com/107913314994758123748noreply@blogger.comBlogger6125tag:blogger.com,1999:blog-11295132.post-5410527260266430362008-12-02T07:07:00.000-08:002008-12-02T07:07:00.000-08:00If you are looking for a more typeful derivation o...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:<BR/><BR/>http://citeseer.ist.psu.edu/old/xu03typebased.htmlEdward Kmetthttp://www.blogger.com/profile/16144424873202502715noreply@blogger.comtag:blogger.com,1999:blog-11295132.post-8771119500750931902008-11-30T13:32:00.000-08:002008-11-30T13:32:00.000-08:00Cristian,That prefix sum article is great. There's...Cristian,<BR/><BR/>That prefix sum article is great. There's a bunch of stuff in there I'm interested in. Thanks.sigfpehttp://www.blogger.com/profile/08096190433222340957noreply@blogger.comtag:blogger.com,1999:blog-11295132.post-60917703745576174992008-11-30T13:25:00.000-08:002008-11-30T13:25:00.000-08:00Very nice article. Thank you so much!It reminds me...Very nice article. Thank you so much!<BR/><BR/>It reminds me of Guy Blelloch, Prefix Sums and Their Applications<BR/><BR/>http://www.cs.cmu.edu/~guyb/papers/Ble93.pdfCristianhttp://www.blogger.com/profile/01055204032970253748noreply@blogger.comtag:blogger.com,1999:blog-11295132.post-8467912037810406442008-11-30T01:42:00.000-08:002008-11-30T01:42:00.000-08:00This is extraordinarily cool, thanks for posting t...This is extraordinarily cool, thanks for posting this. Regretfully, I have nothing else substantial to add, but still :)jkffhttp://www.blogger.com/profile/16923431648214439769noreply@blogger.comtag:blogger.com,1999:blog-11295132.post-91282753467975653852008-11-29T21:50:00.000-08:002008-11-29T21:50:00.000-08:00Yes, the Floyd-Warshall algorithm fits into the sa...Yes, the Floyd-Warshall algorithm fits into the same general framework.<BR/><BR/>Incidentally, I wrote about how you can use a monad to implement a very general version of Floyd-Warshall <A HREF="http://sigfpe.blogspot.com/2007/06/how-to-write-tolerably-efficient.html" REL="nofollow">here</A>. This current problem can be implemented with that monad too - but it might be very hard to keep it efficient.sigfpehttp://www.blogger.com/profile/08096190433222340957noreply@blogger.comtag:blogger.com,1999:blog-11295132.post-12357071375646422122008-11-29T20:22:00.000-08:002008-11-29T20:22:00.000-08:00This reminds me of how the Floyd-Warshall algorith...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.Anonymousnoreply@blogger.com