| 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 |
An Improved Distributed Algorithm for Maximal Independent Set
|
| May 6 |
2:00-3:00 PM |
AVW 4424 |
Karthik Abinav Sankararaman |
Randomized Dependent Rounding of Linear Programs
|
