Alessandro Ferrante

According to our database, Alessandro Ferrante authored at least 16 papers between 2003 and 2010.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2010

A NuSMV Extension for Graded-CTL Model Checking.

Alessandro Ferrante, Maurizio Memoli, Margherita Napoli, Mimmo Parente, Francesco Sorrentino

Proceedings of the Computer Aided Verification, 22nd International Conference, 2010

2009

Fast payment schemes for truthful mechanisms with verification.

Alessandro Ferrante, Gennaro Parlato, Francesco Sorrentino, Carmine Ventre

Theor. Comput. Sci., 2009

Model Checking for Graded CTL.

Alessandro Ferrante, Margherita Napoli, Mimmo Parente

Fundam. Informaticae, 2009

Graded-CTL: Satisfiability and Symbolic Model Checking.

Alessandro Ferrante, Margherita Napoli, Mimmo Parente

Proceedings of the Formal Methods and Software Engineering, 2009

2008

On the hardness of optimization in power-law graphs.

Alessandro Ferrante, Gopal Pandurangan, Kihong Park

Theor. Comput. Sci., 2008

Mixed Nash equilibria in selfish routing problems with dynamic constraints.

Alessandro Ferrante, Mimmo Parente

Theor. Comput. Sci., 2008

Enriched µ-Calculi Module Checking.

Alessandro Ferrante, Aniello Murano, Mimmo Parente

Log. Methods Comput. Sci., 2008

Enriched MU-Calculi Module Checking

Alessandro Ferrante, Aniello Murano, Mimmo Parente

CoRR, 2008

CTLModel-Checking with Graded Quantifiers.

Alessandro Ferrante, Margherita Napoli, Mimmo Parente

Proceedings of the Automated Technology for Verification and Analysis, 2008

2007

Enriched µ-Calculus Pushdown Module Checking.

Alessandro Ferrante, Aniello Murano, Mimmo Parente

Proceedings of the Logic for Programming, 2007

Enriched µ-Calculi Module Checking.

Alessandro Ferrante, Aniello Murano

Proceedings of the Foundations of Software Science and Computational Structures, 2007

2006

Hardness and approximation algorithms of some graph problems.

Alessandro Ferrante

PhD thesis, 2006

2005

Improvements for Truthful Mechanisms with Verifiable One-Parameter Selfish Agents.

Alessandro Ferrante, Gennaro Parlato, Francesco Sorrentino, Carmine Ventre

Proceedings of the Approximation and Online Algorithms, Third International Workshop, 2005

2004

On The Vertex-Connectivity Problem For Graphs With Sharpened Triangle Inequality.

Alessandro Ferrante, Mimmo Parente

Int. J. Found. Comput. Sci., 2004

Existence of Nash Equilibria in Selfish Routing Problems.

Alessandro Ferrante, Mimmo Parente

Proceedings of the Structural Information and Communication Complexity, 2004

2003

An Approximation Algorithm for the Minimum Weight Vertex-Connectivity Problem in Complete Graphs with Sharpened Triangle Inequality.

Alessandro Ferrante, Mimmo Parente

Proceedings of the Theoretical Computer Science, 8th Italian Conference, 2003