Alessandro Ferrante

17 papers A* 1B 5C 1Misc 1Journal 7Unranked 1
YearRankTypeTitle / Venue / Authors
2010 A* conf
A NuSMV Extension for Graded-CTL Model Checking.
CAV
Alessandro Ferrante, Maurizio Memoli, Margherita Napoli, Mimmo Parente, Francesco Sorrentino
2009 J jnl
Fast payment schemes for truthful mechanisms with verification.
Theor. Comput. Sci.
Alessandro Ferrante, Gennaro Parlato, Francesco Sorrentino, Carmine Ventre
2009 C conf
Graded-CTL: Satisfiability and Symbolic Model Checking.
ICFEM
Alessandro Ferrante, Margherita Napoli, Mimmo Parente
2009 J jnl
Model Checking for Graded CTL.
Fundam. Informaticae
Alessandro Ferrante, Margherita Napoli, Mimmo Parente
2008 B conf
CTLModel-Checking with Graded Quantifiers.
ATVA
Alessandro Ferrante, Margherita Napoli, Mimmo Parente
2008 J jnl
Enriched MU-Calculi Module Checking
CoRR
Alessandro Ferrante, Aniello Murano, Mimmo Parente
2008 J jnl
Enriched µ-Calculi Module Checking.
Log. Methods Comput. Sci.
Alessandro Ferrante, Aniello Murano, Mimmo Parente
2008 J jnl
Mixed Nash equilibria in selfish routing problems with dynamic constraints.
Theor. Comput. Sci.
Alessandro Ferrante, Mimmo Parente
2008 J jnl
On the hardness of optimization in power-law graphs.
Theor. Comput. Sci.
Alessandro Ferrante, Gopal Pandurangan, Kihong Park
2007 B conf
Enriched µ-Calculi Module Checking.
FoSSaCS
Alessandro Ferrante, Aniello Murano
2007 B conf
Enriched µ-Calculus Pushdown Module Checking.
LPAR
Alessandro Ferrante, Aniello Murano, Mimmo Parente
2007 Misc conf
On the Hardness of Optimization in Power Law Graphs.
COCOON
Alessandro Ferrante, Gopal Pandurangan, Kihong Park
2006 — —
Hardness and approximation algorithms of some graph problems.
Alessandro Ferrante
2005 B conf
Improvements for Truthful Mechanisms with Verifiable One-Parameter Selfish Agents.
WAOA
Alessandro Ferrante, Gennaro Parlato, Francesco Sorrentino, Carmine Ventre
2004 B conf
Existence of Nash Equilibria in Selfish Routing Problems.
SIROCCO
Alessandro Ferrante, Mimmo Parente
2004 J jnl
On The Vertex-Connectivity Problem For Graphs With Sharpened Triangle Inequality.
Int. J. Found. Comput. Sci.
Alessandro Ferrante, Mimmo Parente
2003 — conf
An Approximation Algorithm for the Minimum Weight Vertex-Connectivity Problem in Complete Graphs with Sharpened Triangle Inequality.
ICTCS
Alessandro Ferrante, Mimmo Parente