2009 |
12 | EE | Alessandro Ferrante,
Gennaro Parlato,
Francesco Sorrentino,
Carmine Ventre:
Fast payment schemes for truthful mechanisms with verification.
Theor. Comput. Sci. 410(8-10): 886-899 (2009) |
2008 |
11 | EE | Alessandro Ferrante,
Margherita Napoli,
Mimmo Parente:
CTLModel-Checking with Graded Quantifiers.
ATVA 2008: 18-32 |
10 | EE | Alessandro Ferrante,
Aniello Murano,
Mimmo Parente:
Enriched MU-Calculi Module Checking
CoRR abs/0805.3462: (2008) |
9 | EE | Alessandro Ferrante,
Gopal Pandurangan,
Kihong Park:
On the hardness of optimization in power-law graphs.
Theor. Comput. Sci. 393(1-3): 220-230 (2008) |
8 | EE | Alessandro Ferrante,
Mimmo Parente:
Mixed Nash equilibria in selfish routing problems with dynamic constraints.
Theor. Comput. Sci. 393(1-3): 37-53 (2008) |
2007 |
7 | EE | Alessandro Ferrante,
Gopal Pandurangan,
Kihong Park:
On the Hardness of Optimization in Power Law Graphs.
COCOON 2007: 417-427 |
6 | EE | Alessandro Ferrante,
Aniello Murano:
Enriched µ-Calculi Module Checking.
FoSSaCS 2007: 183-197 |
5 | EE | Alessandro Ferrante,
Aniello Murano,
Mimmo Parente:
Enriched µ-Calculus Pushdown Module Checking.
LPAR 2007: 438-453 |
2005 |
4 | EE | Alessandro Ferrante,
Gennaro Parlato,
Francesco Sorrentino,
Carmine Ventre:
Improvements for Truthful Mechanisms with Verifiable One-Parameter Selfish Agents.
WAOA 2005: 147-160 |
2004 |
3 | EE | Alessandro Ferrante,
Mimmo Parente:
Existence of Nash Equilibria in Selfish Routing Problems.
SIROCCO 2004: 149-160 |
2 | EE | Alessandro Ferrante,
Mimmo Parente:
On The Vertex-Connectivity Problem For Graphs With Sharpened Triangle Inequality.
Int. J. Found. Comput. Sci. 15(5): 701-715 (2004) |
2003 |
1 | EE | Alessandro Ferrante,
Mimmo Parente:
An Approximation Algorithm for the Minimum Weight Vertex-Connectivity Problem in Complete Graphs with Sharpened Triangle Inequality.
ICTCS 2003: 137-149 |