Dynamic Binary Search Trees: Improved Lower Bounds for the Greedy-Future Algorithm.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/stacs/SadehK23
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/stacs/SadehK23
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Haim_Kaplan
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Yaniv_Sadeh
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.4230%2FLIPIcs.STACS.2023.53
>
foaf:
homepage
<
https://doi.org/10.4230/LIPIcs.STACS.2023.53
>
dc:
identifier
DBLP conf/stacs/SadehK23
(xsd:string)
dc:
identifier
DOI doi.org%2F10.4230%2FLIPIcs.STACS.2023.53
(xsd:string)
dcterms:
issued
2023
(xsd:gYear)
rdfs:
label
Dynamic Binary Search Trees: Improved Lower Bounds for the Greedy-Future Algorithm.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Haim_Kaplan
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Yaniv_Sadeh
>
swrc:
pages
53:1-53:21
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/stacs/2023
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/stacs/SadehK23/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/stacs/SadehK23
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/stacs/stacs2023.html#SadehK23
>
rdfs:
seeAlso
<
https://doi.org/10.4230/LIPIcs.STACS.2023.53
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/stacs
>
dc:
title
Dynamic Binary Search Trees: Improved Lower Bounds for the Greedy-Future Algorithm.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document