|
Search the dblp DataBase
Roberto De Prisco:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Vincenzo Auletta, Roberto De Prisco, Paolo Penna, Giuseppe Persiano
The Power of Verification for One-Parameter Agents. [Citation Graph (0, 0)][DBLP] ICALP, 2004, pp:171-182 [Conf]
- 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]
- Anja Feldmann, Nils Kammenhuber, Olaf Maennel, Bruce M. Maggs, Roberto De Prisco, Ravi Sundaram
A methodology for estimating interdomain web traffic demand. [Citation Graph (0, 0)][DBLP] Internet Measurement Conference, 2004, pp:322-335 [Conf]
- Jeffrey Pang, James Hendricks, Aditya Akella, Roberto De Prisco, Bruce M. Maggs, Srinivasan Seshan
Availability, usage, and deployment characteristics of the domain name system. [Citation Graph (0, 0)][DBLP] Internet Measurement Conference, 2004, pp:1-14 [Conf]
- Carlo Blundo, Stelvio Cimato, Roberto De Prisco
Certified Email: Design and Implementation of a New Optimistic Protocol.. [Citation Graph (0, 0)][DBLP] ISCC, 2003, pp:828-833 [Conf]
- Roberto De Prisco, Alan Fekete, Nancy A. Lynch, Alexander A. Shvartsman
A Dynamic View-Oriented Group Communication Service. [Citation Graph (0, 0)][DBLP] PODC, 1998, pp:227-236 [Conf]
- Roberto De Prisco, Dahlia Malkhi, Michael K. Reiter
On k-Set Consensus Problems in Asynchronous Systems. [Citation Graph (0, 0)][DBLP] PODC, 1999, pp:257-265 [Conf]
- Roberto De Prisco, Alain J. Mayer, Moti Yung
Time-Optimal Message-Efficient Work Performance in the Presence of Faults (Extended Summary). [Citation Graph (0, 0)][DBLP] PODC, 1994, pp:161-172 [Conf]
- Carlo Blundo, Stelvio Cimato, Roberto De Prisco
A Lightweight Approach to Authenticated Web Caching. [Citation Graph (0, 0)][DBLP] SAINT, 2005, pp:157-163 [Conf]
- Stelvio Cimato, Roberto De Prisco, Alfredo De Santis
Colored Visual Cryptography Without Color Darkening. [Citation Graph (0, 0)][DBLP] SCN, 2004, pp:235-248 [Conf]
- Roberto De Prisco, Alfredo De Santis
Cheating Immune (2, n)-Threshold Visual Secret Sharing. [Citation Graph (0, 0)][DBLP] SCN, 2006, pp:216-228 [Conf]
- Vincenzo Auletta, Roberto De Prisco, Paolo Penna, Giuseppe Persiano
On Designing Truthful Mechanisms for Online Scheduling. [Citation Graph (0, 0)][DBLP] SIROCCO, 2005, pp:3-17 [Conf]
- Vincenzo Auletta, Roberto De Prisco, Paolo Penna, Pino Persiano
How to route and tax selfish unsplittable traffic. [Citation Graph (0, 0)][DBLP] SPAA, 2004, pp:196-205 [Conf]
- Vincenzo Auletta, Roberto De Prisco, Paolo Penna, Giuseppe Persiano
Deterministic Truthful Approximation Mechanisms for Scheduling Related Machines. [Citation Graph (0, 0)][DBLP] STACS, 2004, pp:608-619 [Conf]
- Roberto De Prisco, Angelo Monti
On Reconfigurability of VLSI Linear Arrays. [Citation Graph (0, 0)][DBLP] WADS, 1993, pp:553-564 [Conf]
- Bogdan S. Chlebus, Roberto De Prisco, Alexander A. Shvartsman
Performing Tasks on Restartable Message-Passing Processors. [Citation Graph (0, 0)][DBLP] WDAG, 1997, pp:96-110 [Conf]
- Roberto De Prisco, Alan Fekete, Nancy A. Lynch, Alexander A. Shvartsman
A Dynamic Primary Configuration Group Communication Service. [Citation Graph (0, 0)][DBLP] DISC, 1999, pp:64-78 [Conf]
- Roberto De Prisco, Butler W. Lampson, Nancy A. Lynch
Revisiting the Paxos Algorithm. [Citation Graph (0, 0)][DBLP] WDAG, 1997, pp:111-125 [Conf]
- Stelvio Cimato, Roberto De Prisco, Alfredo De Santis
Probabilistic Visual Cryptography Schemes. [Citation Graph (0, 0)][DBLP] Comput. J., 2006, v:49, n:1, pp:97-107 [Journal]
- Roberto De Prisco, Alfredo De Santis
On the Data Expansion of the Huffman Compression Algorithm. [Citation Graph (0, 0)][DBLP] Comput. J., 1998, v:41, n:3, pp:137-144 [Journal]
- Roberto De Prisco, Sergio Rajsbaum
Algorithmic problems in distributed systems. [Citation Graph (0, 0)][DBLP] Computer Networks, 2006, v:50, n:10, pp:1581-1582 [Journal]
- Roberto De Prisco, Alfredo De Santis
Catastrophic Faults in Reconfigurable Systolic Linear Arrays. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1997, v:75, n:2, pp:105-123 [Journal]
- Bogdan S. Chlebus, Roberto De Prisco, Alexander A. Shvartsman
Performing tasks on synchronous restartable message-passing processors. [Citation Graph (0, 0)][DBLP] Distributed Computing, 2001, v:14, n:1, pp:49-64 [Journal]
- Stelvio Cimato, Roberto De Prisco, Alfredo De Santis
Optimal Colored Threshold Visual Cryptography Schemes. [Citation Graph (0, 0)][DBLP] Des. Codes Cryptography, 2005, v:35, n:3, pp:311-335 [Journal]
- Roberto De Prisco, Alfredo De Santis
On Lower Bounds for the Redundancy of Optimal Codes. [Citation Graph (0, 0)][DBLP] Des. Codes Cryptography, 1998, v:15, n:1, pp:29-45 [Journal]
- Carlo Blundo, Stelvio Cimato, Roberto De Prisco, Anna Lisa Ferrara
Modeling A Certified Email Protocol using I/O Automata. [Citation Graph (0, 0)][DBLP] Electr. Notes Theor. Comput. Sci., 2004, v:99, n:, pp:339-359 [Journal]
- Roberto De Prisco, Giuseppe Persiano
Characteristic Inequalities for Binary Trees. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1995, v:53, n:4, pp:201-207 [Journal]
- Roberto De Prisco, Giuseppe Parlati, Giuseppe Persiano
A Note on the Expected Path Length of Trees with Known Fringe. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1996, v:59, n:6, pp:309-315 [Journal]
- Roberto De Prisco, Alfredo De Santis
On Binary Search Trees. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1993, v:45, n:5, pp:249-253 [Journal]
- Roberto De Prisco, Alfredo De Santis
On the Redundancy Achieved by Huffman Codes. [Citation Graph (0, 0)][DBLP] Inf. Sci., 1996, v:88, n:1-4, pp:131-148 [Journal]
- Roberto De Prisco, Butler W. Lampson, Nancy A. Lynch
Revisiting the PAXOS algorithm. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2000, v:243, n:1-2, pp:35-91 [Journal]
- Roberto De Prisco, Angelo Monti, Linda Pagli
Testing and Reconfiguration of VLSI Linear Arrays. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1998, v:197, n:1-2, pp:171-188 [Journal]
- Roberto De Prisco, Giuseppe Parlati, Giuseppe Persiano
Minimal Path Length of Trees with Known Fringe. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1995, v:143, n:1, pp:175-188 [Journal]
- Roberto De Prisco, Alfredo De Santis
New Lower Bounds on the Cost of Binary Search Trees. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1996, v:156, n:1&2, pp:315-325 [Journal]
- Stelvio Cimato, Roberto De Prisco, Alfredo De Santis
Colored visual cryptography without color darkening. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2007, v:374, n:1-3, pp:261-276 [Journal]
- Carlo Blundo, Roberto De Prisco
New bounds on the expected length of one-to-one codes. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1996, v:42, n:1, pp:246-250 [Journal]
- Roberto De Prisco, Alfredo De Santis
A new bound for the data expansion of Huffman codes. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1997, v:43, n:6, pp:2028-2032 [Journal]
- Roberto De Prisco, Dahlia Malkhi, Michael K. Reiter
On k-Set Consensus Problems in Asynchronous Systems. [Citation Graph (0, 0)][DBLP] IEEE Trans. Parallel Distrib. Syst., 2001, v:12, n:1, pp:7-21 [Journal]
Do You Trust Your Phone? [Citation Graph (, )][DBLP]
An Evolutionary Music Composer Algorithm for Bass Harmonization. [Citation Graph (, )][DBLP]
A Neural Network for Bass Functional Harmonization. [Citation Graph (, )][DBLP]
EvoBassComposer: a multi-objective genetic algorithm for 4-voice compositions. [Citation Graph (, )][DBLP]
Search in 0.013secs, Finished in 0.016secs
|