{"@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/Q697003","@type":"DigitalObject","kernel":{"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q697003","digitalObjectType":"https://schema.org/ScholarlyArticle","primaryIdentifier":"mardi:Q697003","kernelVersion":"v1","immutable":true,"modified":"2026-01-03T06:45:29Z"},"profile":{"@context":"https://schema.org","@type":"ScholarlyArticle","@id":"https://portal.mardi4nfdi.de/entity/Q697003","name":"Optimal and efficient algorithms for summing and prefix summing on parallel machines","headline":"Optimal and efficient algorithms for summing and prefix summing on parallel machines","description":"scientific article; zbMATH DE number 1800328","url":"https://portal.mardi4nfdi.de/entity/Q697003","datePublished":"2002-09-12","author":[{"@id":"https://portal.mardi4nfdi.de/entity/Q697002"}],"publisher":[{"@id":"https://portal.mardi4nfdi.de/entity/Q86622"}],"identifier":{"@type":"PropertyValue","propertyID":"doi","value":"10.1006/JPDC.2000.1698","url":"https://doi.org/10.1006/JPDC.2000.1698"},"sameAs":["https://doi.org/10.1006/JPDC.2000.1698"]},"provenance":{"prov:generatedAtTime":"2026-01-03T06:45:29Z","prov:wasAttributedTo":"MaRDI Knowledge Graph"}}