Optimal lower bounds for projective list update algorithms.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/journals/talg/AmbuhlGS13
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/talg/AmbuhlGS13
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Bernd_G%E2%88%9A%C2%A7rtner
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Bernhard_von_Stengel
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Christoph_Amb%E2%88%9A%C4%BEhl
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1145%2F2500120
>
foaf:
homepage
<
https://doi.org/10.1145/2500120
>
dc:
identifier
DBLP journals/talg/AmbuhlGS13
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1145%2F2500120
(xsd:string)
dcterms:
issued
2013
(xsd:gYear)
swrc:
journal
<
https://dblp.l3s.de/d2r/resource/journals/talg
>
rdfs:
label
Optimal lower bounds for projective list update algorithms.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Bernd_G%E2%88%9A%C2%A7rtner
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Bernhard_von_Stengel
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Christoph_Amb%E2%88%9A%C4%BEhl
>
swrc:
number
4
(xsd:string)
swrc:
pages
31:1-31:18
(xsd:string)
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/talg/AmbuhlGS13/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/talg/AmbuhlGS13
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/journals/talg/talg9.html#AmbuhlGS13
>
rdfs:
seeAlso
<
https://doi.org/10.1145/2500120
>
dc:
title
Optimal lower bounds for projective list update algorithms.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:Article
rdf:
type
foaf:Document
swrc:
volume
9
(xsd:string)