{"@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/Q666192","@type":"DigitalObject","kernel":{"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q666192","digitalObjectType":"https://schema.org/ScholarlyArticle","primaryIdentifier":"mardi:Q666192","kernelVersion":"v1","immutable":true,"modified":"2026-01-18T05:14:01Z"},"profile":{"@context":"https://schema.org","@type":"ScholarlyArticle","@id":"https://portal.mardi4nfdi.de/entity/Q666192","name":"Lock-free parallel dynamic programming","headline":"Lock-free parallel dynamic programming","description":"scientific article; zbMATH DE number 6012871","url":"https://portal.mardi4nfdi.de/entity/Q666192","datePublished":"2012-03-07","author":[{"@id":"https://portal.mardi4nfdi.de/entity/Q523249"},{"@id":"https://portal.mardi4nfdi.de/entity/Q264991"},{"@id":"https://portal.mardi4nfdi.de/entity/Q666191"},{"@id":"https://portal.mardi4nfdi.de/entity/Q265706"},{"@id":"https://portal.mardi4nfdi.de/entity/Q488323"}],"publisher":[{"@id":"https://portal.mardi4nfdi.de/entity/Q86622"}],"identifier":{"@type":"PropertyValue","propertyID":"doi","value":"10.1016/J.JPDC.2010.01.004","url":"https://doi.org/10.1016/J.JPDC.2010.01.004"},"sameAs":["https://doi.org/10.1016/J.JPDC.2010.01.004"],"citation":[{"@id":"https://portal.mardi4nfdi.de/entity/Q3241581"},{"@id":"https://portal.mardi4nfdi.de/entity/Q2892372"},{"@id":"https://portal.mardi4nfdi.de/entity/Q3116647"},{"@id":"https://portal.mardi4nfdi.de/entity/Q3705254"},{"@id":"https://portal.mardi4nfdi.de/entity/Q5900519"},{"@id":"https://portal.mardi4nfdi.de/entity/Q5729523"},{"@id":"https://portal.mardi4nfdi.de/entity/Q807386"},{"@id":"https://portal.mardi4nfdi.de/entity/Q1127215"}]},"provenance":{"prov:generatedAtTime":"2026-01-18T05:14:01Z","prov:wasAttributedTo":"MaRDI Knowledge Graph"}}