Clara Bertolissi

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Paolo Baldan

> Home > Persons > Clara Bertolissi

Publications

2010
[c11]
- view
  authority control:
- export record
  dblp key:
  - conf/wadt/BaldanB10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/wadt/BaldanB10
Paolo Baldan, Clara Bertolissi:
Sharing in the Graph Rewriting Calculus. WADT 2010: 27-41
2007
[j2]
- view
  authority control:
- export record
  dblp key:
  - journals/mscs/BaldanBCK07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mscs/BaldanBCK07
Paolo Baldan, Clara Bertolissi, Horatiu Cirstea, Claude Kirchner:
A rewriting calculus for cyclic higher-order term graphs. Math. Struct. Comput. Sci. 17(3): 363-406 (2007)
[c4]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/entcs/BaldanBCK08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/entcs/BaldanBCK08
Paolo Baldan, Clara Bertolissi, Horatiu Cirstea, Claude Kirchner:
Towards a Sharing Strategy for the Graph Rewriting Calculus. WRS@RDP 2007: 111-127
2004
[c2]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/entcs/BertolissiBCK05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/entcs/BertolissiBCK05
Clara Bertolissi, Paolo Baldan, Horatiu Cirstea, Claude Kirchner:
A Rewriting Calculus for Cyclic Higher-order Term Graphs. TERMGRAPH 2004: 21-41

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.