Anonymous

Changes

From Theory
1,616 bytes removed ,  11:29, 29 January 2016
no edit summary
Line 2: Line 2:       −
==Fall 2015 ==
+
==Spring 2016 ==
 
{| class="wikitable" style="text-align: center;" border="1"
 
{| class="wikitable" style="text-align: center;" border="1"
 
|-
 
|-
 
! width="70pt" | Date !! width="110pt" | Time !! width="70pt" | Location !! width="150pt" | Speaker !! width="580pt" | Title
 
! width="70pt" | Date !! width="110pt" | Time !! width="70pt" | Location !! width="150pt" | Speaker !! width="580pt" | Title
 
|-
 
|-
| Aug 3|| 11:00 AM-12:00 PM|| CSIC 1121|| [http://www.cs.nyu.edu/spencer/ Joel Spencer] || Finding Needles in Exponential Haystacks
+
| Feb 5|| 1:00 AM-2:00 PM|| CSIC 2107|| [https://sites.google.com/site/panxupi/ Pan Xu] || TBA
 
|-
 
|-
| Sept 11|| 1:00-2:00 PM|| CSIC3118|| [http://www.cs.umd.edu/~manishp/ Manish Purohit] || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Sept-10-2015 Approximation Algorithms for Connected Maximum Cut and Related Problems]
+
| Feb 12|| 1:00-2:00 PM|| CSIC 2107|| Paul Randazzo || TBA
 
|-
 
|-
| Sept 25|| 1:00-2:00 PM|| CSIC3118|| [http://karthikabinavs.xyz Karthik A Sankararaman] || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Sept-25-2015 Lassere Hierarchy]
+
| Feb 19|| 1:00-2:00 PM|| CSIC 2107|| Rahul Shah || TBA
 
|-
 
|-
| Oct 2|| 1:00-2:00 PM|| CSIC3118|| Pan Xu || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Oct-2-2015 Lassere Hierarchy]  
+
| Feb 26|| 1:00-2:00 PM|| CSIC 2107|| [http://www.cs.jhu.edu/~vova/ Vladimir Braverman] || TBA
 
|-
 
|-
| Oct 9|| 1:00-2:00 PM|| CSIC3118|| [http://www.cs.umd.edu/~hossein/ Hossein Esfandiari] || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Oct-9-2015 Online Allocation with Traffic Spikes: Mixing Adversarial and Stochastic Models]
+
| March 4|| 1:00-2:00 PM|| CSIC 2107|| [http://www.cs.umd.edu/~bbrubach/ Brian Brubach] || TBA
 
|-
 
|-
| Oct 30|| 1:00-2:00 PM|| CSIC3118|| [http://www.cs.umd.edu/~manishp/ Manish Purohit] || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Oct-30-2015 Two Faces of Algorithm Design: Optimization and Learning]  
+
| March 11|| 1:00-2:00 PM|| CSIC 2107|| [http://www.cs.umd.edu/~ioana/ Ioana bercea] || TBA
|-
  −
| Nov 6 || 1:00-2:00 PM|| CSIC3118|| Khoa Trinh || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Nov-6-2015 An Improved Approximation Algorithm for Knapsack Median]
  −
|-
  −
| Nov 13|| 1:00-2:00 PM|| CSIC3118|| Soheil Ehsani || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Nov-13-2015 Online Degree-Bounded Steiner Network Design]
  −
|-
  −
| Nov 20|| 1:00-2:00 PM|| AVW 4424|| Saeed Seddighin ||  [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Nov-20-2015 The power of stochastic modeling, beating theoretically proven lower bounds of optimization problems]
  −
|-
  −
| Dec 4 || 1:00-2:00 PM|| CSIC3118|| [http://www.cs.umd.edu/~dehghani/ Sina Dehghani] ||  [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Dec-4-2015 Pricing the Cloud]
  −
|-
  −
| Dec 11 || 1:00-2:00 PM|| CSIC3118|| [http://people.seas.harvard.edu/~babis/ Charalampos Tsourakakis]  || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Dec-11-2015 Scalable Large Near-Clique Detection in Large-Scale Networks]
   
|}
 
|}
  
editor
178

edits