More Like this

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

   https://doi.org/10.46298/theoretics.23.6  

   Huang, Shang-En ; Huang, Dawei ; Kopelowitz, Tsvi ; Pettie, Seth ; Thorup, Mikkel ( May 2023 , TheoretiCS)

   Dynamic connectivity is one of the most fundamental problems in dynamic graphalgorithms. We present a randomized Las Vegas dynamic connectivity datastructure with $O(\log n(\log\log n)^2)$ amortized expected update time and$O(\log n/\log\log\log n)$ worst case query time, which comes very close to thecell probe lower bounds of Patrascu and Demaine (2006) and Patrascu and Thorup(2011). 

   more » « less
2. Fully Dynamic Connectivity in O (log n (log log n ) 2 ) Amortized Expected Time

   https://doi.org/10.1137/1.9781611974782.32  

   Huang, Shang-En ; Huang, Dawei ; Kopelowitz, Tsvi ; Pettie, Seth ( January 2017 , SODA 2017)
3. Distributed MIS in O(log log n) Awake Complexity

   https://doi.org/10.1145/3583668.3594574  

   Dufoulon, Fabien ; Moses, William K. ; Pandurangan, Gopal ( June 2023 , PODC '23: Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing)
4. Random matrices with log-range correlations, and log-Sobolev inequalities

   https://doi.org/10.5802/ambp.396  

   Kemp, Todd ; Zimmermann, David ( January 2020 , Annales Mathématiques Blaise Pascal)
5. Log BPS Numbers of Log Calabi-Yau Surfaces

   https://doi.org/10.1090/tran/8234  

   Choi, J ; van Garrel, M ; Katz, S ; and Takahashi, N ( November 2020 , Transactions of the American Mathematical Society)

   null (Ed.)