4. Talks

  • Lynch-Welch Clock Synchronization Workshop on Robust Hardware Design, Saarbrücken, Germany, October 2019. (chalk talk)
  • Introduction to Active Learning Guest Lecture for Theory of Distributed Systems, Saarbrücken, Germany, October 2019. (slides)
  • With Great Speed Come Small Buffers, ACM Principles of Distributed Computing (PODC) 2019, Toronto, Canada. (slides)
  • On the Volume Complexity of LCLs, Workshop on Local Algorithms (WOLA) 2019, Zurich, Switzerland. (slides)
  • Space-Optimal Packet Routing on Trees, IEEE International Conference on Computer Communications (INFOCOM) 2019, Paris, France. (slides)
    • Best In-Session Presentation Award
  • On Sampling Edges Almost Uniformly, Symposium on Simplicity in Algorithms (SOSA) 2018, New Orleans, LA. (slides)
  • The Space Requirement of Local Forwarding on Acyclic Networks, PODC 2017, Washington DC. (conference slides, seminar slides)
  • Space-time Tradeoffs for Distributed Verification, PODC 2016, Chicago, IL. (slides)
  • Stable Matchings with Bounded Preferences, Joint Math Meetings 2016, Seattle, WA. (slides)
  • The Stable Marriage Problem, Los Angeles Math Circle (High School II), 2016. (handout 1, handout 2)
  • Fast Distributed Almost Stable Matchings, PODC 2015, San Sebastien, Spain. (slides)
  • It’s Not Easy Being Three: The Approximability of Three-Dimensional Stable Matching Problems MATCH-UP 2015, Glasgow, Scotland, UK. (slides)
  • A Stable Marriage Requires Communication. Mathematics Department Colloquium, Reed College, Spring 2015.
  • Fast Distributed Almost Stable Matchings, PODC 2015, San Sebastien, Spain. (slides)
  • Fault Tolerance in Networks of Bounded Degree. Computer Science Seminar (Cryptographic Protocols), UCLA, Winter 2015. (notes)
  • Introduction to Communication Complexity. Participating Logic Seminar, UCLA, Spring 2014. (notes)
  • The Communication Complexity of Finding a Stable Marriage Advancement to Candidacy Talk, UCLA, March, 2014. (slides)
  • Estimating the Second Frequency Moment. Participating Probability Seminar, UCLA, Fall 2012. (notes)
  • Azuma’s Inequality and Concentration of Measure. Participating Probability Seminar, UCLA, Spring 2012. (notes)
  • Sumsets and Rusza Calculus. Participating Combinatorics Seminar, UCLA, Fall 2011. (notes)
  • Anisotropic Coarsening in the Dilute Limit. (with Melinda Gildner and Ben Vollmayr-Lee) American Physical Society March Meeting, 2009.
  • Anisotropic Coarsening: 2 Models in 3 Dimensions. Bucknell University/Reed College, August/September 2008.

Will Rosenbaum

Saarbrücken, Germany

comments powered by Disqus