<?xml version="1.0" encoding="UTF-8"?>
 <rdf:RDF xmlns="http://purl.org/rss/1.0/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:cc="http://web.resource.org/cc/" xmlns:syn="http://purl.org/rss/1.0/modules/syndication/" xmlns:admin="http://webns.net/mvcb/">
  <channel rdf:about="http://pinboard.in">
    <title>Pinboard (randombit)</title>
    <link>https://pinboard.in/u:randombit/public/</link>
    <description>recent bookmarks from randombit</description>
    <items>
      <rdf:Seq>	<rdf:li rdf:resource="https://courses.csail.mit.edu/6.042/spring17/mcs.pdf"/>
	<rdf:li rdf:resource="http://www.cs.rochester.edu/u/michael/PODC96.html"/>
	<rdf:li rdf:resource="http://blog.reverberate.org/2013/07/ll-and-lr-parsing-demystified.html"/>
	<rdf:li rdf:resource="http://marisa-trie.googlecode.com/svn/trunk/docs/readme.en.html"/>
	<rdf:li rdf:resource="https://code.google.com/p/cpp-btree/"/>
	<rdf:li rdf:resource="http://www.cs.ucsb.edu/~koc/docs/j37.pdf"/>
	<rdf:li rdf:resource="http://cmph.sourceforge.net/"/>
	<rdf:li rdf:resource="http://www.cs.toronto.edu/~mackay/itila/book.html"/>
	<rdf:li rdf:resource="http://en.wikipedia.org/wiki/Stable_marriage_problem"/>
	<rdf:li rdf:resource="http://www.1stworks.com/ref/RuskeyCombGen.pdf"/>
	<rdf:li rdf:resource="http://algowiki.net/wiki/index.php/Edmonds's_algorithm"/>
	<rdf:li rdf:resource="http://infolab.stanford.edu/TR/CS-TR-75-482.html"/>
	<rdf:li rdf:resource="http://robotics.stanford.edu/~nilsson/mlbook.html"/>
	<rdf:li rdf:resource="http://www-csli.stanford.edu/~hinrich/information-retrieval-book.html"/>
	<rdf:li rdf:resource="http://csrc.nist.gov/groups/ST/hash/index.html"/>
	<rdf:li rdf:resource="http://citeseer.ist.psu.edu/seidel96randomized.html"/>
	<rdf:li rdf:resource="http://en.wikipedia.org/wiki/Sieve_of_Atkin"/>
	<rdf:li rdf:resource="http://www.ee.technion.ac.il/~hugo/kdf/"/>
	<rdf:li rdf:resource="http://www.oreilly.com/catalog/9780596529321/toc.html"/>
	<rdf:li rdf:resource="http://www.aiplayground.org/artikel/delicious-mates/"/>
	<rdf:li rdf:resource="http://www.cl.cam.ac.uk/research/srg/netos/lock-free/"/>
	<rdf:li rdf:resource="http://www.ee.technion.ac.il/~ayellet/Ps/nelson.pdf"/>
	<rdf:li rdf:resource="http://minisat.se/"/>
	<rdf:li rdf:resource="http://en.wikipedia.org/wiki/Adaptive_Replacement_Cache"/>
	<rdf:li rdf:resource="http://www.cs.yale.edu/homes/aspnes/skip-graphs-abstract.html"/>
	<rdf:li rdf:resource="http://www.hoard.org/"/>
	<rdf:li rdf:resource="http://gmplib.org/gmpbench.html"/>
	<rdf:li rdf:resource="http://www.cs.umass.edu/~emery/hoard/"/>
	<rdf:li rdf:resource="http://lambda-the-ultimate.org/node/2718"/>
	<rdf:li rdf:resource="http://www.celemony.com/cms/index.php?id=dna"/>
	<rdf:li rdf:resource="http://www.linuxjournal.com/article/6797"/>
	<rdf:li rdf:resource="http://www.cs.queensu.ca/~thurston/ragel/"/>
	<rdf:li rdf:resource="http://supertech.csail.mit.edu/papers.html"/>
	<rdf:li rdf:resource="http://svn.python.org/view/python/trunk/Objects/listsort.txt?rev=51013&amp;view=markup"/>
	<rdf:li rdf:resource="http://web.mit.edu/jasonkb/www/quackle/"/>
	<rdf:li rdf:resource="http://citeseer.ist.psu.edu/preneel95security.html"/>
	<rdf:li rdf:resource="http://sip.unige.ch/omptl/"/>
	<rdf:li rdf:resource="http://www.gowrikumar.com/programming/index.html"/>
	<rdf:li rdf:resource="http://www.tinyos.net/"/>
	<rdf:li rdf:resource="http://labs.google.com/papers/mapreduce.html"/>
	<rdf:li rdf:resource="http://fastcrypto.org/"/>
	<rdf:li rdf:resource="http://en.wikipedia.org/wiki/Vector_clocks"/>
	<rdf:li rdf:resource="http://blog.notdot.net/archives/30-Damn-Cool-Algorithms,-Part-1-BK-Trees.html"/>
	<rdf:li rdf:resource="http://quantlib.org/"/>
	<rdf:li rdf:resource="http://nms.lcs.mit.edu/projects/cricket/"/>
	<rdf:li rdf:resource="http://groups.csail.mit.edu/tds/paxos.html"/>
	<rdf:li rdf:resource="http://www.spread.org/"/>
	<rdf:li rdf:resource="http://pine.cs.yale.edu/pinewiki/Paxos"/>
	<rdf:li rdf:resource="http://research.microsoft.com/users/lamport/pubs/pubs.html"/>
	<rdf:li rdf:resource="http://research.microsoft.com/users/lamport/tla/pluscal.html"/>
	<rdf:li rdf:resource="http://swtch.com/~rsc/regexp/regexp1.html"/>
	<rdf:li rdf:resource="http://www.brpreiss.com/books/opus7/"/>
	<rdf:li rdf:resource="http://www.awprofessional.com/title/0201361183"/>
	<rdf:li rdf:resource="http://en.wikipedia.org/wiki/List_of_algorithms"/>
	<rdf:li rdf:resource="http://www.memorymanagement.org/"/>
	<rdf:li rdf:resource="http://www.nist.gov/dads/"/>
      </rdf:Seq>
    </items>
  </channel><item rdf:about="https://courses.csail.mit.edu/6.042/spring17/mcs.pdf">
    <title>Mathematics for Computer Science</title>
    <dc:date>2017-03-07T00:42:55+00:00</dc:date>
    <link>https://courses.csail.mit.edu/6.042/spring17/mcs.pdf</link>
    <dc:creator>randombit</dc:creator><dc:subject>math algorithm book</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:randombit/b:2ca24684070a/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:math"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:algorithm"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:book"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.cs.rochester.edu/u/michael/PODC96.html">
    <title>Simple, Fast, and Practical Non-Blocking and Blocking Concurrent Queue Algorithms</title>
    <dc:date>2014-05-26T23:05:59+00:00</dc:date>
    <link>http://www.cs.rochester.edu/u/michael/PODC96.html</link>
    <dc:creator>randombit</dc:creator><dc:subject>algorithm concurrency</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:randombit/b:b015eef56e93/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:algorithm"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:concurrency"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://blog.reverberate.org/2013/07/ll-and-lr-parsing-demystified.html">
    <title>Josh Haberman: LL and LR Parsing Demystified</title>
    <dc:date>2014-02-15T13:22:01+00:00</dc:date>
    <link>http://blog.reverberate.org/2013/07/ll-and-lr-parsing-demystified.html</link>
    <dc:creator>randombit</dc:creator><dc:subject>parsing parser ll lr algorithm compilers via:graydon</dc:subject>
