<?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 (abiola)</title>
    <link>https://pinboard.in/u:abiola/public/</link>
    <description>recent bookmarks from abiola</description>
    <items>
      <rdf:Seq>	<rdf:li rdf:resource="https://deepmind.google/blog/alphaevolve-impact/"/>
	<rdf:li rdf:resource="https://news.ycombinator.com/item?id=47443903"/>
	<rdf:li rdf:resource="https://epub.ub.uni-muenchen.de/97103/"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/2007.03909"/>
	<rdf:li rdf:resource="https://www.quantamagazine.org/a-new-bridge-links-the-strange-math-of-infinity-to-computer-science-20251121/"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/2004.04905"/>
	<rdf:li rdf:resource="https://github.com/glacier-creative-git/knowledge-graph-traversal-semantic-rag-research"/>
	<rdf:li rdf:resource="https://en.wikipedia.org/wiki/MinHash"/>
	<rdf:li rdf:resource="https://academic.oup.com/pnasnexus/article/3/1/pgae005/7516080?login=false"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/2501.02305"/>
	<rdf:li rdf:resource="https://stackoverflow.com/questions/5209960/algorithms-with-superexponential-runtime"/>
	<rdf:li rdf:resource="https://www.quantamagazine.org/the-question-of-whats-fair-illuminates-the-question-of-whats-hard-20240624/"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/2301.10191"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/2210.10173"/>
	<rdf:li rdf:resource="https://www.quantamagazine.org/new-breakthrough-brings-matrix-multiplication-closer-to-ideal-20240307/"/>
	<rdf:li rdf:resource="https://en.wikipedia.org/wiki/Arithmetic_coding"/>
	<rdf:li rdf:resource="https://www.ams.org/journals/notices/202402/noti2869/noti2869.html"/>
	<rdf:li rdf:resource="https://dl.acm.org/doi/10.1145/3625817"/>
	<rdf:li rdf:resource="https://www.quantamagazine.org/researchers-refute-a-widespread-belief-about-online-algorithms-20231120/"/>
	<rdf:li rdf:resource="https://en.wikipedia.org/wiki/Galactic_algorithm"/>
	<rdf:li rdf:resource="https://en.wikipedia.org/wiki/Gibbs_sampling"/>
	<rdf:li rdf:resource="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7515030/"/>
	<rdf:li rdf:resource="https://www.nature.com/articles/s41586-022-05172-4"/>
	<rdf:li rdf:resource="https://web.stanford.edu/class/cs168/index.html"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/2012.09265"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/2203.00671#"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1810.00378"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/2203.00671"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/2112.09992"/>
	<rdf:li rdf:resource="https://www.quantamagazine.org/researchers-defeat-randomness-to-create-ideal-code-20211124/"/>
	<rdf:li rdf:resource="https://www.quantamagazine.org/statistics-postdoc-tames-decades-old-geometry-problem-20210301/"/>
	<rdf:li rdf:resource="https://news.ycombinator.com/item?id=28396077"/>
	<rdf:li rdf:resource="https://news.ycombinator.com/item?id=28215676"/>
	<rdf:li rdf:resource="http://www.cs.cmu.edu/~kmcrane/Projects/RepulsiveCurves/"/>
	<rdf:li rdf:resource="https://en.wikipedia.org/wiki/Stable_marriage_problem"/>
	<rdf:li rdf:resource="https://www.quantamagazine.org/mathematicians-inch-closer-to-matrix-multiplication-goal-20210323/"/>
	<rdf:li rdf:resource="https://facebook.github.io/zstd/"/>
	<rdf:li rdf:resource="https://news.ycombinator.com/item?id=24785322"/>
	<rdf:li rdf:resource="https://en.wikipedia.org/wiki/Power_graph_analysis"/>
	<rdf:li rdf:resource="https://www.shadertoy.com/view/4sSXWt"/>
	<rdf:li rdf:resource="http://www.cs.cmu.edu/~kmcrane/Projects/MonteCarloGeometryProcessing/index.html"/>
	<rdf:li rdf:resource="https://en.wikipedia.org/wiki/Iterated_logarithm"/>
	<rdf:li rdf:resource="http://www.gabrielnivasch.org/fun/inverse-ackermann"/>
	<rdf:li rdf:resource="https://jeffe.cs.illinois.edu/teaching/algorithms/"/>
	<rdf:li rdf:resource="https://github.com/ilyaraz/ot_estimators"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/0907.2423"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1410.7012"/>
	<rdf:li rdf:resource="https://epjdatascience.springeropen.com/articles/10.1140/epjds/s13688-017-0109-5"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/2004.02290"/>
	<rdf:li rdf:resource="https://github.com/mikepound/mazesolving"/>
	<rdf:li rdf:resource="http://www.math.uwaterloo.ca/tsp/index.html"/>
	<rdf:li rdf:resource="https://arstechnica.com/gaming/2019/12/how-much-of-a-genius-level-move-was-using-binary-space-partitioning-in-doom/"/>
	<rdf:li rdf:resource="https://people.csail.mit.edu/tzumao/diffrt/"/>
	<rdf:li rdf:resource="http://ccodearchive.net/list.html"/>
	<rdf:li rdf:resource="http://jeffe.cs.illinois.edu/teaching/algorithms/"/>
	<rdf:li rdf:resource="https://en.wikipedia.org/wiki/Miller%E2%80%93Rabin_primality_test"/>
	<rdf:li rdf:resource="https://blogs.msdn.microsoft.com/devdev/2006/06/19/factoring-large-numbers-with-quadratic-sieve/"/>
	<rdf:li rdf:resource="https://www.scottaaronson.com/writings/bignumbers.html"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1910.02926"/>
	<rdf:li rdf:resource="https://en.wikipedia.org/wiki/Luhn_algorithm"/>
	<rdf:li rdf:resource="https://jgrapht.org/"/>
	<rdf:li rdf:resource="https://news.ycombinator.com/item?id=21151646"/>
	<rdf:li rdf:resource="http://geomalgorithms.com/a09-_intersect-3.html"/>
	<rdf:li rdf:resource="https://www.aaai.org/ocs/index.php/ICAPS/ICAPS16/paper/viewFile/13155/12717"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1909.10475"/>
	<rdf:li rdf:resource="https://www.eecs.tufts.edu/~ap/geo/disc"/>
	<rdf:li rdf:resource="https://en.wikipedia.org/wiki/Euclidean_shortest_path"/>
	<rdf:li rdf:resource="https://en.wikipedia.org/wiki/Topological_sorting"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1509.05053#"/>
	<rdf:li rdf:resource="http://geomalgorithms.com/a07-_distance.html"/>
      </rdf:Seq>
    </items>
  </channel><item rdf:about="https://deepmind.google/blog/alphaevolve-impact/">
    <title>AlphaEvolve: Gemini-powered coding agent scaling impact across fields — Google DeepMind</title>
    <dc:date>2026-05-07T17:09:10+00:00</dc:date>
    <link>https://deepmind.google/blog/alphaevolve-impact/</link>
    <dc:creator>abiola</dc:creator><dc:subject>Algorithms DeepMind Google Machine-Learning</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:abiola/b:cb569068755c/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:DeepMind"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Google"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Machine-Learning"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://news.ycombinator.com/item?id=47443903">
    <title>Finding all regex matches has always been O(n²) | Hacker News</title>
    <dc:date>2026-03-24T15:07:37+00:00</dc:date>
    <link>https://news.ycombinator.com/item?id=47443903</link>
    <dc:creator>abiola</dc:creator><dc:subject>Algorithms Computer-Science</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:abiola/b:a3a7890931d0/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Computer-Science"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://epub.ub.uni-muenchen.de/97103/">
    <title>A Novel Hilbert Curve for Cache-Locality Preserving Loops</title>
    <dc:date>2026-03-21T21:15:02+00:00</dc:date>
    <link>https://epub.ub.uni-muenchen.de/97103/</link>
    <dc:creator>abiola</dc:creator><dc:subject>Algorithms Performance Programming</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:abiola/b:1255a95040a0/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Performance"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Programming"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/2007.03909">
    <title>[2007.03909] Best-First Beam Search</title>
    <dc:date>2026-01-06T22:19:32+00:00</dc:date>
    <link>https://arxiv.org/abs/2007.03909</link>
    <dc:creator>abiola</dc:creator><dc:subject>Algorithms LLMs Machine-Learning NLP</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:abiola/b:2ee339db5636/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:LLMs"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Machine-Learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:NLP"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://www.quantamagazine.org/a-new-bridge-links-the-strange-math-of-infinity-to-computer-science-20251121/">
    <title>A New Bridge Links the Strange Math of Infinity to Computer Science | Quanta Magazine</title>
    <dc:date>2025-11-21T20:02:22+00:00</dc:date>
    <link>https://www.quantamagazine.org/a-new-bridge-links-the-strange-math-of-infinity-to-computer-science-20251121/</link>
    <dc:creator>abiola</dc:creator><dc:subject>Algorithms Combinatorics Computer-Science Logic Mathematics Set-Theory</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:abiola/b:179034184f67/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Combinatorics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Computer-Science"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Logic"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Mathematics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Set-Theory"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/2004.04905">
    <title>[2004.04905] Distributed Algorithms, the Lovász Local Lemma, and Descriptive Combinatorics</title>
    <dc:date>2025-11-21T20:00:15+00:00</dc:date>
    <link>https://arxiv.org/abs/2004.04905</link>
    <dc:creator>abiola</dc:creator><dc:subject>Algorithms Combinatorics Computer-Science Logic Mathematics Set-Theory</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:abiola/b:d18834eb4983/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Combinatorics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Computer-Science"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Logic"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Mathematics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Set-Theory"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://github.com/glacier-creative-git/knowledge-graph-traversal-semantic-rag-research">
    <title>glacier-creative-git/knowledge-graph-traversal-semantic-rag-research: Completed research on semantic retrieval augmented generation through novel knowledge graph traversal algorithms.</title>
    <dc:date>2025-11-07T10:42:54+00:00</dc:date>
    <link>https://github.com/glacier-creative-git/knowledge-graph-traversal-semantic-rag-research</link>
    <dc:creator>abiola</dc:creator><dc:subject>Algorithms Graphs LLMs Machine-Learning NLP Programming Python RAG</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:abiola/b:d791d606b8ac/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Graphs"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:LLMs"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Machine-Learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:NLP"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Programming"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Python"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:RAG"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://en.wikipedia.org/wiki/MinHash">
    <title>MinHash - Wikipedia</title>
    <dc:date>2025-10-20T14:15:10+00:00</dc:date>
    <link>https://en.wikipedia.org/wiki/MinHash</link>
    <dc:creator>abiola</dc:creator><description><![CDATA[In computer science and data mining, MinHash (or the min-wise independent permutations locality sensitive hashing scheme) is a technique for quickly estimating how similar two sets are.]]></description>
