( en | de | ru )

 

Disambiguation of "Persiano, Pino"

Author of the publication

copydeleteadd this publication to your clipboard
Randomness Recycling in Constant-Round Private Computations (extended Abstract).

, , and . DISC, volume 1693 of Lecture Notes in Computer Science, page 138-150. Springer, (1999)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Luca Pino

Pino D'Amico

Andreas Pinosa

Amabelia Silvia Pino Machado

Rudolf Pinoli

 

Other publications of authors with the same name

How to route and tax selfish unsplittable traffic., , , and . SPAA, page 196-205. ACM, (2004)Edge Coloring of Bipartite Graphs with Constraints., , and . MFCS, volume 1672 of Lecture Notes in Computer Science, page 376-386. Springer, (1999)Bandwidth Allocation Algorithms on Tree-Shaped All-Optical Networks with Wavelength Converters., , , and . SIROCCO, page 24-39. Carleton Scientific, (1997)Optimal Pebble Motion on a Tree., and . Inf. Comput., 165 (1): 42-68 (2001)A secure and private system for subscription-based remote services., and . ACM Trans. Inf. Syst. Secur., 6 (4): 472-500 (2003)Efficient Automatic Simulation of Parallel Computation on Network of Workstations., , , and . ICALP Satellite Workshops, page 191-202. Carleton Scientific, Waterloo, Ontario, Canada, (2000)An Anonymous Credential System and a Privacy-Aware PKI., and . ACISP, volume 2727 of Lecture Notes in Computer Science, page 27-38. Springer, (2003)Private Computation with Shared Randomness over Broadcast Channel., and . ICISC, volume 2288 of Lecture Notes in Computer Science, page 244-257. Springer, (2001)Sparse and limited wavelength conversion in all-optical tree networks., , , , and . Theor. Comput. Sci., 266 (1-2): 887-934 (2001)Optimal and Approximate Station Placement in Networks (With Applications to Multicasting and Space Efficient Traversals)., , , and . STACS, volume 2010 of Lecture Notes in Computer Science, page 271-282. Springer, (2001)