The SCEAS System
| |||||||

## Search the dblp DataBase
Pino Persiano:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Pino Persiano, Ivan Visconti
**An Anonymous Credential System and a Privacy-Aware PKI.**[Citation Graph (0, 0)][DBLP] ACISP, 2003, pp:27-38 [Conf] - Vincenzo Auletta, Ioannis Caragiannis, Christos Kaklamanis, Pino Persiano
**Randomized path coloring on binary trees.**[Citation Graph (0, 0)][DBLP] APPROX, 2000, pp:60-71 [Conf] - Pino Persiano, Ivan Visconti
**User privacy issues regarding certificates and the TLS protocol: the design and implementation of the SPSL protocol.**[Citation Graph (0, 0)][DBLP] ACM Conference on Computer and Communications Security, 2000, pp:53-62 [Conf] - Christos Kaklamanis, Danny Krizanc, Manuela Montangero, Pino Persiano
**Efficient Automatic Simulation of Parallel Computation on Network of Workstations.**[Citation Graph (0, 0)][DBLP] ICALP Satellite Workshops, 2000, pp:191-202 [Conf] - Christos Kaklamanis, Pino Persiano, Thomas Erlebach, Klaus Jansen
**Constrained Bipartite Edge Coloring with Applications to Wavelength Routing.**[Citation Graph (0, 0)][DBLP] ICALP, 1997, pp:493-504 [Conf] - Clemente Galdi, Pino Persiano
**Private Computation with Shared Randomness over Broadcast Channel.**[Citation Graph (0, 0)][DBLP] ICISC, 2001, pp:244-257 [Conf] - Vincenzo Auletta, Ioannis Caragiannis, Christos Kaklamanis, Pino Persiano
**On the Complexity of Wavelength Converters.**[Citation Graph (0, 0)][DBLP] MFCS, 1998, pp:771-779 [Conf] - Ioannis Caragiannis, Christos Kaklamanis, Pino Persiano
**Edge Coloring of Bipartite Graphs with Constraints.**[Citation Graph (0, 0)][DBLP] MFCS, 1999, pp:376-386 [Conf] - Vincenzo Auletta, Ioannis Caragiannis, Christos Kaklamanis, Pino Persiano
**Bandwidth Allocation Algorithms on Tree-Shaped All-Optical Networks with Wavelength Converters.**[Citation Graph (0, 0)][DBLP] SIROCCO, 1997, pp:24-39 [Conf] - Ioannis Caragiannis, Christos Kaklamanis, Pino Persiano
**Wavelength Routing of Symmetric Communication Requests in Directed Fiber Trees.**[Citation Graph (0, 0)][DBLP] SIROCCO, 1998, pp:10-19 [Conf] - Vincenzo Auletta, Roberto De Prisco, Paolo Penna, Pino Persiano
**How to route and tax selfish unsplittable traffic.**[Citation Graph (0, 0)][DBLP] SPAA, 2004, pp:196-205 [Conf] - Clemente Galdi, Christos Kaklamanis, Manuela Montangero, Pino Persiano
**Optimal and Approximate Station Placement in Networks (With Applications to Multicasting and Space Efficient Traversals).**[Citation Graph (0, 0)][DBLP] STACS, 2001, pp:271-282 [Conf] - Giuseppe Cattaneo, Luigi Catuogno, Aniello Del Sorbo, Pino Persiano
**The Design and Implementation of a Transparent Cryptographic File System for UNIX.**[Citation Graph (0, 0)][DBLP] USENIX Annual Technical Conference, FREENIX Track, 2001, pp:199-212 [Conf] - Ioannis Caragiannis, Christos Kaklamanis, Pino Persiano, Anastasios Sidiropoulos
**Fractional and Integral Coloring of Locally-Symmetric Sets of Paths on Binary Trees.**[Citation Graph (0, 0)][DBLP] WAOA, 2003, pp:81-94 [Conf] - Carlo Blundo, Clemente Galdi, Pino Persiano
**Randomness Recycling in Constant-Round Private Computations (extended Abstract).**[Citation Graph (0, 0)][DBLP] DISC, 1999, pp:138-150 [Conf] - Ioannis Caragiannis, Afonso Ferreira, Christos Kaklamanis, Stephane Perennes, Pino Persiano, Hervé Rivano
**Approximate Constrained Bipartite Edge Coloring.**[Citation Graph (0, 0)][DBLP] WG, 2001, pp:21-31 [Conf] - Vincenzo Auletta, Angelo Monti, Mimmo Parente, Pino Persiano
**A Linear-Time Algorithm for the Feasibility of Pebble Motion on Trees.**[Citation Graph (0, 0)][DBLP] Algorithmica, 1999, v:23, n:3, pp:223-245 [Journal] - Ioannis Caragiannis, Afonso Ferreira, Christos Kaklamanis, Stephane Perennes, Pino Persiano, Hervé Rivano
**Approximate constrained bipartite edge coloring.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2004, v:143, n:1-3, pp:54-61 [Journal] - Vincenzo Auletta, Pino Persiano
**Optimal Pebble Motion on a Tree.**[Citation Graph (0, 0)][DBLP] Inf. Comput., 2001, v:165, n:1, pp:42-68 [Journal] - Ioannis Caragiannis, Christos Kaklamanis, Pino Persiano
**Symmetric Communication in All-Optical Tree Networks.**[Citation Graph (0, 0)][DBLP] Parallel Processing Letters, 2000, v:10, n:4, pp:305-314 [Journal] - Vincenzo Auletta, Ioannis Caragiannis, Luisa Gargano, Christos Kaklamanis, Pino Persiano
**Sparse and limited wavelength conversion in all-optical tree networks.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2001, v:266, n:1-2, pp:887-934 [Journal] - Vincenzo Auletta, Ioannis Caragiannis, Christos Kaklamanis, Pino Persiano
**Randomized path coloring on binary trees.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2002, v:289, n:1, pp:355-399 [Journal] - Ioannis Caragiannis, Christos Kaklamanis, Pino Persiano
**Edge coloring of bipartite graphs with constraints.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2002, v:270, n:1-2, pp:361-399 [Journal] - Thomas Erlebach, Klaus Jansen, Christos Kaklamanis, Milena Mihail, Pino Persiano
**Optimal Wavelength Routing on Directed Fiber Trees.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1999, v:221, n:1-2, pp:119-137 [Journal] - Pino Persiano, Ivan Visconti
**A secure and private system for subscription-based remote services.**[Citation Graph (0, 0)][DBLP] ACM Trans. Inf. Syst. Secur., 2003, v:6, n:4, pp:472-500 [Journal]
Search in 0.002secs, Finished in 0.003secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |