<?xml version="1.0" encoding="utf-8"?>
<?xml-stylesheet type="text/xsl" href="../assets/xml/rss.xsl" media="all"?><rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>PCG, A Better Random Number Generator (Posts about videos)</title><link>http://www.pcg-random.org/</link><description></description><atom:link href="http://www.pcg-random.org/categories/videos.xml" rel="self" type="application/rss+xml"></atom:link><language>en</language><copyright>Contents © 2026 &lt;a href="mailto:oneill@pcg-random.org"&gt;M.E. O'Neill&lt;/a&gt; </copyright><lastBuildDate>Sat, 10 Jan 2026 00:53:27 GMT</lastBuildDate><generator>Nikola (getnikola.com)</generator><docs>http://blogs.law.harvard.edu/tech/rss</docs><item><title>Stanford Colloquium Talk</title><link>http://www.pcg-random.org/posts/stanford-colloquium-talk.html</link><dc:creator>M.E. O'Neill</dc:creator><description>&lt;p&gt;On February 18, I gave a talk about at Stanford University, as part of &lt;a class="reference external" href="http://web.stanford.edu/class/ee380/Abstracts/150218.html"&gt;EE380, Computer Systems Colloquium&lt;/a&gt;.&lt;/p&gt;
&lt;p&gt;The talk provides an overview random number generation in general and the PCG family in particular.  It was a good audience and a fun experience.  They recorded the talk, and actually had pretty good production values, and then &lt;a class="reference external" href="http://youtube.com/watch?v=45Oet5qjlms"&gt;posted it to YouTube&lt;/a&gt;.&lt;/p&gt;
&lt;iframe width="560" height="315" src="https://www.youtube.com/embed/45Oet5qjlms" frameborder="0" allowfullscreen&gt;&lt;/iframe&gt;</description><category>news</category><category>videos</category><guid>http://www.pcg-random.org/posts/stanford-colloquium-talk.html</guid><pubDate>Wed, 01 Apr 2015 00:07:52 GMT</pubDate></item></channel></rss>