| 2009 | ||
|---|---|---|
| c32 | Fanica Gavril, Alon Itai: Covering a Tree by a Forest. Graph Theory, Computational Intelligence and Thought 2009: 66-76 | |
| 2008 | ||
| j44 | Alon Itai, Shuly Wintner: Language resources for Hebrew. Language Resources and Evaluation 42(1): 75-98 (2008) | |
| c31 | Einav Itamar, Alon Itai: Using Movie Subtitles for Creating a Large-Scale Bilingual Corpora. LREC 2008 | |
| r1 | ||
| 2007 | ||
| j43 | ||
| 2006 | ||
| c30 | ||
| 2004 | ||
| j42 | Alexander Gaysinsky, Alon Itai, Hadas Shachnai: Strongly competitive algorithms for caching with pipelined prefetching. Inf. Process. Lett. 91(1): 19-27 (2004) | |
| 2002 | ||
| j41 | Alon Itai, Michael Rodeh, Hadas Shachnai: The passport control problem or how to keep a dynamic service system load balanced? Theor. Comput. Sci. 282(2): 303-318 (2002) | |
| 2001 | ||
| j40 | Alon Efrat, Alon Itai, Matthew J. Katz: Geometry Helps in Bottleneck Matching and Related Problems. Algorithmica 31(1): 1-28 (2001) | |
| j39 | Alon Itai: Generating permutations and combinations in lexicographical order. J. Braz. Comp. Soc. 7(3): 65-68 (2001) | |
| c29 | Alexander Gaysinsky, Alon Itai, Hadas Shachnai: Strongly Competitive Algorithms for Caching with Pipelined Prefetching. ESA 2001: 49-61 | |
| 1999 | ||
| j38 | Yefim Dinitz, Alon Itai, Michael Rodeh: On an Algorithm of Zemlyachenko for Subtree Isomorphism. Inf. Process. Lett. 70(3): 141-146 (1999) | |
| j37 | ||
| 1998 | ||
| c28 | Joseph Gil, Alon Itai: The Complexity of Type Analysis of Object Oriented Programs. ECOOP 1998: 601-634 | |
| 1996 | ||
| j36 | Alon Itai, Hadas Shachnai: Adaptive Source Routing in High-Speed Networks. J. Algorithms 20(2): 218-243 (1996) | |
| j35 | Nechama Allenberg-Navony, Alon Itai, Shlomo Moran: Average and Randomized Complexity of Distributed Problems. SIAM J. Comput. 25(6): 1254-1267 (1996) | |
| c27 | Alon Efrat, Alon Itai: Improvements on Bottleneck Matching and Related Problems Using Geometry. Symposium on Computational Geometry 1996: 301-310 | |
| 1995 | ||
| j34 | Moshe Levinger, Uzzi Ornan, Alon Itai: Learning Morpho-Lexical Probabilities from an Untagged Corpus with an Application to Hebrew. Computational Linguistics 21(3): 383-404 (1995) | |
| j33 | Shai Ben-David, Alon Itai, Eyal Kushilevitz: Learning by Distances. Inf. Comput. 117(2): 240-250 (1995) | |
| j32 | Rajeev Alur, Alon Itai, Robert P. Kurshan, Mihalis Yannakakis: Timing Verification by Successive Approximation. Inf. Comput. 118(1): 142-157 (1995) | |
| c26 | ||
| 1994 | ||
| j31 | Ido Dagan, Alon Itai: Word Sense Disambiguation Using a Second Language Monolingual Corpus. Computational Linguistics 20(4): 563-596 (1994) | |
| j30 | ||
| j29 | Shmuel Gal, Yona Hollander, Alon Itai: Optimal mapping in direct mapped cache environments. Math. Program. 63: 371-387 (1994) | |
| c25 | ||
| c24 | Nechama Allenberg-Navony, Alon Itai, Shlomo Moran: Average and Randomized Complexity of Distributed Problems. WDAG 1994: 311-325 | |
| 1993 | ||
| j28 | Reuven Bar-Yehuda, Amos Israeli, Alon Itai: Multiple Communication in Multihop Radio Networks. SIAM J. Comput. 22(4): 875-887 (1993) | |
| c23 | Reuven Bar-Yehuda, Alon Efrat, Alon Itai: A Simple Algorithm for Maintaining the Center of a Planar Point-set. CCCG 1993: 252-257 | |
| c22 | ||
| 1992 | ||
| j27 | Reuven Bar-Yehuda, Oded Goldreich, Alon Itai: On the Time-Complexity of Broadcast in Multi-hop Radio Networks: An Exponential Gap Between Determinism and Randomization. J. Comput. Syst. Sci. 45(1): 104-126 (1992) | |
| c21 | Rajeev Alur, Alon Itai, Robert P. Kurshan, Mihalis Yannakakis: Timing Verification by Successive Approximation. CAV 1992: 137-150 | |
| c20 | ||
| c19 | Shmuel Gal, Yona Hollander, Alon Itai: Optimal Mapping in Direct Mapped Cache Environments. ISTCS 1992: 91-102 | |
| 1991 | ||
| j26 | Ido Dagan, Alon Itai: A set expression based inheritance system. Ann. Math. Artif. Intell. 4: 269-280 (1991) | |
| j25 | Reuven Bar-Yehuda, Oded Goldreich, Alon Itai: Efficient Emulation of Single-Hop Radio Network with Collision Detection on Multi-Hop Radio Network with no Collision Detection. Distributed Computing 5: 67-71 (1991) | |
| j24 | Gyora M. Benedek, Alon Itai: Learnability with Respect to Fixed Distributions. Theor. Comput. Sci. 86(2): 377-390 (1991) | |
| c18 | Ido Dagan, Alon Itai, Ulrike Schwall: Two Languages Are More Informative Than One. ACL 1991: 130-137 | |
| c17 | ||
| 1990 | ||
| j23 | Alon Itai, Michael Rodeh: Symmetry breaking in distributed networks. Inf. Comput. 88(1): 60-87 (1990) | |
| j22 | Alon Itai, Shay Kutten, Yaron Wolfstahl, Shmuel Zaks: Optimal Distributed t-Resilient Election in Complete Networks. IEEE Trans. Software Eng. 16(4): 415-420 (1990) | |
| c16 | Ido Dagan, Alon Itai: Automatic Processing of Large Corpora for the Resolution of Anaphora References. COLING 1990: 330-332 | |
| c15 | ||
| 1989 | ||
| j21 | ||
| c14 | Reuven Bar-Yehuda, Oded Goldreich, Alon Itai: Efficient Emulation of Single-Hop Radio Network with Collision Detection on Multi-Hop Radio Network with no Collision Detection. WDAG 1989: 24-32 | |
| 1988 | ||
| j20 | Alon Itai, Yoav Raz: The Number of Buffers Required for Sequential Processing of a Disk File. Commun. ACM 31(11): 1338-1342 (1988) | |
| j19 | Alon Itai, Michael Rodeh: The Multi-Tree Approach to Reliability in Distributed Networks. Inf. Comput. 79(1): 43-59 (1988) | |
| c13 | ||
| c12 | ||
| 1987 | ||
| j18 | Alon Itai, Johann A. Makowsky: Unification as a Complexity Measure for Logic Programming. J. Log. Program. 4(2): 105-117 (1987) | |
| j17 | Oded Shmueli, Alon Itai: Complexity of Views: Tree and Cyclic Schemas. SIAM J. Comput. 16(1): 17-37 (1987) | |
| c11 | Reuven Bar-Yehuda, Oded Goldreich, Alon Itai: On the Time-Complexity of Broadcast in Radio Networks: An Exponential Gap Between Determinism and Randomization. PODC 1987: 98-108 | |
| 1986 | ||
| j16 | Amos Israeli, Alon Itai: A Fast and Simple Randomized Parallel Algorithm for Maximal Matching. Inf. Process. Lett. 22(2): 77-80 (1986) | |
| j15 | Noga Alon, László Babai, Alon Itai: A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem. J. Algorithms 7(4): 567-583 (1986) | |
| 1985 | ||
| j14 | ||
| c10 | ||
| 1984 | ||
| j13 | ||
| c9 | Alon Itai, Michael Rodeh: The Multi-Tree Approach to Reliability in Distributed Networks. FOCS 1984: 137-147 | |
| c8 | ||
| 1983 | ||
| c7 | Alon Itai, Zvi Rosberg: A Golden Ratio Control Policy for a Communication Channel. Computer Performance and Reliability 1983: 387-401 | |
| 1982 | ||
| j12 | ||
| j11 | Alon Itai, Yehoshua Perl, Yossi Shiloach: The complexity of finding maximum disjoint paths with length constraints. Networks 12(3): 277-286 (1982) | |
| j10 | Alon Itai, Christos H. Papadimitriou, Jayme Luiz Szwarcfiter: Hamilton Paths in Grid Graphs. SIAM J. Comput. 11(4): 676-686 (1982) | |
| 1981 | ||
| j9 | Alon Itai, Richard J. Lipton, Christos H. Papadimitriou, Michael Rodeh: Covering Graphs by Simple Circuits. SIAM J. Comput. 10(4): 746-750 (1981) | |
| c6 | ||
| c5 | Alon Itai, Alan G. Konheim, Michael Rodeh: A Sparse Table Implementation of Priority Queues. ICALP 1981: 417-431 | |
| 1979 | ||
| j8 | Alon Itai: A Randomized Algorithm for Checking Equivalence of Circular Lists. Inf. Process. Lett. 9(3): 118-121 (1979) | |
| j7 | ||
| 1978 | ||
| j6 | Yehoshua Perl, Alon Itai, Haim Avni: Interpolation Search - A Log Log N Search. Commun. ACM 21(7): 550-553 (1978) | |
| j5 | Alon Itai, Michael Rodeh, Steven L. Tanimoto: Some Matching Problems for Bipartite Graphs. J. ACM 25(4): 517-525 (1978) | |
| j4 | ||
| j3 | Alon Itai, Michael Rodeh: Finding a Minimum Circuit in a Graph. SIAM J. Comput. 7(4): 413-423 (1978) | |
| c4 | ||
| 1977 | ||
| c3 | ||
| c2 | ||
| 1976 | ||
| j2 | ||
| j1 | Shimon Even, Alon Itai, Adi Shamir: On the Complexity of Timetable and Multicommodity Flow Problems. SIAM J. Comput. 5(4): 691-703 (1976) | |
| 1975 | ||
| c1 | Shimon Even, Alon Itai, Adi Shamir: On the Complexity of Timetable and Multi-Commodity Flow Problems. FOCS 1975: 184-193 | |
Colors in the list of coauthors
Last update Sun May 19 08:51:16 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page