Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Peter Calvert

Peter Robert Calvert

> Home > Persons

Person information

affiliation (PhD 2015): University of Cambridge, UK

Refine list

refinements active!

zoomed in on ?? of ?? records

view refined list in

export refined list as

showing all ?? records

2010 – 2019

see FAQ

What is the meaning of the colors in the publication lists?

2015
[b1]
- view
  - electronic edition @ bl.uk
  - no references & citations available
- export record
  dblp key:
  - phd/ethos/Calvert15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/phd/ethos/Calvert15
Peter Robert Calvert:
Architecture-neutral parallelism via the join calculus. University of Cambridge, UK, 2015
2012
[c3]
- view
  authority control:
- export record
  dblp key:
  - conf/sas/CalvertM12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/sas/CalvertM12
Peter Calvert, Alan Mycroft:
Control Flow Analysis for the Join Calculus. SAS 2012: 181-197
[c2]
- view
  authority control:
- export record
  dblp key:
  - journals/corr/abs-1302-6329
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1302-6329
Peter Calvert, Alan Mycroft:
Mapping the Join Calculus to Heterogeneous Hardware. PLACES 2012: 7-12
2011
[c1]
- view
  authority control:
- export record
  dblp key:
  - conf/europar/CalvertM11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/europar/CalvertM11
Peter Calvert, Alan Mycroft:
Petri-nets as an Intermediate Representation for Heterogeneous Architectures. Euro-Par (2) 2011: 226-237

Coauthor Index

see FAQ

a service of

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.