An O(n) time algorithm for finding Hamilton cycles with high probability

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


Duration: 23:31
290 views
4

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

An O(n) time algorithm for finding Hamilton cycles with high probability

Rajko Nenadov
Angelika Steger (ETH Zürich)
Pascal Su (ETH Zürich)



Other Videos By Simons Institute for the Theory of Computing


2021-01-15Quantitative Correlation Inequalities via Semigroup Interpolation
2021-01-15Differentially Oblivious Turing Machines
2021-01-15Unknown I.I.D. Prophets: Better Bounds, Streaming Algorithms, and a New Impossibility
2021-01-15Online Paging with a Vanishing Regret
2021-01-15Towards local testability for quantum coding
2021-01-15Complete Problems for Multi-Pseudodeterministic Computations
2021-01-15A New Connection Between Node and Edge Depth Robust Graphs
2021-01-15Training (Overparametrized) Neural Networks in Near-Linear Time
2021-01-15Communication memento: Memoryless communication complexity
2021-01-15Relative Lipschitzness in Extragradient Methods and a Direct Recipe for Acceleration
2021-01-15An O(n) time algorithm for finding Hamilton cycles with high probability
2021-01-15Computational Complexity of the Hylland-Zeckhauser Scheme for One-Sided Matching Markets
2021-01-15Sensitivity Analysis of the Maximum Matching Problem
2021-01-15On Distributed Differential Privacy and Counting Distinct Elements
2021-01-15A Generalized Matching Reconfiguration Problem
2021-01-15Agnostic learning with unknown utilities
2021-01-15Quantum versus Randomized Communication Complexity, with Efficient Players
2021-01-15No quantum speedup over gradient descent for non-smooth convex optimization
2021-01-15Sequential Defaulting in Financial Networks
2021-01-15Non-quasi-linear Agents in Quasi-linear Mechanisms
2021-01-15Online Search With a Hint