23 citations · 23 across the 3 of their papers we have counts for
3 papers
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…
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…
Doing Moore with Less -- Leapfrogging Moore's Law with Inexactness for Supercomputing
Sven Leyffer, Stefan M. Wild, Mike Fagan +4
Energy and power consumption are major limitations to continued scaling of computing systems. Inexactness, where the quality of the solution can be traded for energy savings, has b…