This paper studies the nucleus decomposition problem, which has been shown to be useful in finding dense substructures graphs. We present a novel parallel algorithm that is efficient both theory and practice. Our achieves work complexity matching best sequential while also having low depth (parallel running time), significantly improves upon only existing (Sariyüce et al. , PVLDB 2018). The key...