• "Concentration Inequalities." IFOR Seminar. ETH Zurich. October 2016.
  • "Hardness and approximation for Network Flow Interdiction." Swiss OR Days. Università della Svizzera Italiana. September 2016. slides
  • "Approximation algorithms for interdiction problems." OR 2016. Helmut-Schmidt University. August 2016. slides
  • "Finding heavy hitters by chaining with few random bits." Chaining Methods and their Applications to Computer Science. Harvard University. June 2016. slides. video
  • "Beating CountSketch for heavy hitters." Symposium on the Theory of Computing. Cambridge, MA. June 2016. slides
  • "L2 heavy hitters in optimal space and time." Theory Reading Group. EPFL. June 2016. notes
  • "Beating CountSketch for heavy hitters." Mittagsseminar. ETH Zurich. June 2016. slides
  • "Beating CountSketch for heavy hitters." Foundations of Computer Science Seminar. Weizmann Institute. May 2016. slides
  • "Streaming sums and symmetric norms." NICT Inference Workshop. Institut Henri Poincaré. March 2016. slides. video
  • "Streaming symmetric norms via measure concentration." NICT Central Workshop. Institut Henri Poincaré. February 2016. slides. video
  • "The space complexity of streaming sums". Sublinear Algorithms Workshop. Johns Hopkins University. January 2016. slides
  • "Universal sketches for the frequency negative moments". RANDOM. Princeton University. August 2015. slides
  • "b-stable set interdiction on bipartite graphs". International Symposium on Mathematical Programming. Pittsburgh, PA. July 2015. slides
  • "Stable and b-stable set interdiction on bipartite graphs". Swiss OR Days. IBM Research Ruschlikon. May 2015. slides
  • "Streaming space complexity of nearly all functions of one variable". Mittagsseminar. ETH Zurich. April 2015. slides
  • "Sampling bipartite graphs". IFOR Seminar. ETH Zurich. January 2014. slides
  • "Sampling bipartite graphs". CUSO Spring Seminar. Zinal, Switzerland. January 2014. slides