PaperAnother look at the degree constrained subgraph problemYossi ShiloachInformation Processing Letters
PaperOptimal doubly logarithmic parallel algorithms based on finding all nearest smaller valuesOmer Berkman, Baruch Schieber, et al.Journal of Algorithms
PaperFinding all nearest neighbors for convex polygons in parallel: A new lower bound technique and a matching algorithmBaruch Schieber, Uzi VishkinDiscrete Applied Mathematics
PaperTowards a First Vertical Prototyping of an Extremely Fine-Grained Parallel Programming ApproachDorit Naishlos, Joseph Nuzman, et al.Theory of Computing Systems
