On the paging-complexity of periodic arrangements (Q1239004): Difference between revisions

@@ 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/0304-3975(77)90035-4
+Normal rank
@@ Property / OpenAlex ID @@
+W1988139629
@@ Property / OpenAlex ID: W1988139629 / rank @@
+Normal rank
@@ Property / cites work @@
+Principles of Optimal Page Replacement
@@ Property / cites work: Principles of Optimal Page Replacement / rank @@
+Normal rank
@@ Property / cites work @@
+Q4066554
@@ Property / cites work: Q4066554 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5613193
@@ Property / cites work: Q5613193 / rank @@
+Normal rank
@@ Property / cites work @@
+Organizing matrices and matrix operations for paged memory systems
+Normal rank
@@ Property / cites work @@
+A theorem on linear diophantine equations and the paging-complexity of loop-chains
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1239004