<dc:identifier>https://pinboard.in/u:randombit/b:e7956c8ca690/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:parsing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:parser"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:ll"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:lr"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:algorithm"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:compilers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:via:graydon"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://marisa-trie.googlecode.com/svn/trunk/docs/readme.en.html">
    <title>MARISA: Matching Algorithm with Recursively Implemented StorAge</title>
    <dc:date>2013-04-01T18:20:02+00:00</dc:date>
    <link>http://marisa-trie.googlecode.com/svn/trunk/docs/readme.en.html</link>
    <dc:creator>randombit</dc:creator><description><![CDATA[Matching Algorithm with Recursively Implemented StorAge (MARISA) is a space-efficient trie data structure. libmarisa is a C++ library for an implementation of MARISA. Users can build dictionaries and search keys from the dictionaries. The package also provides command line tools to test basic operations of libmarisa, and the tools are useful to test the performance.]]></description>
<dc:subject>c++ algorithm trie map storage</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:randombit/b:f6e099ba52ec/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:c++"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:algorithm"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:trie"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:map"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:storage"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://code.google.com/p/cpp-btree/">
    <title>cpp-btree - C++ B-tree - Google Project Hosting</title>
    <dc:date>2013-02-04T15:34:35+00:00</dc:date>
    <link>https://code.google.com/p/cpp-btree/</link>
    <dc:creator>randombit</dc:creator><description><![CDATA[C++ B-tree is a template library that implements ordered in-memory containers based on a B-tree data structure. Similar to the STL map, set, multimap, and multiset templates, this library provides btree_map, btree_set, btree_multimap, and btree_multiset.]]></description>
