Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Roberto Tamassia
2010 – today
- 2013
[c130]Charalampos Papamanthou, Elaine Shi, Roberto Tamassia, Ke Yi: Streaming Authenticated Data Structures. EUROCRYPT 2013: 353-370- [c129]Charalampos Papamanthou, Elaine Shi, Roberto Tamassia: Signatures of Correct Computation. TCC 2013: 222-242
- 2012
- [j78]Michael T. Goodrich, Duy Nguyen, Olga Ohrimenko, Charalampos Papamanthou, Roberto Tamassia, Nikos Triandopoulos, Cristina Videira Lopes: Efficient Verification of Web-Content Searching Through Authenticated Web Crawlers. PVLDB 5(10): 920-931 (2012)
- [j77]Fan Zhou, Goce Trajcevski, Oliviu Ghica, Roberto Tamassia, Peter Scheuermann, Ashfaq A. Khokhar: Deflection-Aware Tracking-Principal Selection in Active Wireless Sensor Networks. IEEE T. Vehicular Technology 61(7): 3240-3254 (2012)
- [c128]Michael T. Goodrich, Michael Mitzenmacher, Olga Ohrimenko, Roberto Tamassia: Practical oblivious storage. CODASPY 2012: 13-24
- [c127]James Kelley, Roberto Tamassia, Nikos Triandopoulos: Hardening Access Control and Data Protection in GFS-like File Systems. ESORICS 2012: 19-36
- [c126]Michael T. Goodrich, Olga Ohrimenko, Roberto Tamassia: Graph Drawing in the Cloud: Privately Visualizing Relational Data Using Small Working Storage. Graph Drawing 2012: 43-54
- [c125]Goce Trajcevski, Besim Avci, Fan Zhou, Roberto Tamassia, Peter Scheuermann, Lauren Miller, Adam Barber: Motion Trends Detection in Wireless Sensor Networks. MDM 2012: 232-237
- [c124]Michael T. Goodrich, Michael Mitzenmacher, Olga Ohrimenko, Roberto Tamassia: Privacy-preserving group data access via stateless oblivious RAM simulation. SODA 2012: 157-167
- [c123]Olga Ohrimenko, Hobart Reynolds, Roberto Tamassia: Authenticating Email Search Results. STM 2012: 225-240
- [i14]Michael T. Goodrich, Duy Nguyen, Olga Ohrimenko, Charalampos Papamanthou, Roberto Tamassia, Nikos Triandopoulos, Cristina Videira Lopes: Verifying Search Results Over Web Collections. CoRR abs/1204.5446 (2012)
- [i13]Michael T. Goodrich, Olga Ohrimenko, Roberto Tamassia: Data-Oblivious Graph Drawing Model and Algorithms. CoRR abs/1209.0756 (2012)
- 2011
- [j76]Michael T. Goodrich, Roberto Tamassia, Nikos Triandopoulos: Efficient Authenticated Data Structures for Graph Connectivity and Geometric Search Problems. Algorithmica 60(3): 505-552 (2011)
- [j75]Goce Trajcevski, Roberto Tamassia, Isabel F. Cruz, Peter Scheuermann, David Hartglass, Christopher Zamierowski: Ranking continuous nearest neighbors for uncertain trajectories. VLDB J. 20(5): 767-791 (2011)
- [c122]Michael T. Goodrich, Michael Mitzenmacher, Olga Ohrimenko, Roberto Tamassia: Oblivious RAM simulation with efficient worst-case access overhead. CCSW 2011: 95-100
- [c121]Charalampos Papamanthou, Roberto Tamassia, Nikos Triandopoulos: Optimal Verification of Operations on Dynamic Sets. CRYPTO 2011: 91-110
- [c120]Goce Trajcevski, Fan Zhou, Roberto Tamassia, Besim Avci, Peter Scheuermann, Ashfaq A. Khokhar: Bypassing Holes in Sensor Networks: Load-Balance vs. Latency. GLOBECOM 2011: 1-5
- [i12]Michael T. Goodrich, Michael Mitzenmacher, Olga Ohrimenko, Roberto Tamassia: Privacy-Preserving Group Data Access via Stateless Oblivious RAM Simulation. CoRR abs/1105.4125 (2011)
- [i11]Michael T. Goodrich, Michael Mitzenmacher, Olga Ohrimenko, Roberto Tamassia: Oblivious RAM Simulation with Efficient Worst-Case Access Overhead. CoRR abs/1107.5093 (2011)
- [i10]Michael T. Goodrich, Michael Mitzenmacher, Olga Ohrimenko, Roberto Tamassia: Oblivious Storage with Low I/O Overhead. CoRR abs/1110.1851 (2011)
- [i9]Charalampos Papamanthou, Roberto Tamassia: Cryptography for Efficiency: Authenticated Data Structures Based on Lattices and Parallel Online Memory Checking. IACR Cryptology ePrint Archive 2011: 102 (2011)
- [i8]Charalampos Papamanthou, Elaine Shi, Roberto Tamassia: Publicly Verifiable Delegation of Computation. IACR Cryptology ePrint Archive 2011: 587 (2011)
- 2010
- [j74]Anna Lysyanskaya, Roberto Tamassia, Nikos Triandopoulos: Authenticated error-correcting codes with applications to multicast authentication. ACM Trans. Inf. Syst. Secur. 13(2) (2010)
- [j73]Roberto Tamassia, Danfeng Yao, William H. Winsborough: Independently Verifiable Decentralized Role-Based Delegation. IEEE Transactions on Systems, Man, and Cybernetics, Part A 40(6): 1206-1219 (2010)
- [c119]Roberto Tamassia, Nikos Triandopoulos: Certification and Authentication of Data Structures. AMW 2010
- [c118]David Eppstein, Michael T. Goodrich, Roberto Tamassia: Privacy-preserving data-oblivious geometric algorithms for geographic data. GIS 2010: 13-22
- [c117]Oliviu Ghica, Goce Trajcevski, Fan Zhou, Roberto Tamassia, Peter Scheuermann: Selecting tracking principals with epoch awareness. GIS 2010: 222-231
- [c116]Charalampos Papamanthou, Roberto Tamassia, Nikos Triandopoulos: Optimal Authenticated Data Structures with Multilinear Forms. Pairing 2010: 246-264
- [i7]David Eppstein, Michael T. Goodrich, Roberto Tamassia: Privacy-Preserving Data-Oblivious Geometric Algorithms for Geographic Data. CoRR abs/1009.1904 (2010)
- [i6]Charalampos Papamanthou, Roberto Tamassia: Update-Optimal Authenticated Structures Based on Lattices. IACR Cryptology ePrint Archive 2010: 128 (2010)
- [i5]Charalampos Papamanthou, Roberto Tamassia, Nikos Triandopoulos: Optimal Verification of Operations on Dynamic Sets. IACR Cryptology ePrint Archive 2010: 455 (2010)
2000 – 2009
- 2009
- [j72]Danfeng Yao, Roberto Tamassia: Compact and Anonymous Role-Based Authorization Chain. ACM Trans. Inf. Syst. Secur. 12(3) (2009)
- [c115]C. Christopher Erway, Alptekin Küpçü, Charalampos Papamanthou, Roberto Tamassia: Dynamic provable data possession. ACM Conference on Computer and Communications Security 2009: 213-222
- [c114]Goce Trajcevski, Roberto Tamassia, Hui Ding, Peter Scheuermann, Isabel F. Cruz: Continuous probabilistic nearest-neighbor queries for uncertain trajectories. EDBT 2009: 874-885
- [c113]Michael T. Goodrich, Jonathan Z. Sun, Roberto Tamassia, Nikos Triandopoulos: Reliable Resource Searching in P2P Networks. SecureComm 2009: 437-447
- [i4]Michael T. Goodrich, Roberto Tamassia, Jasminka Hasic: An Efficient Dynamic and Distributed RSA Accumulator. CoRR abs/0905.1307 (2009)
- [i3]Michael T. Goodrich, Roberto Tamassia, Nikos Triandopoulos: Efficient Authenticated Data Structures for Graph Connectivity and Geometric Search Problems. CoRR abs/0908.4116 (2009)
- [i2]Charalampos Papamanthou, Roberto Tamassia, Nikos Triandopoulos: Cryptographic Accumulators for Authenticated Hash Tables. IACR Cryptology ePrint Archive 2009: 625 (2009)
- 2008
- [j71]Michael T. Goodrich, Roberto Tamassia, Danfeng (Daphne) Yao: Notarized federated ID management and authentication. Journal of Computer Security 16(4): 399-418 (2008)
- [j70]Camil Demetrescu, Roberto Tamassia: Papers from ALENEX 2005. ACM Journal of Experimental Algorithmics 12 (2008)
- [j69]Nancy M. Amato, Der-Tsai Lee, Andrea Pietracaprina, Roberto Tamassia: Preface. Theor. Comput. Sci. 408(2-3): 97-98 (2008)
- [j68]Danfeng Yao, Keith B. Frikken, Mikhail J. Atallah, Roberto Tamassia: Private Information: To Reveal or not to Reveal. ACM Trans. Inf. Syst. Secur. 12(1) (2008)
- [c112]Charalampos Papamanthou, Franco P. Preparata, Roberto Tamassia: Algorithms for Location Estimation Based on RSSI Sampling. ALGOSENSORS 2008: 72-86
- [c111]Charalampos Papamanthou, Roberto Tamassia, Nikos Triandopoulos: Authenticated hash tables. ACM Conference on Computer and Communications Security 2008: 437-448
- [c110]Michael T. Goodrich, Roberto Tamassia, Nikos Triandopoulos: Super-Efficient Verification of Dynamic Outsourced Databases. CT-RSA 2008: 407-424
- [c109]Goce Trajcevski, Oliviu Ghica, Peter Scheuermann, Roberto Tamassia, Isabel F. Cruz: Alternating multiple tributaries + deltas. DMSN 2008: 28-34
- [c108]Roberto Tamassia, Bernardo Palazzi, Charalampos Papamanthou: Graph Drawing for Security Visualization. Graph Drawing 2008: 2-13
- [c107]Michael T. Goodrich, Charalampos Papamanthou, Roberto Tamassia, Nikos Triandopoulos: Athos: Efficient Authentication of Outsourced File Systems. ISC 2008: 80-96
- [c106]Alexander Heitzmann, Bernardo Palazzi, Charalampos Papamanthou, Roberto Tamassia: Efficient integrity checking of untrusted network storage. StorageSS 2008: 43-54
- [c105]Alexander Heitzmann, Bernardo Palazzi, Charalampos Papamanthou, Roberto Tamassia: Effective Visualization of File System Access-Control. VizSEC 2008: 18-25
- [i1]C. Christopher Erway, Alptekin Küpçü, Charalampos Papamanthou, Roberto Tamassia: Dynamic Provable Data Possession. IACR Cryptology ePrint Archive 2008: 432 (2008)
- 2007
- [c104]Roberto Tamassia, Nikos Triandopoulos: Efficient Content Authentication in Peer-to-Peer Networks. ACNS 2007: 354-372
- [c103]Isabel F. Cruz, Roberto Tamassia, Danfeng Yao: Privacy-Preserving Schema Matching Using Mutual Information. DBSec 2007: 93-94
- [c102]Goce Trajcevski, Hui Ding, Peter Scheuermann, Roberto Tamassia, Dennis Vaccaro: Dynamics-aware similarity of moving objects trajectories. GIS 2007: 11
- [c101]Charalampos Papamanthou, Roberto Tamassia: Time and Space Efficient Algorithms for Two-Party Authenticated Data Structures. ICICS 2007: 1-15
- [c100]Lorenzo Cirio, Isabel F. Cruz, Roberto Tamassia: A Role and Attribute Based Access Control System Using Semantic Web Technologies. OTM Workshops (2) 2007: 1256-1266
- [c99]Danfeng Yao, Yunhua Koglin, Elisa Bertino, Roberto Tamassia: Decentralized authorization and data security in web content delivery. SAC 2007: 1654-1661
- [c98]Michael T. Goodrich, Charalampos Papamanthou, Roberto Tamassia: On the Cost of Persistence and Authentication in Skip Lists. WEA 2007: 94-107
- 2006
- [c97]Michael T. Goodrich, Roberto Tamassia, Danfeng Yao: Notarized Federated Identity Management for Web Services. DBSec 2006: 133-147
- [c96]Danfeng Yao, Keith B. Frikken, Mikhail J. Atallah, Roberto Tamassia: Point-Based Trust: Define How Much Privacy Is Worth. ICICS 2006: 190-209
- 2005
- [c95]Michael T. Goodrich, Mikhail J. Atallah, Roberto Tamassia: Indexing Information for Data Forensics. ACNS 2005: 206-221
- [c94]Michael T. Goodrich, Roberto Tamassia, Danfeng Yao: Accredited DomainKeys: A Service Architecture for Improved Email Validation. CEAS 2005
- [c93]Mikhail J. Atallah, Keith B. Frikken, Michael T. Goodrich, Roberto Tamassia: Secure Biometric Authentication for Weak Computational Devices. Financial Cryptography 2005: 357-371
- [c92]Roberto Tamassia, Nikos Triandopoulos: Computational Bounds on Hierarchical Data Processing with Applications to Information Security. ICALP 2005: 153-165
- [c91]Danfeng Yao, Roberto Tamassia, Seth Proctor: On Improving the Performance of Role-Based Cascaded Delegation in Ubiquitous Computing. SecureComm 2005: 157-170
- [c90]Danfeng Yao, Michael Shin, Roberto Tamassia, William H. Winsborough: Visualization of Automated Trust Negotiation. VizSEC 2005: 8
- [e5]Camil Demetrescu, Robert Sedgewick, Roberto Tamassia (Eds.): Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithmics and Combinatorics, ALENEX /ANALCO 2005, Vancouver, BC, Canada, 22 January 2005. SIAM 2005, ISBN 0-89871-596-2
- 2004
- [b5]Michael T. Goodrich, Roberto Tamassia, David M. Mount: Data structures and algorithms in C++. Wiley 2004, ISBN 978-0-471-42924-1, pp. I-XV, 1-683
- [c89]Michael T. Goodrich, Jonathan Z. Sun, Roberto Tamassia: Efficient Tree-Based Revocation in Groups of Low-State Devices. CRYPTO 2004: 511-527
- [c88]Benjamin Finkel, Roberto Tamassia: Curvilinear Graph Drawing Using the Force-Directed Method. Graph Drawing 2004: 448-453
- [c87]Roberto Tamassia, Danfeng Yao, William H. Winsborough: Role-based cascaded delegation. SACMAT 2004: 146-155
- [c86]Anna Lysyanskaya, Roberto Tamassia, Nikos Triandopoulos: Multicast Authentication in Fully Adversarial Networks. IEEE Symposium on Security and Privacy 2004: 241-
- [c85]Sean Cannella, Daniel J. Polivy, Michael Shin, Christian D. Straub, Roberto Tamassia: Secure Visualization of Authentication Information: A Case Study. VL/HCC 2004: 35-37
- 2003
- [b4]Michael T. Goodrich, Roberto Tamassia: Data structures and algorithms in Java (3. ed.). Wiley 2003, ISBN 978-0-471-64452-1, pp. I-XVII, 1-681
- [j67]
- [c84]Michael T. Goodrich, Roberto Tamassia, Nikos Triandopoulos, Robert F. Cohen: Authenticated Data Structures for Graph and Geometric Searching. CT-RSA 2003: 295-313
- [c83]Michael T. Goodrich, Michael Shin, Christian D. Straub, Roberto Tamassia: Distributed Data Authenication (System Demonstration). DISCEX (2) 2003: 58-59
- [c82]Michael T. Goodrich, Roberto Tamassia: Efficient and Scalable Infrastructure Support for Dynamic Coalitions. DISCEX (2) 2003: 246-251
- [c81]
- [c80]Michael T. Goodrich, Michael Shin, Roberto Tamassia, William H. Winsborough: Authenticated Dictionaries for Fresh Attribute Credentials. iTrust 2003: 332-347
- 2002
- [b3]Michael T. Goodrich, Roberto Tamassia: Algorithm design - foundations, analysis and internet examples. Wiley 2002, ISBN 978-0-471-38365-9, pp. I-XII, 1-708
- [j66]Timothy M. Chan, Michael T. Goodrich, S. Rao Kosaraju, Roberto Tamassia: Optimizing area and aspect ration in straight-line orthogonal tree drawings. Comput. Geom. 23(2): 153-162 (2002)
- [j65]Stina S. Bridgeman, Roberto Tamassia: A User Study in Similarity Measures for Graph Drawing. J. Graph Algorithms Appl. 6(3): 225-254 (2002)
- [c79]Michael T. Goodrich, Roberto Tamassia, Jasminka Hasic: An Efficient Dynamic and Distributed Cryptographic Accumulator. ISC 2002: 372-388
- [c78]David Emory, Roberto Tamassia: JERPA: a distance-learning environment for introductory Java programming courses. SIGCSE 2002: 307-311
- [c77]Daniel J. Polivy, Roberto Tamassia: Authenticating distributed data using Web services and XML signatures. XML Security 2002: 80-89
- 2001
- [j64]Giuseppe Di Battista, Roberto Tamassia, Luca Vismara: Incremental Convex Planarity Testing. Inf. Comput. 169(1): 94-126 (2001)
- [j63]Roberto Tamassia, Luca Vismara: A Case Study in Algorithm Engineering for Geometric Computing. Int. J. Comput. Geometry Appl. 11(1): 15-70 (2001)
- [j62]Takao Nishizeki, Roberto Tamassia, Dorothea Wagner: Guest Editors' Foreword. J. Graph Algorithms Appl. 5(5): 1 (2001)
- [j61]Ashim Garg, Roberto Tamassia: On the Computational Complexity of Upward and Rectilinear Planarity Testing. SIAM J. Comput. 31(2): 601-625 (2001)
- [c76]
- [c75]Aris Anagnostopoulos, Michael T. Goodrich, Roberto Tamassia: Persistent Authenticated Dictionaries and Their Applications. ISC 2001: 379-393
- [c74]
- [e4]Frank K. H. A. Dehne, Jörg-Rüdiger Sack, Roberto Tamassia (Eds.): Algorithms and Data Structures, 7th International Workshop, WADS 2001, Providence, RI, USA, August 8-10, 2001, Proceedings. Lecture Notes in Computer Science 2125, Springer 2001, ISBN 3-540-42423-7
- 2000
- [j60]
- [j59]Stina S. Bridgeman, Giuseppe Di Battista, Walter Didimo, Giuseppe Liotta, Roberto Tamassia, Luca Vismara: Turn-regularity and optimal area drawings of orthogonal representations. Comput. Geom. 16(1): 53-93 (2000)
- [j58]Giuseppe Di Battista, Ashim Garg, Giuseppe Liotta, Armando Parise, Roberto Tamassia, Emanuele Tassinari, Francesco Vargiu, Luca Vismara: Drawing Directed Acyclic Graphs: An Experimental Study. Int. J. Comput. Geometry Appl. 10(6): 623-648 (2000)
- [j57]Stina S. Bridgeman, Roberto Tamassia: Difference Metrics for Interactive Orthogonal Graph Drawing Algorithms. J. Graph Algorithms Appl. 4(3): 47-74 (2000)
- [j56]Roberto Tamassia, Ioannis G. Tollis, Jeffrey Scott Vitter: A Parallel Algorithm for Planar Orthogonal Grid Drawings. Parallel Processing Letters 10(1): 141-150 (2000)
- [j55]Luca Vismara, Giuseppe Di Battista, Ashim Garg, Giuseppe Liotta, Roberto Tamassia, Francesco Vargiu: Experimental studies on graph drawing algorithms. Softw., Pract. Exper. 30(11): 1235-1284 (2000)
- [c73]
- [c72]Stina S. Bridgeman, Roberto Tamassia: A User Study in Similarity Measures for Graph Drawing. Graph Drawing 2000: 19-30
- [c71]Ulrik Brandes, Galina Shubina, Roberto Tamassia, Dorothea Wagner: Fast Layout Methods for Timetable Graphs. Graph Drawing 2000: 127-138
- [c70]Stina S. Bridgeman, Michael T. Goodrich, Stephen G. Kobourov, Roberto Tamassia: PILOT: an interactive tool for learning and grading. SIGCSE 2000: 139-143
- [c69]Stina S. Bridgeman, Michael T. Goodrich, Stephen G. Kobourov, Roberto Tamassia: SAIL: a system for generating, archiving, and retrieving specialized assignments using LATEX. SIGCSE 2000: 300-304
1990 – 1999
- 1999
- [b2]Giuseppe Di Battista, Peter Eades, Roberto Tamassia, Ioannis G. Tollis: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice-Hall 1999, ISBN 0-13-301615-3
- [j54]Giuseppe Di Battista, Roberto Tamassia, Luca Vismara: Output-Sensitive Reporting of Disjoint Paths. Algorithmica 23(4): 302-340 (1999)
- [j53]James E. Baker, Isabel F. Cruz, Giuseppe Liotta, Roberto Tamassia: Visualizing geometric algorithms over the Web. Comput. Geom. 12(1-2): 125-152 (1999)
- [j52]Stina S. Bridgeman, Ashim Garg, Roberto Tamassia: A Graph Drawing and Translation Service on the World Wide Web. Int. J. Comput. Geometry Appl. 9(4/5): 419-446 (1999)
- [j51]Gill Barequet, Christian A. Duncan, Michael T. Goodrich, Stina S. Bridgeman, Roberto Tamassia: GeomNet: Geometric Computing Over the Internet. IEEE Internet Computing 3(2): 21-29 (1999)
- [j50]Roberto Tamassia: Advances in the Theory and Practice of Graph Drawing. Theor. Comput. Sci. 217(2): 235-254 (1999)
- [c68]Michael T. Goodrich, Mark Handy, Benoît Hudson, Roberto Tamassia: Accessing the Internal Organization of Data Structures in the JDSL Library. ALENEX 1999: 124-139
- [c67]Stina S. Bridgeman, Giuseppe Di Battista, Walter Didimo, Giuseppe Liotta, Roberto Tamassia, Luca Vismara: Turn-Regularity and Planar Orthogonal Drawings. Graph Drawing 1999: 8-26
- [c66]Michael T. Goodrich, Roberto Tamassia: Using randomization in the teaching of data structures and algorithms. SIGCSE 1999: 53-57
- [c65]Ryan Shaun Baker, Michael Boilen, Michael T. Goodrich, Roberto Tamassia, B. Aaron Stibel: Testers and visualizers for teaching data structures. SIGCSE 1999: 261-265
- [e3]Frank K. H. A. Dehne, Arvind Gupta, Jörg-Rüdiger Sack, Roberto Tamassia (Eds.): Algorithms and Data Structures, 6th International Workshop, WADS '99, Vancouver, British Columbia, Canada, August 11-14, 1999, Proceedings. Lecture Notes in Computer Science 1663, Springer 1999, ISBN 3-540-66279-0
- 1998
- [b1]Michael T. Goodrich, Roberto Tamassia: Data structures and algorithms in Java. World wide series in computer science, Wiley 1998, ISBN 978-0-471-19308-1, pp. I-XVIII, 1-738
- [j49]Olivier Devillers, Giuseppe Liotta, Franco P. Preparata, Roberto Tamassia: Checking the convexity of polytopes and the planarity of subdivisions. Comput. Geom. 11(3-4): 187-208 (1998)
- [j48]
- [j47]Paola Bertolazzi, Giuseppe Di Battista, Carlo Mannino, Roberto Tamassia: Optimal Upward Planarity Testing of Single-Source Digraphs. SIAM J. Comput. 27(1): 132-169 (1998)
- [j46]Michael T. Goodrich, Roberto Tamassia: Dynamic Trees and Dynamic Point Location. SIAM J. Comput. 28(2): 612-636 (1998)
- [j45]Giuseppe Liotta, Franco P. Preparata, Roberto Tamassia: Robust Proximity Queries: An Illustration of Degree-Driven Algorithm Design. SIAM J. Comput. 28(3): 864-889 (1998)
- [c64]Stina S. Bridgeman, Roberto Tamassia: Difference Metrics for Interactive Orthogonal Graph Drawing Algorithms. Graph Drawing 1998: 57-71
- [c63]Natasha Gelfand, Roberto Tamassia: Algorithmic Patterns for Orthogonal Graph Drawing. Graph Drawing 1998: 138-152
- [c62]Roberto Tamassia: Implementing Algorithms and Data Structures: An Educational and Research Perspective. ISAAC 1998: 4-8
- [c61]Michael T. Goodrich, Roberto Tamassia: Teaching the analysis of algorithms with visual proofs. SIGCSE 1998: 207-211
- [c60]Natasha Gelfand, Michael T. Goodrich, Roberto Tamassia: Teaching data structure design patterns. SIGCSE 1998: 331-335
- 1997
- [j44]
- [j43]Emo Welzl, Giuseppe Di Battista, Ashim Garg, Giuseppe Liotta, Roberto Tamassia, Emanuele Tassinari, Francesco Vargiu: An Experimental Comparison of Four Graph Drawing Algorithms. Comput. Geom. 7: 303-325 (1997)
- [j42]Yi-Jen Chiang, Roberto Tamassia: Optimal Shortest Path and Minimum-Link Path Queries Between Two Convex Polygons Inside a Simple Polygonal Obstacle. Int. J. Comput. Geometry Appl. 7(1/2): 85-121 (1997)
- [j41]Goos Kant, Giuseppe Liotta, Roberto Tamassia, Ioannis G. Tollis: Area Requirement of Visibility Representations of Trees. Inf. Process. Lett. 62(2): 81-88 (1997)
- [j40]Michael T. Goodrich, Roberto Tamassia: Dynamic Ray Shooting and Shortest Paths in Planar Subdivisions via Balanced Geodesic Triangulations. J. Algorithms 23(1): 51-73 (1997)
- [p2]Roberto Tamassia, Bryan Cantrill: Data Structures. The Computer Science and Engineering Handbook 1997: 86-110
- [c59]Giuseppe Liotta, Roberto Tamassia, Ioannis G. Tollis, Paola Vocca: Area Requirement of Gabriel Drawings. CIAC 1997: 135-146
- [c58]Giuseppe Liotta, Franco P. Preparata, Roberto Tamassia: Robust Proximity Queries: An Illustration of Degree-Driven Algorithm Design. Symposium on Computational Geometry 1997: 156-165
- [c57]Gill Barequet, Stina S. Bridgeman, Christian A. Duncan, Michael T. Goodrich, Roberto Tamassia: Classical Computational Geometry in GeomNet. Symposium on Computational Geometry 1997: 412-414
- [c56]Stina S. Bridgeman, Jody Fanto, Ashim Garg, Roberto Tamassia, Luca Vismara: InteractiveGiotto: An Algorithm for Interactive Orthogonal Graph Drawing. Graph Drawing 1997: 303-308
- [c55]Olivier Devillers, Giuseppe Liotta, Franco P. Preparata, Roberto Tamassia: Checking the Convexity of Polytopes and the Planarity of Subdivisions (Extended Abstract). WADS 1997: 186-199
- [e2]Frank K. H. A. Dehne, Andrew Rau-Chaplin, Jörg-Rüdiger Sack, Roberto Tamassia (Eds.): Algorithms and Data Structures, 5th International Workshop, WADS '97, Halifax, Nova Scotia, Canada, August 6-8, 1997, Proceedings. Lecture Notes in Computer Science 1272, Springer 1997, ISBN 3-540-63307-3
- 1996
- [j39]Roberto Tamassia, Jeffrey Scott Vitter: Optimal Cooperative Search in Fractional Cascaded Data Structures. Algorithmica 15(2): 154-171 (1996)
- [j38]Giuseppe Di Battista, Roberto Tamassia: On-Line Maintenance of Triconnected Components with SPQR-Trees. Algorithmica 15(4): 302-318 (1996)
- [j37]Giuseppe Di Battista, Roberto Tamassia: Guest Editors' Introduction to the Special Issue on Graph Drwaing. Algorithmica 16(1): 1-3 (1996)
- [j36]
- [j35]Roberto Tamassia: Strategic Directions in Computational Geometry. ACM Comput. Surv. 28(4): 591-606 (1996)
- [j34]Peter Eades, Xuemin Lin, Roberto Tamassia: An Algorithm for Drawing a Hierarchical Graph. Int. J. Comput. Geometry Appl. 6(2): 145-156 (1996)
- [j33]Ashim Garg, Michael T. Goodrich, Roberto Tamassia: Planar upward tree drawings with optimal area. Int. J. Comput. Geometry Appl. 6(3): 333-356 (1996)
- [j32]
- [j31]Yi-Jen Chiang, Franco P. Preparata, Roberto Tamassia: A Unified Approach to Dynamic Point Location, Ray Shooting, and Shortest Paths in Planar Maps. SIAM J. Comput. 25(1): 207-233 (1996)
- [j30]Giuseppe Di Battista, Roberto Tamassia: On-Line Planarity Testing. SIAM J. Comput. 25(5): 956-997 (1996)
- [c54]James E. Baker, Isabel F. Cruz, Giuseppe Liotta, Roberto Tamassia: Algorithm animation over the World Wide Web. AVI 1996: 203-212
- [c53]James E. Baker, Isabel F. Cruz, Giuseppe Liotta, Roberto Tamassia: The Mocha algorithm animation system. AVI 1996: 248-250
- [c52]Roberto Tamassia, Giuseppe Liotta, Franco P. Preparata: Robust Proximity Queries in Implicit Voronoi Diagrams. CCCG 1996: 1-1
- [c51]Giuseppe Di Battista, Roberto Tamassia, Luca Vismara: Output-Sensitive Reporting of Disjoint Paths (Extended Abstract). COCOON 1996: 81-91
- [c50]Marek Chrobak, Michael T. Goodrich, Roberto Tamassia: Convex Drawings of Graphs in Two and Three Dimensions (Preliminary Version). Symposium on Computational Geometry 1996: 319-328
- [c49]James E. Baker, Isabel F. Cruz, Giuseppe Liotta, Roberto Tamassia: Animating Geometric Algorithms Over the Web. Symposium on Computational Geometry 1996: C-3-C-4
- [c48]
- [c47]Stina S. Bridgeman, Ashim Garg, Roberto Tamassia: A Graph Drawing and Translation Service on the WWW. Graph Drawing 1996: 45-52
- [c46]Timothy M. Chan, Michael T. Goodrich, S. Rao Kosaraju, Roberto Tamassia: Optimizing Area and Aspect Ratio in Straight-Line Orthogonal Tree Drawings. Graph Drawing 1996: 63-75
- [c45]Giuseppe Di Battista, Ashim Garg, Giuseppe Liotta, Armando Parise, Roberto Tamassia, Emanuele Tassinari, Francesco Vargiu, Luca Vismara: Drawing Directed Acyclic Graphs: An Experimental Study. Graph Drawing 1996: 76-91
- [c44]Ashim Garg, Roberto Tamassia: GIOTTO3D: A System for Visualizing Hierarchical Structures in 3D. Graph Drawing 1996: 193-200
- [c43]Ashim Garg, Roberto Tamassia: A New Minimum Cost Flow Algorithm with Applications to Graph Drawing. Graph Drawing 1996: 201-216
- 1995
- [j29]
- [j28]Sairam Subramanian, Roberto Tamassia, Jeffrey Scott Vitter: An Efficient Parallel Algorithm for Shortest Paths in Planar Layered Digraphs. Algorithmica 14(4): 322-339 (1995)
- [j27]James E. Baker, Isabel F. Cruz, Giuseppe Liotta, Roberto Tamassia: A New Model for Algorithm Animation Over the WWW. ACM Comput. Surv. 27(4): 568-572 (1995)
- [j26]Robert F. Cohen, Giuseppe Di Battista, Roberto Tamassia, Ioannis G. Tollis: Dynamic Graph Drawings: Trees, Series-Parallel Digraphs, and Planar ST-Digraphs. SIAM J. Comput. 24(5): 970-1001 (1995)
- [j25]
- [c42]Giuseppe Di Battista, Ashim Garg, Giuseppe Liotta, Roberto Tamassia, Emanuele Tassinari, Francesco Vargiu: An Experimental Comparison of Three Graph Drawing Algorithms (Extended Abstract). Symposium on Computational Geometry 1995: 306-315
- [c41]Yi-Jen Chiang, Michael T. Goodrich, Edward F. Grove, Roberto Tamassia, Darren Erik Vengroff, Jeffrey Scott Vitter: External-Memory Graph Algorithms. SODA 1995: 139-149
- [e1]Roberto Tamassia, Ioannis G. Tollis (Eds.): Graph Drawing, DIMACS International Workshop, GD '94, Princeton, New Jersey, USA, October 10-12, 1994, Proceedings. Lecture Notes in Computer Science 894, Springer 1995, ISBN 3-540-58950-3
- 1994
- [j24]Giuseppe Di Battista, Peter Eades, Roberto Tamassia, Ioannis G. Tollis: Algorithms for Drawing Graphs: an Annotated Bibliography. Comput. Geom. 4: 235-282 (1994)
- [j23]Paola Bertolazzi, Robert F. Cohen, Giuseppe Di Battista, Roberto Tamassia, Ioannis G. Tollis: How to Draw a Series-Parallel Digraph. Int. J. Comput. Geometry Appl. 4(4): 385-402 (1994)
- [j22]Peter Bro Miltersen, Sairam Subramanian, Jeffrey Scott Vitter, Roberto Tamassia: Complexity Models for Incremental Computation. Theor. Comput. Sci. 130(1): 203-236 (1994)
- [c40]
- [c39]Ashim Garg, Roberto Tamassia: Planar Drawings and Angular Resolution: Algorithms and Bounds (Extended Abstract). ESA 1994: 12-23
- [c38]Yi-Jen Chiang, Roberto Tamassia: Optimal Shortest Path and Minimum-Link Path Queries in the Presence of Obstacles (Extended Abstract). ESA 1994: 266-277
- [c37]Ashim Garg, Roberto Tamassia: On the Compuational Complexity of Upward and Rectilinear Planarity Testing. Graph Drawing 1994: 286-297
- [c36]Giuseppe Di Battista, Roberto Tamassia, Luca Vismara: On-Line Convex Plabarity Testing. WG 1994: 242-255
- 1993
- [j21]David Eppstein, Giuseppe F. Italiano, Roberto Tamassia, Robert Endre Tarjan, Jeffery Westbrook, Moti Yung: Corrigendum: Maintenance of a Minimum Spanning Forest in a Dynamic Plane Graph. J. Algorithms 15(1): 173 (1993)
- [j20]Roberto Tamassia, Ioannis G. Tollis: Dynamic Reachability in Planar Digraphs with One Source and One Sink. Theor. Comput. Sci. 119(2): 331-343 (1993)
- [c35]Goos Kant, Giuseppe Liotta, Roberto Tamassia, Ioannis G. Tollis: Area Requirement of Visibility Representations of Trees. CCCG 1993: 192-197
- [c34]Michael T. Goodrich, Roberto Tamassia: Dynamic Ray Shooting and Shortest Paths Via Balanced Geodesic Triangulations. Symposium on Computational Geometry 1993: 318-327
- [c33]Ashim Garg, Michael T. Goodrich, Roberto Tamassia: Area-Efficient Upward Tree Drawings. Symposium on Computational Geometry 1993: 359-368
- [c32]Paola Bertolazzi, Giuseppe Di Battista, Carlo Mannino, Roberto Tamassia: Optimal Upward Planarity Testing of Single-Source Digraphs. ESA 1993: 37-48
- [c31]Robert F. Cohen, Roberto Tamassia: Combine and Conquer: a General Technique for Dynamic Algorithms (Extended Abstract). ESA 1993: 97-108
- [c30]Robert F. Cohen, Sairam Sairam, Roberto Tamassia, Jeffrey Scott Vitter: Dynamic algorithms for optimization problems in bounded tree-width graphs. IPCO 1993: 99-112
- [c29]Yi-Jen Chiang, Franco P. Preparata, Roberto Tamassia: A Unified Approach to Dynamic Point Location, Ray Shooting, and Shortest Paths in Planar Maps. SODA 1993: 44-53
- [c28]Sairam Sairam, Jeffrey Scott Vitter, Roberto Tamassia: A Complexity Theoretic Approach to Incremental Computation. STACS 1993: 640-649
- [c27]Robert F. Cohen, Giuseppe Di Battista, Arkady Kanevsky, Roberto Tamassia: Reinventing the wheel: an optimal data structure for connectivity queries. STOC 1993: 194-200
- 1992
- [j19]Giuseppe Di Battista, Roberto Tamassia, Ioannis G. Tollis: Area Requirement and Symmetry Display of Planar Upward Drawings. Discrete & Computational Geometry 7: 381-401 (1992)
- [j18]Yi-Jen Chiang, Roberto Tamassia: Dynamization of the trapezoid method for planar point location in monotone subdivisions. Int. J. Comput. Geometry Appl. 2(3): 311-333 (1992)
- [j17]Giuseppe Di Battista, Roberto Tamassia, Ioannis G. Tollis: Constrained Visibility Representations of Graphs. Inf. Process. Lett. 41(1): 1-7 (1992)
- [j16]David Eppstein, Giuseppe F. Italiano, Roberto Tamassia, Robert Endre Tarjan, Jeffery Westbrook, Moti Yung: Maintenance of a Minimum Spanning Forest in a Dynamic Plane Graph. J. Algorithms 13(1): 33-54 (1992)
- [j15]Franco P. Preparata, Roberto Tamassia: Efficient Point Location in a Convex Spatial Cell-Complex. SIAM J. Comput. 21(2): 267-280 (1992)
- [c26]Robert F. Cohen, Giuseppe Di Battista, Roberto Tamassia, Ioannis G. Tollis, Paola Bertolazzi: A Framework for Dynamic Graph Drawing. Symposium on Computational Geometry 1992: 261-270
- [c25]Sairam Sairam, Roberto Tamassia, Jeffrey Scott Vitter: A Divide and Conquer Approach to Shortest Paths in Planar Layered Digraphs. SPDP 1992: 176-183
- [c24]Paola Bertolazzi, Robert F. Cohen, Giuseppe Di Battista, Roberto Tamassia, Ioannis G. Tollis: How to Draw a Series-Parallel Digraph (Extended Abstract). SWAT 1992: 272-283
- 1991
- [j14]Roberto Tamassia: An Incremental Reconstruction Method for Dynamic Planar Point Location. Inf. Process. Lett. 37(2): 79-83 (1991)
- [j13]Roberto Tamassia, Ioannis G. Tollis, Jeffrey Scott Vitter: Lower Bounds for Planar Orthogonal Drawings of Graphs. Inf. Process. Lett. 39(1): 35-40 (1991)
- [j12]Roberto Tamassia, Jeffrey Scott Vitter: Parallel Transitive Closure and Point Location in Planar Structures. SIAM J. Comput. 20(4): 708-725 (1991)
- [j11]Roberto Tamassia, Ioannis G. Tollis: Representations of Graphs on a Cylinder. SIAM J. Discrete Math. 4(1): 139-149 (1991)
- [j10]Bruno Codenotti, Roberto Tamassia: A Network Flow Approach to the Reconfiguration of VLSI Arrays. IEEE Trans. Computers 40(1): 118-121 (1991)
- [c23]Yi-Jen Chiang, Roberto Tamassia: Dynamization of the Trapezoid Method for Planar Point Location (Extended Abstract). Symposium on Computational Geometry 1991: 61-70
- [c22]Arkady Kanevsky, Roberto Tamassia, Giuseppe Di Battista, Jianer Chen: On-Line Maintenance of the Four-Connected Components of a Graph (Extended Abstract). FOCS 1991: 793-801
- [c21]Robert F. Cohen, Roberto Tamassia: Dynamic Expression Trees and their Applications (Extended Abstract). SODA 1991: 52-61
- [c20]Roberto Tamassia, Ioannis G. Tollis, Jeffrey Scott Vitter: Lower bounds and parallel algorithms for planar orthogonal grid drawings. SPDP 1991: 386-393
- [c19]Michael T. Goodrich, Roberto Tamassia: Dynamic Trees and Dynamic Point Location (Preliminary Version). STOC 1991: 523-533
- 1990
- [j9]Roberto Tamassia, Franco P. Preparata: Dynamic Maintenance of Planar Digraphs, with Applications. Algorithmica 5(4): 509-527 (1990)
- [j8]Franco P. Preparata, Roberto Tamassia: Dynamic Planar Point Location with Optimal Query Time. Theor. Comput. Sci. 74(1): 95-114 (1990)
- [c18]Giuseppe Di Battista, Roberto Tamassia: On-Line Graph Algorithms with SPQR-Trees. ICALP 1990: 598-611
- [c17]David Eppstein, Giuseppe F. Italiano, Roberto Tamassia, Robert Endre Tarjan, Jeffery Westbrook, Moti Yung: Maintenance of a Minimum Spanning Forest in a Dynamic Planar Graph. SODA 1990: 1-11
- [c16]Roberto Tamassia, Jeffrey Scott Vitter: Optimal Cooperative Search in Fractional Cascaded Data Structures. SPAA 1990: 307-316
- [c15]Giuseppe Di Battista, Amadeo Giammarco, Giuseppe Santucci, Roberto Tamassia: The Architecture of Diagram Server. VL 1990: 60-65
1980 – 1989
- 1989
- [j7]Giuseppe Di Battista, Hannu Kangassalo, Roberto Tamassia: Definition Libraries for Conceptual Modelling. Data Knowl. Eng. 4: 245-260 (1989)
- [j6]Franco P. Preparata, Roberto Tamassia: Fully Dynamic Point Location in a Monotone Subdivision. SIAM J. Comput. 18(4): 811-830 (1989)
- [c14]Giuseppe Di Battista, Roberto Tamassia, Ioannis G. Tollis: Area Requirement and Symmetry Display in Drawing Graphs. Symposium on Computational Geometry 1989: 51-60
- [c13]Giuseppe Di Battista, Roberto Tamassia: Incremental Planarity Testing (Extended Abstract). FOCS 1989: 436-441
- [c12]Roberto Tamassia, Jeffrey Scott Vitter: Optimal Parallel Algorithms for Transitive Closure and Point Location in Planar Structures. SPAA 1989: 399-408
- [c11]Franco P. Preparata, Roberto Tamassia: Dynamic Planar Point Location with Optimal Query Time. STACS 1989: 84-95
- [c10]Franco P. Preparata, Roberto Tamassia: Efficient Spatial Point Location (Extended Abstract). WADS 1989: 3-11
- 1988
- [j5]Giuseppe Di Battista, Roberto Tamassia: Algorithms for Plane Representations of Acyclic Digraphs. Theor. Comput. Sci. 61: 175-198 (1988)
- [c9]
- [c8]Giuseppe Di Battista, Hannu Kangassalo, Roberto Tamassia: Definition Libraries for Conceptual Modelling. ER 1988: 251-267
- [c7]Franco P. Preparata, Roberto Tamassia: Fully Dynamic Techniques for Point Location and Transitive Closure in Planar Structures (Extended Abstract). FOCS 1988: 558-567
- [c6]Roberto Tamassia: A Dynamic Data Structure for Planar Graph Embedding (Extended Abstract). ICALP 1988: 576-590
- 1987
- [j4]Roberto Tamassia: On Embedding a Graph in the Grid with the Minimum Number of Bends. SIAM J. Comput. 16(3): 421-444 (1987)
- [c5]
- 1986
- [j3]Roberto Tamassia, Ioannis G. Tollis: A Unified Approach a Visibility Representation of Planar Graphs. Discrete & Computational Geometry 1: 321-341 (1986)
- [j2]Carlo Batini, Enrico Nardelli, Roberto Tamassia: A Layout Algorithm for Data Flow Diagrams. IEEE Trans. Software Eng. 12(4): 538-546 (1986)
- [c4]Roberto Tamassia, Ioannis G. Tollis: Algorithms for Visibility Representations of Planar Graphs. STACS 1986: 130-141
- [c3]Roberto Tamassia, Ioannis G. Tollis: Centipede Graphs and Visibility on a Cylinder. WG 1986: 252-263
- 1985
- [p1]Carlo Batini, Enrico Nardelli, Maurizio Talamo, Roberto Tamassia: GINCOD: A Graphical Tool for Conceptual Design of Data Base Applications. Computer-Aided Database Design: the DATAID approach 1985: 33-51
- [c2]
- 1984
- [j1]Carlo Batini, Maurizio Talamo, Roberto Tamassia: Computer aided layout of entity relationship diagrams. Journal of Systems and Software 4(2-3): 163-173 (1984)
- 1983
- [c1]Roberto Tamassia, Carlo Batini, Maurizio Talamo: An Algorithm for Automatic Layout of Entity-Relationship Diagrams. ER 1983: 421-439
Coauthor Index
[j78] [c128] [c126] [c124] [i14] [i13] [j76] [c122] [i12] [i11] [i10] [c118] [i7] [c113] [i4] [i3] [j71] [c110] [c107] [c98] [c97] [c95] [c94] [c93] [b5] [c89] [b4] [c84] [c83] [c82] [c80] [b3] [j66] [c79] [c75] [c74] [c70] [c69] [j51] [c68] [c66] [c65] [b1] [j46] [c61] [c60] [j40] [c57] [j33] [c50] [c46] [c41] [c34] [c33] [c19]
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-05-29 22:25 CEST by the dblp team