Search the dblp DataBase
Alessandro Ferrante :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Alessandro Ferrante , Mimmo Parente An Approximation Algorithm for the Minimum Weight Vertex-Connectivity Problem in Complete Graphs with Sharpened Triangle Inequality. [Citation Graph (0, 0)][DBLP ] ICTCS, 2003, pp:137-149 [Conf ] Alessandro Ferrante , Mimmo Parente Existence of Nash Equilibria in Selfish Routing Problems. [Citation Graph (0, 0)][DBLP ] SIROCCO, 2004, pp:149-160 [Conf ] Alessandro Ferrante , Gennaro Parlato , Francesco Sorrentino , Carmine Ventre Improvements for Truthful Mechanisms with Verifiable One-Parameter Selfish Agents. [Citation Graph (0, 0)][DBLP ] WAOA, 2005, pp:147-160 [Conf ] Alessandro Ferrante , Mimmo Parente On The Vertex-Connectivity Problem For Graphs With Sharpened Triangle Inequality. [Citation Graph (0, 0)][DBLP ] Int. J. Found. Comput. Sci., 2004, v:15, n:5, pp:701-715 [Journal ] Alessandro Ferrante , Gopal Pandurangan , Kihong Park On the Hardness of Optimization in Power Law Graphs. [Citation Graph (0, 0)][DBLP ] COCOON, 2007, pp:417-427 [Conf ] Alessandro Ferrante , Aniello Murano Enriched µ-Calculi Module Checking. [Citation Graph (0, 0)][DBLP ] FoSSaCS, 2007, pp:183-197 [Conf ] Alessandro Ferrante , Aniello Murano , Mimmo Parente Enriched µ-Calculus Pushdown Module Checking. [Citation Graph (0, 0)][DBLP ] LPAR, 2007, pp:438-453 [Conf ] CTLModel-Checking with Graded Quantifiers. [Citation Graph (, )][DBLP ] A NuSMV Extension for Graded-CTL Model Checking. [Citation Graph (, )][DBLP ] Graded-CTL: Satisfiability and Symbolic Model Checking. [Citation Graph (, )][DBLP ] Enriched MU-Calculi Module Checking [Citation Graph (, )][DBLP ] Search in 0.004secs, Finished in 0.005secs