<?xml version="1.0" encoding="UTF-8"?>
<?xml-stylesheet href="/static_war/render/xsl/rss2.xsl" media="screen" type="text/xsl"?>
<rss version="2.0">
  <channel>
    <title>Computer Science &#187; Department Events</title>
    <link>https://warwick.ac.uk/fac/sci/dcs/events/</link>
    <description>Recently published events, starting Thu, 12 Mar 2026</description>
    <language>en-GB</language>
    <copyright>(C) 2026 University of Warwick</copyright>
    <pubDate>Thu, 12 Mar 2026 19:39:36 GMT</pubDate>
    <lastBuildDate>Wed, 11 Mar 2026 12:07:46 GMT</lastBuildDate>
    <docs>http://blogs.law.harvard.edu/tech/rss</docs>
    <managingEditor>Computer Science</managingEditor>
    <webMaster>webteam@warwick.ac.uk (Warwick ITS Web Team)</webMaster>
    <generator>SiteBuilder2, University of Warwick, http://go.warwick.ac.uk/sitebuilder</generator>
    <category>Complexity Meetings</category>
    <category>Theory and Foundations</category>
    <item>
      <title>30/04 5pm-6:30pm: Complexity Seminar: High Rate Efficient Local List Decoding from HDX (Yotam Dikstein, IAS Princeton)</title>
      <link>https://sites.google.com/view/igorcarbonioliveira/online-complexity-seminar</link>
      <description>&lt;p&gt;When:
	
  		&lt;time class="dtstart" datetime="2026-04-30T17:00:00.000"&gt;17:00&lt;/time&gt;
		-
		&lt;time class="dtend" datetime="2026-04-30T18:30:00.000"&gt;18:30, Thu, 30 Apr '26&lt;/time&gt;
&lt;/p&gt;
	&lt;p&gt;Where: Online&lt;/p&gt;
	&lt;p&gt;&lt;p&gt;https://sites.google.com/view/igorcarbonioliveira/online-complexity-seminar&lt;/p&gt;&lt;/p&gt;</description>
      <category>Complexity Meetings</category>
      <category>Theory and Foundations</category>
      <pubDate>Tue, 24 Feb 2026 12:01:29 GMT</pubDate>
      <author>Computer Science</author>
      <guid isPermaLink="false">8ac672c69c8a6b40019c8f8699f612cb</guid>
    </item>
    <item>
      <title>16/04 5pm-6:30pm: Complexity Seminar: Superquadratic Lower Bounds for Depth-2 Linear Threshold Circuits (Yichuan Wang, Tsinghua University)</title>
      <link>https://sites.google.com/view/igorcarbonioliveira/online-complexity-seminar</link>
      <description>&lt;p&gt;When:
	
  		&lt;time class="dtstart" datetime="2026-04-16T17:00:00.000"&gt;17:00&lt;/time&gt;
		-
		&lt;time class="dtend" datetime="2026-04-16T18:30:00.000"&gt;18:30, Thu, 16 Apr '26&lt;/time&gt;
&lt;/p&gt;
	&lt;p&gt;Where: Online&lt;/p&gt;
	&lt;p&gt;&lt;p&gt;https://sites.google.com/view/igorcarbonioliveira/online-complexity-seminar&lt;/p&gt;&lt;/p&gt;</description>
      <category>Complexity Meetings</category>
      <category>Theory and Foundations</category>
      <pubDate>Fri, 20 Feb 2026 09:38:13 GMT</pubDate>
      <author>Computer Science</author>
      <guid isPermaLink="false">8ac672c69c70cfcb019c7a6a01603a4a</guid>
    </item>
    <item>
      <title>09/04 5pm-6:30pm: Complexity Seminar: The Structure of In-Place Space-Bounded Computation (Nathan Sheffield, MIT)</title>
      <link>https://sites.google.com/view/igorcarbonioliveira/online-complexity-seminar</link>
      <description>&lt;p&gt;When:
	
  		&lt;time class="dtstart" datetime="2026-04-09T17:00:00.000"&gt;17:00&lt;/time&gt;
		-
		&lt;time class="dtend" datetime="2026-04-09T18:30:00.000"&gt;18:30, Thu, 09 Apr '26&lt;/time&gt;
&lt;/p&gt;
	&lt;p&gt;Where: Online&lt;/p&gt;
	&lt;p&gt;&lt;p&gt;https://sites.google.com/view/igorcarbonioliveira/online-complexity-seminar&lt;/p&gt;&lt;/p&gt;</description>
      <category>Complexity Meetings</category>
      <category>Theory and Foundations</category>
      <pubDate>Fri, 20 Feb 2026 09:37:05 GMT</pubDate>
      <author>Computer Science</author>
      <guid isPermaLink="false">8ac672c49c70d2df019c7a68f6682f2a</guid>
    </item>
    <item>
      <title>02/04 5pm-6:30pm: Complexity Seminar: SNARGs for NP from Unprovability of Mathematical Theorems (Surya Mathialagan - NTT Research)</title>
      <link>https://sites.google.com/view/igorcarbonioliveira/online-complexity-seminar</link>
      <description>&lt;p&gt;When:
	
  		&lt;time class="dtstart" datetime="2026-04-02T17:00:00.000"&gt;17:00&lt;/time&gt;
		-
		&lt;time class="dtend" datetime="2026-04-02T18:30:00.000"&gt;18:30, Thu, 02 Apr '26&lt;/time&gt;
