default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlessandro Ferrante
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2010
[c9]Alessandro Ferrante, Maurizio Memoli, Margherita Napoli
, Mimmo Parente, Francesco Sorrentino:
A NuSMV Extension for Graded-CTL Model Checking. CAV 2010: 670-673
2000 – 2009
- 2009
- [j6]Alessandro Ferrante, Margherita Napoli, Mimmo Parente:
Model Checking for Graded CTL. Fundam. Informaticae 96(3): 323-339 (2009) - [j5]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) - [c8]Alessandro Ferrante, Margherita Napoli, Mimmo Parente:
Graded-CTL: Satisfiability and Symbolic Model Checking. ICFEM 2009: 306-325 - 2008
- [j4]Alessandro Ferrante, Aniello Murano, Mimmo Parente:
Enriched µ-Calculi Module Checking. Log. Methods Comput. Sci. 4(3) (2008) - [j3]Alessandro Ferrante, Mimmo Parente:
Mixed Nash equilibria in selfish routing problems with dynamic constraints. Theor. Comput. Sci. 393(1-3): 37-53 (2008) - [j2]Alessandro Ferrante, Gopal Pandurangan, Kihong Park:
On the hardness of optimization in power-law graphs. Theor. Comput. Sci. 393(1-3): 220-230 (2008) - [c7]Alessandro Ferrante, Margherita Napoli, Mimmo Parente:
CTLModel-Checking with Graded Quantifiers. ATVA 2008: 18-32 - [i1]Alessandro Ferrante, Aniello Murano, Mimmo Parente:
Enriched MU-Calculi Module Checking. CoRR abs/0805.3462 (2008) - 2007
- [c6]Alessandro Ferrante, Gopal Pandurangan, Kihong Park:
On the Hardness of Optimization in Power Law Graphs. COCOON 2007: 417-427 - [c5]Alessandro Ferrante, Aniello Murano:
Enriched µ-Calculi Module Checking. FoSSaCS 2007: 183-197 - [c4]Alessandro Ferrante, Aniello Murano, Mimmo Parente:
Enriched µ-Calculus Pushdown Module Checking. LPAR 2007: 438-453 - 2006
- [b1]Alessandro Ferrante:
Hardness and approximation algorithms of some graph problems. University of Salerno, Italy, 2006 - 2005
- [c3]Alessandro Ferrante, Gennaro Parlato, Francesco Sorrentino, Carmine Ventre:
Improvements for Truthful Mechanisms with Verifiable One-Parameter Selfish Agents. WAOA 2005: 147-160 - 2004
- [j1]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) - [c2]Alessandro Ferrante, Mimmo Parente:
Existence of Nash Equilibria in Selfish Routing Problems. SIROCCO 2004: 149-160 - 2003
- [c1]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
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-07 01:07 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
