Since the 1970s, algorithms have been able to test graph isomorphism, but in exponential time. This means that the increasing ...

Yuanzhao Zhang, an SFI Complexity Postdoctoral Fellow ... Zhang and his collaborators describe a novel algorithm that can infer the structure of a hypergraph using only the observed dynamics. Their ...

Puneet Gupta's research highlights the immense potential of greedy algorithms in addressing timing closure challenges.