<dc:subject>Algorithms Computer-Science Programming</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:abiola/b:f2a4e9e442ee/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Computer-Science"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Programming"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://academic.oup.com/pnasnexus/article/3/1/pgae005/7516080?login=false">
    <title>Solving inverse problems in physics by optimizing a discrete loss: Fast and accurate learning without neural networks | PNAS Nexus | Oxford Academic</title>
    <dc:date>2025-06-11T17:53:56+00:00</dc:date>
    <link>https://academic.oup.com/pnasnexus/article/3/1/pgae005/7516080?login=false</link>
    <dc:creator>abiola</dc:creator><dc:subject>Algorithms Machine-Learning Numerics PDEs Physics</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:abiola/b:7842b3e15bc1/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Machine-Learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Numerics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:PDEs"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Physics"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/2501.02305">
    <title>[2501.02305] Optimal Bounds for Open Addressing Without Reordering</title>
    <dc:date>2025-02-10T20:12:09+00:00</dc:date>
    <link>https://arxiv.org/abs/2501.02305</link>
    <dc:creator>abiola</dc:creator><dc:subject>Algorithms Computer-Science</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:abiola/b:d6abe2aa6398/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Computer-Science"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://stackoverflow.com/questions/5209960/algorithms-with-superexponential-runtime">
    <title>time complexity - Algorithms with superexponential runtime? - Stack Overflow</title>
    <dc:date>2024-11-21T22:44:49+00:00</dc:date>
    <link>https://stackoverflow.com/questions/5209960/algorithms-with-superexponential-runtime</link>
    <dc:creator>abiola</dc:creator><dc:subject>Algorithms Computer-Science</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:abiola/b:785e7f8e777d/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Computer-Science"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://www.quantamagazine.org/the-question-of-whats-fair-illuminates-the-question-of-whats-hard-20240624/">
    <title>The Question of What’s Fair Illuminates the Question of What’s Hard | Quanta Magazine</title>
    <dc:date>2024-07-01T20:52:27+00:00</dc:date>
    <link>https://www.quantamagazine.org/the-question-of-whats-fair-illuminates-the-question-of-whats-hard-20240624/</link>
    <dc:creator>abiola</dc:creator><dc:subject>Algorithms Complexity-Theory Computer-Science</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:abiola/b:7af70352b0d7/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Complexity-Theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Computer-Science"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/2301.10191">
    <title>[2301.10191] Distinct Elements in Streams: An Algorithm for the (Text) Book</title>
    <dc:date>2024-05-20T08:43:44+00:00</dc:date>
    <link>https://arxiv.org/abs/2301.10191</link>
    <dc:creator>abiola</dc:creator><dc:subject>Algorithms Computer-Science</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:abiola/b:0d1b84a23fba/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Computer-Science"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/2210.10173">
    <title>[2210.10173] Faster Matrix Multiplication via Asymmetric Hashing</title>
    <dc:date>2024-03-08T08:39:09+00:00</dc:date>
    <link>https://arxiv.org/abs/2210.10173</link>
    <dc:creator>abiola</dc:creator><dc:subject>Algorithms Computer-Science Numerics</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:abiola/b:e3d57baafa57/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Computer-Science"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Numerics"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://www.quantamagazine.org/new-breakthrough-brings-matrix-multiplication-closer-to-ideal-20240307/">
    <title>New Breakthrough Brings Matrix Multiplication Closer to Ideal | Quanta Magazine</title>
    <dc:date>2024-03-08T08:37:44+00:00</dc:date>
    <link>https://www.quantamagazine.org/new-breakthrough-brings-matrix-multiplication-closer-to-ideal-20240307/</link>
    <dc:creator>abiola</dc:creator><dc:subject>Algorithms Computer-Science Numerics</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:abiola/b:10c1bfd90ff8/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Computer-Science"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Numerics"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://en.wikipedia.org/wiki/Arithmetic_coding">
    <title>Arithmetic coding - Wikipedia</title>
    <dc:date>2024-03-01T22:13:35+00:00</dc:date>
    <link>https://en.wikipedia.org/wiki/Arithmetic_coding</link>
    <dc:creator>abiola</dc:creator><dc:subject>Algorithms Information-Theory</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:abiola/b:f52bebb4c822/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Information-Theory"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://www.ams.org/journals/notices/202402/noti2869/noti2869.html">
    <title>Compressed Sensing-Based SARS-CoV-2 Pool Testing</title>
    <dc:date>2024-01-23T19:12:40+00:00</dc:date>
    <link>https://www.ams.org/journals/notices/202402/noti2869/noti2869.html</link>
    <dc:creator>abiola</dc:creator><dc:subject>Algorithms Computer-Science Mathematics</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:abiola/b:5551ad273f1c/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Computer-Science"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Mathematics"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://dl.acm.org/doi/10.1145/3625817">
    <title>Iceberg Hashing: Optimizing Many Hash-Table Criteria at Once | Journal of the ACM</title>
    <dc:date>2024-01-22T08:37:59+00:00</dc:date>
    <link>https://dl.acm.org/doi/10.1145/3625817</link>
    <dc:creator>abiola</dc:creator><dc:subject>Algorithms Computer-Science</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:abiola/b:88f19fbf4b15/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Computer-Science"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://www.quantamagazine.org/researchers-refute-a-widespread-belief-about-online-algorithms-20231120/">
    <title>Researchers Refute a Widespread Belief About Online Algorithms | Quanta Magazine</title>
    <dc:date>2023-11-21T07:19:07+00:00</dc:date>
    <link>https://www.quantamagazine.org/researchers-refute-a-widespread-belief-about-online-algorithms-20231120/</link>
    <dc:creator>abiola</dc:creator><dc:subject>Algorithms Computer-Science</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:abiola/b:b9f74f2b3d31/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Computer-Science"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://en.wikipedia.org/wiki/Galactic_algorithm">
    <title>Galactic algorithm - Wikipedia</title>
    <dc:date>2023-05-28T21:56:29+00:00</dc:date>
    <link>https://en.wikipedia.org/wiki/Galactic_algorithm</link>
    <dc:creator>abiola</dc:creator><dc:subject>Algorithms Computer-Science</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:abiola/b:4269e01239d4/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Computer-Science"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://en.wikipedia.org/wiki/Gibbs_sampling">
    <title>Gibbs sampling - Wikipedia</title>
    <dc:date>2023-01-28T21:53:02+00:00</dc:date>
    <link>https://en.wikipedia.org/wiki/Gibbs_sampling</link>
    <dc:creator>abiola</dc:creator><dc:subject>Algorithms Statistics</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:abiola/b:30cb05981618/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Statistics"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7515030/">
    <title>Approximate Entropy and Sample Entropy: A Comprehensive Tutorial - PMC</title>
    <dc:date>2023-01-09T17:13:20+00:00</dc:date>
    <link>https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7515030/</link>
    <dc:creator>abiola</dc:creator><dc:subject>Algorithms Information-Theory Statistics Time-Series</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:abiola/b:395ec0f89f58/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Information-Theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Statistics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Time-Series"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://www.nature.com/articles/s41586-022-05172-4">
    <title>Discovering faster matrix multiplication algorithms with reinforcement learning | Nature</title>
    <dc:date>2022-10-05T18:18:31+00:00</dc:date>
    <link>https://www.nature.com/articles/s41586-022-05172-4</link>
    <dc:creator>abiola</dc:creator><dc:subject>Algorithms DeepMind Machine-Learning Numerics Reinforcement-Learning</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:abiola/b:83379438d731/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:DeepMind"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Machine-Learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Numerics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Reinforcement-Learning"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://web.stanford.edu/class/cs168/index.html">
    <title>The Modern Algorithmic Toolbox (CS168), Spring 2022</title>
    <dc:date>2022-09-10T08:02:56+00:00</dc:date>
    <link>https://web.stanford.edu/class/cs168/index.html</link>
    <dc:creator>abiola</dc:creator><dc:subject>Algorithms Computer-Science</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:abiola/b:f9ae34cfb2c1/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Computer-Science"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/2012.09265">
    <title>[2012.09265] Variational Quantum Algorithms</title>
    <dc:date>2022-07-30T21:01:13+00:00</dc:date>
    <link>https://arxiv.org/abs/2012.09265</link>
    <dc:creator>abiola</dc:creator><dc:subject>Algorithms Computer-Science Quantum-Computing</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:abiola/b:d74c3af56e3f/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Computer-Science"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Quantum-Computing"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/2203.00671#">
    <title>[2203.00671] Maximum Flow and Minimum-Cost Flow in Almost-Linear Time</title>
    <dc:date>2022-05-02T18:49:31+00:00</dc:date>
    <link>https://arxiv.org/abs/2203.00671#</link>
    <dc:creator>abiola</dc:creator><dc:subject>Algorithms Complexity-Theory Computer-Science</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:abiola/b:a49cb38ebab5/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Complexity-Theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Computer-Science"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1810.00378">
    <title>[1810.00378] Pseudo-Random Number Generation using Generative Adversarial Networks</title>
    <dc:date>2022-05-01T15:22:51+00:00</dc:date>
    <link>https://arxiv.org/abs/1810.00378</link>
    <dc:creator>abiola</dc:creator><dc:subject>Algorithms GANs Machine-Learning</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:abiola/b:c2c8af6a1bae/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:GANs"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Machine-Learning"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/2203.00671">
    <title>[2203.00671] Maximum Flow and Minimum-Cost Flow in Almost-Linear Time</title>
    <dc:date>2022-04-29T14:57:35+00:00</dc:date>
    <link>https://arxiv.org/abs/2203.00671</link>
    <dc:creator>abiola</dc:creator><dc:subject>Algorithms Complexity-Theory Computer-Science</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:abiola/b:20a448656a83/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Complexity-Theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Computer-Science"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/2112.09992">
    <title>[2112.09992] Weisfeiler and Leman go Machine Learning: The Story so far</title>
    <dc:date>2022-03-30T17:09:23+00:00</dc:date>
    <link>https://arxiv.org/abs/2112.09992</link>
    <dc:creator>abiola</dc:creator><dc:subject>Algorithms Graphs Machine-Learning GNNs</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:abiola/b:f9ae57a9641b/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Graphs"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Machine-Learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:GNNs"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://www.quantamagazine.org/researchers-defeat-randomness-to-create-ideal-code-20211124/">
    <title>Researchers Defeat Randomness to Create Ideal Code | Quanta Magazine</title>
    <dc:date>2021-11-25T16:26:08+00:00</dc:date>
    <link>https://www.quantamagazine.org/researchers-defeat-randomness-to-create-ideal-code-20211124/</link>
    <dc:creator>abiola</dc:creator><dc:subject>Algorithms Computer-Science Information-Theory</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:abiola/b:935de25c2bb9/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Computer-Science"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Information-Theory"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://www.quantamagazine.org/statistics-postdoc-tames-decades-old-geometry-problem-20210301/">
    <title>Statistics Postdoc Tames Decades-Old Geometry Problem | Quanta Magazine</title>
    <dc:date>2021-10-18T15:45:07+00:00</dc:date>
    <link>https://www.quantamagazine.org/statistics-postdoc-tames-decades-old-geometry-problem-20210301/</link>
    <dc:creator>abiola</dc:creator><dc:subject>Algorithms Geometry Machine-Learning Mathematics</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:abiola/b:8ae0b76558b7/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Geometry"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Machine-Learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Mathematics"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://news.ycombinator.com/item?id=28396077">
    <title>An optimal algorithm for bounded random integers | Hacker News</title>
    <dc:date>2021-09-03T10:31:30+00:00</dc:date>
    <link>https://news.ycombinator.com/item?id=28396077</link>
    <dc:creator>abiola</dc:creator><dc:subject>Algorithms Apple Programming</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:abiola/b:c993109fb284/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Apple"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Programming"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://news.ycombinator.com/item?id=28215676">
    <title>Complexity theory puts limits on performance of gradient descent | Hacker News</title>
    <dc:date>2021-08-25T19:45:58+00:00</dc:date>
    <link>https://news.ycombinator.com/item?id=28215676</link>
    <dc:creator>abiola</dc:creator><dc:subject>Algorithms Complexity-Theory Computer-Science Machine-Learning</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:abiola/b:25dbbc0f668e/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Complexity-Theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Computer-Science"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Machine-Learning"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.cs.cmu.edu/~kmcrane/Projects/RepulsiveCurves/">
    <title>Keenan Crane - Repulsive Curves</title>
    <dc:date>2021-07-31T15:05:00+00:00</dc:date>
    <link>http://www.cs.cmu.edu/~kmcrane/Projects/RepulsiveCurves/</link>
    <dc:creator>abiola</dc:creator><dc:subject>Algorithms Computer-Science Graphics Mathematics Pathfinding</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:abiola/b:3c399c1824a8/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Computer-Science"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Graphics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Mathematics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Pathfinding"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://en.wikipedia.org/wiki/Stable_marriage_problem">
    <title>Stable marriage problem - Wikipedia</title>
    <dc:date>2021-06-09T21:30:02+00:00</dc:date>
    <link>https://en.wikipedia.org/wiki/Stable_marriage_problem</link>
    <dc:creator>abiola</dc:creator><dc:subject>Algorithms Computer-Science Economics Mathematics</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:abiola/b:9ec35a2120db/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Computer-Science"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Economics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Mathematics"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://www.quantamagazine.org/mathematicians-inch-closer-to-matrix-multiplication-goal-20210323/">
    <title>Mathematicians Inch Closer to Matrix Multiplication Goal | Quanta Magazine</title>
    <dc:date>2021-03-31T20:00:55+00:00</dc:date>
    <link>https://www.quantamagazine.org/mathematicians-inch-closer-to-matrix-multiplication-goal-20210323/</link>
    <dc:creator>abiola</dc:creator><dc:subject>Algorithms Computer-Science Numerics</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:abiola/b:606af6401732/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Computer-Science"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Numerics"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://facebook.github.io/zstd/">
    <title>Zstandard - Real-time data compression algorithm</title>
    <dc:date>2020-12-18T14:15:44+00:00</dc:date>
    <link>https://facebook.github.io/zstd/</link>
    <dc:creator>abiola</dc:creator><dc:subject>Algorithms Facebook Programming Software</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:abiola/b:905ab897b1a3/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Facebook"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Programming"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Software"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://news.ycombinator.com/item?id=24785322">
    <title>A Family of Better Random Number Generators | Hacker News</title>
    <dc:date>2020-10-15T07:56:08+00:00</dc:date>
    <link>https://news.ycombinator.com/item?id=24785322</link>
    <dc:creator>abiola</dc:creator><dc:subject>Algorithms Programming Security</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:abiola/b:08531a02eda4/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Programming"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Security"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://en.wikipedia.org/wiki/Power_graph_analysis">
    <title>Power graph analysis - Wikipedia</title>
    <dc:date>2020-07-30T20:58:29+00:00</dc:date>
    <link>https://en.wikipedia.org/wiki/Power_graph_analysis</link>
    <dc:creator>abiola</dc:creator><dc:subject>Algorithms Graphs Graph-Theory Mathematics</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:abiola/b:09a4afee5037/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Graphs"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Graph-Theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Mathematics"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://www.shadertoy.com/view/4sSXWt">
    <title>Direct Light using MIS</title>
    <dc:date>2020-07-05T11:51:52+00:00</dc:date>
    <link>https://www.shadertoy.com/view/4sSXWt</link>
    <dc:creator>abiola</dc:creator><dc:subject>Algorithms Graphics</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:abiola/b:58bd467b59b2/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Graphics"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.cs.cmu.edu/~kmcrane/Projects/MonteCarloGeometryProcessing/index.html">
    <title>Keenan Crane - Monte Carlo Geometry Processing</title>
    <dc:date>2020-07-05T11:25:27+00:00</dc:date>
    <link>http://www.cs.cmu.edu/~kmcrane/Projects/MonteCarloGeometryProcessing/index.html</link>
    <dc:creator>abiola</dc:creator><dc:subject>Algorithms Graphics</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:abiola/b:ef588e10ad83/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Graphics"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://en.wikipedia.org/wiki/Iterated_logarithm">
    <title>Iterated logarithm - Wikipedia</title>
    <dc:date>2020-07-03T21:37:35+00:00</dc:date>
    <link>https://en.wikipedia.org/wiki/Iterated_logarithm</link>
    <dc:creator>abiola</dc:creator><dc:subject>Algorithms Computer-Science Mathematics</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:abiola/b:157d334d04cf/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Computer-Science"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Mathematics"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.gabrielnivasch.org/fun/inverse-ackermann">
    <title>Inverse Ackermann without pain - גבריאל ניבש - Gabriel Nivasch</title>
    <dc:date>2020-05-18T10:48:58+00:00</dc:date>
    <link>http://www.gabrielnivasch.org/fun/inverse-ackermann</link>
    <dc:creator>abiola</dc:creator><dc:subject>Algorithms Computability Mathematics</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:abiola/b:32771a1ffb68/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Computability"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Mathematics"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://jeffe.cs.illinois.edu/teaching/algorithms/">
    <title>Algorithms by Jeff Erickson</title>
    <dc:date>2020-05-12T07:59:12+00:00</dc:date>
    <link>https://jeffe.cs.illinois.edu/teaching/algorithms/</link>
    <dc:creator>abiola</dc:creator><dc:subject>Algorithms Books Computer-Science</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:abiola/b:3f5d50420922/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Books"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Computer-Science"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://github.com/ilyaraz/ot_estimators">
    <title>ilyaraz/ot_estimators: Implementations of several fast approximate algorithms for geometric optimal transport (OT)</title>
    <dc:date>2020-04-23T17:17:31+00:00</dc:date>
    <link>https://github.com/ilyaraz/ot_estimators</link>
    <dc:creator>abiola</dc:creator><dc:subject>Algorithms C++ Optimal-Transport Programming Python</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:abiola/b:a0beea0f1059/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:C++"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Optimal-Transport"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Programming"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Python"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/0907.2423">
    <title>[0907.2423] Computing Multidimensional Persistence</title>
    <dc:date>2020-04-17T13:29:14+00:00</dc:date>
    <link>https://arxiv.org/abs/0907.2423</link>
    <dc:creator>abiola</dc:creator><dc:subject>Algebraic-Topology Algorithms Geometry Mathematics</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:abiola/b:edb702f7f3a3/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Algebraic-Topology"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Geometry"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Mathematics"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1410.7012">
    <title>[1410.7012] Only distances are required to reconstruct submanifolds</title>
    <dc:date>2020-04-16T13:51:00+00:00</dc:date>
    <link>https://arxiv.org/abs/1410.7012</link>
    <dc:creator>abiola</dc:creator><dc:subject>Algebraic-Topology Algorithms Geometry Mathematics</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:abiola/b:63a8d9e48323/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Algebraic-Topology"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Geometry"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Mathematics"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://epjdatascience.springeropen.com/articles/10.1140/epjds/s13688-017-0109-5">
    <title>A roadmap for the computation of persistent homology | EPJ Data Science | Full Text</title>
    <dc:date>2020-04-16T13:27:50+00:00</dc:date>
    <link>https://epjdatascience.springeropen.com/articles/10.1140/epjds/s13688-017-0109-5</link>
    <dc:creator>abiola</dc:creator><dc:subject>Algebraic-Topology Algorithms Mathematics</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:abiola/b:3b476b2b71bb/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Algebraic-Topology"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Mathematics"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/2004.02290">
    <title>[2004.02290] A new hashing based nearest neighbors selection technique for big datasets</title>
    <dc:date>2020-04-07T08:54:25+00:00</dc:date>
    <link>https://arxiv.org/abs/2004.02290</link>
    <dc:creator>abiola</dc:creator><dc:subject>Algorithms Machine-Learning</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:abiola/b:7715f6500bbf/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Machine-Learning"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://github.com/mikepound/mazesolving">
    <title>GitHub - mikepound/mazesolving: A variety of algorithms to solve mazes from an input image</title>
    <dc:date>2020-02-01T22:23:50+00:00</dc:date>
    <link>https://github.com/mikepound/mazesolving</link>
    <dc:creator>abiola</dc:creator><dc:subject>Algorithms Programming Python</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:abiola/b:5085b865b097/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Programming"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Python"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.math.uwaterloo.ca/tsp/index.html">
    <title>Traveling Salesman Problem</title>
    <dc:date>2020-01-25T07:57:11+00:00</dc:date>
    <link>http://www.math.uwaterloo.ca/tsp/index.html</link>
    <dc:creator>abiola</dc:creator><dc:subject>Algorithms Computer-Science</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:abiola/b:92dfb8073197/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Computer-Science"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arstechnica.com/gaming/2019/12/how-much-of-a-genius-level-move-was-using-binary-space-partitioning-in-doom/">
    <title>How much of a genius-level move was using binary space partitioning in Doom? | Ars Technica</title>
    <dc:date>2019-12-30T12:32:13+00:00</dc:date>
    <link>https://arstechnica.com/gaming/2019/12/how-much-of-a-genius-level-move-was-using-binary-space-partitioning-in-doom/</link>
    <dc:creator>abiola</dc:creator><dc:subject>Algorithms Graphics Programming</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:abiola/b:a5b545718da7/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Graphics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Programming"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://people.csail.mit.edu/tzumao/diffrt/">
    <title>Differentiable Monte Carlo Ray Tracing through Edge Sampling</title>
    <dc:date>2019-12-27T15:07:53+00:00</dc:date>
    <link>https://people.csail.mit.edu/tzumao/diffrt/</link>
    <dc:creator>abiola</dc:creator><dc:subject>Algorithms Graphics Machine-Learning</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:abiola/b:fc0e5969f741/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Graphics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Machine-Learning"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://ccodearchive.net/list.html">
    <title>Comprehensive C Archive Network</title>
    <dc:date>2019-12-11T20:51:49+00:00</dc:date>
    <link>http://ccodearchive.net/list.html</link>
    <dc:creator>abiola</dc:creator><dc:subject>Algorithms C Data-Structures Programming Software</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:abiola/b:0777a1500870/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:C"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Data-Structures"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Programming"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Software"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://jeffe.cs.illinois.edu/teaching/algorithms/">
    <title>Algorithms by Jeff Erickson</title>
    <dc:date>2019-12-11T20:48:33+00:00</dc:date>
    <link>http://jeffe.cs.illinois.edu/teaching/algorithms/</link>
    <dc:creator>abiola</dc:creator><dc:subject>Algorithms Books Computer-Science</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:abiola/b:3061b7d300be/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Books"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Computer-Science"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://en.wikipedia.org/wiki/Miller%E2%80%93Rabin_primality_test">
    <title>Miller–Rabin primality test - Wikipedia</title>
    <dc:date>2019-11-28T13:42:03+00:00</dc:date>
    <link>https://en.wikipedia.org/wiki/Miller%E2%80%93Rabin_primality_test</link>
    <dc:creator>abiola</dc:creator><dc:subject>Algorithms Mathematics Number-Theory</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:abiola/b:ce8d82eceb69/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Mathematics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Number-Theory"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://blogs.msdn.microsoft.com/devdev/2006/06/19/factoring-large-numbers-with-quadratic-sieve/">
    <title>Factoring large numbers with quadratic sieve – Developing for Developers</title>
    <dc:date>2019-11-26T15:53:16+00:00</dc:date>
    <link>https://blogs.msdn.microsoft.com/devdev/2006/06/19/factoring-large-numbers-with-quadratic-sieve/</link>
    <dc:creator>abiola</dc:creator><dc:subject>Algorithms Mathematics Number-Theory</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:abiola/b:aa23f98401c1/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Mathematics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Number-Theory"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://www.scottaaronson.com/writings/bignumbers.html">
    <title>Who Can Name the Bigger Number?</title>
    <dc:date>2019-11-16T20:31:09+00:00</dc:date>
    <link>https://www.scottaaronson.com/writings/bignumbers.html</link>
    <dc:creator>abiola</dc:creator><dc:subject>Algorithms Computer-Science Mathematics</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:abiola/b:4ef5530c8e2c/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Computer-Science"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Mathematics"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1910.02926">
    <title>[1910.02926] Cubic Stylization</title>
    <dc:date>2019-11-03T08:02:06+00:00</dc:date>
    <link>https://arxiv.org/abs/1910.02926</link>
    <dc:creator>abiola</dc:creator><dc:subject>Algorithms Computer-Science Graphics</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:abiola/b:a0af0d84f2bd/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Computer-Science"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Graphics"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://en.wikipedia.org/wiki/Luhn_algorithm">
    <title>Luhn algorithm - Wikipedia</title>
    <dc:date>2019-10-22T13:21:09+00:00</dc:date>
    <link>https://en.wikipedia.org/wiki/Luhn_algorithm</link>
    <dc:creator>abiola</dc:creator><dc:subject>Algorithms</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:abiola/b:4ea02219b921/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Algorithms"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://jgrapht.org/">
    <title>JGraphT - a Java library of graph theory data structures and algorithms</title>
    <dc:date>2019-10-22T13:14:24+00:00</dc:date>
    <link>https://jgrapht.org/</link>
    <dc:creator>abiola</dc:creator><dc:subject>Algorithms Data-Structures Graphs Java Programming Software</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:abiola/b:be574ada9b0a/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Data-Structures"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Graphs"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Java"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Programming"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Software"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://news.ycombinator.com/item?id=21151646">
    <title>Karatsuba Algorithm | Hacker News</title>
    <dc:date>2019-10-05T06:28:29+00:00</dc:date>
    <link>https://news.ycombinator.com/item?id=21151646</link>
    <dc:creator>abiola</dc:creator><dc:subject>Algorithms Computer-Science Mathematics Numerics</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:abiola/b:3ba02c4fa65b/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Computer-Science"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Mathematics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Numerics"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://geomalgorithms.com/a09-_intersect-3.html">
    <title>Intersections of a Set of Segments</title>
    <dc:date>2019-10-04T12:43:44+00:00</dc:date>
    <link>http://geomalgorithms.com/a09-_intersect-3.html</link>
    <dc:creator>abiola</dc:creator><description><![CDATA[Discusses Bentley-Ottmann and alternatives]]></description>
