{"@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/Q4199544","@type":"DigitalObject","kernel":{"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q4199544","digitalObjectType":"https://schema.org/ScholarlyArticle","primaryIdentifier":"mardi:Q4199544","kernelVersion":"v1","immutable":true,"modified":"2024-03-20T00:51:59Z"},"profile":{"@context":"https://schema.org","@type":"ScholarlyArticle","@id":"https://portal.mardi4nfdi.de/entity/Q4199544","name":"Efficient Ordering of Hash Tables","headline":"Efficient Ordering of Hash Tables","description":"scientific article; zbMATH DE number 3640891","url":"https://portal.mardi4nfdi.de/entity/Q4199544","datePublished":"1979-00-00","author":[{"@id":"https://portal.mardi4nfdi.de/entity/Q876701"},{"@id":"https://portal.mardi4nfdi.de/entity/Q287449"}],"publisher":[{"@id":"https://portal.mardi4nfdi.de/entity/Q84798"}],"identifier":{"@type":"PropertyValue","propertyID":"doi","value":"10.1137/0208038","url":"https://doi.org/10.1137/0208038"},"sameAs":["https://doi.org/10.1137/0208038"]},"provenance":{"prov:generatedAtTime":"2024-03-20T00:51:59Z","prov:wasAttributedTo":"MaRDI Knowledge Graph"}}