An Ω( (log n / log log n)^2 ) Cell-Probe Lower Bound for Dynamic Boolean Data StructuresPublished in FOCS 2026 (to appear), 2026Download paper hereAn Ω((log n / log log n)^2) cell-probe lower bound for dynamic boolean data structures (FOCS 2026).Share on Twitter Facebook LinkedIn Previous Next