Travelled to:1 × Denmark
1 × Finland
1 × Korea
1 × Portugal
2 × USA
Collaborated with:N.Triandopoulos M.T.Goodrich G.D.Battista ∅ C.Papamanthou O.Ohrimenko D.Papadopoulos E.Upfal D.Yao Y.Koglin E.Bertino R.F.Cohen A.Kanevsky D.Nguyen C.V.Lopes
Talks about:data (4) dynam (3) web (3) structur (2) content (2) authent (2) secur (2) optim (2) graph (2) tree (2)
Person: Roberto Tamassia
DBLP: Tamassia:Roberto
Contributed to:
2015
20142012
20072005
1993199119901988Wrote 9 papers:
- VLDB-2015-PapadopoulosPTT #authentication #pattern matching #proving
- Practical Authenticated Pattern Matching with Optimal Proof Size (DP, CP, RT, NT), pp. 750–761.
- ICALP-v2-2014-OhrimenkoGTU #in the cloud
- The Melbourne Shuffle: Improving Oblivious Storage in the Cloud (OO, MTG, RT, EU), pp. 556–567.
- VLDB-2012-GoodrichNOPTTL #authentication #crawling #performance #verification #web
- Efficient Verification of Web-Content Searching Through Authenticated Web Crawlers (MTG, DN, OO, CP, RT, NT, CVL), pp. 920–931.
- SAC-2007-YaoKBT #distributed #security #web
- Decentralized authorization and data security in web content delivery (DY, YK, EB, RT), pp. 1654–1661.
- ICALP-2005-TamassiaT #bound #security
- Computational Bounds on Hierarchical Data Processing with Applications to Information Security (RT, NT), pp. 153–165.
- STOC-1993-CohenBKT #data type #query
- Reinventing the wheel: an optimal data structure for connectivity queries (RFC, GDB, AK, RT), pp. 194–200.
- STOC-1991-GoodrichT
- Dynamic Trees and Dynamic Point Location (MTG, RT), pp. 523–533.
- ICALP-1990-BattistaT #algorithm #graph #online
- On-Line Graph Algorithms with SPQR-Trees (GDB, RT), pp. 598–611.
- ICALP-1988-Tamassia #data type #graph
- A Dynamic Data Structure for Planar Graph Embedding (RT), pp. 576–590.