Stop the war!

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

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Gerard Gorman

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 Christopher C. Pain

> Home > Persons > Gerard Gorman

Publications

2008
[j3]
- view
  authority control:
- export record
  dblp key:
  - journals/gandc/GormanPWPA08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/gandc/GormanPWPA08
Gerard J. Gorman, M. D. Piggott, M. R. Wells, Christopher C. Pain, Peter A. Allison:
A systematic approach to unstructured mesh generation for ocean modelling using GMT and Terreno. Comput. Geosci. 34(12): 1721-1731 (2008)
2007
[j2]
- view
  authority control:
- export record
  dblp key:
  - journals/gandc/GormanPP07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/gandc/GormanPP07
Gerard J. Gorman, M. D. Piggott, Christopher C. Pain:
Shoreline approximation for unstructured mesh generation. Comput. Geosci. 33(5): 666-677 (2007)
2006
[j1]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/cma/PowerPPFGUGN06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cma/PowerPPFGUGN06
P. W. Power, Christopher C. Pain, M. D. Piggott, Fangxin Fang, Gerard J. Gorman, A. P. Umpleby, Anthony J. H. Goddard, I. M. Navon:
Adjoint A Posteriori Error Measures for Anisotropic Mesh Optimisation. Comput. Math. Appl. 52(8-9): 1213-1242 (2006)

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.