 | 2009 |
|---|
| 73 |       | Fanica Gavril,
Alon Itai:
Covering a Tree by a Forest.
Graph Theory, Computational Intelligence and Thought 2009: 66-76 |
| 2008 |
|---|
| 72 | | Alon Itai:
Randomized Broadcasting in Radio Networks.
Encyclopedia of Algorithms 2008 |
| 2007 |
|---|
| 71 | | Alon Itai,
Irit Katriel:
Canonical density control.
Inf. Process. Lett. 104(6): 200-204 (2007) |
| 2006 |
|---|
| 70 | | Joseph Gil,
Alexander Gorovoy,
Alon Itai:
Software Fingerprinting.
ITRE 2006: 69-73 |
| 2004 |
|---|
| 69 | | Alexander Gaysinsky,
Alon Itai,
Hadas Shachnai:
Strongly competitive algorithms for caching with pipelined prefetching.
Inf. Process. Lett. 91(1): 19-27 (2004) |
| 2002 |
|---|
| 68 | | 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 |
|---|
| 67 | | Alexander Gaysinsky,
Alon Itai,
Hadas Shachnai:
Strongly Competitive Algorithms for Caching with Pipelined Prefetching.
ESA 2001: 49-61 |
| 66 | | Alon Efrat,
Alon Itai,
Matthew J. Katz:
Geometry Helps in Bottleneck Matching and Related Problems.
Algorithmica 31(1): 1-28 (2001) |
| 65 |  | Alon Itai:
Generating permutations and combinations in lexicographical order.
J. Braz. Comp. Soc. 7(3): 65-68 (2001) |
| 1999 |
|---|
| 64 | | Yefim Dinitz,
Alon Itai,
Michael Rodeh:
On an Algorithm of Zemlyachenko for Subtree Isomorphism.
Inf. Process. Lett. 70(3): 141-146 (1999) |
| 63 | | Joseph Gil,
Alon Itai:
How to Pack Trees.
J. Algorithms 32(2): 108-132 (1999) |
| 1998 |
|---|
| 62 | | Joseph Gil,
Alon Itai:
The Complexity of Type Analysis of Object Oriented Programs.
ECOOP 1998: 601-634 |
| 1996 |
|---|
| 61 | | Alon Efrat,
Alon Itai:
Improvements on Bottleneck Matching and Related Problems Using Geometry.
Symposium on Computational Geometry 1996: 301-310 |
| 60 | | Alon Itai,
Hadas Shachnai:
Adaptive Source Routing in High-Speed Networks.
J. Algorithms 20(2): 218-243 (1996) |
| 59 | | Nechama Allenberg-Navony,
Alon Itai,
Shlomo Moran:
Average and Randomized Complexity of Distributed Problems.
SIAM J. Comput. 25(6): 1254-1267 (1996) |
| 1995 |
|---|
| 58 | | Joseph Gil,
Alon Itai:
Packing Trees.
ESA 1995: 113-127 |
| 57 | | 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) |
| 56 | | Shai Ben-David,
Alon Itai,
Eyal Kushilevitz:
Learning by Distances
Inf. Comput. 117(2): 240-250 (1995) |
| 55 | | Rajeev Alur,
Alon Itai,
Robert P. Kurshan,
Mihalis Yannakakis:
Timing Verification by Successive Approximation
Inf. Comput. 118(1): 142-157 (1995) |
| 1994 |
|---|
| 54 | | Alon Itai:
Learning Morphology - Practice Makes Good.
ICGI 1994: 5-15 |
| 53 | | Nechama Allenberg-Navony,
Alon Itai,
Shlomo Moran:
Average and Randomized Complexity of Distributed Problems.
WDAG 1994: 311-325 |
| 52 | | Ido Dagan,
Alon Itai:
Word Sense Disambiguation Using a Second Language Monolingual Corpus.
Computational Linguistics 20(4): 563-596 (1994) |
| 51 | | Gyora M. Benedek,
Alon Itai:
Nonuniform Learnability.
J. Comput. Syst. Sci. 48(2): 311-323 (1994) |
| 50 | | Shmuel Gal,
Yona Hollander,
Alon Itai:
Optimal mapping in direct mapped cache environments.
Math. Program. 63: 371-387 (1994) |
| 1993 |
|---|
| 49 | | Reuven Bar-Yehuda,
Alon Efrat,
Alon Itai:
A Simple Algorithm for Maintaining the Center of a Planar Point-set.
CCCG 1993: 252-257 |
| 48 | | Alon Itai,
Hadas Shachnai:
Adaptive Source Routing in High-Speed Networks.
ISTCS 1993: 212-221 |
| 47 | | Reuven Bar-Yehuda,
Amos Israeli,
Alon Itai:
Multiple Communication in Multihop Radio Networks.
SIAM J. Comput. 22(4): 875-887 (1993) |
| 1992 |
|---|
| 46 | | Rajeev Alur,
Alon Itai,
Robert P. Kurshan,
Mihalis Yannakakis:
Timing Verification by Successive Approximation.
CAV 1992: 137-150 |
| 45 | | Gyora M. Benedek,
Alon Itai:
Dominating Distributions and Learnability.
COLT 1992: 253-264 |
| 44 | | Shmuel Gal,
Yona Hollander,
Alon Itai:
Optimal Mapping in Direct Mapped Cache Environments.
ISTCS 1992: 91-102 |
| 43 | | 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) |
| 1991 |
|---|
| 42 | | Ido Dagan,
Alon Itai,
Ulrike Schwall:
Two Languages Are More Informative Than One.
ACL 1991: 130-137 |
| 41 | | Alon Itai:
The Communication Complexity of the Two List Problem.
WDAG 1991: 193-199 |
| 40 | | Ido Dagan,
Alon Itai:
A set expression based inheritance system.
Ann. Math. Artif. Intell. 4: 269-280 (1991) |
| 39 | | 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) |
| 38 | | Gyora M. Benedek,
Alon Itai:
Learnability with Respect to Fixed Distributions.
Theor. Comput. Sci. 86(2): 377-390 (1991) |
| 1990 |
|---|
| 37 | | Ido Dagan,
Alon Itai:
Automatic Processing of Large Corpora for the Resolution of Anaphora References.
COLING 1990: 330-332 |
| 36 | | Shai Ben-David,
Alon Itai,
Eyal Kushilevitz:
Learning by Distances.
COLT 1990: 232-245 |
| 35 | | 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) |
| 34 | | Alon Itai,
Michael Rodeh:
Symmetry breaking in distributed networks
Inf. Comput. 88(1): 60-87 (1990) |
| 1989 |
|---|
| 33 | | 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 |
|---|
| 32 | | Gyora M. Benedek,
Alon Itai:
Learnability by Fixed Distributions.
COLT 1988: 80-90 |
| 31 | | Gyora M. Benedek,
Alon Itai:
Nonuniform Learnability.
ICALP 1988: 82-92 |
| 30 | | Alon Itai,
Yoav Raz:
The Number of Buffers Required for Sequential Processing of a Disk File.
Commun. ACM 31(11): 1338-1342 (1988) |
| 29 | | Alon Itai,
Michael Rodeh:
The Multi-Tree Approach to Reliability in Distributed Networks
Inf. Comput. 79(1): 43-59 (1988) |
| 1987 |
|---|
| 28 | | 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 |
| 27 | | Alon Itai,
Johann A. Makowsky:
Unification as a Complexity Measure for Logic Programming.
J. Log. Program. 4(2): 105-117 (1987) |
| 26 | | Oded Shmueli,
Alon Itai:
Complexity of Views: Tree and Cyclic Schemas.
SIAM J. Comput. 16(1): 17-37 (1987) |
| 1986 |
|---|
| 25 | | Amos Israeli,
Alon Itai:
A Fast and Simple Randomized Parallel Algorithm for Maximal Matching.
Inf. Process. Lett. 22(2): 77-80 (1986) |
| 24 | | 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 |
|---|
| 23 | | Alon Itai:
Parallel Arithmetic with Concurrent Writes.
PODC 1985: 293-299 |
| 22 | | Alon Itai,
Michael Rodeh:
Scheduling Transmissions in a Network.
J. Algorithms 6(3): 409-429 (1985) |
| 1984 |
|---|
| 21 | | Alon Itai,
Michael Rodeh:
The Multi-Tree Approach to Reliability in Distributed Networks
FOCS 1984: 137-147 |
| 20 | | Oded Shmueli,
Alon Itai:
Maintenance of Views.
SIGMOD Conference 1984: 240-255 |
| 19 | | Alon Itai,
Avram Zehavi:
Bounds on path connectivity.
Discrete Mathematics 51(1): 25-34 (1984) |
| 1983 |
|---|
| 18 | | Alon Itai,
Zvi Rosberg:
A Golden Ratio Control Policy for a Communication Channel.
Computer Performance and Reliability 1983: 387-401 |
| 1982 |
|---|
| 17 | | Alon Itai,
Michael Rodeh:
Representation of Graphs.
Acta Inf. 17: 215-219 (1982) |
| 16 | | Alon Itai,
Christos H. Papadimitriou,
Jayme Luiz Szwarcfiter:
Hamilton Paths in Grid Graphs.
SIAM J. Comput. 11(4): 676-686 (1982) |
| 1981 |
|---|
| 15 | | Alon Itai,
Michael Rodeh:
Symmetry Breaking in Distributive Networks
FOCS 1981: 150-158 |
| 14 | | Alon Itai,
Alan G. Konheim,
Michael Rodeh:
A Sparse Table Implementation of Priority Queues.
ICALP 1981: 417-431 |
| 13 | | Alon Itai,
Richard J. Lipton,
Christos H. Papadimitriou,
Michael Rodeh:
Covering Graphs by Simple Circuits.
SIAM J. Comput. 10(4): 746-750 (1981) |
| 1979 |
|---|
| 12 | | Alon Itai:
A Randomized Algorithm for Checking Equivalence of Circular Lists.
Inf. Process. Lett. 9(3): 118-121 (1979) |
| 11 | | Alon Itai,
Yossi Shiloach:
Maximum Flow in Planar Networks.
SIAM J. Comput. 8(2): 135-150 (1979) |
| 1978 |
|---|
| 10 | | Alon Itai,
Michael Rodeh:
Covering a Graph by Circuits.
ICALP 1978: 289-299 |
| 9 | | Yehoshua Perl,
Alon Itai,
Haim Avni:
Interpolation Search - A Log Log N Search.
Commun. ACM 21(7): 550-553 (1978) |
| 8 | | Alon Itai,
Michael Rodeh,
Steven L. Tanimoto:
Some Matching Problems for Bipartite Graphs.
J. ACM 25(4): 517-525 (1978) |
| 7 | | Alon Itai:
Two-Commodity Flow.
J. ACM 25(4): 596-611 (1978) |
| 6 | | Alon Itai,
Michael Rodeh:
Finding a Minimum Circuit in a Graph.
SIAM J. Comput. 7(4): 413-423 (1978) |
| 1977 |
|---|
| 5 | | Alon Itai,
Michael Rodeh:
Some Matching Problems.
ICALP 1977: 258-268 |
| 4 | | Alon Itai:
Finding a Minimum Circuit in a Graph
STOC 1977: 1-10 |
| 1976 |
|---|
| 3 | | Alon Itai:
Optimal Alphabetic Trees.
SIAM J. Comput. 5(1): 9-18 (1976) |
| 2 | | Shimon Even,
Alon Itai,
Adi Shamir:
On the Complexity of Timetable and Multicommodity Flow Problems.
SIAM J. Comput. 5(4): 691-703 (1976) |
| 1975 |
|---|
| 1 | | Shimon Even,
Alon Itai,
Adi Shamir:
On the Complexity of Timetable and Multi-Commodity Flow Problems
FOCS 1975: 184-193 |
