13 citations · 45 across the 12 of their papers we have counts for
13 papers
A Decremental Algorithm for Checking the Possibility of Braess Paradox in Dynamic Nets
Dario Fiorenza, Daniele Gorla, Ivano Salvo
Braess paradox originates when latency at Wardrop equilibrium in traffic networks decreases because of removing edges. The graph-theoretic property of networks suffering from the B…
An Incremental Algorithm for Checking the Possibility of Braess Paradox in Dynamic Nets
Dario Fiorenza, Daniele Gorla, Ivano Salvo
Braess paradox is a well-known phenomenon that originates when latency at Wardrop equilibrium in traffic networks decreases because of removing edges. The possibility of having the…
BaBE: Enhancing Fairness via Estimation of Latent Explaining Variables
Ruta Binkyte, Daniele Gorla, Catuscia Palamidessi
We consider the problem of unfair discrimination between two groups and propose a pre-processing method to achieve fairness. Corrective methods like statistical parity usually lead…
An implicit function theorem for the stream calculus
Michele Boreale, Luisa Collodi, Daniele Gorla
In the context of the stream calculus, we present an Implicit Function Theorem (IFT) for polynomial systems, and discuss its relations with the classical IFT from calculus. In part…
On the (Im)Possibility of Estimating Various Notions of Differential Privacy
Daniele Gorla, Louis Jalouzot, Federica Granese +2
We analyze to what extent final users can infer information about the level of protection of their data when the data obfuscation mechanism is a priori unknown to them (the so-call…
Algebra and coalgebra of stream products
Michele Boreale, Daniele Gorla
We study connections among polynomials, differential equations and streams over a field K, in terms of algebra and coalgebra. We first introduce the class of (F,G)-products on stre…
DOCTOR: A Simple Method for Detecting Misclassification Errors
Federica Granese, Marco Romanelli, Daniele Gorla +2
Deep neural networks (DNNs) have shown to perform very well on large scale object recognition problems and lead to widespread use for real-world applications, including situations…
Conflict vs Causality in Event Structures
Daniele Gorla, Ivano Salvo, Adolfo Piperno
Event structures are one of the best known models for concurrency. Many variants of the basic model and many possible notions of equivalence for them have been devised in the liter…
Approximate Model Counting, Sparse XOR Constraints and Minimum Distance
Michele Boreale, Daniele Gorla
The problem of counting the number of models of a given Boolean formula has numerous applications, including computing the leakage of deterministic programs in Quantitative Informa…
A Polynomial-time Algorithm for Detecting the Possibility of Braess Paradox in Directed Graphs
Pietro Cenciarelli, Daniele Gorla, Ivano Salvo
A directed multigraph is said vulnerable if it can generate Braess paradox in Traffic Networks. In this paper, we give a graph-theoretic characterisation of vulnerable directed mul…
Graph Theoretic Investigations on Inefficiencies in Network Models
Pietro Cenciarelli, Daniele Gorla, Ivano Salvo
We consider network models where information items flow %are sent from a source to a sink node. We start with a model where routing is constrained by energy available on nodes in f…
Proceedings 16th International Workshop on Expressiveness in Concurrency
Sibylle Fröschle, Daniele Gorla
This volume contains the proceedings of the 16th International Workshop on Expressiveness in Concurrency (EXPRESS'09), which took place on 5th September 2009 in Bologna, co-located…
Security Policies as Membranes in Systems for Global Computing
Daniele Gorla, Matthew Hennessy, Vladimiro Sassone
We propose a simple global computing framework, whose main concern is code migration. Systems are structured in sites, and each site is divided into two parts: a computing body, an…