{
  "@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:W00310029300",
      "author": {
        "@id": "http://urn.fi/URN:NBN:fi:au:pn:000047062"
      },
      "name": "On the worst case of a minimal spanning tree algorithm for Euclidean space"
    },
    {
      "@id": "http://urn.fi/URN:NBN:fi:bib:me:W00162253600",
      "author": {
        "@id": "http://urn.fi/URN:NBN:fi:au:pn:000047062"
      },
      "name": "A note on the complexity of trie compaction"
    },
    {
      "@id": "http://urn.fi/URN:NBN:fi:bib:me:W00310025000",
      "contributor": {
        "@id": "http://urn.fi/URN:NBN:fi:au:pn:000047062"
      },
      "name": "A minimal spanning tree algorithm for a point set in Euclidean space"
    },
    {
      "@id": "http://urn.fi/URN:NBN:fi:bib:me:W00734074500",
      "contributor": {
        "@id": "http://urn.fi/URN:NBN:fi:au:pn:000047062"
      },
      "name": "Systemoinnin seminaariesitelmät 1984 : [2]"
    },
    {
      "@id": "http://urn.fi/URN:NBN:fi:bib:me:W00310033800",
      "contributor": {
        "@id": "http://urn.fi/URN:NBN:fi:au:pn:000047062"
      },
      "name": "Notes on the complexity of sorting in abstract machines"
    },
    {
      "@id": "http://urn.fi/URN:NBN:fi:au:pn:000047062",
      "@type": "Person",
      "name": "Katajainen, Jyrki"
    },
    {
      "@id": "http://urn.fi/URN:NBN:fi:bib:me:W00310042700",
      "contributor": {
        "@id": "http://urn.fi/URN:NBN:fi:au:pn:000047062"
      },
      "name": "Proceedings of the second Finnish Summer School on Theoretical Computer Science : Parainen, Finland, August 26-29, 1985"
    },
    {
      "@id": "http://urn.fi/URN:NBN:fi:bib:me:W00310050900",
      "author": {
        "@id": "http://urn.fi/URN:NBN:fi:au:pn:000047062"
      },
      "name": "Bucketing and filtering in computational geometry"
    },
    {
      "@id": "http://urn.fi/URN:NBN:fi:bib:me:W00310033500",
      "author": {
        "@id": "http://urn.fi/URN:NBN:fi:au:pn:000047062"
      },
      "name": "An implementation of Cheriton-Tarjan's minimal spanning tree algorithm using ordered subsets"
    },
    {
      "@id": "http://urn.fi/URN:NBN:fi:bib:me:W00310048500",
      "author": {
        "@id": "http://urn.fi/URN:NBN:fi:au:pn:000047062"
      },
      "name": "Simulation of turing machines by random access machines in O(T[square root]log S) time"
    },
    {
      "@id": "http://urn.fi/URN:NBN:fi:bib:me:W00162181300",
      "author": {
        "@id": "http://urn.fi/URN:NBN:fi:au:pn:000047062"
      },
      "name": "On the relationship between minimum matchings and Delaunay graphs in the L[sub p]-metric"
    }
  ]
}