<dc:subject>c++ algorithm library</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:randombit/b:be74a9420714/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:c++"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:algorithm"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:library"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.cs.ucsb.edu/~koc/docs/j37.pdf">
    <title>Analyzing and Comparing Montgomery Multiplication Algorithms</title>
    <dc:date>2011-06-02T13:54:09+00:00</dc:date>
    <link>http://www.cs.ucsb.edu/~koc/docs/j37.pdf</link>
    <dc:creator>randombit</dc:creator><dc:subject>montgomery crypto algorithm</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:randombit/b:f8cf6665ddf6/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:montgomery"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:crypto"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:algorithm"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://cmph.sourceforge.net/">
    <title>CMPH - C Minimal Perfect Hashing Library</title>
    <dc:date>2011-03-10T16:33:31+00:00</dc:date>
    <link>http://cmph.sourceforge.net/</link>
    <dc:creator>randombit</dc:creator><dc:subject>algorithm programming perfecthashing lbrary</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:randombit/b:87d955628c30/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:algorithm"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:programming"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:perfecthashing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:lbrary"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.cs.toronto.edu/~mackay/itila/book.html">
    <title>David MacKay: Information Theory, Inference, and Learning Algorithms: The Book</title>
    <dc:date>2009-07-17T17:18:51+00:00</dc:date>
    <link>http://www.cs.toronto.edu/~mackay/itila/book.html</link>
    <dc:creator>randombit</dc:creator><description><![CDATA[Information Theory, Inference, and Learning Algorithms
]]></description>
<dc:subject>algorithm book machinelearning informationtheory</dc:subject>
<dc:identifier>https://pinboard.in/u:randombit/b:27823fddf9cd/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:algorithm"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:book"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:machinelearning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:informationtheory"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://en.wikipedia.org/wiki/Stable_marriage_problem">
    <title>Stable marriage problem - Wikipedia, the free encyclopedia</title>
    <dc:date>2009-04-11T05:09:27+00:00</dc:date>
    <link>http://en.wikipedia.org/wiki/Stable_marriage_problem</link>
    <dc:creator>randombit</dc:creator><dc:subject>algorithm analysis social</dc:subject>
<dc:identifier>https://pinboard.in/u:randombit/b:3ca822a9ae8d/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:algorithm"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:analysis"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:social"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.1stworks.com/ref/RuskeyCombGen.pdf">
    <title>Combinatorial Generation</title>
    <dc:date>2009-03-07T23:18:37+00:00</dc:date>
    <link>http://www.1stworks.com/ref/RuskeyCombGen.pdf</link>
    <dc:creator>randombit</dc:creator><dc:subject>combinatorics algorithm book via:graydon</dc:subject>
<dc:identifier>https://pinboard.in/u:randombit/b:33fa56d55e83/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:combinatorics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:algorithm"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:book"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:via:graydon"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://algowiki.net/wiki/index.php/Edmonds's_algorithm">
    <title>Edmonds's algorithm - Algowiki</title>
    <dc:date>2009-03-06T05:07:55+00:00</dc:date>
    <link>http://algowiki.net/wiki/index.php/Edmonds's_algorithm</link>
    <dc:creator>randombit</dc:creator><dc:subject>algorithm graph</dc:subject>
<dc:identifier>https://pinboard.in/u:randombit/b:44936b25a3a5/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:algorithm"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:graph"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://infolab.stanford.edu/TR/CS-TR-75-482.html">
    <title>An Algorithm for Finding Best Matches in Logarithmic Expected Time</title>
    <dc:date>2009-02-26T18:13:51+00:00</dc:date>
    <link>http://infolab.stanford.edu/TR/CS-TR-75-482.html</link>
    <dc:creator>randombit</dc:creator><description><![CDATA[Using k-d trees for m-nearest neighbor search in logarithmic time.
]]></description>
<dc:subject>algorithm nearestneighbor kdtree</dc:subject>
<dc:identifier>https://pinboard.in/u:randombit/b:701db843eb94/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:algorithm"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:nearestneighbor"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:kdtree"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://robotics.stanford.edu/~nilsson/mlbook.html">
    <title>Introduction to Machine Learning</title>
    <dc:date>2009-02-25T17:54:40+00:00</dc:date>
    <link>http://robotics.stanford.edu/~nilsson/mlbook.html</link>
    <dc:creator>randombit</dc:creator><dc:subject>book algorithm ai machinelearning</dc:subject>
<dc:identifier>https://pinboard.in/u:randombit/b:8304e6dd8711/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:book"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:algorithm"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:ai"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:machinelearning"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www-csli.stanford.edu/~hinrich/information-retrieval-book.html">
    <title>Introduction to Information Retrieval</title>
    <dc:date>2009-02-10T01:43:11+00:00</dc:date>
    <link>http://www-csli.stanford.edu/~hinrich/information-retrieval-book.html</link>
    <dc:creator>randombit</dc:creator><dc:subject>information book algorithm informationretrieval via:j2323</dc:subject>
<dc:identifier>https://pinboard.in/u:randombit/b:9fb58e8eb80c/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:information"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:book"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:algorithm"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:informationretrieval"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:via:j2323"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://csrc.nist.gov/groups/ST/hash/index.html">
    <title>NIST.gov - Computer Security Division - Computer Security Resource Center</title>
    <dc:date>2008-10-30T04:48:15+00:00</dc:date>
    <link>http://csrc.nist.gov/groups/ST/hash/index.html</link>
    <dc:creator>randombit</dc:creator><dc:subject>sha hashfunction crypto algorithm nist</dc:subject>
