[RDF data]
Home | Example Publications
PropertyValue
dcterms:bibliographicCitation <http://dblp.uni-trier.de/rec/bibtex/conf/focs/FiatMRW95>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Adi_Ros%E2%88%9A%C2%A9n>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Amos_Fiat>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Orli_Waarts>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Yishay_Mansour>
foaf:homepage <http://dx.doi.org/doi.org%2F10.1109%2FSFCS.1995.492570>
foaf:homepage <https://doi.org/10.1109/SFCS.1995.492570>
dc:identifier DBLP conf/focs/FiatMRW95 (xsd:string)
dc:identifier DOI doi.org%2F10.1109%2FSFCS.1995.492570 (xsd:string)
dcterms:issued 1995 (xsd:gYear)
rdfs:label Competitive Access Time via Dynamic Storage Rearrangement (Preliminary Version). (xsd:string)
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Adi_Ros%E2%88%9A%C2%A9n>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Amos_Fiat>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Orli_Waarts>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Yishay_Mansour>
swrc:pages 392-401 (xsd:string)
dcterms:partOf <https://dblp.l3s.de/d2r/resource/publications/conf/focs/1995>
owl:sameAs <http://bibsonomy.org/uri/bibtexkey/conf/focs/FiatMRW95/dblp>
owl:sameAs <http://dblp.rkbexplorer.com/id/conf/focs/FiatMRW95>
rdfs:seeAlso <http://dblp.uni-trier.de/db/conf/focs/focs95.html#FiatMRW95>
rdfs:seeAlso <https://doi.org/10.1109/SFCS.1995.492570>
swrc:series <https://dblp.l3s.de/d2r/resource/conferences/focs>
dc:subject graph theory; storage allocation; competitive algorithms; computational complexity; database management systems; optimisation; tree data structures; operations research; competitive access time; dynamic storage rearrangement; warehouse; undirected graph; server; industrial stacker crane warehouse; automatic robot run warehouse; disk track optimization; two dimensional memory management; bubble memory; mass storage systems; doubly linked list management; process migration; probability distribution; competitive algorithms; upper bounds; lower bounds; disk storage; database; tree structure (xsd:string)
dc:title Competitive Access Time via Dynamic Storage Rearrangement (Preliminary Version). (xsd:string)
dc:type <http://purl.org/dc/dcmitype/Text>
rdf:type swrc:InProceedings
rdf:type foaf:Document