PaperOptimal doubly logarithmic parallel algorithms based on finding all nearest smaller valuesOmer Berkman, Baruch Schieber, et al.Journal of Algorithms
PaperSolving NP-hard problems in 'almost trees': Vertex coverDon Coppersmith, Uzi VishkinDiscrete Applied Mathematics
