Communications of the ACM
Latest Research
From Communications of the ACM
Technical Perspective: Isolating a Matching When Your Coins Go Missing
Whether there exists a deterministic parallel algorithm for bipartite matching remains an outstanding question at the frontiers of our understanding of the role...
From Communications of the ACM
A Deterministic Parallel Algorithm for Bipartite Perfect Matching
In this article, we give an almost complete derandomization of the Isolation Lemma for perfect matchings in bipartite graphs.
From Communications of the ACM
Technical Perspective: Borrowing Big Code to Automate Programming Activities
"Predicting Program Properties from 'Big Code'" presents new techniques for leveraging big code to automate two programming activities: selecting understandable...
From Communications of the ACM