{"@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/Q3580962","@type":"DigitalObject","kernel":{"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q3580962","digitalObjectType":"https://schema.org/ScholarlyArticle","primaryIdentifier":"mardi:Q3580962","kernelVersion":"v1","immutable":true,"modified":"2026-01-08T08:55:17Z"},"profile":{"@context":"https://schema.org","@type":"ScholarlyArticle","@id":"https://portal.mardi4nfdi.de/entity/Q3580962","name":"Sorting and searching in the presence of memory faults (without redundancy)","headline":"Sorting and searching in the presence of memory faults (without redundancy)","description":"scientific article; zbMATH DE number 5770701","url":"https://portal.mardi4nfdi.de/entity/Q3580962","datePublished":"2010-08-15","author":[{"@id":"https://portal.mardi4nfdi.de/entity/Q458450"},{"@id":"https://portal.mardi4nfdi.de/entity/Q270020"}],"publisher":[{"@id":"https://portal.mardi4nfdi.de/entity/Q3580947"}],"identifier":{"@type":"PropertyValue","propertyID":"doi","value":"10.1145/1007352.1007375","url":"https://doi.org/10.1145/1007352.1007375"},"sameAs":["https://doi.org/10.1145/1007352.1007375"]},"provenance":{"prov:generatedAtTime":"2026-01-08T08:55:17Z","prov:wasAttributedTo":"MaRDI Knowledge Graph"}}