Author pages are created from data sourced from our academic publisher partnerships and public sources.

- Publications
- Influence

Dynamic provable data possession

- C. Erway, Alptekin Küpçü, Charalampos Papamanthou, R. Tamassia
- Computer Science
- IACR Cryptol. ePrint Arch.
- 9 November 2009

We consider the problem of efficiently proving the integrity of data stored at untrusted servers. In the provable data possession (PDP) model, the client preprocesses the data and then sends it to an… Expand

On Embedding a Graph in the Grid with the Minimum Number of Bends

- R. Tamassia
- Mathematics, Computer Science
- SIAM J. Comput.
- 1 June 1987

Given a planar graph G together with a planar representation P, a region preserving grid embedding of G is a planar embedding of G in the rectilinear grid that has planar representation isomorphic to… Expand

External-memory graph algorithms

- Y. Chiang, M. Goodrich, E. Grove, R. Tamassia, D. E. Vengroff, J. Vitter
- Computer Science
- SODA '95
- 22 January 1995

We present a collection of new techniques for designing and analyzing e cient external-memory algorithms for graph problems and illustrate how these techniques can be applied to a wide variety of… Expand

A unified approach to visibility representations of planar graphs

- R. Tamassia, Ioannis G. Tollis
- Computer Science, Mathematics
- Discret. Comput. Geom.
- 1 December 1986

We studyvisibility representations of graphs, which are constructed by mapping vertices to horizontal segments, and edges to vertical segments that intersect only adjacent vertex-segments. Every… Expand

On the Computational Complexity of Upward and Rectilinear Planarity Testing

- Ashim Garg, R. Tamassia
- Computer Science, Mathematics
- SIAM J. Comput.
- 1 February 2002

A directed graph is upward planar if it can be drawn in the plane such that every edge is a monotonically increasing curve in the vertical direction and no two edges cross. An undirected graph is… Expand

Data Structures and Algorithms in Java

- M. Goodrich, R. Tamassia
- Computer Science
- 23 January 1998

From the Publisher:
Using the power of technology to go beyond the borders of the printed page, Goodrich and Tamassia have created a book that is conceptually elegant and innovative. It incorporates… Expand

- 317
- 29

Algorithms for Drawing Graphs: an Annotated Bibliography

- G. D. Battista, P. Eades, R. Tamassia, I. Tollis
- Computer Science
- Comput. Geom.
- 1 August 1988

Several data presentation problems involve drawing graphs so that they are easy to read and understand. Examples include circuit schematics and diagrams for information systems analysis and design.… Expand

On-Line Planarity Testing

- G. D. Battista, R. Tamassia
- Computer Science, Mathematics
- SIAM J. Comput.
- 1 May 1989

The on-line planarity-testing problem consists of performing the following operations on a planar graph $G$: (i) testing if a new edge can be added to $G$ so that the resulting graph is itself… Expand

Algorithms for Plane Representations of Acyclic Digraphs

- G. D. Battista, R. Tamassia
- Mathematics, Computer Science
- Theor. Comput. Sci.
- 1 November 1988

Abstract Acyclic digraphs are widely used for representing hierarchical structures. Examples include PERT networks, subroutine-call graphs, family trees, organization charts, Hasse diagrams, and ISA… Expand

Algorithm design - foundations, analysis and internet examples

- M. Goodrich, R. Tamassia
- Computer Science
- 2001

PART I: FUNDAMENTAL TOOLS. Algorithm Analysis. Basic Data Structures. Search Trees and Skip Lists. Sorting, Sets, and Selection. Fundamental Techniques. PART II: GRAPH ALGORITHMS. Graphs. Weighted… Expand

- 233
- 18