Arthur S. Trew

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 Bartosz Dobrzelecki

> Home > Persons > Arthur S. Trew

Publications

2011
[j8]
- view
  authority control:
- export record
  dblp key:
  - journals/concurrency/PetrouSMFPDGTH11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/concurrency/PetrouSMFPDGTH11
Savvas Petrou, Terence M. Sloan, Muriel Mewissen, Thorsten Forster, Michal Piotrowski, Bartosz Dobrzelecki, Peter Ghazal, Arthur S. Trew, Jon Hill:
Optimization of a parallel permutation testing function for the SPRINT R package. Concurr. Comput. Pract. Exp. 23(17): 2258-2268 (2011)
[c11]
- view
  authority control:
- export record
  dblp key:
  - conf/ieeehpcs/PiotrowskiSMFMPDGTH11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ieeehpcs/PiotrowskiSMFMPDGTH11
Michal Piotrowski, Terence M. Sloan, Muriel Mewissen, Thorsten Forster, Lawrence Mitchell, Savvas Petrou, Bartosz Dobrzelecki, Peter Ghazal, Arthur S. Trew, Jon Hill:
Optimisation and parallelisation of the partitioning around medoids function in R. HPCS 2011: 707-713
2009
[c9]
- view
  authority control:
- export record
  dblp key:
  - conf/icns/GrahamNKSPDT09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icns/GrahamNKSPDT09
Paul Graham, Jeremy Nowell, Kostas Kavoussanakis, Florian Scharinger, Charaka Palansuriya, Bartosz Dobrzelecki, Arthur S. Trew:
The Probes Coordination Protocol: Periodic Task Coordination and Control across Administrative Boundaries. ICNS 2009: 462-467

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.