Dynamic placement of records and the classical occupancy problem (Q1145997): Difference between revisions

@@ Property / author @@
+Matyas Arato
@@ Property / author: Matyas Arato / rank @@
+Normal rank
@@ Property / author @@
+András A. Benczúr
@@ Property / author: András A. Benczúr / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0898-1221(81)90117-6
+Normal rank
@@ Property / OpenAlex ID @@
+W2049370018
@@ Property / OpenAlex ID: W2049370018 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5812325
@@ Property / cites work: Q5812325 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimizing expected travel time on geometrical patterns by optimal probability rearrangements
+Normal rank
@@ Property / cites work @@
+On the Optimality of the Probability Ranking Scheme in Storage Applications
+Normal rank
@@ Property / cites work @@
+Dynamic Placement of Records in Linear Storage
@@ Property / cites work: Dynamic Placement of Records in Linear Storage / rank @@
+Normal rank
@@ Property / cites work @@
+Q4113392
@@ Property / cites work: Q4113392 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4139668
@@ Property / cites work: Q4139668 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3908462
@@ Property / cites work: Q3908462 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5620889
@@ Property / cites work: Q5620889 / rank @@
+Normal rank
@@ Property / cites work @@
+Placement of Records on a Secondary Storage Device to Minimize Access Time
+Normal rank