{"@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/Q1907232","@type":"DigitalObject","kernel":{"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q1907232","digitalObjectType":"https://schema.org/ScholarlyArticle","primaryIdentifier":"mardi:Q1907232","kernelVersion":"v1","immutable":true,"modified":"2025-07-25T14:21:11Z"},"profile":{"@context":"https://schema.org","@type":"ScholarlyArticle","@id":"https://portal.mardi4nfdi.de/entity/Q1907232","name":"Parallel algorithms for arrangements","headline":"Parallel algorithms for arrangements","description":"scientific article; zbMATH DE number 845917","url":"https://portal.mardi4nfdi.de/entity/Q1907232","datePublished":"1996-02-20","author":[{"@id":"https://portal.mardi4nfdi.de/entity/Q1822913"},{"@id":"https://portal.mardi4nfdi.de/entity/Q1193636"},{"@id":"https://portal.mardi4nfdi.de/entity/Q808698"}],"publisher":[{"@id":"https://portal.mardi4nfdi.de/entity/Q96582"}],"identifier":{"@type":"PropertyValue","propertyID":"doi","value":"10.1007/BF01941684","url":"https://doi.org/10.1007/BF01941684"},"sameAs":["https://doi.org/10.1007/BF01941684"],"citation":[{"@id":"https://portal.mardi4nfdi.de/entity/Q1115600"},{"@id":"https://portal.mardi4nfdi.de/entity/Q1907232"},{"@id":"https://portal.mardi4nfdi.de/entity/Q5187396"},{"@id":"https://portal.mardi4nfdi.de/entity/Q3833604"},{"@id":"https://portal.mardi4nfdi.de/entity/Q1082821"},{"@id":"https://portal.mardi4nfdi.de/entity/Q3777447"},{"@id":"https://portal.mardi4nfdi.de/entity/Q1117690"},{"@id":"https://portal.mardi4nfdi.de/entity/Q3772828"},{"@id":"https://portal.mardi4nfdi.de/entity/Q3740283"},{"@id":"https://portal.mardi4nfdi.de/entity/Q5807665"}]},"provenance":{"prov:generatedAtTime":"2025-07-25T14:21:11Z","prov:wasAttributedTo":"MaRDI Knowledge Graph"}}