Fully Dynamic Connectivity in $O(\log n(\log\log n)^2)$ Amortized Expected Time

Documenti analoghi

• PCF Learned Sort: a Learning Augmented Sort Algorithm with $O(n \log\log n)$ Expected Complexity
  di: Sato, Atsuki, et al.
  Pubblicazione: (2024)
• Finding a solution to the Erdős-Ginzburg-Ziv theorem in $O(n\log\log\log n)$ time
  di: Leung, Yui Hin Arvin
  Pubblicazione: (2025)
• Fully dynamic biconnectivity in $\tilde{\mathcal{O}}(\log^2 n)$ time
  di: Holm, Jacob, et al.
  Pubblicazione: (2025)
• Color Distance Oracles and Snippets: Separation Between Exact and Approximate Solutions
  di: Horowicz, Noam, et al.
  Pubblicazione: (2025)
• Fully Dynamic Min-Cut of Superconstant Size in Subpolynomial Time
  di: Jin, Wenyu, et al.
  Pubblicazione: (2024)