<?xml version="1.0" encoding="UTF-8"?>
<rdf:RDF xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" xmlns="http://purl.org/rss/1.0/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"><channel rdf:about="https://www.bibsonomy.org/user/draganigajic/algorithms"><title>BibSonomy bookmarks for /user/draganigajic/algorithms</title><link>https://www.bibsonomy.org/user/draganigajic/algorithms</link><description>BibSonomy RSS Feed for /user/draganigajic/algorithms</description><items><rdf:Seq><rdf:li rdf:resource="http://www.codepoetics.com/wiki/index.php?title=Topics:SICP_in_other_languages"/><rdf:li rdf:resource="http://www.csse.monash.edu.au/~lloyd/"/><rdf:li rdf:resource="http://www.algosort.com/"/><rdf:li rdf:resource="http://11011110.livejournal.com/135302.html"/><rdf:li rdf:resource="http://benlynn.blogspot.com/2007/04/trees-hash-tables-and-tries.html"/><rdf:li rdf:resource="http://video.google.com/videoplay?docid=-2894489251637986433"/><rdf:li rdf:resource="http://mlton.org/FunctionalRecordUpdate"/><rdf:li rdf:resource="http://www.cs.cmu.edu/~aberger/maxent.html"/><rdf:li rdf:resource="http://www.brpreiss.com/"/><rdf:li rdf:resource="http://web.engr.oregonstate.edu/~erwig/papers/abstracts.html"/><rdf:li rdf:resource="http://okmij.org/ftp/Scheme/lib/treap.scm"/><rdf:li rdf:resource="http://graphics.stanford.edu/~seander/bithacks.html"/><rdf:li rdf:resource="http://www.usenix.org/events/hotos07/tech/full_papers/wong/wong_html/"/><rdf:li rdf:resource="http://augustss.blogspot.com/2007/08/quicksort-in-haskell-quicksort-is.html"/><rdf:li rdf:resource="http://www.iro.umontreal.ca/~lapalme/Algorithms-functional.html"/><rdf:li rdf:resource="http://philippsen.com/Personen/schneide/gtbook/appendix-a.pdf?language=de"/><rdf:li rdf:resource="http://igitur-archive.library.uu.nl/dissertations/01850074/inhoud.htm"/><rdf:li rdf:resource="http://lambda-the-ultimate.org/node/2920"/><rdf:li rdf:resource="http://www.randomhacks.net/articles/2007/02/08/haskell-queues-without-pointers"/><rdf:li rdf:resource="http://kapilash.wordpress.com/2008/04/29/z-algorithm-in-haskell/"/></rdf:Seq></items></channel><item rdf:about="http://www.codepoetics.com/wiki/index.php?title=Topics:SICP_in_other_languages"><title>Topics:SICP in other languages - CTMWiki</title><description></description><link>http://www.codepoetics.com/wiki/index.php?title=Topics:SICP_in_other_languages</link><dc:creator>draganigajic</dc:creator><dc:date>2011-07-13T18:13:47+02:00</dc:date><dc:subject>*read 100+ Scala algorithms cs education erlang examples fp haskell javascript lisp lua ocaml pl python qi ruby scheme sicp tutorial wiki </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2011-07-13T18:13:47+02:00&#034; href=&#034;http://www.codepoetics.com/wiki/index.php?title=Topics:SICP_in_other_languages&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://www.codepoetics.com/wiki/index.php?title=Topics:SICP_in_other_languages&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/*read"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/100+"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Scala"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/algorithms"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/cs"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/education"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/erlang"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/examples"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/fp"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/haskell"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/javascript"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/lisp"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/lua"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/ocaml"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/pl"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/python"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/qi"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/ruby"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/scheme"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/sicp"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/tutorial"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/wiki"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.csse.monash.edu.au/~lloyd/"><title>Lloyd Allison FP</title><description></description><link>http://www.csse.monash.edu.au/~lloyd/</link><dc:creator>draganigajic</dc:creator><dc:date>2011-07-13T18:13:46+02:00</dc:date><dc:subject>FP algorithms </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2011-07-13T18:13:46+02:00&#034; href=&#034;http://www.csse.monash.edu.au/~lloyd/&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://www.csse.monash.edu.au/~lloyd/&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/FP"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/algorithms"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.algosort.com/"><title>Computer Programming Algorithms Directory</title><description></description><link>http://www.algosort.com/</link><dc:creator>draganigajic</dc:creator><dc:date>2011-07-13T18:13:40+02:00</dc:date><dc:subject>100+ 1k+ algorithms cs pl programming </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2011-07-13T18:13:40+02:00&#034; href=&#034;http://www.algosort.com/&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://www.algosort.com/&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/100+"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/1k+"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/algorithms"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/cs"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/pl"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/programming"/></rdf:Bag></taxo:topics></item><item rdf:about="http://11011110.livejournal.com/135302.html"><title>11011110: Reweighting a graph for faster shortest paths</title><description></description><link>http://11011110.livejournal.com/135302.html</link><dc:creator>draganigajic</dc:creator><dc:date>2011-07-13T18:13:39+02:00</dc:date><dc:subject>a* ai algorithms cs graph pathfinding </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2011-07-13T18:13:39+02:00&#034; href=&#034;http://11011110.livejournal.com/135302.html&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://11011110.livejournal.com/135302.html&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/a*"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/ai"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/algorithms"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/cs"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/graph"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/pathfinding"/></rdf:Bag></taxo:topics></item><item rdf:about="http://benlynn.blogspot.com/2007/04/trees-hash-tables-and-tries.html"><title>Ben Lynn: Openly Geeky: Trees, Hash Tables and Tries</title><description></description><link>http://benlynn.blogspot.com/2007/04/trees-hash-tables-and-tries.html</link><dc:creator>draganigajic</dc:creator><dc:date>2011-07-13T18:13:38+02:00</dc:date><dc:subject>algorithms cs </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2011-07-13T18:13:38+02:00&#034; href=&#034;http://benlynn.blogspot.com/2007/04/trees-hash-tables-and-tries.html&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://benlynn.blogspot.com/2007/04/trees-hash-tables-and-tries.html&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/algorithms"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/cs"/></rdf:Bag></taxo:topics></item><item rdf:about="http://video.google.com/videoplay?docid=-2894489251637986433"><title>22C3: Lecture on Freenet&#039;s new algorithm</title><description>Ian Clarke and Oskar Sandberg give a talk on the new algorithm behind freenet 0.7, at the Chaos Communication Congress in Berlin.. Dec 30, 2005.</description><link>http://video.google.com/videoplay?docid=-2894489251637986433</link><dc:creator>draganigajic</dc:creator><dc:date>2011-07-13T18:13:29+02:00</dc:date><dc:subject>*watch algorithms anonymity p2p software video </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;Ian Clarke and Oskar Sandberg give a talk on the new algorithm behind freenet 0.7, at the Chaos Communication Congress in Berlin.. Dec 30, 2005.&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/*watch"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/algorithms"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/anonymity"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/p2p"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/software"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/video"/></rdf:Bag></taxo:topics></item><item rdf:about="http://mlton.org/FunctionalRecordUpdate"><title>FunctionalRecordUpdate - MLton Standard ML Compiler (SML Compiler)</title><description></description><link>http://mlton.org/FunctionalRecordUpdate</link><dc:creator>draganigajic</dc:creator><dc:date>2011-07-13T18:13:16+02:00</dc:date><dc:subject>algorithms fp ml sml </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2011-07-13T18:13:16+02:00&#034; href=&#034;http://mlton.org/FunctionalRecordUpdate&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://mlton.org/FunctionalRecordUpdate&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/algorithms"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/fp"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/ml"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/sml"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.cs.cmu.edu/~aberger/maxent.html"><title>Maximum Entropy</title><description></description><link>http://www.cs.cmu.edu/~aberger/maxent.html</link><dc:creator>draganigajic</dc:creator><dc:date>2011-07-13T18:13:14+02:00</dc:date><dc:subject>algorithms bayesian entropy machinelearning math maxent statistics tutorial </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2011-07-13T18:13:14+02:00&#034; href=&#034;http://www.cs.cmu.edu/~aberger/maxent.html&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://www.cs.cmu.edu/~aberger/maxent.html&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/algorithms"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/bayesian"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/entropy"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/machinelearning"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/math"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/maxent"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/statistics"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/tutorial"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.brpreiss.com/"><title>Website of Bruno R. Preiss</title><description></description><link>http://www.brpreiss.com/</link><dc:creator>draganigajic</dc:creator><dc:date>2011-07-13T18:13:11+02:00</dc:date><dc:subject>100+ algorithms book c++ java oo patterns programming python ruby </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2011-07-13T18:13:11+02:00&#034; href=&#034;http://www.brpreiss.com/&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://www.brpreiss.com/&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/100+"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/algorithms"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/book"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/c++"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/java"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/oo"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/patterns"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/programming"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/python"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/ruby"/></rdf:Bag></taxo:topics></item><item rdf:about="http://web.engr.oregonstate.edu/~erwig/papers/abstracts.html"><title>Publication-Abstracts by Martin Erwig</title><description></description><link>http://web.engr.oregonstate.edu/~erwig/papers/abstracts.html</link><dc:creator>draganigajic</dc:creator><dc:date>2011-07-13T18:13:11+02:00</dc:date><dc:subject>*RIL *read abstracts algorithms bibliography cs fp graph haskell papers programming </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2011-07-13T18:13:11+02:00&#034; href=&#034;http://web.engr.oregonstate.edu/~erwig/papers/abstracts.html&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://web.engr.oregonstate.edu/~erwig/papers/abstracts.html&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/*RIL"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/*read"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/abstracts"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/algorithms"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/bibliography"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/cs"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/fp"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/graph"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/haskell"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/papers"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/programming"/></rdf:Bag></taxo:topics></item><item rdf:about="http://okmij.org/ftp/Scheme/lib/treap.scm"><title>[WWW] Olegs Scheme Treap implementation</title><description></description><link>http://okmij.org/ftp/Scheme/lib/treap.scm</link><dc:creator>draganigajic</dc:creator><dc:date>2011-07-13T18:13:10+02:00</dc:date><dc:subject>algorithms code olegKiselyov scheme treaps </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2011-07-13T18:13:10+02:00&#034; href=&#034;http://okmij.org/ftp/Scheme/lib/treap.scm&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://okmij.org/ftp/Scheme/lib/treap.scm&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/algorithms"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/code"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/olegKiselyov"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/scheme"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/treaps"/></rdf:Bag></taxo:topics></item><item rdf:about="http://graphics.stanford.edu/~seander/bithacks.html"><title>Bit Twiddling Hacks</title><description></description><link>http://graphics.stanford.edu/~seander/bithacks.html</link><dc:creator>draganigajic</dc:creator><dc:date>2011-07-13T18:13:09+02:00</dc:date><dc:subject>100+ 1k+ C algorithm algorithms coding optimization performance </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2011-07-13T18:13:09+02:00&#034; href=&#034;http://graphics.stanford.edu/~seander/bithacks.html&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://graphics.stanford.edu/~seander/bithacks.html&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/100+"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/1k+"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/C"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/algorithm"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/algorithms"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/coding"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/optimization"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/performance"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.usenix.org/events/hotos07/tech/full_papers/wong/wong_html/"><title>Hyperspaces for Object Clustering and Approximate Matching in Peer-to-Peer Overlays</title><description></description><link>http://www.usenix.org/events/hotos07/tech/full_papers/wong/wong_html/</link><dc:creator>draganigajic</dc:creator><dc:date>2011-07-13T18:13:08+02:00</dc:date><dc:subject>algorithm algorithms dht p2p search </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2011-07-13T18:13:08+02:00&#034; href=&#034;http://www.usenix.org/events/hotos07/tech/full_papers/wong/wong_html/&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://www.usenix.org/events/hotos07/tech/full_papers/wong/wong_html/&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/algorithm"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/algorithms"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/dht"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/p2p"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/search"/></rdf:Bag></taxo:topics></item><item rdf:about="http://augustss.blogspot.com/2007/08/quicksort-in-haskell-quicksort-is.html"><title>Quicksort in Haskell</title><description></description><link>http://augustss.blogspot.com/2007/08/quicksort-in-haskell-quicksort-is.html</link><dc:creator>draganigajic</dc:creator><dc:date>2011-07-13T18:13:02+02:00</dc:date><dc:subject>algorithms blogpost haskell monads sort </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2011-07-13T18:13:02+02:00&#034; href=&#034;http://augustss.blogspot.com/2007/08/quicksort-in-haskell-quicksort-is.html&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://augustss.blogspot.com/2007/08/quicksort-in-haskell-quicksort-is.html&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/algorithms"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/blogpost"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/haskell"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/monads"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/sort"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.iro.umontreal.ca/~lapalme/Algorithms-functional.html"><title>Algorithms: A Functional Programming Approach</title><description></description><link>http://www.iro.umontreal.ca/~lapalme/Algorithms-functional.html</link><dc:creator>draganigajic</dc:creator><dc:date>2011-07-13T18:13:01+02:00</dc:date><dc:subject>algorithms book fp haskell sethi </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2011-07-13T18:13:01+02:00&#034; href=&#034;http://www.iro.umontreal.ca/~lapalme/Algorithms-functional.html&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://www.iro.umontreal.ca/~lapalme/Algorithms-functional.html&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/algorithms"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/book"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/fp"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/haskell"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/sethi"/></rdf:Bag></taxo:topics></item><item rdf:about="http://philippsen.com/Personen/schneide/gtbook/appendix-a.pdf?language=de"><title>Implementing the Categorical Approach to Graph Transformations With Haskell</title><description></description><link>http://philippsen.com/Personen/schneide/gtbook/appendix-a.pdf?language=de</link><dc:creator>draganigajic</dc:creator><dc:date>2011-07-13T18:12:58+02:00</dc:date><dc:subject>algorithms categoryTheory graph haskell </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2011-07-13T18:12:58+02:00&#034; href=&#034;http://philippsen.com/Personen/schneide/gtbook/appendix-a.pdf?language=de&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://philippsen.com/Personen/schneide/gtbook/appendix-a.pdf?language=de&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/algorithms"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/categoryTheory"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/graph"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/haskell"/></rdf:Bag></taxo:topics></item><item rdf:about="http://igitur-archive.library.uu.nl/dissertations/01850074/inhoud.htm"><title>Frans Johan Rietman: A relational calculus for the design of distributed algorithms</title><description></description><link>http://igitur-archive.library.uu.nl/dissertations/01850074/inhoud.htm</link><dc:creator>draganigajic</dc:creator><dc:date>2011-07-13T18:12:51+02:00</dc:date><dc:subject>algorithms book distributed logic relationalCalculus thesis </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2011-07-13T18:12:51+02:00&#034; href=&#034;http://igitur-archive.library.uu.nl/dissertations/01850074/inhoud.htm&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://igitur-archive.library.uu.nl/dissertations/01850074/inhoud.htm&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/algorithms"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/book"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/distributed"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/logic"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/relationalCalculus"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/thesis"/></rdf:Bag></taxo:topics></item><item rdf:about="http://lambda-the-ultimate.org/node/2920"><title>The Little Books in Oz | Lambda the Ultimate</title><description></description><link>http://lambda-the-ultimate.org/node/2920</link><dc:creator>draganigajic</dc:creator><dc:date>2011-07-13T18:12:50+02:00</dc:date><dc:subject>algorithms announce ltu ml oz scheme </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2011-07-13T18:12:50+02:00&#034; href=&#034;http://lambda-the-ultimate.org/node/2920&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://lambda-the-ultimate.org/node/2920&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/algorithms"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/announce"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/ltu"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/ml"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/oz"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/scheme"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.randomhacks.net/articles/2007/02/08/haskell-queues-without-pointers"><title>Haskell: Queues without pointers</title><description></description><link>http://www.randomhacks.net/articles/2007/02/08/haskell-queues-without-pointers</link><dc:creator>draganigajic</dc:creator><dc:date>2011-07-13T18:12:46+02:00</dc:date><dc:subject>algorithms blogpost haskell queues </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2011-07-13T18:12:46+02:00&#034; href=&#034;http://www.randomhacks.net/articles/2007/02/08/haskell-queues-without-pointers&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://www.randomhacks.net/articles/2007/02/08/haskell-queues-without-pointers&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/algorithms"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/blogpost"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/haskell"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/queues"/></rdf:Bag></taxo:topics></item><item rdf:about="http://kapilash.wordpress.com/2008/04/29/z-algorithm-in-haskell/"><title>Z Algorithm in Haskell</title><description></description><link>http://kapilash.wordpress.com/2008/04/29/z-algorithm-in-haskell/</link><dc:creator>draganigajic</dc:creator><dc:date>2011-07-13T18:12:31+02:00</dc:date><dc:subject>algorithms blogpost haskell snippets strings </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2011-07-13T18:12:31+02:00&#034; href=&#034;http://kapilash.wordpress.com/2008/04/29/z-algorithm-in-haskell/&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://kapilash.wordpress.com/2008/04/29/z-algorithm-in-haskell/&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/algorithms"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/blogpost"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/haskell"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/snippets"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/strings"/></rdf:Bag></taxo:topics></item></rdf:RDF>