Difference between revisions of "CATS"

From Theory
Line 26: Line 26:
 
| Nov 15|| 1:00-2:00 PM|| CSIC1122|| [http://mhbateni.com/academic/ Mohammad Hossein Bateni] || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Nov-15-2013 Concise Bid Optimization Strategies with Multiple Budget Constraints]  
 
| Nov 15|| 1:00-2:00 PM|| CSIC1122|| [http://mhbateni.com/academic/ Mohammad Hossein Bateni] || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Nov-15-2013 Concise Bid Optimization Strategies with Multiple Budget Constraints]  
 
|-
 
|-
| Nov 22|| 1:00-2:00 PM|| CSIC1122|| [http://www.cs.umd.edu/~gasarch/ William Gasarch] || Pretty good, though still Exponential, algorithms for 3-SAT and Min Ind Set  
+
| Nov 22|| 1:00-2:00 PM|| CSIC1122|| [http://www.cs.umd.edu/~gasarch/ William Gasarch] || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Nov-22-2013 Pretty good, though still Exponential, algorithms for 3-SAT and Min Ind Set]
 
|}
 
|}
  

Revision as of 20:36, 19 November 2013

Capital Area Theory Seminar[edit]

Fall 2013[edit]

Date Time Location Speaker Title
Sep 17 1:00-2:00 PM AVW3258 Maria-Florina Balcan The Power of Localization for Active and Passive Learning of Linear Separators
Sep 20 1:00-2:00 PM CSIC1122 Yingyu Liang Clustering under Perturbation Resilience
Sep 27 1:00-2:00 PM CSIC1122 Rajesh Chitnis List H-Coloring a Graph by Removing Few Vertices
Oct 4 1:00-2:00 PM CSIC1122 Kamal Jain Algorithmic Game Theory of eBay's Buyer-Selling matching
Oct 11 1:00-2:00 PM CSIC1122 Matthew Andrews Economics of Sponsored Content in Mobile Data Networks under Uncertain Demand
Oct 25 1:00-2:00 PM CSIC1122 Anshul Sawant Scheduling a Cascade with Opposing Influences
Nov 1 1:00-2:00 PM CSIC1122 Zhenming Liu Statistically-secure ORAM with $\tilde{O}(\log^2 n)$ Overhead
Nov 8 1:00-2:00 PM CSIC1122 David Harris Partial Resampling in the Moser-Tardos Framework
Nov 15 1:00-2:00 PM CSIC1122 Mohammad Hossein Bateni Concise Bid Optimization Strategies with Multiple Budget Constraints
Nov 22 1:00-2:00 PM CSIC1122 William Gasarch Pretty good, though still Exponential, algorithms for 3-SAT and Min Ind Set

Summer 2013[edit]

Date Time Location Speaker Title
Aug 2 1:00-2:00 PM AVW4172 Hubert Chan Revisiting the Ranking Algorithm for Greedy Randomized Matching on Arbitrary Graphs

CATS Talks from previous semesters[edit]