A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is
ACM 2015] to produce a noninteractive probabilistically checkable proof of correctness, and (ii) the execution of the algorithm when preparing the proof tolerates a controllable number of adversarial errors ... We engineer an open-source GPU implementation of a distributed algorithm design of Björklund and Kaski [PODC 2016] where (i) the execution of the algorithm can be delegated [Goldwasser, Kalai, and Rothblum ... In this paper we seek to engineer a practical implementation of the Björklund-Kaski design for delegatable and error-tolerant counting of six-vertex subgraphs. ...doi:10.1137/1.9781611975055.16 dblp:conf/alenex/Kaski18 fatcat:hlfxvpbb2zdmrlf4venyyhipim
On the basis of the introduced policy derivation patterns (evaluation, control and refinement patterns) and intra-layer associations the policy derivation process is conducted automated by means of a modeling ... A comprehensive model of the managed and the management system is created. Both systems are modeled on three abstraction layers ("Use Cases", "Services", "Components"). ... In fact, they imply a subgraph with nodes and edges of special types which builds an excerpt from a system model. ...doi:10.17877/de290r-20239 fatcat:mvh746sbbzhrphc26gccqw2axi