The following pages link to Alessandro Ferrante (Q1006064):
Displaying 13 items.
- Fast payment schemes for truthful mechanisms with verification (Q1006066) (← links)
- Mixed Nash equilibria in selfish routing problems with dynamic constraints (Q2481950) (← links)
- On the hardness of optimization in power-law graphs (Q2481967) (← links)
- Model Checking for Graded CTL (Q3400570) (← links)
- Enriched μ–Calculus Pushdown Module Checking (Q3498485) (← links)
- Enriched MU-Calculi Module Checking (Q3535606) (← links)
- CTL Model-Checking with Graded Quantifiers (Q3540061) (← links)
- On the Hardness of Optimization in Power Law Graphs (Q3608866) (← links)
- ON THE VERTEX-CONNECTIVITY PROBLEM FOR GRAPHS WITH SHARPENED TRIANGLE INEQUALITY (Q4667918) (← links)
- Structural Information and Communication Complexity (Q5315222) (← links)
- Enriched μ-Calculi Module Checking (Q5758045) (← links)
- Theoretical Computer Science (Q5897356) (← links)
- Approximation and Online Algorithms (Q5898470) (← links)