Skip to main navigation
Skip to search
Skip to main content
Tel Aviv University Home
Update Request & User Guide (TAU staff only)
Home
Experts
Research units
Equipment
Research output
Prizes
Activities
Search by expertise, name or affiliation
Feasible schedules for rotating transmissions
Noga Alon
*
*
Corresponding author for this work
School of Computer Science
Research output
:
Contribution to journal
›
Article
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Feasible schedules for rotating transmissions'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Mathematics
Arbitrary
24%
Closed interval
55%
Disjoint
37%
Integer
24%
Modulo
39%
Multivariate Polynomials
52%
Non-negative
65%
Optical Networks
69%
Pairwise
41%
Rotating
94%
Schedule
100%
Scheduling Problem
48%
Unit circle
46%
Engineering & Materials Science
Fiber optic networks
97%
Polynomials
73%
Scheduling
65%