Graph algorithms
6Comparison Graphs: a Unified Method for Uniformity Testing
Uri Meir (Tel Aviv University)
Is the space complexity of planted clique recovery the same as that of detection?
Jay Mardia (Stanford University)
An O(n) time algorithm for finding Hamilton cycles with high probability
Rajko Nenadov, Angelika Steger (ETH Zürich), Pascal Su (ETH Zürich)
Even the Easiest(?) Graph Coloring Problem is not Easy in Streaming!
Anup Bhattacharya (Indian Statistical Institute, Kolkata, India), Arijit Bishnu (Indian Statistical
Institute, Kolkata, India), Gopinath Mishra (Indian Statistical Institute, Kolkata, India), Anannya Upasana (Indian Statistical Institute, Kolkata, India)
Erasure-Resilient Sublinear-Time Graph Algorithms
Amit Levi (University of Waterloo), Ramesh Krishnan S. Pallavoor (Boston University), Sofya Raskhodnikova (Boston University), Nithin Varma (University of Haifa)
ITCS 2021
Other Videos By Simons Institute for the Theory of Computing
| 2021-01-15 | The entropy of lies: playing twenty questions with a liar |
| 2021-01-12 | Error Correcting Codes for Uncompressed Messages |
| 2021-01-12 | Algorithms and Hardness for Multidimensional Range Updates and Queries |
| 2021-01-12 | Algebraic and circuit complexity |
| 2021-01-12 | Online and streaming algorithms |
| 2021-01-12 | Algorithmic Game Theory |
| 2021-01-12 | Optimization |
| 2021-01-12 | Codes and information |
| 2021-01-12 | Machine Learning |
| 2021-01-11 | Circuits and communication |
| 2021-01-10 | Graph algorithms |
| 2021-01-10 | Algorithms |
| 2021-01-10 | GRADUATING BITS |
| 2021-01-10 | Algorithmic game theory |
| 2021-01-10 | Quantum information |
| 2021-01-10 | Quantum |
| 2021-01-09 | Analytic methods |
| 2021-01-09 | Computational complexity |
| 2021-01-08 | Distributed models |
| 2021-01-08 | Pseudorandomness |
| 2021-01-08 | Crypto and Privacy |