Transport schemes for topology-transparent scheduling (Q2471060): Difference between revisions

@@ Property / cites work @@
+Q4263658
@@ Property / cites work: Q4263658 / rank @@
+Normal rank
@@ Property / cites work @@
+Cover-free families and topology-transparent scheduling for MANETs
+Normal rank
@@ Property / cites work @@
+Families of finite sets in which no intersection of \(\ell\) sets is covered by the union of \(s\) others
+Normal rank
@@ Property / cites work @@
+Families of finite sets in which no set is covered by the union of \(r\) others
+Normal rank
@@ Property / cites work @@
+Orthogonal arrays. Theory and applications
@@ Property / cites work: Orthogonal arrays. Theory and applications / rank @@
+Normal rank
@@ Property / cites work @@
+On the upper bound of the size of the \(r\)-cover-free families
+Normal rank
@@ Property / cites work @@
+Some new bounds for cover-free families
@@ Property / cites work: Some new bounds for cover-free families / rank @@
+Normal rank
@@ Property / cites work @@
+A five-phase reservation protocol (FPRP) for mobile ad hoc networks
+Normal rank