Roberto Tamassia

Ontology type: schema:Person     

Person Info





Publications in SciGraph latest 50 shown

  • 2015 Minimal Spatio-Temporal Database Repairs in ADVANCES IN SPATIAL AND TEMPORAL DATABASES
  • 2014 The Melbourne Shuffle: Improving Oblivious Storage in the Cloud in AUTOMATA, LANGUAGES, AND PROGRAMMING
  • 2012 Hardening Access Control and Data Protection in GFS-like File Systems in COMPUTER SECURITY – ESORICS 2012
  • 2011 Optimal Verification of Operations on Dynamic Sets in ADVANCES IN CRYPTOLOGY – CRYPTO 2011
  • 2009 Reliable Resource Searching in P2P Networks in SECURITY AND PRIVACY IN COMMUNICATION NETWORKS
  • 2008 Athos: Efficient Authentication of Outsourced File Systems in INFORMATION SECURITY
  • 2008 Effective Visualization of File System Access-Control in VISUALIZATION FOR COMPUTER SECURITY
  • 2007 On the Cost of Persistence and Authentication in Skip Lists in EXPERIMENTAL ALGORITHMS
  • 2007 Efficient Content Authentication in Peer-to-Peer Networks in ROBOCUP-97: ROBOT SOCCER WORLD CUP I
  • 2007 Private Distributed Scalar Product Protocol With Application To Privacy-Preserving Computation of Trust in TRUST MANAGEMENT
  • 2007 Privacy-Preserving Schema Matching Using Mutual Information in DATA AND APPLICATIONS SECURITY XXI
  • 2007 A Role and Attribute Based Access Control System Using Semantic Web Technologies in ON THE MOVE TO MEANINGFUL INTERNET SYSTEMS 2007: OTM 2007 WORKSHOPS
  • 2005 Curvilinear Graph Drawing Using the Force-Directed Method in GRAPH DRAWING
  • 2005 Indexing Information for Data Forensics in ROBOCUP 2005: ROBOT SOCCER WORLD CUP IX
  • 2005 Computational Bounds on Hierarchical Data Processing with Applications to Information Security in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 2005 Secure Biometric Authentication for Weak Computational Devices in FINANCIAL CRYPTOGRAPHY AND DATA SECURITY
  • 2003-05-27 Authenticated Dictionaries for Fresh Attribute Credentials in TRUST MANAGEMENT
  • 2002 An Efficient Dynamic and Distributed Cryptographic Accumulator* in INFORMATION SECURITY
  • 2001-09-11 Persistent Authenticated Dictionaries and Their Applications in INFORMATION SECURITY
  • 2000 Improving Angular Resolution in Visualizations of Geographic Networks in DATA VISUALIZATION 2000
  • 1999-04 Output-Sensitive Reporting of Disjoint Paths in ALGORITHMICA
  • 1997 Drawing directed acyclic graphs: An experimental study in GRAPH DRAWING
  • 1997 A new minimum cost flow algorithm with applications to graph drawing in GRAPH DRAWING
  • 1997 Checking the convexity of polytopes and the planarity of subdivisions (extended abstract) in ALGORITHMS AND DATA STRUCTURES
  • 1996-02 Optimal cooperative search in fractional cascaded data structures in ALGORITHMICA
  • 1995 On the computational complexity of upward and rectilinear planarity testing in GRAPH DRAWING
  • 1994 Advances in graph drawing in ALGORITHMS AND COMPLEXITY
  • 1994 Planar drawings and angular resolution: Algorithms and bounds in ALGORITHMS — ESA '94
  • 1992-04 Area requirement and symmetry display of planar upward drawings in DISCRETE & COMPUTATIONAL GEOMETRY
  • 1989 Efficient spatial point location in ALGORITHMS AND DATA STRUCTURES
  • 1989 Dynamic planar point location with optimal query time in STACS 89
  • 1988 A dynamic data structure for planar graph embedding in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 1988 Efficient reconfiguration of VLSI arrays in VLSI ALGORITHMS AND ARCHITECTURES
  • 1987 Centipede graphs and visibility on a cylinder in GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE
  • 1986-12 A unified approach to visibility representations of planar graphs in DISCRETE & COMPUTATIONAL GEOMETRY
  • 1986 Algorithms for visibility representations of planar graphs in STACS 86
  • JSON-LD is the canonical representation for SciGraph data.

    TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT

        "@context": "", 
        "affiliation": [
            "affiliation": {
              "id": "", 
              "type": "Organization"
            "isCurrent": true, 
            "type": "OrganizationRole"
            "id": "", 
            "type": "Organization"
            "id": "", 
            "type": "Organization"
        "familyName": "Tamassia", 
        "givenName": "Roberto", 
        "id": "sg:person.0674326220.33", 
        "sameAs": [
        "sdDataset": "persons", 
        "sdDatePublished": "2019-03-07T13:15", 
        "sdLicense": "", 
        "sdPublisher": {
          "name": "Springer Nature - SN SciGraph project", 
          "type": "Organization"
        "sdSource": "s3://com-uberresearch-data-dimensions-researchers-20181010/20181011/dim_researchers/base/researchers_1074.json", 
        "type": "Person"

    Download the RDF metadata as:  json-ld nt turtle xml License info


    JSON-LD is a popular format for linked data which is fully compatible with JSON.

    curl -H 'Accept: application/ld+json' ''

    N-Triples is a line-based linked data format ideal for batch operations.

    curl -H 'Accept: application/n-triples' ''

    Turtle is a human-readable linked data format.

    curl -H 'Accept: text/turtle' ''

    RDF/XML is a standard XML format for linked data.

    curl -H 'Accept: application/rdf+xml' ''


    Preview window. Press ESC to close (or click here)