The following pages link to Roberto De Prisco (Q392176):
Displaying 23 items.
- Color visual cryptography schemes for black and white secret images (Q392177) (← links)
- Secure computation without computers (Q517015) (← links)
- Minimal path length of trees with known fringe (Q673649) (← links)
- Characteristic inequalities for binary trees (Q674183) (← links)
- On designing truthful mechanisms for online scheduling (Q838147) (← links)
- (Q1004285) (redirect page) (← links)
- The power of verification for one-parameter agents (Q1004286) (← links)
- Colored visual cryptography without color darkening (Q1022609) (← links)
- Testing and reconfiguration of VLSI linear arrays (Q1128669) (← links)
- On lower bounds for the redundancy of optimal codes (Q1273505) (← links)
- A note on the expected path length of trees with known fringe (Q1350914) (← links)
- New lower bounds on the cost of binary search trees (Q1351808) (← links)
- Catastrophic faults in reconfigurable systolic linear arrays (Q1363642) (← links)
- On the redundancy achieved by Huffman codes (Q1364502) (← links)
- Secret sharing schemes for infinite sets of participants: a new design technique (Q2227498) (← links)
- On binary search trees (Q2366072) (← links)
- Optimal colored threshold visual cryptography schemes (Q2486869) (← links)
- On <i>k</i> -set consensus problems in asynchronous systems (Q2942769) (← links)
- Secure Two-Party Computation: A Visual Way (Q2948250) (← links)
- Measure-Independent Characterization of Contrast Optimal Visual Cryptography Schemes (Q2948251) (← links)
- Private Visual Share-Homomorphic Computation and Randomness Reduction in Visual Cryptography (Q2953811) (← links)
- Using Colors to Improve Visual Cryptography for Black and White Images (Q3002114) (← links)
- Probabilistic secret sharing (Q5005168) (← links)
