{"@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/Q1114403","@type":"DigitalObject","kernel":{"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q1114403","digitalObjectType":"https://schema.org/ScholarlyArticle","primaryIdentifier":"mardi:Q1114403","kernelVersion":"v1","immutable":true,"modified":"2026-01-06T20:11:25Z"},"profile":{"@context":"https://schema.org","@type":"ScholarlyArticle","@id":"https://portal.mardi4nfdi.de/entity/Q1114403","name":"On saving space in parallel computation","headline":"On saving space in parallel computation","description":"scientific article; zbMATH DE number 4082978","url":"https://portal.mardi4nfdi.de/entity/Q1114403","datePublished":"1988-00-00","author":[{"@id":"https://portal.mardi4nfdi.de/entity/Q415280"}],"publisher":[{"@id":"https://portal.mardi4nfdi.de/entity/Q63092"}],"identifier":{"@type":"PropertyValue","propertyID":"doi","value":"10.1016/0020-0190(88)90233-5","url":"https://doi.org/10.1016/0020-0190(88)90233-5"},"sameAs":["https://doi.org/10.1016/0020-0190(88)90233-5"],"comment":"The literature on parallel computing describes a number of algorithms whose space requirements exceed their time-processor product. Generalizing an idea by \\textit{R. Cole} and \\textit{U. Vishkin} [Approximate parallel scheduling II, Preprint (1987)] and combining it with a well known trick for avoiding initialization of memory areas, we show that in the CRCW PRAM model of computation, such anomalies can always be kept within bounds.","citation":[{"@id":"https://portal.mardi4nfdi.de/entity/Q4773298"},{"@id":"https://portal.mardi4nfdi.de/entity/Q3219751"}]},"provenance":{"prov:generatedAtTime":"2026-01-06T20:11:25Z","prov:wasAttributedTo":"MaRDI Knowledge Graph"}}