Seminars
Seminars 2009-2012
The seminar is run everyweek (on Tuesdays), for one hour at 256 Coates Hall at 1:30 PM.| Date | Speaker | Topic |
| March 27, 2012 | Konstantin Busch | Universal Steiner Trees in Graphs |
| March 20, 2012 | Manish Patil | Range Searching on Uncertain Data |
| March 13, 2012 | Rahul Shah | On counting and encoding tree structures |
| Feb 28, 2012 | Sharma Thankachan | Document Listing for Queries With Excluded Pattern |
| Feb 14, 2012 | Cheng Sheng | New Results on Two-dimensional Orthogonal Range Aggregation in External Memory |
| Feb 07, 2012 | Xuanting Cai | Exact and Approximate Pattern Matching In The Streaming Model |
| Jan 31, 2012 | Sharma Thankachan | Top-k Document Retrieval in Optimal Time and Linear Space |
| Nov 21, Nov 28, 2011 | Gokarna Sharma | approximation algorithms for balanced graph partitioning |
| Oct 24, Oct 31, Nov 14, 2011 | Sudip Biswas | Cache oblivious algorithms |
| Oct 10, 2011 | Sharma Thankachan | Compressed Text Indexing With Wildcards, Compressed Indexes for Aligned Pattern Matching |
| Oct 5, 2011 | Prof. Rajgopal Kannan | Analysis of Bottleneck Congestion and Jamming Games in Networks |
| Sep 26, 2011 | Manish Patil | Property matching and weighted matching |
| Sep 19, 2011 | Gokarna Sharma | Distributed Transactional Memory for General Networks |
| Sep 12, 2011 | Sharma Thankachan | Towards an Optimal Space-and-Query-Time Index for Top-k Document Retrieval |
| Apr 11, 2011 | Prof. Rajgopal Kannan | The (tight) Price of Anarchy of Super-Polynomial games is Super-Logarithmic |
| Mar 21, 2011 | Sharma Thankachan | Compressed Property Suffix Trees |
| Feb 21, 2011 | Sudip Biswas & Emran Chowdhury | All-pairs Approximate Shortest Paths |
| Feb 15, 2011 | Prof. Rahul Shah | Speeding up dynamic programing for tree problems |
| Nov 16, 2010 | Srivathsan Srinivas | Oblivious Buy-at-Bulk in Planar Graphs |
| Nov 3, 2010 | Prof.Rahul Shah | Parameterized Pattern Matching: Are succinct data structures possible? |
| Oct 27, 2010 | Manish Patil | A Truly Dynamic Data Structure for Top-k Queries on Uncertain Data |
| Oct 6, 2010 | Tsung-Han Ku (National Tsing Hua University, Taiwan) | Faster Compressed Dictionary Matching |
| Sep 22, 2010 | Gokarna Sharma | A Competitive Analysis for Balanced Transactional Memory Workloads |
| Sep 15, 2010 | Prof. Rajgopal Kannan | Optimal Price of Anarchy for Bottleneck Routing Game- Continuation |
| Sep 08, 2010 | Prof. Rajgopal Kannan | Optimal Price of Anarchy for Bottleneck Routing Game |
| June 15, 2010 | Prof. Rahul Jain | QIP = PSPACE |
| April 28, 2010 | Prof. Rahul Shah | Phylogeny Construction and Metric Embeddings |
| April 14, 2010 | Prof. Rahul Shah | Compression, Indexing and Retrieval for Massive Strings Data |
| April 12, 2010 | Prof. Costas Busch | Algorithms and Games for Networks and Multiprocessors |
| March 24, 2010 | Prof. Rajgopal Kannan | Price of Anarchy of Bottleneck Routing Games |
| March 3, 2010 | Gokarna Sharma | Window-Based Greedy Contention Management for Transactional Memory |
| Feb 24, 2010 | Sharma V. Thankachan | String Retrieval for Multi-pattern Queries |
| Feb 17, 2010 | Sharma V. Thankachan | Set Intersection Problem |
| Feb 03, 2010 | Manish Patil | Adaptive thresholding algorithm for online prefetching and caching on parallel disks |
| Nov 11, 2009 | Prof. Rajgopal Kannan | Some game theory problems in communications |
| Nov 04, 2009 | Manish Patil | Top-k queries on Uncertain Data |
| Oct 28, 2009 | Prof. Rahul Shah | Framework for dynamizing succinct data structures with applications to XML indexing |
| Oct 21, 2009 | Prof. Costas Busch | Sparse Covers and its applications |
| Oct 14, 2009 | Srivathsan Srinivas | GIST: Group Independent Spanning Tree |
| Oct 07, 2009 | Prof. Rahul Shah | Top-k String retrieval |
| Sep 23, 2009 | Prof. Rajgopal Kannan | Online algorithms for Jamming and Analysis of Congestion Games |
| Sep 16, 2009 | Srivathsan Srinivas | Universal Steiner Tree for Data Aggregation in Low Doubling Graphs |
| Sep 09, 2009 | Sharma V. Thankachan | Compressed data structures for dictionary matching problem |
Seminars
from previous semesters can be viewed here