A
Alon Itai
Researcher at Technion – Israel Institute of Technology
Publications - 86
Citations - 8594
Alon Itai is an academic researcher from Technion – Israel Institute of Technology. The author has contributed to research in topics: Randomized algorithm & Deterministic algorithm. The author has an hindex of 38, co-authored 86 publications receiving 8197 citations. Previous affiliations of Alon Itai include University of California, Berkeley & University of Chicago.
Papers
More filters
Journal ArticleDOI
On the Complexity of Timetable and Multicommodity Flow Problems
Shimon Even,Alon Itai,Adi Shamir +2 more
TL;DR: A very primitive version of Gotlieb’s timetable problem is shown to be NP-complete, and therefore all the common timetable problems areNP-complete.
Journal ArticleDOI
A fast and simple randomized parallel algorithm for the maximal independent set problem
TL;DR: A technique due to A. Joffe (1974) is applied and deterministic construction in fast parallel time of various combinatorial objects whose existence follows from probabilistic arguments is obtained.
Journal ArticleDOI
Hamilton Paths in Grid Graphs
TL;DR: This work gives necessary and sufficient conditions for the graph to have a Hamilton path between these two nodes, and provides a new, relatively simple, proof of the result that the Euclidean traveling salesman problem is NP-complete.
Journal ArticleDOI
On the time-complexity of broadcast in multi-hop radio networks: an exponential gap between determinism and randomization
TL;DR: It is shown that any deterministic broadcast protocol requires 8(n) time-slots, even if the network has diameter 3, and n is known to all processors, which demonstrates an exponential gap in complexity between randomization and determinism.
Proceedings ArticleDOI
On the complexity of time table and multi-commodity flow problems
Shimon Even,Alon Itai,Adi Shamir +2 more
TL;DR: The theorem that a meeting function always exists if all teachers and classes have no time constraints is proved and the multi-commodity integral flow problem is shown to be NP-complete even if the number of commodities is two.