Decentralisation in the blockchain space

Contains fulltext : 233930.pdf (Publisher’s version ) (Open Access)25 november 202

Decentralisation: a multidisciplinary perspective

Contains fulltext : 236508.pdf (Publisher’s version ) (Open Access

A Local Computation Approximation Scheme to Maximum Matching

We present a polylogarithmic local computation matching algorithm which guarantees a (1-\eps)-approximation to the maximum matching in graphs of bounded degree.Comment: Appears in Approx 201

On the Security Cost of Using a Free and Open Source Component in a Proprietary Product

The work presented in this paper is motivated by the need to estimate the security effort of consuming Free and Open Source Software (FOSS) components within a proprietary software supply chain of a large European software vendor. To this extent we have identified three different cost models: centralized (the company checks each component and propagates changes to the different product groups), distributed (each product group is in charge of evaluating and fixing its consumed FOSS components), and hybrid (only the least used components are checked individually by each development team). We investigated publicly available factors (\eg, development activity such as commits, code size, or fraction of code size in different programming languages) to identify which one has the major impact on the security effort of using a FOSS component in a larger software product