<dc:subject>Algorithms Computer-Science Geometry Graphics Programming</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:abiola/b:9db5e5605b9d/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Computer-Science"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Geometry"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Graphics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Programming"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://www.aaai.org/ocs/index.php/ICAPS/ICAPS16/paper/viewFile/13155/12717">
    <title>Speeding up A* Search on Visibility Graphs Defined Over Quadtrees to Enable Long Distance Path Planning for Unmanned Surface Vehicles - 12717</title>
    <dc:date>2019-10-03T14:07:43+00:00</dc:date>
    <link>https://www.aaai.org/ocs/index.php/ICAPS/ICAPS16/paper/viewFile/13155/12717</link>
    <dc:creator>abiola</dc:creator><dc:subject>Algorithms Computer-Science Pathfinding</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:abiola/b:9894fc820500/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Computer-Science"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Pathfinding"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1909.10475">
    <title>[1909.10475] String Diagrams for Assembly Planning</title>
    <dc:date>2019-10-03T12:28:46+00:00</dc:date>
    <link>https://arxiv.org/abs/1909.10475</link>
    <dc:creator>abiola</dc:creator><dc:subject>Algorithms Category-Theory Mathematics Robotics</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:abiola/b:9acc4c4c7976/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Category-Theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Mathematics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Robotics"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://www.eecs.tufts.edu/~ap/geo/disc">
    <title>Shortest Path Discussion on Funnel Algorithm</title>
    <dc:date>2019-10-02T08:15:29+00:00</dc:date>
    <link>https://www.eecs.tufts.edu/~ap/geo/disc</link>
    <dc:creator>abiola</dc:creator><dc:subject>Algorithms Computer-Science Geometry</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:abiola/b:1c1e00dc2c49/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Computer-Science"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Geometry"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://en.wikipedia.org/wiki/Euclidean_shortest_path">
    <title>Euclidean shortest path - Wikipedia</title>
    <dc:date>2019-10-02T08:08:32+00:00</dc:date>
    <link>https://en.wikipedia.org/wiki/Euclidean_shortest_path</link>
    <dc:creator>abiola</dc:creator><dc:subject>Computer-Science Geometry Mathematics Algorithms</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:abiola/b:bd85968c452d/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Computer-Science"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Geometry"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Mathematics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Algorithms"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://en.wikipedia.org/wiki/Topological_sorting">
    <title>Topological sorting - Wikipedia</title>
    <dc:date>2019-09-28T15:28:36+00:00</dc:date>
    <link>https://en.wikipedia.org/wiki/Topological_sorting</link>
    <dc:creator>abiola</dc:creator><dc:subject>Algorithms Computer-Science Graph-Theory</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:abiola/b:bffc1b225ee1/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Computer-Science"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Graph-Theory"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1509.05053#">
    <title>[1509.05053] Array Layouts for Comparison-Based Searching</title>
    <dc:date>2019-09-26T12:03:21+00:00</dc:date>
    <link>https://arxiv.org/abs/1509.05053#</link>
    <dc:creator>abiola</dc:creator><dc:subject>Algorithms Computer-Science Data-Structures</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:abiola/b:ae17d4c28005/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Computer-Science"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Data-Structures"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://geomalgorithms.com/a07-_distance.html">
    <title>Distance between Lines, Segments and their CPA (2D &amp; 3D)</title>
    <dc:date>2019-09-25T09:58:39+00:00</dc:date>
    <link>http://geomalgorithms.com/a07-_distance.html</link>
    <dc:creator>abiola</dc:creator><dc:subject>Algorithms Geometry Programming</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:abiola/b:cc5a9759227b/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Geometry"/>
	<rdf:li rdf:resource="https://pinboard.in/u:abiola/t:Programming"/>
</rdf:Bag></taxo:topics>
</item>
</rdf:RDF>