Roberto Tamassia

From MaRDI portal
Person:262256

Available identifiers

zbMath Open tamassia.robertoDBLPt/RobertoTamassiaWikidataQ7351921 ScholiaQ7351921MaRDI QIDQ262256

List of research outcomes





PublicationDate of PublicationType
Full Database Reconstruction with Access and Search Pattern Leakage2024-03-14Paper
Mitigation Techniques for Attacks on 1-Dimensional Databases that Support Range Queries2024-03-14Paper
Output-sensitive reporting of disjoint paths (extended abstract)2024-01-29Paper
On-line convex planarity testing2024-01-05Paper
How to draw a series-parallel digraph2022-12-09Paper
Checking the convexity of polytopes and the planarity of subdivisions (extended abstract)2022-08-19Paper
Dynamic planar point location with optimal query time2022-08-16Paper
Accountable Storage2022-07-01Paper
https://portal.mardi4nfdi.de/entity/Q57433862019-05-10Paper
https://portal.mardi4nfdi.de/entity/Q46438702018-05-29Paper
Drawing with colors2017-12-05Paper
Zero-Knowledge Accumulators and Set Algebra2017-01-06Paper
Verifiable Zero-Knowledge Order Queries and Updates for Fully Dynamic Lists and Trees2016-10-21Paper
Area requirement of visibility representations of trees2016-05-26Paper
Authenticated hash tables based on cryptographic accumulators2016-03-29Paper
Zero-Knowledge Authenticated Order Queries and Order Statistics on a List2016-03-10Paper
Reinventing the wheel2015-05-07Paper
https://portal.mardi4nfdi.de/entity/Q29359812014-12-30Paper
The Melbourne Shuffle: Improving Oblivious Storage in the Cloud2014-07-01Paper
Streaming Authenticated Data Structures2013-05-31Paper
Graph Drawing in the Cloud: Privately Visualizing Relational Data Using Small Working Storage2013-04-03Paper
Signatures of Correct Computation2013-03-18Paper
Optimal Verification of Operations on Dynamic Sets2011-08-12Paper
Efficient authenticated data structures for graph connectivity and geometric search problems2011-06-30Paper
Optimal Authenticated Data Structures with Multilinear Forms2010-11-26Paper
Reliable Resource Searching in P2P Networks2010-04-24Paper
Efficient Content Authentication in Peer-to-Peer Networks2009-03-10Paper
An experimental comparison of four graph drawing algorithms.2008-04-25Paper
Super-Efficient Verification of Dynamic Outsourced Databases2008-04-24Paper
Time and Space Efficient Algorithms for Two-Party Authenticated Data Structures2008-03-25Paper
Indexing Information for Data Forensics2007-09-24Paper
Automata, Languages and Programming2006-01-10Paper
Financial Cryptography and Data Security2005-12-22Paper
Advances in Cryptology – CRYPTO 20042005-08-23Paper
A CASE STUDY IN ALGORITHM ENGINEERING FOR GEOMETRIC COMPUTING2005-06-10Paper
https://portal.mardi4nfdi.de/entity/Q31543752004-12-16Paper
https://portal.mardi4nfdi.de/entity/Q30475742004-08-12Paper
https://portal.mardi4nfdi.de/entity/Q30437582004-08-06Paper
https://portal.mardi4nfdi.de/entity/Q44723002004-08-04Paper
https://portal.mardi4nfdi.de/entity/Q44722882004-08-04Paper
https://portal.mardi4nfdi.de/entity/Q44484162004-02-18Paper
https://portal.mardi4nfdi.de/entity/Q44460732004-01-25Paper
https://portal.mardi4nfdi.de/entity/Q44185442003-08-10Paper
https://portal.mardi4nfdi.de/entity/Q44084582003-06-29Paper
A User Study in Similarity Measures for Graph Drawing2003-06-23Paper
Optimizing area and aspect ratio in straight-line orthogonal tree drawings2003-03-10Paper
https://portal.mardi4nfdi.de/entity/Q47890762003-01-23Paper
Incremental convex planarity testing2003-01-14Paper
On the computational complexity of upward and rectilinear planarity testing2002-04-23Paper
Algorithm design: Foundations, analysis, and Internet examples2001-11-29Paper
https://portal.mardi4nfdi.de/entity/Q27539522001-11-11Paper
https://portal.mardi4nfdi.de/entity/Q49455222001-04-20Paper
Drawing directed acyclic graphs: an experimental study2001-04-17Paper
https://portal.mardi4nfdi.de/entity/Q47885972001-01-01Paper
Difference Metrics for Interactive Orthogonal Graph Drawing Algorithms2000-12-14Paper
https://portal.mardi4nfdi.de/entity/Q45016932000-11-16Paper
Turn-regularity and optimal area drawings of orthogonal representations2000-06-05Paper
https://portal.mardi4nfdi.de/entity/Q42341361999-11-03Paper
Visualizing geometric algorithms over the Web1999-05-03Paper
Advances in the theory and practice of graph drawing1999-04-28Paper
Checking the convexity of polytopes and the planarity of subdivisions1999-04-11Paper
Output-sensitive reporting of disjoint paths1999-03-30Paper
Robust Proximity Queries: An Illustration of Degree-Driven Algorithm Design1999-02-22Paper
Constraints in graph drawing algorithms1998-10-05Paper
Dynamic Trees and Dynamic Point Location1998-09-21Paper
https://portal.mardi4nfdi.de/entity/Q44010341998-08-02Paper
Optimal Upward Planarity Testing of Single-Source Digraphs1998-05-10Paper
Optimal Shortest Path and Minimum-Link Path Queries between Two Convex Polygons inside a Simple Polygonal Obstacle1997-07-27Paper
PLANAR UPWARD TREE DRAWINGS WITH OPTIMAL AREA1997-06-30Paper
On-line Planar Graph Embedding1997-03-12Paper
On-Line Planarity Testing1996-11-07Paper
https://portal.mardi4nfdi.de/entity/Q48860431996-11-04Paper
AN ALGORITHM FOR DRAWING A HIERARCHICAL GRAPH1996-08-12Paper
A Unified Approach to Dynamic Point Location, Ray shooting, and Shortest Paths in Planar Maps1996-07-02Paper
On-line maintenance of triconnected components with SPQR-trees1996-06-06Paper
Dynamic Graph Drawings: Trees, Series-Parallel Digraphs, and Planar $ST$-Digraphs1996-04-11Paper
Upward planarity testing1996-04-11Paper
An efficient parallel algorithm for shortest paths in planar layered digraphs1996-03-18Paper
Optimal cooperative search in fractional cascaded data structures1996-03-07Paper
Dynamic expression trees1995-04-09Paper
HOW TO DRAW A SERIES-PARALLEL DIGRAPH1995-04-06Paper
Algorithms for drawing graphs: An annotated bibliography1994-11-30Paper
Complexity models for incremental computation1994-08-29Paper
https://portal.mardi4nfdi.de/entity/Q42815661994-04-07Paper
https://portal.mardi4nfdi.de/entity/Q31388711994-01-02Paper
https://portal.mardi4nfdi.de/entity/Q31404001994-01-02Paper
Dynamic reachability in planar digraphs with one source and one sink1993-11-28Paper
https://portal.mardi4nfdi.de/entity/Q31389391993-10-20Paper
https://portal.mardi4nfdi.de/entity/Q40387211993-05-18Paper
DYNAMIZATION OF THE TRAPEZOID METHOD FOR PLANAR POINT LOCATION IN MONOTONE SUBDIVISIONS1993-04-01Paper
https://portal.mardi4nfdi.de/entity/Q40288701993-03-28Paper
https://portal.mardi4nfdi.de/entity/Q40146321992-10-18Paper
Area requirement and symmetry display of planar upward drawings1992-09-26Paper
Efficient Point Location in a Convex Spatial Cell-Complex1992-06-28Paper
Maintenance of a minimum spanning forest in a dynamic plane graph1992-06-28Paper
Constrained visibility representations of graphs1992-06-28Paper
Lower bounds for planar orthogonal drawings of graphs1992-06-27Paper
Parallel Transitive Closure and Point Location in Planar Structures1992-06-25Paper
Representations of Graphs on a Cylinder1991-01-01Paper
An incremental reconstruction method for dynamic planar point location1991-01-01Paper
Dynamic maintenance of planar digraphs, with applications1990-01-01Paper
Dynamic planar point location with optimal query time1990-01-01Paper
Fully Dynamic Point Location in a Monotone Subdivision1989-01-01Paper
Algorithms for plane representations of acyclic digraphs1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37952471988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37967801988-01-01Paper
On Embedding a Graph in the Grid with the Minimum Number of Bends1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37859821987-01-01Paper
A unified approach to visibility representations of planar graphs1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37427361986-01-01Paper

Research outcomes over time

This page was built for person: Roberto Tamassia