<?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 (jd)</title>
    <link>https://pinboard.in/u:jd/public/</link>
    <description>recent bookmarks from jd</description>
    <items>
      <rdf:Seq>	<rdf:li rdf:resource="https://blog.acolyer.org/2020/10/02/toward-an-api-for-the-real-numbers/"/>
	<rdf:li rdf:resource="https://bost.ocks.org/mike/algorithms/"/>
	<rdf:li rdf:resource="http://www.geeksforgeeks.org/given-a-set-of-line-segments-find-if-any-two-segments-intersect/"/>
	<rdf:li rdf:resource="http://blogs.msdn.com/b/oldnewthing/archive/2014/11/27/10576382.aspx"/>
	<rdf:li rdf:resource="http://www.redblobgames.com/pathfinding/a-star/introduction.html"/>
	<rdf:li rdf:resource="http://www.nytimes.com/2014/04/29/science/to-divide-the-rent-start-with-a-triangle.html"/>
	<rdf:li rdf:resource="http://compgeom.cs.uiuc.edu/~jeffe/teaching/algorithms/"/>
	<rdf:li rdf:resource="http://bigocheatsheet.com/"/>
	<rdf:li rdf:resource="http://en.wikipedia.org/wiki/Moving_average#Exponential_moving_average"/>
	<rdf:li rdf:resource="http://stackoverflow.com/questions/5859561/getting-the-closest-string-match#answer-5859823"/>
	<rdf:li rdf:resource="http://mailinator.blogspot.com/2012/02/how-mailinator-compresses-email-by-90.html"/>
      </rdf:Seq>
    </items>
  </channel><item rdf:about="https://blog.acolyer.org/2020/10/02/toward-an-api-for-the-real-numbers/">
    <title>Toward an API for the real numbers | the morning paper</title>
    <dc:date>2020-10-03T02:35:47+00:00</dc:date>
    <link>https://blog.acolyer.org/2020/10/02/toward-an-api-for-the-real-numbers/</link>
    <dc:creator>jd</dc:creator><description><![CDATA[exploration of a practical general purpose real number type that both reflects the mathematical laws of the real numbers, and also supports exact comparisons in situations in which that’s normally expected.
]]></description>
<dc:subject>algorithms math</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:jd/b:3b0b8f45b127/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:jd/t:algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:jd/t:math"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://bost.ocks.org/mike/algorithms/">
    <title>Visualizing Algorithms</title>
    <dc:date>2017-08-27T20:29:23+00:00</dc:date>
    <link>https://bost.ocks.org/mike/algorithms/</link>
    <dc:creator>jd</dc:creator><description><![CDATA[general interest article by Mike Bostock]]></description>
<dc:subject>algorithms visualization</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:jd/b:af194f34ed00/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:jd/t:algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:jd/t:visualization"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.geeksforgeeks.org/given-a-set-of-line-segments-find-if-any-two-segments-intersect/">
    <title>Given n line segments, find if any two segments intersect - GeeksforGeeks - www.geeksforgeeks.org/</title>
    <dc:date>2016-09-05T02:37:32+00:00</dc:date>
    <link>http://www.geeksforgeeks.org/given-a-set-of-line-segments-find-if-any-two-segments-intersect/</link>
    <dc:creator>jd</dc:creator><description><![CDATA[sweep line algorithm]]></description>
<dc:subject>algorithms</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:jd/b:586716b685f8/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:jd/t:algorithms"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://blogs.msdn.com/b/oldnewthing/archive/2014/11/27/10576382.aspx">
    <title>Some light reading on lock-free programming - The Old New Thing - Site Home - MSDN Blogs</title>
    <dc:date>2014-11-29T19:55:42+00:00</dc:date>
    <link>http://blogs.msdn.com/b/oldnewthing/archive/2014/11/27/10576382.aspx</link>
    <dc:creator>jd</dc:creator><description><![CDATA[references to lockless programming]]></description>
<dc:subject>c++ cpp algorithms</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:jd/b:9e9c8d4ec1c8/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:jd/t:c++"/>
	<rdf:li rdf:resource="https://pinboard.in/u:jd/t:cpp"/>
	<rdf:li rdf:resource="https://pinboard.in/u:jd/t:algorithms"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.redblobgames.com/pathfinding/a-star/introduction.html">
    <title>Introduction to A*</title>
    <dc:date>2014-07-20T05:47:57+00:00</dc:date>
    <link>http://www.redblobgames.com/pathfinding/a-star/introduction.html</link>
    <dc:creator>jd</dc:creator><description><![CDATA[In games we often want to find paths from one location to another. A* is a commonly recommended algorithm. Breadth First Search, Dijkstra’s Algorithm, and A* are graph search algorithms that use the same basic structure. They represent the map as a graph and then find a path in that graph. If you haven’t seen node-and-edge graphs before, here’s my introductory article. Breadth First Search is the simplest of the graph search algorithms, so let’s start there, and we’ll work our way up to A*.]]></description>
