{
  "@context": {
    "@vocab": "http://schema.org/",
    "rdau": "http://rdaregistry.info/Elements/u/",
    "skos": "http://www.w3.org/2004/02/skos/core#",
    "skos:prefLabel": {
      "@container": "@language"
    }
  },
  "@graph": [
    {
      "@id": "http://urn.fi/URN:NBN:fi:bib:me:W00310025100",
      "contributor": {
        "@id": "http://urn.fi/URN:NBN:fi:au:pn:000042118"
      },
      "name": "A note on a minimal spanning tree algorithm for Euclidean space"
    },
    {
      "@id": "http://urn.fi/URN:NBN:fi:bib:me:W00310035300",
      "author": {
        "@id": "http://urn.fi/URN:NBN:fi:au:pn:000042118"
      },
      "name": "Studies on techniques in data compression"
    },
    {
      "@id": "http://urn.fi/URN:NBN:fi:au:pn:000042118",
      "@type": "Person",
      "name": "Ernvall, Jarmo"
    },
    {
      "@id": "http://urn.fi/URN:NBN:fi:bib:me:W00310029200",
      "contributor": {
        "@id": "http://urn.fi/URN:NBN:fi:au:pn:000042118"
      },
      "name": "On the assembler implementation of a distributive sorting program"
    },
    {
      "@id": "http://urn.fi/URN:NBN:fi:bib:me:W00310025000",
      "author": {
        "@id": "http://urn.fi/URN:NBN:fi:au:pn:000042118"
      },
      "name": "A minimal spanning tree algorithm for a point set in Euclidean space"
    }
  ]
}