Hugh P. Shanahan

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 Mark A. Musen

> Home > Persons > Hugh P. Shanahan

Publications

2019
[i1]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1902-11162
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1902-11162
Peter Wittenburg, Hana Pergl Sustkova, Annalisa Montesanti, Margreet Bloemers, S. H. de Waard, Mark A. Musen, John Graybeal, Kristina M. Hettne, Annika Jacobsen, Robert Pergl, Rob W. W. Hooft, Christine Staiger, Celia W. G. van Gelder, Sebastiaan L. Knijnenburg, A. C. van Arkel, Bert Meerman, Mark D. Wilkinson, Susanna-Assunta Sansone, Philippe Rocca-Serra, Peter McQuilton, Alejandra N. González-Beltrán, G. J. C. Aben, Patrícia Henning, Maria Simone de Menezes Alencar, C. Ribeiro, C. R. L. Silva, Luís Fernando Sayão, Luana Sales, Viviane Veiga, Jefferson Lima, Simone Dib, Paula Xavier dos Santos, R. Murtinho, Jakob Tendel, B. F. Schaap, P. M. Brouwer, A. K. Gavai, Yamine Bouzembrak, Hans J. P. Marvin, Albert Mons, Tobias Kuhn, A. A. Gambardella, Ricardo de Miranda Azevedo, Vesa Muhonen, Mira van der Naald, N. W. Smit, M. J. Buys, Taco F. de Bruin, Fieke Schoots, H. J. E. Goodson, Henry S. Rzepa, Keith G. Jeffery, Hugh P. Shanahan, M. Axton, Veniamin Tkachenko, Anne Deslattes Mays, Natalie Meyers, Michael Conlon, Laurel L. Haak, Erik A. Schultes:
The FAIR Funder pilot programme to make it easy for funders to require and for grantees to produce FAIR Data. CoRR abs/1902.11162 (2019)

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.