<dc:identifier>https://pinboard.in/u:randombit/b:8dabf0fe1f4a/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:sha"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:hashfunction"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:crypto"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:algorithm"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:nist"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://citeseer.ist.psu.edu/seidel96randomized.html">
    <title>Randomized Search Trees (Treaps)</title>
    <dc:date>2008-08-02T15:36:07+00:00</dc:date>
    <link>http://citeseer.ist.psu.edu/seidel96randomized.html</link>
    <dc:creator>randombit</dc:creator><description><![CDATA[A data structure combining properties of binary trees and heaps.
]]></description>
<dc:subject>datastructures algorithm treap scala jvm caching</dc:subject>
<dc:identifier>https://pinboard.in/u:randombit/b:6665c4168762/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:datastructures"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:algorithm"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:treap"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:scala"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:jvm"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:caching"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://en.wikipedia.org/wiki/Sieve_of_Atkin">
    <title>Sieve of Atkin</title>
    <dc:date>2008-07-11T16:43:29+00:00</dc:date>
    <link>http://en.wikipedia.org/wiki/Sieve_of_Atkin</link>
    <dc:creator>randombit</dc:creator><dc:subject>primes math algorithm numbertheory sieve</dc:subject>
<dc:identifier>https://pinboard.in/u:randombit/b:776396ff2c96/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:primes"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:math"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:algorithm"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:numbertheory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:sieve"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.ee.technion.ac.il/~hugo/kdf/">
    <title>On Extract-then-Expand Key Derivation Functions and an HMAC-based KDF, by Hugo Krawczyk</title>
    <dc:date>2008-06-24T19:55:46+00:00</dc:date>
    <link>http://www.ee.technion.ac.il/~hugo/kdf/</link>
    <dc:creator>randombit</dc:creator><description><![CDATA[A fully specified HMAC-based KDF that makes minimal assumptions on the hash.
]]></description>
<dc:subject>crypto algorithm design kdf rng hashfunction hmac prf</dc:subject>
<dc:identifier>https://pinboard.in/u:randombit/b:73ea5e779dbf/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:crypto"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:algorithm"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:design"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:kdf"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:rng"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:hashfunction"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:hmac"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:prf"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.oreilly.com/catalog/9780596529321/toc.html">
    <title>O'Reilly Media | Programming Collective Intelligence</title>
    <dc:date>2008-05-22T16:16:06+00:00</dc:date>
    <link>http://www.oreilly.com/catalog/9780596529321/toc.html</link>
    <dc:creator>randombit</dc:creator><dc:subject>algorithm ai</dc:subject>
<dc:identifier>https://pinboard.in/u:randombit/b:8411ab7b1c76/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:algorithm"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:ai"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.aiplayground.org/artikel/delicious-mates/">
    <title>Find Similar Users on del.icio.us</title>
    <dc:date>2008-05-22T11:59:54+00:00</dc:date>
    <link>http://www.aiplayground.org/artikel/delicious-mates/</link>
    <dc:creator>randombit</dc:creator><dc:subject>del.icio.us python algorithm web2.0</dc:subject>
<dc:identifier>https://pinboard.in/u:randombit/b:dd62c6fcdf24/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:del.icio.us"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:python"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:algorithm"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:web2.0"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.cl.cam.ac.uk/research/srg/netos/lock-free/">
    <title>Practical lock-free data structures</title>
    <dc:date>2008-04-30T21:47:34+00:00</dc:date>
    <link>http://www.cl.cam.ac.uk/research/srg/netos/lock-free/</link>
    <dc:creator>randombit</dc:creator><dc:subject>concurrency lockfree stm parallel datastructures distributed implementation algorithm</dc:subject>
