Theory

CATS-Fall-2015

Revision as of 11:22, 29 January 2016 by Karthikabinav (talk | contribs) (Created page with " ==Fall 2015 == {| class="wikitable" style="text-align: center;" border="1" |- ! width="70pt" | Date !! width="110pt" | Time !! width="70pt" | Location !! width="150pt" | Spea...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Fall 2015

Date Time Location Speaker Title
Aug 3 11:00 AM-12:00 PM CSIC 1121 Joel Spencer Finding Needles in Exponential Haystacks
Sept 11 1:00-2:00 PM CSIC3118 Manish Purohit Approximation Algorithms for Connected Maximum Cut and Related Problems
Sept 25 1:00-2:00 PM CSIC3118 Karthik A Sankararaman Lassere Hierarchy
Oct 2 1:00-2:00 PM CSIC3118 Pan Xu Lassere Hierarchy
Oct 9 1:00-2:00 PM CSIC3118 Hossein Esfandiari Online Allocation with Traffic Spikes: Mixing Adversarial and Stochastic Models
Oct 30 1:00-2:00 PM CSIC3118 Manish Purohit Two Faces of Algorithm Design: Optimization and Learning
Nov 6 1:00-2:00 PM CSIC3118 Khoa Trinh An Improved Approximation Algorithm for Knapsack Median
Nov 13 1:00-2:00 PM CSIC3118 Soheil Ehsani Online Degree-Bounded Steiner Network Design
Nov 20 1:00-2:00 PM AVW 4424 Saeed Seddighin The power of stochastic modeling, beating theoretically proven lower bounds of optimization problems
Dec 4 1:00-2:00 PM CSIC3118 Sina Dehghani Pricing the Cloud
Dec 11 1:00-2:00 PM CSIC3118 Charalampos Tsourakakis Scalable Large Near-Clique Detection in Large-Scale Networks

Web Accessibility

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