{"@context":["https://w3id.org/fdo/context/v1",{"schema":"https://schema.org/","prov":"http://www.w3.org/ns/prov#","fdo":"https://w3id.org/fdo/vocabulary/"}],"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q4848833","@type":"DigitalObject","kernel":{"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q4848833","digitalObjectType":"https://schema.org/ScholarlyArticle","primaryIdentifier":"mardi:Q4848833","kernelVersion":"v1","immutable":true,"modified":"2024-07-30T09:47:26Z"},"profile":{"@context":"https://schema.org","@type":"ScholarlyArticle","@id":"https://portal.mardi4nfdi.de/entity/Q4848833","name":"SEQUENTIAL AND PARALLEL ALGORITHMS FOR THE k CLOSEST PAIRS PROBLEM","headline":"SEQUENTIAL AND PARALLEL ALGORITHMS FOR THE k CLOSEST PAIRS PROBLEM","description":"scientific article; zbMATH DE number 798770","url":"https://portal.mardi4nfdi.de/entity/Q4848833","datePublished":"1996-02-26","author":[{"@id":"https://portal.mardi4nfdi.de/entity/Q1585326"},{"@id":"https://portal.mardi4nfdi.de/entity/Q582044"}],"publisher":[{"@id":"https://portal.mardi4nfdi.de/entity/Q96577"}],"identifier":{"@type":"PropertyValue","propertyID":"doi","value":"10.1142/S0218195995000167","url":"https://doi.org/10.1142/S0218195995000167"},"sameAs":["https://doi.org/10.1142/S0218195995000167"]},"provenance":{"prov:generatedAtTime":"2024-07-30T09:47:26Z","prov:wasAttributedTo":"MaRDI Knowledge Graph"}}