<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Article-Journal |</title><link>http://devintheroboticist.com/publication_types/article-journal/</link><atom:link href="http://devintheroboticist.com/publication_types/article-journal/index.xml" rel="self" type="application/rss+xml"/><description>Article-Journal</description><generator>HugoBlox Kit (https://hugoblox.com)</generator><language>en-us</language><lastBuildDate>Fri, 01 May 2020 00:00:00 +0000</lastBuildDate><image><url>http://devintheroboticist.com/media/icon_hu_1c0e9cb08cfb822a.png</url><title>Article-Journal</title><link>http://devintheroboticist.com/publication_types/article-journal/</link></image><item><title>Quantifying the Difference of Time Complexity Between Two Probability Algorithms</title><link>http://devintheroboticist.com/publications/ewc-time-complexity/</link><pubDate>Fri, 01 May 2020 00:00:00 +0000</pubDate><guid>http://devintheroboticist.com/publications/ewc-time-complexity/</guid><description>&lt;ul&gt;
&lt;li&gt;Hunter, D., &amp;amp; Bowers, C. (2020). Quantifying the difference of time complexity between two probability algorithms. &lt;em&gt;Edward Waters College&amp;rsquo;s Undergraduate Journal on Research Across the Disciplines, 1&lt;/em&gt;(2), 76–97.&lt;/li&gt;
&lt;/ul&gt;</description></item></channel></rss>