<dc:identifier>https://pinboard.in/u:randombit/b:7f7ba2da0400/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:concurrency"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:lockfree"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:stm"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:parallel"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:datastructures"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:distributed"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:implementation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:algorithm"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.ee.technion.ac.il/~ayellet/Ps/nelson.pdf">
    <title>Bloomier Filters</title>
    <dc:date>2008-04-26T03:15:27+00:00</dc:date>
    <link>http://www.ee.technion.ac.il/~ayellet/Ps/nelson.pdf</link>
    <dc:creator>randombit</dc:creator><description><![CDATA[Like Bloom filters, these structures achieve a small space overhead by accepting a small probability of false positives. In the case of "Bloomier filters", a false positive is defined as returning a result when the key is not in the map. The map will neve
]]></description>
<dc:subject>algorithm cache filter</dc:subject>
<dc:identifier>https://pinboard.in/u:randombit/b:714661eda3ba/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:algorithm"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:cache"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:filter"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://minisat.se/">
    <title>MiniSat</title>
    <dc:date>2008-04-21T04:00:28+00:00</dc:date>
    <link>http://minisat.se/</link>
    <dc:creator>randombit</dc:creator><description><![CDATA[MiniSat is a minimalistic, open-source SAT solver, developed to help researchers and developers alike to get started on SAT.
]]></description>
<dc:subject>library algorithm sat logic prion</dc:subject>
<dc:identifier>https://pinboard.in/u:randombit/b:34ead0aeee93/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:library"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:algorithm"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:sat"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:logic"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:prion"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://en.wikipedia.org/wiki/Adaptive_Replacement_Cache">
    <title>Adaptive Replacement Cache - Wikipedia, the free encyclopedia</title>
    <dc:date>2008-04-17T18:26:30+00:00</dc:date>
    <link>http://en.wikipedia.org/wiki/Adaptive_Replacement_Cache</link>
    <dc:creator>randombit</dc:creator><description><![CDATA[Adaptive Replacement Cache (ARC) is a page replacement algorithm with better performance[1] than LRU (Least Recently Used) developed[2] at the IBM Almaden Research Center. This is accomplished by keeping track of both Frequently Used and Recently Used pag
]]></description>
<dc:subject>algorithm cache optimization caching</dc:subject>
<dc:identifier>https://pinboard.in/u:randombit/b:4a8faa78e71f/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:algorithm"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:cache"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:optimization"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:caching"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.cs.yale.edu/homes/aspnes/skip-graphs-abstract.html">
    <title>Skip graphs</title>
    <dc:date>2008-04-14T16:19:14+00:00</dc:date>
    <link>http://www.cs.yale.edu/homes/aspnes/skip-graphs-abstract.html</link>
    <dc:creator>randombit</dc:creator><description><![CDATA[Skip graphs are a novel distributed data structure, based on skip lists, that provide the full functionality of a balanced tree in a distributed system where resources are stored in separate nodes that may fail at any time. They are designed for use in se
]]></description>
<dc:subject>algorithm datastructures networking distributed</dc:subject>
<dc:identifier>https://pinboard.in/u:randombit/b:38fbff393a6d/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:algorithm"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:datastructures"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:networking"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:distributed"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.hoard.org/">
    <title>The Hoard Memory Allocator</title>
    <dc:date>2008-04-08T18:30:44+00:00</dc:date>
    <link>http://www.hoard.org/</link>
    <dc:creator>randombit</dc:creator><dc:subject>algorithm concurrency library malloc memory optimization allocator</dc:subject>
<dc:identifier>https://pinboard.in/u:randombit/b:7534596836ab/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:algorithm"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:concurrency"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:library"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:malloc"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:memory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:optimization"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:allocator"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://gmplib.org/gmpbench.html">
    <title>GMPbench results</title>
    <dc:date>2008-03-31T15:28:16+00:00</dc:date>
    <link>http://gmplib.org/gmpbench.html</link>
    <dc:creator>randombit</dc:creator><dc:subject>benchmarks crypto math algorithm x86</dc:subject>
<dc:identifier>https://pinboard.in/u:randombit/b:902005905ef0/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:benchmarks"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:crypto"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:math"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:algorithm"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:x86"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.cs.umass.edu/~emery/hoard/">
    <title>The Hoard Scalable Memory Allocator</title>
    <dc:date>2008-03-31T14:44:42+00:00</dc:date>
    <link>http://www.cs.umass.edu/~emery/hoard/</link>
    <dc:creator>randombit</dc:creator><description><![CDATA[The Hoard memory allocator is a fast, scalable, and memory-efficient memory allocator. Hoard is a drop-in replacement for malloc() that can  dramatically improve application performance, especially for multithreaded programs running on multiprocessors.
]]></description>
<dc:subject>algorithm c library linux optimization performance malloc</dc:subject>
<dc:identifier>https://pinboard.in/u:randombit/b:0bee42d33a3e/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:algorithm"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:c"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:library"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:linux"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:optimization"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:performance"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:malloc"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://lambda-the-ultimate.org/node/2718">
    <title>Problematic data structure in functional language | Lambda the Ultimate</title>
    <dc:date>2008-03-15T20:25:11+00:00</dc:date>
    <link>http://lambda-the-ultimate.org/node/2718</link>
    <dc:creator>randombit</dc:creator><description><![CDATA[I am having trouble producing a good data structure in a functional context, although there are very fast data structures for imperative languages like C. The data structure is to be used for a functional SAT solver.
]]></description>
<dc:subject>algorithm solver crypto serpent</dc:subject>
<dc:identifier>https://pinboard.in/u:randombit/b:e45ecfb67a94/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:algorithm"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:solver"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:crypto"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:serpent"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.celemony.com/cms/index.php?id=dna">
    <title>celemony_ :: Direct Note Access</title>
    <dc:date>2008-03-15T05:39:26+00:00</dc:date>
    <link>http://www.celemony.com/cms/index.php?id=dna</link>
    <dc:creator>randombit</dc:creator><dc:subject>via:prion algorithm insane</dc:subject>
