Algorithms and Hardness for Multidimensional Range Updates and Queries

Algorithms and Hardness for Multidimensional Range Updates and Queries

Channel:
United States Simons Institute for the Theory of Computing
Subscribers:
68,700
Published on ● Video Link: https://www.youtube.com/watch?v=joB6IaqNqQc


Category:
Vlog
Duration: 38:38
428 views
13

12th Innovations in Theoretical Computer Science Conference (ITCS 2021)
http://itcs-conf.org/

Algorithms and Hardness for Multidimensional Range Updates and Queries

Joshua Lau
Angus Ritossa (UNSW Sydney)



Other Videos By Simons Institute for the Theory of Computing


2021-01-15A Polynomial Degree Bound on Equations for Non-rigid Matrices and Small Linear Circuits
2021-01-15The Strongish Planted Clique Hypothesis and Its Consequences
2021-01-15Pipeline Interventions
2021-01-15Pseudorandom Generators for Unbounded-Width Permutation Branching Programs
2021-01-15Sharp Threshold Rates for Random Codes
2021-01-15The Complexity of Finding Fair Independent Sets in Cycles
2021-01-15Algorithmic Persuasion with Evidence
2021-01-15Comparing computational entropies below majority (or: When is the dense model theorem false?)
2021-01-15The entropy of lies: playing twenty questions with a liar
2021-01-12Error Correcting Codes for Uncompressed Messages
2021-01-12Algorithms and Hardness for Multidimensional Range Updates and Queries
2021-01-12Algebraic and circuit complexity
2021-01-12Online and streaming algorithms
2021-01-12Algorithmic Game Theory
2021-01-12Optimization
2021-01-12Codes and information
2021-01-12Machine Learning
2021-01-11Circuits and communication
2021-01-10Graph algorithms
2021-01-10Algorithms
2021-01-10GRADUATING BITS


Tags:
Simons Institute
theoretical computer science
UC Berkeley
Computer Science
Theory of Computation
Theory of Computing