Before revision:  The proposed analysis technique also shows that the expected depth is {\cal O}( \ln n ), which partially solves a recent conjecture by\emph{ [  Hemmer et al. that is used in the CGAL implementation of the TSD [ .
After revision:  The proposed analysis technique also shows that the expected depth is {\cal O}( \ln n ), which partially solves a recent conjecture by\emph{ [ Hemmer et al. that is used in the CGAL implementation of the TSD . It also shows that history-based RIC circumvents a lower bound on runtime tail estimates of conflict-graph RICs[ .