On the computational complexity of upward and rectilinear planarity testingGARG, Ashim; TAMASSIA, Roberto.SIAM journal on computing (Print). 2002, Vol 31, Num 2, pp 601-625, issn 0097-5397Article

A user study in similarity measures for graph drawingBRIDGEMAN, Stina; TAMASSIA, Roberto.Lecture notes in computer science. 2001, pp 19-30, issn 0302-9743, isbn 3-540-41554-8Conference Paper

Authenticated data structuresTAMASSIA, Roberto.Lecture notes in computer science. 2003, pp 2-5, issn 0302-9743, isbn 3-540-20064-9, 4 p.Conference Paper

Multicast authentication in fully adversarial networksLYSYANSKAYA, Anna; TAMASSIA, Roberto; TRIANDOPOULOS, Nikos et al.IEEE symposium on security and privacy. 2004, pp 241-255, isbn 0-7695-2136-3, 1Vol, 15 p.Conference Paper

Incremental convex planarity testingDI BATTISTA, Giuseppe; TAMASSIA, Roberto; VISMARA, Luca et al.Information and computation (Print). 2001, Vol 169, Num 1, pp 94-126, issn 0890-5401Article

A parallel algorithm for planar orthogonal grid drawingsTAMASSIA, Roberto; TOLLIS, Ioannis G; VITTER, Jeffrey Scott et al.Parallel processing letters. 2000, Vol 10, Num 1, pp 141-150, issn 0129-6264Article

Algorithms and data structures (Providence RI, 8-10 August 2001)Dehne, Frank; Sack, Jörg-Rüdiger; Tamassia, Roberto et al.Lecture notes in computer science. 2001, issn 0302-9743, isbn 3-540-42423-7, XII, 484 p, isbn 3-540-42423-7Conference Proceedings

The graph drawing serverBRIDGEMAN, Stina; TAMASSIA, Roberto.Lecture notes in computer science. 2002, pp 448-450, issn 0302-9743, isbn 3-540-43309-0Conference Paper

Fast layout methods for timetable graphsBRANDES, Ulrik; SHUBINA, Galina; TAMASSIA, Roberto et al.Lecture notes in computer science. 2001, pp 127-138, issn 0302-9743, isbn 3-540-41554-8Conference Paper

Efficient tree-based revocation in groups of low-state devicesGOODRICH, Michael T; SUN, Jonathan Z; TAMASSIA, Roberto et al.Lecture notes in computer science. 2004, pp 511-527, issn 0302-9743, isbn 3-540-22668-0, 17 p.Conference Paper

Efficient Authenticated Data Structures for Graph Connectivity and Geometric Search ProblemsGOODRICH, Michael T; TAMASSIA, Roberto; TRIANDOPOULOS, Nikos et al.Algorithmica. 2011, Vol 60, Num 3, pp 505-552, issn 0178-4617, 48 p.Article

Using the pseudo-dimension to analyze approximation algorithms for integer programmingLONG, Philip M.Lecture notes in computer science. 2001, pp 26-37, issn 0302-9743, isbn 3-540-42423-7Conference Paper

The challenges of delivering content on the InternetLEIGHTON, F. Thomson.Lecture notes in computer science. 2001, issn 0302-9743, isbn 3-540-42423-7, p. 338Conference Paper

Algorithms and data structures (Halifax NS, August 6-8, 1997)Dehne, Frank; Rau-Chaplin, Andrew; Sack, Jörg-Rudiger et al.Lecture notes in computer science. 1997, issn 0302-9743, isbn 3-540-63307-3, X, 476 p, isbn 3-540-63307-3Conference Proceedings

A simple linear time algorithm for proper box rectangular drawings of plane graphsXIN HE.Lecture notes in computer science. 2001, pp 234-245, issn 0302-9743, isbn 3-540-42423-7Conference Paper

Small maximal independent sets and faster exact graph coloringEPPSTEIN, David.Lecture notes in computer science. 2001, pp 462-470, issn 0302-9743, isbn 3-540-42423-7Conference Paper

Voronoi diagrams for moving disks and applicationsKARAVELAS, Menelaos I.Lecture notes in computer science. 2001, pp 62-74, issn 0302-9743, isbn 3-540-42423-7Conference Paper

Algorithms and data structures (Vancouver, 11-14 August 1999)Dehne, Frank; Gupta, Arvind; Sack, Jörg-Rüdiger et al.Lecture notes in computer science. 1999, issn 0302-9743, isbn 3-540-66279-0, IX, 368 p, isbn 3-540-66279-0Conference Proceedings

Complexity bounds for vertical decompositions of linear arrangements in four dimensionsKOLTUN, Vladlen.Lecture notes in computer science. 2001, pp 99-110, issn 0302-9743, isbn 3-540-42423-7Conference Paper

Notarized federated identity management for web servicesGOODRICH, Michael T; TAMASSIA, Roberto; YAO, Danfeng et al.Lecture notes in computer science. 2006, pp 133-147, issn 0302-9743, isbn 3-540-36796-9, 1Vol, 15 p.Conference Paper

Persistent authenticated dictionaries and their applicationsANAGNOSTOPOULOS, Aris; GOODRICH, Michael T; TAMASSIA, Roberto et al.Lecture notes in computer science. 2001, pp 379-393, issn 0302-9743, isbn 3-540-42662-0Conference Paper

Point-based trust : Define how much privacy is worthDANFENG YAO; FDKKEN, Keith B; ATALLAH, Mikhail J et al.Lecture notes in computer science. 2006, pp 190-209, issn 0302-9743, isbn 3-540-49496-0, 20 p.Conference Paper

Computational bounds on hierarchical data processing with applications to information securityTAMASSIA, Roberto; TRIANDOPOULOS, Nikos.Lecture notes in computer science. 2005, pp 153-165, issn 0302-9743, isbn 3-540-27580-0, 13 p.Conference Paper

An efficient dynamic and distributed cryptographic accumulatorGOODRICH, Michael T; TAMASSIA, Roberto; HASI, Jasminka et al.Lecture notes in computer science. 2002, pp 372-388, issn 0302-9743, isbn 3-540-44270-7, 17 p.Conference Paper

Deflection-Aware Tracking-Principal Selection in Active Wireless Sensor NetworksFAN ZHOU; TRAJCEVSKI, Goce; GHICA, Oliviu et al.IEEE transactions on vehicular technology. 2012, Vol 61, Num 7, pp 3240-3254, issn 0018-9545, 15 p.Article