<dc:identifier>https://pinboard.in/u:randombit/b:b1bbd4a0a01d/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:via:prion"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:algorithm"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:insane"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.linuxjournal.com/article/6797">
    <title>Distributed Hash Tables, Part I</title>
    <dc:date>2008-03-03T14:17:29+00:00</dc:date>
    <link>http://www.linuxjournal.com/article/6797</link>
    <dc:creator>randombit</dc:creator><description><![CDATA[Distributed hash tables are an essential component of robust peer-to-peer networks. Learn to write applications that let everyone's copy share the same data.
]]></description>
<dc:subject>dht chord python network p2p distributed algorithm hashfunction</dc:subject>
<dc:identifier>https://pinboard.in/u:randombit/b:470529450adb/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:dht"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:chord"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:python"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:network"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:p2p"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:distributed"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:algorithm"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:hashfunction"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.cs.queensu.ca/~thurston/ragel/">
    <title>Ragel State Machine Compiler</title>
    <dc:date>2008-03-03T04:16:05+00:00</dc:date>
    <link>http://www.cs.queensu.ca/~thurston/ragel/</link>
    <dc:creator>randombit</dc:creator><description><![CDATA[Ragel compiles executable finite state machines from regular languages. Ragel targets C, C++, Objective-C, D, Java and Ruby.
]]></description>
<dc:subject>algorithm c c++ code compiler language performance tool generator ragel grammar parser</dc:subject>
<dc:identifier>https://pinboard.in/u:randombit/b:69c501868b7c/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:algorithm"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:c"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:c++"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:code"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:compiler"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:language"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:performance"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:tool"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:generator"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:ragel"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:grammar"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:parser"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://supertech.csail.mit.edu/papers.html">
    <title>MIT SuperTech Group Paper Listing</title>
    <dc:date>2008-01-22T20:59:54+00:00</dc:date>
    <link>http://supertech.csail.mit.edu/papers.html</link>
    <dc:creator>randombit</dc:creator><dc:subject>algorithm parallel concurrency papers</dc:subject>
