talks & teaching
Talks are grouped by theme. Exact titles may have been different.
Selected Talks
Where do we go from here: Rebalancing an autonomous rideshare fleet
INFORMS Annual Meet 2019.
When hashing met matching: Efficient spatio-temporal search for ridesharing
Cornell University 2019, Ohio State University 2018, INFORMS Annual Meet 2018, INFORMS Revenue Management and Pricing Conference 2018.
Edge-Weighted online windowed matching
INFORMS Annual Meet 2017, Marketplace Innovation Workshop 2017.
On the complexity of information spreading in dynamic networks
Louisiana State University 2013, ACM-SIAM Symposium on Discrete Algorithms (SODA) 2013, IBM Research Watson 2012.
Split and join: Strong partitions and universal steiner trees for graphs
Boston University 2012, IEEE Symposium on Foundations of Computer Science (FOCS) 2012.
Lower bounds for noisy wireless networks using sampling algorithms
Tsinghua University 2009, Max Planck Institute for Informatics 2009, Carnegie Mellon University 2008, University of Texas at Austin 2008, IEEE Symposium on Foundations of Computer Science (FOCS) 2008.
A tight lower bound for parity in noisy communication networks
Toyota Technological Institute at Chicago 2008, University of Illinois at Urbana-Champaigne 2008, ACM-SIAM Symposium on Discrete Algorithms (SODA) 2008.
Tradeoffs in depth-two superconcentrators
Microsoft Research Bangalore 2007, Symposium on Theoretical Aspects of Computer Science 2006.
INFORMS Annual Meet 2019.
When hashing met matching: Efficient spatio-temporal search for ridesharing
Cornell University 2019, Ohio State University 2018, INFORMS Annual Meet 2018, INFORMS Revenue Management and Pricing Conference 2018.
Edge-Weighted online windowed matching
INFORMS Annual Meet 2017, Marketplace Innovation Workshop 2017.
On the complexity of information spreading in dynamic networks
Louisiana State University 2013, ACM-SIAM Symposium on Discrete Algorithms (SODA) 2013, IBM Research Watson 2012.
Split and join: Strong partitions and universal steiner trees for graphs
Boston University 2012, IEEE Symposium on Foundations of Computer Science (FOCS) 2012.
Lower bounds for noisy wireless networks using sampling algorithms
Tsinghua University 2009, Max Planck Institute for Informatics 2009, Carnegie Mellon University 2008, University of Texas at Austin 2008, IEEE Symposium on Foundations of Computer Science (FOCS) 2008.
A tight lower bound for parity in noisy communication networks
Toyota Technological Institute at Chicago 2008, University of Illinois at Urbana-Champaigne 2008, ACM-SIAM Symposium on Discrete Algorithms (SODA) 2008.
Tradeoffs in depth-two superconcentrators
Microsoft Research Bangalore 2007, Symposium on Theoretical Aspects of Computer Science 2006.
Teaching
Algorithms
Instructor, Graduate course, Northeastern University, 2012.
Algorithms and Data Structures
Instructor, Undergraduate course, Northeastern University, twice in 2011.
Algorithms and Randomization
Co-instructor, Advanced graduate course, Max Planck Institute for Informatics and Saarland University, 2010.
Data Structures and Algorithms
Co-instructor, Summer school, Indian Institute of Technology Kanpur, 2002.
Instructor, Graduate course, Northeastern University, 2012.
Algorithms and Data Structures
Instructor, Undergraduate course, Northeastern University, twice in 2011.
Algorithms and Randomization
Co-instructor, Advanced graduate course, Max Planck Institute for Informatics and Saarland University, 2010.
Data Structures and Algorithms
Co-instructor, Summer school, Indian Institute of Technology Kanpur, 2002.