Roberto De Prisco

Available identifiers

zbMath Open de-prisco.robertoDBLP43/5866WikidataQ111721869 ScholiaQ111721869MaRDI QIDQ392176

List of research outcomes

Publication	Date of Publication	Type
On reconfigurability of VLSI linear arrays	2023-01-18	Paper
Probabilistic secret sharing	2021-08-04	Paper
Secret sharing schemes for infinite sets of participants: a new design technique	2021-02-15	Paper
Performing tasks on synchronous restartable message-passing processors	2020-12-03	Paper
Routing selfish unsplittable traffic	2018-11-05	Paper
Time-optimal message-efficient work performance in the presence of faults	2017-09-29	Paper
https://portal.mardi4nfdi.de/entity/Q5271427	2017-07-11	Paper
https://portal.mardi4nfdi.de/entity/Q5271430	2017-07-11	Paper
Secure computation without computers	2017-03-16	Paper
Private Visual Share-Homomorphic Computation and Randomness Reduction in Visual Cryptography	2017-01-06	Paper
Secure Two-Party Computation: A Visual Way	2015-09-30	Paper
Measure-Independent Characterization of Contrast Optimal Visual Cryptography Schemes	2015-09-30	Paper
On k -set consensus problems in asynchronous systems	2015-09-11	Paper
Color visual cryptography schemes for black and white secret images	2014-01-13	Paper
Using Colors to Improve Visual Cryptography for Black and White Images	2011-05-19	Paper
On designing truthful mechanisms for online scheduling	2009-08-21	Paper
Colored visual cryptography without color darkening	2009-06-22	Paper
New Constructions of Mechanisms with Verification	2009-03-12	Paper
The power of verification for one-parameter agents	2009-03-02	Paper
Cheating Immune (2,n)-Threshold Visual Secret Sharing	2008-11-27	Paper
STACS 2004	2007-10-01	Paper
Security in Communication Networks	2006-10-10	Paper
Structural Information and Communication Complexity	2005-11-30	Paper
Automata, Languages and Programming	2005-08-24	Paper
Optimal colored threshold visual cryptography schemes	2005-08-17	Paper
On the Data Expansion of the Huffman Compression Algorithm	2000-03-19	Paper
On lower bounds for the redundancy of optimal codes	1999-06-27	Paper
A new bound for the data expansion of Huffman codes	1999-05-05	Paper
Testing and reconfiguration of VLSI linear arrays	1998-08-13	Paper
On the redundancy achieved by Huffman codes	1997-09-04	Paper
Catastrophic faults in reconfigurable systolic linear arrays	1997-08-10	Paper
Minimal path length of trees with known fringe	1997-02-28	Paper
Characteristic inequalities for binary trees	1997-02-28	Paper
A note on the expected path length of trees with known fringe	1997-02-27	Paper
New lower bounds on the cost of binary search trees	1997-02-27	Paper
New bounds on the expected length of one-to-one codes	1996-12-01	Paper
On binary search trees	1993-06-29	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Roberto De Prisco