The following pages link to Roberto Tamassia (Q262256):
Displaying 50 items.
- Authenticated hash tables based on cryptographic accumulators (Q262258) (← links)
- Area requirement of visibility representations of trees (Q287042) (← links)
- Efficient authenticated data structures for graph connectivity and geometric search problems (Q548654) (← links)
- Dynamic reachability in planar digraphs with one source and one sink (Q688163) (← links)
- An incremental reconstruction method for dynamic planar point location (Q750176) (← links)
- Dynamic maintenance of planar digraphs, with applications (Q911751) (← links)
- Dynamic planar point location with optimal query time (Q914389) (← links)
- A unified approach to visibility representations of planar graphs (Q1085167) (← links)
- Algorithms for plane representations of acyclic digraphs (Q1124349) (← links)
- Lower bounds for planar orthogonal drawings of graphs (Q1182115) (← links)
- Constrained visibility representations of graphs (Q1186563) (← links)
- Area requirement and symmetry display of planar upward drawings (Q1189288) (← links)
- Checking the convexity of polytopes and the planarity of subdivisions (Q1276945) (← links)
- Output-sensitive reporting of disjoint paths (Q1283681) (← links)
- Advances in the theory and practice of graph drawing (Q1285778) (← links)
- Visualizing geometric algorithms over the Web (Q1286485) (← links)
- Complexity models for incremental computation (Q1331947) (← links)
- Algorithms for drawing graphs: An annotated bibliography (Q1337400) (← links)
- Dynamic expression trees (Q1346771) (← links)
- Constraints in graph drawing algorithms (Q1387632) (← links)
- Turn-regularity and optimal area drawings of orthogonal representations (Q1567307) (← links)
- Incremental convex planarity testing (Q1854448) (← links)
- Optimizing area and aspect ratio in straight-line orthogonal tree drawings (Q1862119) (← links)
- An efficient parallel algorithm for shortest paths in planar layered digraphs (Q1899220) (← links)
- Upward planarity testing (Q1904391) (← links)
- Optimal cooperative search in fractional cascaded data structures (Q1907234) (← links)
- On-line maintenance of triconnected components with SPQR-trees (Q1911463) (← links)
- An experimental comparison of four graph drawing algorithms. (Q2482890) (← links)
- DRAWING DIRECTED ACYCLIC GRAPHS: AN EXPERIMENTAL STUDY (Q2708043) (← links)
- (Q2753952) (← links)
- (Q2757736) (← links)
- On the Computational Complexity of Upward and Rectilinear Planarity Testing (Q2784472) (← links)
- Zero-Knowledge Authenticated Order Queries and Order Statistics on a List (Q2794500) (← links)
- Verifiable Zero-Knowledge Order Queries and Updates for Fully Dynamic Lists and Trees (Q2827721) (← links)
- (Q2935981) (← links)
- Zero-Knowledge Accumulators and Set Algebra (Q2953773) (← links)
- (Q3043758) (← links)
- (Q3047574) (← links)
- Optimal Authenticated Data Structures with Multilinear Forms (Q3059655) (← links)
- (Q3138871) (← links)
- (Q3138939) (← links)
- (Q3140400) (← links)
- (Q3154375) (← links)
- Representations of Graphs on a Cylinder (Q3200548) (← links)
- Reliable Resource Searching in P2P Networks (Q3556635) (← links)
- Indexing Information for Data Forensics (Q3593145) (← links)
- Efficient Content Authentication in Peer-to-Peer Networks (Q3612392) (← links)
- (Q3742736) (← links)
- (Q3785982) (← links)
- (Q3795247) (← links)
