AAAAAA

   
Results: 1-13 |
Results: 13
PLACING RESOURCES ON A GROWING LINE
Authors: AULETTA V PARENTE D PERSIANO G
Citation: V. Auletta et al., PLACING RESOURCES ON A GROWING LINE, Journal of algorithms, 26(1), 1998, pp. 87-100
FOCUS ON SECURITY IN INFORMATION NETWORKS
Authors: DESANTIS A PERSIANO G
Citation: A. Desantis et G. Persiano, FOCUS ON SECURITY IN INFORMATION NETWORKS, European transactions on telecommunications, 8(5), 1997, pp. 443-443
THE POWER OF PREPROCESSING IN ZERO-KNOWLEDGE PROOFS OF KNOWLEDGE
Authors: DESANTIS A PERSIANO G
Citation: A. Desantis et G. Persiano, THE POWER OF PREPROCESSING IN ZERO-KNOWLEDGE PROOFS OF KNOWLEDGE, Journal of cryptology, 9(3), 1996, pp. 129-148
DYNAMIC AND STATIC ALGORITHMS FOR OPTIMAL PLACEMENT OF RESOURCES IN ATREE
Authors: AULETTA V PARENTE D PERSIANO G
Citation: V. Auletta et al., DYNAMIC AND STATIC ALGORITHMS FOR OPTIMAL PLACEMENT OF RESOURCES IN ATREE, Theoretical computer science, 165(2), 1996, pp. 441-461
A NOTE ON THE EXPECTED PATH-LENGTH OF TREES WITH KNOWN FRINGE
Authors: DEPRISCO R PARLATI G PERSIANO G
Citation: R. Deprisco et al., A NOTE ON THE EXPECTED PATH-LENGTH OF TREES WITH KNOWN FRINGE, Information processing letters, 59(6), 1996, pp. 309-315
ZERO-KNOWLEDGE ARGUMENTS AND PUBLIC-KEY CRYPTOGRAPHY
Authors: DESANTIS A DICRESCENZO G PERSIANO G
Citation: A. Desantis et al., ZERO-KNOWLEDGE ARGUMENTS AND PUBLIC-KEY CRYPTOGRAPHY, Information and computation, 121(1), 1995, pp. 23-40
MINIMAL PATH-LENGTH OF TREES WITH KNOWN FRINGE
Authors: DEPRISCO R PARLATI G PERSIANO G
Citation: R. Deprisco et al., MINIMAL PATH-LENGTH OF TREES WITH KNOWN FRINGE, Theoretical computer science, 143(1), 1995, pp. 175-188
CHARACTERISTIC INEQUALITIES FOR BINARY BEES
Authors: DEPRISCO R PERSIANO G
Citation: R. Deprisco et G. Persiano, CHARACTERISTIC INEQUALITIES FOR BINARY BEES, Information processing letters, 53(4), 1995, pp. 201-207
THE KNOWLEDGE COMPLEXITY OF QUADRATIC RESIDUOSITY LANGUAGES
Authors: DESANTIS A DICRESCENZO G PERSIANO G
Citation: A. Desantis et al., THE KNOWLEDGE COMPLEXITY OF QUADRATIC RESIDUOSITY LANGUAGES, Theoretical computer science, 132(1-2), 1994, pp. 291-317
TIGHT UPPER AND LOWER BOUNDS ON THE PATH-LENGTH OF BINARY-TREES
Authors: DESANTIS A PERSIANO G
Citation: A. Desantis et G. Persiano, TIGHT UPPER AND LOWER BOUNDS ON THE PATH-LENGTH OF BINARY-TREES, SIAM journal on computing, 23(1), 1994, pp. 12-23
BRANCH-AND-BOUND AND BACKTRACK SEARCH ON MESH-CONNECTED ARRAYS OF PROCESSORS
Authors: KAKLAMANIS C PERSIANO G
Citation: C. Kaklamanis et G. Persiano, BRANCH-AND-BOUND AND BACKTRACK SEARCH ON MESH-CONNECTED ARRAYS OF PROCESSORS, Mathematical systems theory, 27(5), 1994, pp. 471-489
ROUND-OPTIMAL PERFECT ZERO-KNOWLEDGE PROOFS
Authors: DICRESCENZO G PERSIANO G
Citation: G. Dicrescenzo et G. Persiano, ROUND-OPTIMAL PERFECT ZERO-KNOWLEDGE PROOFS, Information processing letters, 50(2), 1994, pp. 93-99
BINARY PREFIX CODES ENDING IN A 1
Authors: CAPOCELLI RM DESANTIS A PERSIANO G
Citation: Rm. Capocelli et al., BINARY PREFIX CODES ENDING IN A 1, IEEE transactions on information theory, 40(4), 1994, pp. 1296-1302
Risultati: 1-13 |