<dc:identifier>https://pinboard.in/u:randombit/b:4f4bf75b8a1a/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:algorithm"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:parallel"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:concurrency"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:papers"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://svn.python.org/view/python/trunk/Objects/listsort.txt?rev=51013&amp;view=markup">
    <title>Description of timsort (Python's sort algorithm)</title>
    <dc:date>2007-12-24T05:11:18+00:00</dc:date>
    <link>http://svn.python.org/view/python/trunk/Objects/listsort.txt?rev=51013&amp;view=markup</link>
    <dc:creator>randombit</dc:creator><dc:subject>sort algorithm analysis python</dc:subject>
<dc:identifier>https://pinboard.in/u:randombit/b:57d31f13f5bd/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:sort"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:algorithm"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:analysis"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:python"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://web.mit.edu/jasonkb/www/quackle/">
    <title>Quackle</title>
    <dc:date>2007-12-20T00:46:50+00:00</dc:date>
    <link>http://web.mit.edu/jasonkb/www/quackle/</link>
    <dc:creator>randombit</dc:creator><dc:subject>ai algorithm games scrabble</dc:subject>
<dc:identifier>https://pinboard.in/u:randombit/b:fd1f00e1b097/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:ai"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:algorithm"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:games"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:scrabble"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://citeseer.ist.psu.edu/preneel95security.html">
    <title>On the Security of Two MAC Algorithms</title>
    <dc:date>2007-12-12T16:48:27+00:00</dc:date>
    <link>http://citeseer.ist.psu.edu/preneel95security.html</link>
    <dc:creator>randombit</dc:creator><dc:subject>crypto security algorithm</dc:subject>
<dc:identifier>https://pinboard.in/u:randombit/b:c65a0e3cd12d/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:crypto"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:security"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:algorithm"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://sip.unige.ch/omptl/">
    <title>OpenMP Multi-Threaded Template Library</title>
    <dc:date>2007-12-06T21:12:01+00:00</dc:date>
    <link>http://sip.unige.ch/omptl/</link>
    <dc:creator>randombit</dc:creator><dc:subject>algorithm c++ parallel stl threads</dc:subject>
<dc:identifier>https://pinboard.in/u:randombit/b:d169b299edc1/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:algorithm"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:c++"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:parallel"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:stl"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:threads"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.gowrikumar.com/programming/index.html">
    <title>Programming Interview Questions</title>
    <dc:date>2007-12-06T18:19:01+00:00</dc:date>
    <link>http://www.gowrikumar.com/programming/index.html</link>
    <dc:creator>randombit</dc:creator><dc:subject>algorithm math puzzle interview</dc:subject>
<dc:identifier>https://pinboard.in/u:randombit/b:15dc12af2ffd/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:algorithm"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:math"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:puzzle"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:interview"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.tinyos.net/">
    <title>TinyOS || An open-source OS for the networked sensor regime.</title>
    <dc:date>2007-11-19T14:44:34+00:00</dc:date>
    <link>http://www.tinyos.net/</link>
    <dc:creator>randombit</dc:creator><description><![CDATA[TinyOS is an open-source operating system designed for wireless embedded sensor networks. It features a component-based architecture which enables rapid innovation and implementation while minimizing code size as required by the severe memory constraints
]]></description>
<dc:subject>algorithm embedded network systems</dc:subject>
<dc:identifier>https://pinboard.in/u:randombit/b:e73cd55ff56e/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:algorithm"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:embedded"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:network"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:systems"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://labs.google.com/papers/mapreduce.html">
    <title>Google Research Publication: MapReduce</title>
    <dc:date>2007-11-11T18:57:51+00:00</dc:date>
    <link>http://labs.google.com/papers/mapreduce.html</link>
    <dc:creator>randombit</dc:creator><dc:subject>google distributed concurrency functional algorithm parallel</dc:subject>
<dc:identifier>https://pinboard.in/u:randombit/b:f08d5401ba32/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:google"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:distributed"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:concurrency"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:functional"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:algorithm"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:parallel"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://fastcrypto.org/">
    <title>Fast Cryptography</title>
    <dc:date>2007-11-01T15:01:28+00:00</dc:date>
    <link>http://fastcrypto.org/</link>
    <dc:creator>randombit</dc:creator><description><![CDATA[VMAC and UMAC
]]></description>
<dc:subject>crypto algorithm</dc:subject>
<dc:identifier>https://pinboard.in/u:randombit/b:318aadbb4ab2/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:crypto"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:algorithm"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://en.wikipedia.org/wiki/Vector_clocks">
    <title>Vector clocks</title>
    <dc:date>2007-10-26T21:25:35+00:00</dc:date>
    <link>http://en.wikipedia.org/wiki/Vector_clocks</link>
    <dc:creator>randombit</dc:creator><dc:subject>distributed algorithm</dc:subject>
<dc:identifier>https://pinboard.in/u:randombit/b:1069d60a1dbd/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:distributed"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:algorithm"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://blog.notdot.net/archives/30-Damn-Cool-Algorithms,-Part-1-BK-Trees.html">
    <title>Burkhard-Keller Trees</title>
    <dc:date>2007-10-20T22:34:37+00:00</dc:date>
    <link>http://blog.notdot.net/archives/30-Damn-Cool-Algorithms,-Part-1-BK-Trees.html</link>
    <dc:creator>randombit</dc:creator><description><![CDATA[
BK-Trees, or Burkhard-Keller Trees are a tree-based data structure engineered for quickly finding near-matches to a string, for example, as used by a spelling checker, or when doing a 'fuzzy' search for a term.
]]></description>
<dc:subject>algorithm blog</dc:subject>
<dc:identifier>https://pinboard.in/u:randombit/b:6c4edf7b99be/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:algorithm"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:blog"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://quantlib.org/">
    <title>QuantLib: a free/open-source library for quantitative finance</title>
    <dc:date>2007-10-15T19:43:28+00:00</dc:date>
    <link>http://quantlib.org/</link>
    <dc:creator>randombit</dc:creator><description><![CDATA[Honestly doesn't seem that great, but in terms of finance frameworks it seems like this is the best you can get. (?)
]]></description>
<dc:subject>algorithm c++ toolbox trading finance</dc:subject>
<dc:identifier>https://pinboard.in/u:randombit/b:7ed18d248c61/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:algorithm"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:c++"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:toolbox"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:trading"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:finance"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://nms.lcs.mit.edu/projects/cricket/">
    <title>The Cricket Indoor Location System: An NMS Project @ MIT CSAIL</title>
    <dc:date>2007-10-07T15:34:29+00:00</dc:date>
    <link>http://nms.lcs.mit.edu/projects/cricket/</link>
    <dc:creator>randombit</dc:creator><dc:subject>algorithm electronics</dc:subject>
<dc:identifier>https://pinboard.in/u:randombit/b:d112e53503a6/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:algorithm"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:electronics"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://groups.csail.mit.edu/tds/paxos.html">
    <title>TDS - Revisiting the Paxos algorithm</title>
    <dc:date>2007-10-03T23:24:53+00:00</dc:date>
    <link>http://groups.csail.mit.edu/tds/paxos.html</link>
    <dc:creator>randombit</dc:creator><dc:subject>algorithm paxos p2p network protocol</dc:subject>
<dc:identifier>https://pinboard.in/u:randombit/b:c3c695e5156f/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:algorithm"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:paxos"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:p2p"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:network"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:protocol"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.spread.org/">
    <title>The Spread Toolkit</title>
    <dc:date>2007-10-03T11:26:27+00:00</dc:date>
    <link>http://www.spread.org/</link>
    <dc:creator>randombit</dc:creator><dc:subject>algorithm distributed network P2P</dc:subject>
<dc:identifier>https://pinboard.in/u:randombit/b:1cf7beb6214e/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:algorithm"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:distributed"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:network"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:P2P"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://pine.cs.yale.edu/pinewiki/Paxos">
    <title>Paxos - PineWiki</title>
    <dc:date>2007-10-01T00:58:09+00:00</dc:date>
    <link>http://pine.cs.yale.edu/pinewiki/Paxos</link>
    <dc:creator>randombit</dc:creator><dc:subject>algorithm distributed paxos</dc:subject>
<dc:identifier>https://pinboard.in/u:randombit/b:f9382bc4ea1f/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:algorithm"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:distributed"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:paxos"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://research.microsoft.com/users/lamport/pubs/pubs.html">
    <title>The Writings of Leslie Lamport</title>
    <dc:date>2007-09-30T23:37:35+00:00</dc:date>
    <link>http://research.microsoft.com/users/lamport/pubs/pubs.html</link>
    <dc:creator>randombit</dc:creator><dc:subject>algorithm concurrency design distributed papers database paxos</dc:subject>
<dc:identifier>https://pinboard.in/u:randombit/b:f3e11ea82efd/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:algorithm"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:concurrency"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:design"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:distributed"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:papers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:database"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:paxos"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://research.microsoft.com/users/lamport/tla/pluscal.html">
    <title>The +CAL Algorithm Language</title>
    <dc:date>2007-09-29T00:20:59+00:00</dc:date>
    <link>http://research.microsoft.com/users/lamport/tla/pluscal.html</link>
    <dc:creator>randombit</dc:creator><description><![CDATA[Something Leslie Lamport has been working on
]]></description>
<dc:subject>algorithm language</dc:subject>
<dc:identifier>https://pinboard.in/u:randombit/b:b09620dda01d/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:algorithm"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:language"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://swtch.com/~rsc/regexp/regexp1.html">
    <title>Regular Expression Matching Can Be Simple And Fast</title>
    <dc:date>2007-06-21T01:59:43+00:00</dc:date>
    <link>http://swtch.com/~rsc/regexp/regexp1.html</link>
    <dc:creator>randombit</dc:creator><dc:subject>algorithm performance optimization</dc:subject>
<dc:identifier>https://pinboard.in/u:randombit/b:be7953fcd1b8/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:algorithm"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:performance"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:optimization"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.brpreiss.com/books/opus7/">
    <title>Data Structures and Algorithms with Object-Oriented Design Patterns in Python</title>
    <dc:date>2006-03-06T00:52:22+00:00</dc:date>
    <link>http://www.brpreiss.com/books/opus7/</link>
    <dc:creator>randombit</dc:creator><dc:subject>python algorithm patterns</dc:subject>
<dc:identifier>https://pinboard.in/u:randombit/b:30d54970e677/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:python"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:algorithm"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:patterns"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.awprofessional.com/title/0201361183">
    <title>Algorithms in C++ Part 5: Graph Algorithms, 3rd Edition</title>
    <dc:date>2006-02-28T23:45:22+00:00</dc:date>
    <link>http://www.awprofessional.com/title/0201361183</link>
    <dc:creator>randombit</dc:creator><dc:subject>book c++ algorithm</dc:subject>
<dc:identifier>https://pinboard.in/u:randombit/b:dcea696ec498/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:book"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:c++"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:algorithm"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://en.wikipedia.org/wiki/List_of_algorithms">
    <title>List of algorithms - Wikipedia, the free encyclopedia</title>
    <dc:date>2006-02-02T13:26:24+00:00</dc:date>
    <link>http://en.wikipedia.org/wiki/List_of_algorithms</link>
    <dc:creator>randombit</dc:creator><dc:subject>algorithm</dc:subject>
<dc:identifier>https://pinboard.in/u:randombit/b:b538b6c94c3d/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:algorithm"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.memorymanagement.org/">
    <title>The Memory Management Reference</title>
    <dc:date>2006-01-06T18:06:39+00:00</dc:date>
    <link>http://www.memorymanagement.org/</link>
    <dc:creator>randombit</dc:creator><description><![CDATA[This looks like an exceedingly useful reference
]]></description>
<dc:subject>algorithm c++ c</dc:subject>
<dc:identifier>https://pinboard.in/u:randombit/b:1ed47530cea1/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:algorithm"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:c++"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:c"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.nist.gov/dads/">
    <title>Dictionary of Algorithms and Data Structures</title>
    <dc:date>2006-01-02T02:08:45+00:00</dc:date>
    <link>http://www.nist.gov/dads/</link>
    <dc:creator>randombit</dc:creator><dc:subject>theory algorithm</dc:subject>
<dc:identifier>https://pinboard.in/u:randombit/b:fb507c9865e5/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:randombit/t:algorithm"/>
</rdf:Bag></taxo:topics>
</item>
</rdf:RDF>