TechTalks.Tv beta

Session 9A

• 
  Dynamic Approximate All-Pairs Shortest Paths: Breaking the $ \tilde O(mn) $ Barrier and Derandomization Authors: Monika Henzinger, Sebastian Krinninger and Danupon Nanongkai
  • Share video
    • Twitter
    • Facebook
  • Watch Video
  • Later
• 
  Fully Dynamic $(1+\epsilon)$-Approximate Matchings Authors: Manoj Gupta, and Richard Peng
  • Share video
    • Twitter
    • Facebook
  • Watch Video
  • Later
• 
  Online Node-weighted Steiner Forest and Extensions via Disk Paintings Authors: Mohammad Taghi Hajiaghayi, Vahid Liaghat and Debmalya Panigrahi
  • Share video
    • Twitter
    • Facebook
  • Watch Video
  • Later
• 
  An LMP O(log n)-Approximation Algorithm for Node Weighted Prize Collecting Steiner Tree Authors: Jochen Koenemann, Sina Sadeghian and Laura Sanità
  • Share video
    • Twitter
    • Facebook
  • Watch Video
  • Later

Session 9B

• 
  Arithmetic circuits: A chasm at depth three Authors: Ankit Gupta, Pritish Kamath, Neeraj Kayal and Ramprasad Saptharishi
  • Share video
    • Twitter
    • Facebook
  • Watch Video
  • Later
• 
  Improved Average-Case Lower Bounds for DeMorgan Formula Size Authors: Ilan Komargodski, Ran Raz and Avishay Tal
  • Share video
    • Twitter
    • Facebook
  • Watch Video
  • Later
• 
  Average Case Lower Bounds for Monotone Switching Networks Authors: Yuval Filmus, Toniann Pitassi, Robert Robere and Stephen A. Cook
  • Share video
    • Twitter
    • Facebook
  • Watch Video
  • Later
• 
  Explicit Subspace Designs Authors: Venkatesan Guruswami and Swastik Kopparty
  • Share video
    • Twitter
    • Facebook
  • Watch Video
  • Later

Session 10A

• 
  Understanding Incentives: Mechanism Design becomes Algorithm Design Authors: Yang Cai, Constantinos Daskalakis and S. Matthew Weinberg
  • Share video
    • Twitter
    • Facebook
  • Watch Video
  • Later
• 
  The Simple Economics of Approximately Optimal Auctions Authors: Saeed Alaei, Hu Fu, Nima Haghpanah and Jason Hartline
  • Share video
    • Twitter
    • Facebook
  • Watch Video
  • Later
• 
  The Price of Stability for Undirected Broadcast Network Design with Fair Cost Allocation is Constant Authors: Vittorio Bilò, Michele Flammini and Luca Moscardelli
  • Share video
    • Twitter
    • Facebook
  • Watch Video
  • Later
• 
  Rational Protocol Design: Cryptography Against Incentive-driven Adversaries Authors: Juan Garay , Jonathan Katz, Ueli Maurer, Bjoern Tackmann and Vassilis Zikas
  • Share video
    • Twitter
    • Facebook
  • Watch Video
  • Later