297 citations · 323 across the 8 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2014
Multi-Party Set Reconciliation Using Characteristic Polynomials
Anudhyan Boral, Michael Mitzenmacher
In the standard set reconciliation problem, there are two parties and , each respectively holding a set of elements and . The goal is for both parties to obta…
cs.DS2013★ 4 cited
Fast branching algorithm for Cluster Vertex Deletion
Anudhyan Boral, Marek Cygan, Tomasz Kociumaka +1
In the family of clustering problems, we are given a set of objects (vertices of the graph), together with some observed pairwise similarities (edges). The goal is to identify clus…