<dc:subject>algorithms</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:jd/b:e3939507d7c3/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:jd/t:algorithms"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.nytimes.com/2014/04/29/science/to-divide-the-rent-start-with-a-triangle.html">
    <title>To Divide the Rent, Start With a Triangle - NYTimes.com</title>
    <dc:date>2014-06-05T02:32:34+00:00</dc:date>
    <link>http://www.nytimes.com/2014/04/29/science/to-divide-the-rent-start-with-a-triangle.html</link>
    <dc:creator>jd</dc:creator><description><![CDATA[approach to dividing unequal things, such as rooms in a rental.  looks like it's a bidding process, trading off desirability with price, that iterates until it converges.

calculator: http://www.nytimes.com/interactive/2014/science/rent-division-calculator.html]]></description>
<dc:subject>algorithms</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:jd/b:5379b39f8ecc/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:jd/t:algorithms"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://compgeom.cs.uiuc.edu/~jeffe/teaching/algorithms/">
    <title>Jeff Erickson's Algorithms Course Materials</title>
    <dc:date>2013-07-01T18:40:40+00:00</dc:date>
    <link>http://compgeom.cs.uiuc.edu/~jeffe/teaching/algorithms/</link>
    <dc:creator>jd</dc:creator><description><![CDATA[lecture notes for the undergraduate and graduate algorithms classes taught at the University of Illinois

ordered by concepts: recursion, randomization, amortization, graph, combinatorial, lower bounds.
]]></description>
<dc:subject>algorithms</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:jd/b:334444025092/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:jd/t:algorithms"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://bigocheatsheet.com/">
    <title>Big-O Algorithm Complexity Cheat Sheet</title>
    <dc:date>2013-05-06T03:44:50+00:00</dc:date>
    <link>http://bigocheatsheet.com/</link>
    <dc:creator>jd</dc:creator><description><![CDATA[nice chart of algorithm complexity for sorting, searching, data structures.  looks at time and space; average & worse.  color coded.]]></description>
<dc:subject>cheatsheet algorithms</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:jd/b:5f1ed3532250/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:jd/t:cheatsheet"/>
	<rdf:li rdf:resource="https://pinboard.in/u:jd/t:algorithms"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://en.wikipedia.org/wiki/Moving_average#Exponential_moving_average">
    <title>Moving average - Wikipedia, the free encyclopedia</title>
    <dc:date>2012-06-12T04:57:29+00:00</dc:date>
    <link>http://en.wikipedia.org/wiki/Moving_average#Exponential_moving_average</link>
    <dc:creator>jd</dc:creator><description><![CDATA[math behind computing a rolling mean]]></description>
<dc:subject>algorithms</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:jd/b:b489d9c53896/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:jd/t:algorithms"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://stackoverflow.com/questions/5859561/getting-the-closest-string-match#answer-5859823">
    <title>Getting the closest string match - Stack Overflow</title>
    <dc:date>2012-05-04T22:22:27+00:00</dc:date>
    <link>http://stackoverflow.com/questions/5859561/getting-the-closest-string-match#answer-5859823</link>
    <dc:creator>jd</dc:creator><description><![CDATA[great discussion, includes Levenshtein distance, Needleman-Wunsch, Smith-Waterman ]]></description>
<dc:subject>algorithms</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:jd/b:9104fe3e76f3/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:jd/t:algorithms"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://mailinator.blogspot.com/2012/02/how-mailinator-compresses-email-by-90.html">
    <title>Mailinator(tm) Blog: How Mailinator compresses email by 90%</title>
    <dc:date>2012-02-22T00:07:07+00:00</dc:date>
    <link>http://mailinator.blogspot.com/2012/02/how-mailinator-compresses-email-by-90.html</link>
    <dc:creator>jd</dc:creator><description><![CDATA[using standard compression plus common (cached) line detection to reduce storage requirements]]></description>
<dc:subject>algorithms</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:jd/b:3bd078b92d06/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:jd/t:algorithms"/>
</rdf:Bag></taxo:topics>
</item>
</rdf:RDF>