<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>girish lab – Research</title><link>/research/</link><description>Recent content in Research on girish lab</description><generator>Hugo -- gohugo.io</generator><language>en</language><atom:link href="/research/index.xml" rel="self" type="application/rss+xml"/><item><title>Research: Model Compression</title><link>/research/model-compression/</link><pubDate>Mon, 27 Jun 2016 00:00:00 +0000</pubDate><guid>/research/model-compression/</guid><description/></item><item><title>Research: Hardness of Approximation</title><link>/research/hardness/</link><pubDate>Wed, 27 Apr 2016 00:00:00 +0000</pubDate><guid>/research/hardness/</guid><description>
&lt;p>Improved lowerbounds for graph/hypergraph coloring.&lt;/p></description></item><item><title>Research: PCPs &amp; Hardness Amplification</title><link>/research/pcps/</link><pubDate>Wed, 27 Apr 2016 00:00:00 +0000</pubDate><guid>/research/pcps/</guid><description>
&lt;p>Improved PCPs using low-degree codes and product constructions.&lt;/p></description></item><item><title>Research: Physarum Computer</title><link>/research/physarum-computer/</link><pubDate>Wed, 27 Apr 2016 00:00:00 +0000</pubDate><guid>/research/physarum-computer/</guid><description>
&lt;p>Formal proof for slime-molds finding shortest paths in maze.&lt;/p></description></item><item><title>Research: Streaming Algorithms</title><link>/research/streaming/</link><pubDate>Wed, 27 Apr 2016 00:00:00 +0000</pubDate><guid>/research/streaming/</guid><description>
&lt;p>Few pass, small memory algorithms for big data.&lt;/p></description></item></channel></rss>