Before revision:  In STOC'18, Assadi et al. presented a distributed algorithm for maintaining an MIS with O(1) ( amortized) round complexity and O(m^{3/4\left(\log^2 n}\right) \left(\right)  ]  Assadi et al. is deterministic;
After revision:  In STOC'18, Assadi et al. presented a distributed algorithm for maintaining an MIS with O(1) ( amortized) round complexity and O(m^{3/4\left(\log^2 n}\right) \left(\right) amortized rounds in the Congest model. Notably, the amortized message complexity of our algorithm matches the amortized update time of the best-known deterministic centralized MIS algorithm by Gupta and Khan ] Assadi et al. is deterministic;