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
Research output
Prizes
Activities
Press/Media
Search by expertise, name or affiliation
Feasible schedules for rotating transmissions
Noga Alon
*
*
Corresponding author for this work
School of Computer Science
Institute for Advanced Studies
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
Keyphrases
Closed Intervals
100%
Disjoint
100%
Dyson Conjecture
100%
Feasible Schedule
100%
Multivariate Polynomials
100%
Optical Networks
100%
Positive Integer
100%
Real numbers
100%
Scheduling Problem
100%
Unit Circle
100%
Mathematics
Closed Interval
100%
Modulo
100%
Optical Networks
100%
Pairwise Disjoint
100%
Polynomial
100%
Positive Integer
100%
Real Number
100%
Unit Circle
100%