166 citations · 191 across the 7 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
cs.DS2020
A polynomial time parallel algorithm for graph isomorphism using a quasipolynomial number of processors
Duc Hung Pham, Krishna V. Palem, M. V. Panduranga Rao
The Graph Isomorphism (GI) problem is a theoretically interesting problem because it has not been proven to be in P nor to be NP-complete. Babai made a breakthrough in 2015 when an…
eess.SP2020
The Assurance Monitor Pattern
Adam Duracz, K. Mani Chandy, Mohamed Abdelrahman +5
Some applications require an assurance that certain criteria are violated with only low probability. An alert is generated when the current course of action is likely to violate as…