<http://experiment.worldcat.org/entity/work/data/340772426.nt> <http://rdfs.org/ns/void#inDataset> <http://purl.oclc.org/dataset/WorldCat/Works> .
<http://experiment.worldcat.org/entity/work/data/340772426.nt> <http://schema.org/about> <http://worldcat.org/entity/work/id/340772426> .
<http://worldcat.org/entity/work/id/340772426> <http://schema.org/author> <http://worldcat.org/entity/person/id/2644360634> .
<http://worldcat.org/entity/work/id/340772426> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://schema.org/CreativeWork> .
<http://worldcat.org/entity/work/id/340772426> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://www.productontology.org/id/Thesis> .
<http://worldcat.org/entity/work/id/340772426> <http://schema.org/workExample> <http://www.worldcat.org/oclc/723976359> .
<http://worldcat.org/entity/work/id/340772426> <http://schema.org/name> "New algorithms and lower bounds for sequential access data compression" .
<http://worldcat.org/entity/work/id/340772426> <http://schema.org/workExample> <http://www.worldcat.org/oclc/455632262> .