This paper studies the nucleus decomposition problem, which has been shown to be useful in finding dense substructures graphs. We present a novel parallel algorithm that is efficient both theory and practice. Our achieves work complexity matching best sequential while also having low depth (parallel running time), significantly improves upon only existing (Sariyüce et al. , PVLDB 2018). The key...

We introduce what –if some kind of group action exists– is a truly (information-theoretically) safe cryptographic communication system: a protocol which provides zero information to any passive adversary having full access to the channel. 1. The false algorithm, simple version Assume Alice wants to share a secret s, which we assume for simplicity is a non-zero rational number s = p/q ∈ Q⋆. For ...

A topological classification scheme consists of two ingredients: (1) an abstract class X of topological spaces; and (2) a "taxonomy", i.e. a list of first order sentences, together with a way of assigning an abstract class of spaces to each sentence of the list so that logically equivalent sentences are assigned the same class. X, is then endowed with an equivalence relation, two spaces belongi...

Purpose – The purpose of this paper is to present a theoretically based analysis and evaluation of the Norwegian quality assurance scheme (QA1 and QA2) for major public projects (MPPs), drawing on a number of different perspectives from organization theory and decision-making theory, but also from insight from two major public reform waves – new public management (NPM) and post-NPM. The purpose...