Difference between revisions of "CATS"

From Theory
Line 26: Line 26:
 
| April 8|| 1:00-2:00 PM|| CSIC 2107|| [http://www.maa.org/fern-y-hunt Fern Hunt] || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Apr-8-2016 An Algorithm for Identifying Optimal Spreaders in a Random Walk Model of Network Communication]
 
| April 8|| 1:00-2:00 PM|| CSIC 2107|| [http://www.maa.org/fern-y-hunt Fern Hunt] || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Apr-8-2016 An Algorithm for Identifying Optimal Spreaders in a Random Walk Model of Network Communication]
 
|-
 
|-
−
| April 15|| 1:00-2:00 PM|| CSIC 2107|| Saba Ahmadi || TBA
+
| April 15|| 1:00-2:00 PM|| CSIC 2107|| Saba Ahmadi || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Apr-15-2016 Dynamic (1+\epsilon)-Approximate Matchings: A Density Sensitive Approach]
 
|-
 
|-
−
| April 22|| 1:00-2:00 PM|| CSIC 2107|| Ahmed Abdelkader || TBA
+
| April 22|| 1:00-2:00 PM|| CSIC 2107|| Ahmed Abdelkader || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Apr-22-2016 Approximating the ATSP on topologically restricted graphs]
 
|-
 
|-
 
| April 29|| 1:00-2:00 PM|| CSIC 2107|| Yang Sheng || TBA
 
| April 29|| 1:00-2:00 PM|| CSIC 2107|| Yang Sheng || TBA

Revision as of 01:23, 20 April 2016

Capital Area Theory Seminar[edit]

Spring 2016[edit]

Date Time Location Speaker Title
Feb 5 1:00 AM-2:00 PM CSIC 2107 Pan Xu Stochastic Knapsack Problem
Feb 12 1:00-2:00 PM CSIC 2107 Paul Randazzo On Polynomial Time algorithms for restricted Subset Sum Problems
Feb 19 1:00-2:00 PM CSIC 2107 Rahul Shah Succinct Data Structures and Text Indexing
Feb 26 1:00-2:00 PM CSIC 2107 Vladimir Braverman New Streaming Methods for Heavy Hitters and Norms
March 4 1:00-2:00 PM CSIC 2107 Brian Brubach Survey of Local Computation Algorithms
March 11 1:00-2:00 PM CSIC 2107 Ioana bercea On Computing Maximal Independent Sets of Hypergraphs in Parallel
March 16 1:00-2:00 PM CSIC 2107 Debmalya Panigrahi Online Budgeted Allocation with General Budgets
March 25 1:00-2:00 PM CSIC 2107 Amin Karbasi Data Summarization at Scale
April 8 1:00-2:00 PM CSIC 2107 Fern Hunt An Algorithm for Identifying Optimal Spreaders in a Random Walk Model of Network Communication
April 15 1:00-2:00 PM CSIC 2107 Saba Ahmadi Dynamic (1+\epsilon)-Approximate Matchings: A Density Sensitive Approach
April 22 1:00-2:00 PM CSIC 2107 Ahmed Abdelkader Approximating the ATSP on topologically restricted graphs
April 29 1:00-2:00 PM CSIC 2107 Yang Sheng TBA
May 6 1:00-2:00 PM CSIC 2107 Karthik Abinav Sankararaman TBA

CATS Talks from previous semesters[edit]

Web Accessibility

Retrieved from "https://wiki.cs.umd.edu/theory/w/index.php?title=CATS&oldid=2060"