The following pages link to Violet R. Syrotiuk (Q658090):
Displaying 19 items.
- Grooming traffic to minimize load (Q658091) (← links)
- Wang tilings and distributed verification on anonymous torus networks (Q675863) (← links)
- On a combinatorial framework for fault characterization (Q1616211) (← links)
- Separating interaction effects using locating and detecting arrays (Q1671021) (← links)
- A hierarchical framework for recovery in compressive sensing (Q1693135) (← links)
- Cover-free families and topology-transparent scheduling for MANETs (Q1877340) (← links)
- Strengthening hash families and compressive sensing (Q1932362) (← links)
- Detecting arrays for main effects (Q2175414) (← links)
- Directed complete bipartite graph decompositions: indirect constructions (Q2468018) (← links)
- Transport schemes for topology-transparent scheduling (Q2471060) (← links)
- Variable Weight Sequences for Adaptive Scheduled Access in MANETs (Q2907277) (← links)
- Lower bounds for two-period grooming via linear programming duality (Q3548731) (← links)
- Grooming for two-period optical networks (Q3548732) (← links)
- Ternary Schedules for Energy-Limited Sensor Networks (Q3549049) (← links)
- (Q3793720) (← links)
- Covering strong separating hash families (Q4993007) (← links)
- (Q5133659) (← links)
- (Q5488379) (← links)
- Detecting arrays for effects of single factors (Q6086392) (← links)
