[RDF data]
Home | Example Publications
PropertyValue
dcterms:bibliographicCitation <http://dblp.uni-trier.de/rec/bibtex/conf/alenex/VialDEGJ18>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/David_Eppstein>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Juan_Jos%E2%88%9A%C2%A9_Besa_Vial>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Michael_T._Goodrich>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Timothy_Johnson>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/William_E._Devanny>
foaf:homepage <http://dx.doi.org/doi.org%2F10.1137%2F1.9781611975055.8>
foaf:homepage <https://doi.org/10.1137/1.9781611975055.8>
dc:identifier DBLP conf/alenex/VialDEGJ18 (xsd:string)
dc:identifier DOI doi.org%2F10.1137%2F1.9781611975055.8 (xsd:string)
dcterms:issued 2018 (xsd:gYear)
rdfs:label Quadratic Time Algorithms Appear to be Optimal for Sorting Evolving Data. (xsd:string)
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/David_Eppstein>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Juan_Jos%E2%88%9A%C2%A9_Besa_Vial>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Michael_T._Goodrich>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Timothy_Johnson>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/William_E._Devanny>
swrc:pages 87-96 (xsd:string)
dcterms:partOf <https://dblp.l3s.de/d2r/resource/publications/conf/alenex/2018>
owl:sameAs <http://bibsonomy.org/uri/bibtexkey/conf/alenex/VialDEGJ18/dblp>
owl:sameAs <http://dblp.rkbexplorer.com/id/conf/alenex/VialDEGJ18>
rdfs:seeAlso <http://dblp.uni-trier.de/db/conf/alenex/alenex2018.html#VialDEGJ18>
rdfs:seeAlso <https://doi.org/10.1137/1.9781611975055.8>
swrc:series <https://dblp.l3s.de/d2r/resource/conferences/alenex>
dc:title Quadratic Time Algorithms Appear to be Optimal for Sorting Evolving Data. (xsd:string)
dc:type <http://purl.org/dc/dcmitype/Text>
rdf:type swrc:InProceedings
rdf:type foaf:Document