|
Search the dblp DataBase
Carmine Ventre:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Vincenzo Auletta, Roberto De Prisco, Paolo Penna, Giuseppe Persiano, Carmine Ventre
New Constructions of Mechanisms with Verification. [Citation Graph (0, 0)][DBLP] ICALP (1), 2006, pp:596-607 [Conf]
- Paolo Penna, Carmine Ventre
Energy-efficient broadcasting in ad-hoc networks: combining MSTs with shortest-path trees. [Citation Graph (0, 0)][DBLP] PE-WASUN, 2004, pp:61-68 [Conf]
- Paolo Penna, Carmine Ventre
Sharing the Cost of Multicast Transmissions in Wireless Networks. [Citation Graph (0, 0)][DBLP] SIROCCO, 2004, pp:255-266 [Conf]
- Paolo Penna, Carmine Ventre
Free-Riders in Steiner Tree Cost-Sharing Games. [Citation Graph (0, 0)][DBLP] SIROCCO, 2005, pp:231-245 [Conf]
- Paolo Penna, Carmine Ventre
The Algorithmic Structure of Group Strategyproof Budget-Balanced Cost-Sharing Mechanisms. [Citation Graph (0, 0)][DBLP] STACS, 2006, pp:337-348 [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]
- Paolo Penna, Carmine Ventre
More Powerful and Simpler Cost-Sharing Methods. [Citation Graph (0, 0)][DBLP] WAOA, 2004, pp:97-110 [Conf]
- Carmine Ventre
Mechanisms with Verification for Any Finite Domain. [Citation Graph (0, 0)][DBLP] WINE, 2006, pp:37-49 [Conf]
Collusion-Resistant Mechanisms with Verification Yielding Optimal Solutions. [Citation Graph (, )][DBLP]
Combinatorial Auctions with Verification Are Tractable. [Citation Graph (, )][DBLP]
Completely Non-malleable Encryption Revisited. [Citation Graph (, )][DBLP]
Optimal collusion-resistant mechanisms with verification. [Citation Graph (, )][DBLP]
Ranking games that have competitiveness-based strategies. [Citation Graph (, )][DBLP]
Utilitarian Mechanism Design for Multi-Objective Optimization. [Citation Graph (, )][DBLP]
On Stackelberg Pricing with Computationally Bounded Consumers. [Citation Graph (, )][DBLP]
Alternatives to Truthfulness Are Hard to Recognize. [Citation Graph (, )][DBLP]
Co-sound Zero-Knowledge with Public Keys. [Citation Graph (, )][DBLP]
Search in 0.003secs, Finished in 0.005secs
|