Sfoglia per Autore
Placing resources in a tree: Dynamic and static algorithmsAutomata, Languages and Programming
1995-01-01 Auletta, Vincenzo; Parente, Domenico; Persiano, Giuseppe
Dynamic and Static Algorithms for Optimal Placement of Resources in Trees
1996-01-01 Auletta, Vincenzo; Parente, Domenico; Persiano, Giuseppe
A new approach to optimal planning of robot motion on a tree with obstaclesAlgorithms — ESA '96
1996-01-01 Auletta, Vincenzo; Parente, Domenico; Persiano, Giuseppe
A linear time algorithm for the feasibility of pebble motion on treesAlgorithm Theory
1996-01-01 Auletta, Vincenzo; Angelo, Monti; Parente, Domenico; Persiano, Giuseppe
Placing Resources on a Growing Line
1998-01-01 Auletta, Vincenzo; Parente, Domenico; Persiano, Giuseppe
Placing Resource on a Growing Line
1998-01-01 Auletta, Vincenzo; Parente, Domenico; Persiano, Giuseppe
Constrained bipartite edge coloring with applications to wavelength routing
1999-01-01 Persiano, Giuseppe; Erlebach, T; Jansen, K; Kaklamanis, C.
Randomness recycling in constant-round private computations.
1999-01-01 Persiano, Giuseppe; Blundo, Carlo; Galdi, C.
Edge coloring of bipartite graphs with constraints.
1999-01-01 Persiano, Giuseppe; Caragiannis, I; Kaklamanis, C.
Non-Interactive Zero-Knowledge: A Low-Randomness Characterization of NP
1999-01-01 DE SANTIS, Alfredo; DI CRESCENZO, G.; Persiano, Giuseppe; Yung, M.
The graph clustering problem has a perfect zero-knowledge interactive proof.
1999-01-01 DE SANTIS, Alfredo; DI CRESCENZO, G; Goldereich, O; Persiano, Giuseppe
The Randomness Complexity of Private Computation
1999-01-01 Blundo, Carlo; DE SANTIS, Alfredo; Persiano, Giuseppe; Vaccaro, Ugo
A Linear Time Algorithm for the Feasibility of Pebble Motion on Trees
1999-01-01 Auletta, Vincenzo; Angelo, Monti; Parente, Domenico; Persiano, Giuseppe
Symmetric communication in all-optical tree networks
2000-01-01 Persiano, Giuseppe; Caragiannis, I; Kaklamanis, C.
Efficient automatic simulation of parallel computation on networks of workstations.
2000-01-01 Persiano, Giuseppe; Kaklamanis, C; Krizanc, D; Montangero, M.
User privacy issues regarding certificates and the TLS protocol
2000-01-01 Persiano, Giuseppe; Visconti, Ivan
Necessary and Sufficient Assumptions for Non-Interactive Zero-Knowledge proofs of Knowledge for all NP relations
2000-01-01 DE SANTIS, Alfredo; DI CRESCENZO, G.; Persiano, Giuseppe
Randomized path coloring in binary trees.
2000-01-01 Persiano, Giuseppe; Auletta, Vincenzo; Caragiannis, I; Kaklamanis, C.
Un Sistema a Garanzia dell’Anonimato su Internet
2001-01-01 Blundo, Carlo; Cattaneo, Giuseppe; D'Agostino, A.; DE SANTIS, Alfredo; DEL VACCHIO, S.; Maiorano, G.; Orabona, I.; Persiano, G.
Approximate constrained bipartite edge coloring.
2001-01-01 Persiano, Giuseppe; Caragiannis, I; Ferreira, A; Kaklamanis, C; Perennes, S; Rivano, H.
Titolo | Data di pubblicazione | Autore(i) | File |
---|---|---|---|
Placing resources in a tree: Dynamic and static algorithmsAutomata, Languages and Programming | 1-gen-1995 | Auletta, Vincenzo; Parente, Domenico; Persiano, Giuseppe | |
Dynamic and Static Algorithms for Optimal Placement of Resources in Trees | 1-gen-1996 | Auletta, Vincenzo; Parente, Domenico; Persiano, Giuseppe | |
A new approach to optimal planning of robot motion on a tree with obstaclesAlgorithms — ESA '96 | 1-gen-1996 | Auletta, Vincenzo; Parente, Domenico; Persiano, Giuseppe | |
A linear time algorithm for the feasibility of pebble motion on treesAlgorithm Theory | 1-gen-1996 | Auletta, Vincenzo; Angelo, Monti; Parente, Domenico; Persiano, Giuseppe | |
Placing Resources on a Growing Line | 1-gen-1998 | Auletta, Vincenzo; Parente, Domenico; Persiano, Giuseppe | |
Placing Resource on a Growing Line | 1-gen-1998 | Auletta, Vincenzo; Parente, Domenico; Persiano, Giuseppe | |
Constrained bipartite edge coloring with applications to wavelength routing | 1-gen-1999 | Persiano, Giuseppe; Erlebach, T; Jansen, K; Kaklamanis, C. | |
Randomness recycling in constant-round private computations. | 1-gen-1999 | Persiano, Giuseppe; Blundo, Carlo; Galdi, C. | |
Edge coloring of bipartite graphs with constraints. | 1-gen-1999 | Persiano, Giuseppe; Caragiannis, I; Kaklamanis, C. | |
Non-Interactive Zero-Knowledge: A Low-Randomness Characterization of NP | 1-gen-1999 | DE SANTIS, Alfredo; DI CRESCENZO, G.; Persiano, Giuseppe; Yung, M. | |
The graph clustering problem has a perfect zero-knowledge interactive proof. | 1-gen-1999 | DE SANTIS, Alfredo; DI CRESCENZO, G; Goldereich, O; Persiano, Giuseppe | |
The Randomness Complexity of Private Computation | 1-gen-1999 | Blundo, Carlo; DE SANTIS, Alfredo; Persiano, Giuseppe; Vaccaro, Ugo | |
A Linear Time Algorithm for the Feasibility of Pebble Motion on Trees | 1-gen-1999 | Auletta, Vincenzo; Angelo, Monti; Parente, Domenico; Persiano, Giuseppe | |
Symmetric communication in all-optical tree networks | 1-gen-2000 | Persiano, Giuseppe; Caragiannis, I; Kaklamanis, C. | |
Efficient automatic simulation of parallel computation on networks of workstations. | 1-gen-2000 | Persiano, Giuseppe; Kaklamanis, C; Krizanc, D; Montangero, M. | |
User privacy issues regarding certificates and the TLS protocol | 1-gen-2000 | Persiano, Giuseppe; Visconti, Ivan | |
Necessary and Sufficient Assumptions for Non-Interactive Zero-Knowledge proofs of Knowledge for all NP relations | 1-gen-2000 | DE SANTIS, Alfredo; DI CRESCENZO, G.; Persiano, Giuseppe | |
Randomized path coloring in binary trees. | 1-gen-2000 | Persiano, Giuseppe; Auletta, Vincenzo; Caragiannis, I; Kaklamanis, C. | |
Un Sistema a Garanzia dell’Anonimato su Internet | 1-gen-2001 | Blundo, Carlo; Cattaneo, Giuseppe; D'Agostino, A.; DE SANTIS, Alfredo; DEL VACCHIO, S.; Maiorano, G.; Orabona, I.; Persiano, G. | |
Approximate constrained bipartite edge coloring. | 1-gen-2001 | Persiano, Giuseppe; Caragiannis, I; Ferreira, A; Kaklamanis, C; Perennes, S; Rivano, H. |
Legenda icone
- file ad accesso aperto
- file disponibili sulla rete interna
- file disponibili agli utenti autorizzati
- file disponibili solo agli amministratori
- file sotto embargo
- nessun file disponibile