Cluttered orderings for the complete bipartite graph (Q2576349): Difference between revisions

@@ Property / DOI @@
-.1016/j.dam.2005.06.005
@@ Property / DOI: 10.1016/j.dam.2005.06.005 / 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/j.dam.2005.06.005
+Normal rank
@@ Property / OpenAlex ID @@
+W1985390352
@@ Property / OpenAlex ID: W1985390352 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3998644
@@ Property / cites work: Q3998644 / rank @@
+Normal rank
@@ Property / cites work @@
+Asymptotically optimal erasure-resilient codes for large disk arrays.
+Normal rank
@@ Property / cites work @@
+Optimal and pessimal orderings of Steiner triple systems in disk arrays.
+Normal rank
@@ Property / cites work @@
+Ladder orderings of pairs and RAID performance.
@@ Property / cites work: Ladder orderings of pairs and RAID performance. / rank @@
+Normal rank
@@ Property / cites work @@
+Q4551381
@@ Property / cites work: Q4551381 / rank @@
+Normal rank
@@ Property / cites work @@
+Coding techniques for handling failures in large disk arrays
+Normal rank
@@ Property / DOI @@
+.1016/J.DAM.2005.06.005
@@ Property / DOI: 10.1016/J.DAM.2005.06.005 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2576349