- M. Lipshteyn et al. (Eds.): Golumbic Festschrift, LNCS 5420, pp. 6676, 2009. Springer-Verlag Berlin Heidelberg 2009
- SYMMETRY BREAKING IN DISTRIBUTED NETWORKS Alon Itai Michael Rodeh
- SIAM J. COMPUT. Vol. 7, No. 4, November 1978
- Programming S. L. Graham, R. L. Rivest
- SlAM J. COMPUT. Vol. 11, No. 4, November 1982
- Strongly Competitive Algorithms for Caching with Pipelined Prefetching
- The Multi-Tree Approach to Reliability in Distributed Networks Computer Science Department
- Detecting Data Structures from Traces Alon Itai Michael Slavkin
- A Linguistic Search Tool for Semitic Languages Knowledge Center for Processing Hebrew
- How to Pronounce Hebrew Names Alon Itai and Gai Shaked
- Randomized Broadcasting in Radio Networks, 1992; Reuven Bar-Yehuda, Oded Goldreich, Alon Itai
- Language Resources for Hebrew Department of Computer Science, Technion, Israel Institute of Technology, 32000
- Two-CommodityFlow Technion--lsrael Instituteof Technology
- Visualization of splay trees Performed by Vladimir Yanovsky
- THREE TREE-PATHS Avram Zehavi
- Using Movie Subtitles for Creating a Large-Scale Bilingual Corpora Einav Itamar, Alon Itai
- SIAM J. COMPUT. Vol. 8, No. 2, May 1979
- Appendix B: Following is the set of rules used for Hebrew in order to automatically generate the SW set for every
- Some Matching Problems for Bipartite Graphs Techmon-lsrael Institute of Technology, Hatfa. Israel
- SIAM J. COMPUT. Vol. 16, No. 1, February 1987
- SIAM J. COMPUT. Voi. 5, No. 1, March 1976
- RESEARCHCONTRIBUTIONS Algorithms and