&lt;/p&gt;
	&lt;p&gt;Where: Online&lt;/p&gt;
	&lt;p&gt;&lt;p&gt;https://sites.google.com/view/igorcarbonioliveira/online-complexity-seminar&lt;/p&gt;&lt;/p&gt;</description>
      <category>Complexity Meetings</category>
      <category>Theory and Foundations</category>
      <pubDate>Tue, 17 Feb 2026 18:34:19 GMT</pubDate>
      <author>Computer Science</author>
      <guid isPermaLink="false">8ac672c49c649e01019c6ce1bf535720</guid>
    </item>
    <item>
      <title>12/03 5pm-6:30pm: Complexity Seminar: Range Avoidance, Arthur-Merlin, and TFNP (Zeyong Li - National University of Singapore)</title>
      <link>https://sites.google.com/view/igorcarbonioliveira/online-complexity-seminar</link>
      <description>&lt;p&gt;When:
	
  		&lt;time class="dtstart" datetime="2026-03-12T17:00:00.000"&gt;17:00&lt;/time&gt;
		-
		&lt;time class="dtend" datetime="2026-03-12T18:30:00.000"&gt;18:30, Thu, 12 Mar '26&lt;/time&gt;
&lt;/p&gt;
	&lt;p&gt;Where: Online&lt;/p&gt;
	&lt;p&gt;&lt;p&gt;https://sites.google.com/view/igorcarbonioliveira/online-complexity-seminar&lt;/p&gt;&lt;/p&gt;</description>
      <category>Complexity Meetings</category>
      <category>Theory and Foundations</category>
      <pubDate>Mon, 16 Feb 2026 15:32:02 GMT</pubDate>
      <author>Computer Science</author>
      <guid isPermaLink="false">8ac672c59c51675d019c67147e507841</guid>
    </item>
    <item>
      <title>26/03 5pm-6:30pm: Complexity Seminar:  Hardness of Range Avoidance and Proof Complexity Generators from Demi-Bits (Hanlin Ren, IAS)</title>
      <link>https://sites.google.com/view/igorcarbonioliveira/online-complexity-seminar</link>
      <description>&lt;p&gt;When:
	
  		&lt;time class="dtstart" datetime="2026-03-26T17:00:00.000"&gt;17:00&lt;/time&gt;
		-
		&lt;time class="dtend" datetime="2026-03-26T18:30:00.000"&gt;18:30, Thu, 26 Mar '26&lt;/time&gt;
&lt;/p&gt;
	&lt;p&gt;Where: Online&lt;/p&gt;
	&lt;p&gt;&lt;p&gt;https://sites.google.com/view/igorcarbonioliveira/online-complexity-seminar&lt;/p&gt;&lt;/p&gt;</description>
      <category>Complexity Meetings</category>
      <category>Theory and Foundations</category>
      <pubDate>Sat, 14 Feb 2026 18:40:32 GMT</pubDate>
      <author>Computer Science</author>
      <guid isPermaLink="false">8ac672c59c51675d019c5d745ac6473b</guid>
    </item>
    <item>
      <title>19/03 5pm-6:30pm: Complexity Seminar:  The PCP Theorem with a Single Composition (Amik Raj Behera, Copenhagen)</title>
      <link>https://sites.google.com/view/igorcarbonioliveira/online-complexity-seminar</link>
      <description>&lt;p&gt;When:
	
  		&lt;time class="dtstart" datetime="2026-03-19T17:00:00.000"&gt;17:00&lt;/time&gt;
		-
		&lt;time class="dtend" datetime="2026-03-19T18:30:00.000"&gt;18:30, Thu, 19 Mar '26&lt;/time&gt;
&lt;/p&gt;
	&lt;p&gt;Where: Online&lt;/p&gt;
	&lt;p&gt;&lt;p&gt;https://sites.google.com/view/igorcarbonioliveira/online-complexity-seminar&lt;/p&gt;&lt;/p&gt;</description>
      <category>Complexity Meetings</category>
      <category>Theory and Foundations</category>
      <pubDate>Sat, 14 Feb 2026 18:39:34 GMT</pubDate>
      <author>Computer Science</author>
      <guid isPermaLink="false">8ac672c59c51675d019c5d7377d44738</guid>
    </item>
  </channel>
</rss>
