The SCEAS System
| |||||||

## Search the dblp DataBase
Alon Itai:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Oded Shmueli, Alon Itai
**Maintenance of Views.**[Citation Graph (28, 16)][DBLP] SIGMOD Conference, 1984, pp:240-255 [Conf] - Yehoshua Perl, Alon Itai, Haim Avni
**Interpolation Search - A Log Log N Search.**[Citation Graph (2, 0)][DBLP] Commun. ACM, 1978, v:21, n:7, pp:550-553 [Journal] - Shimon Even, Alon Itai, Adi Shamir
**On the Complexity of Timetable and Multicommodity Flow Problems.**[Citation Graph (2, 0)][DBLP] SIAM J. Comput., 1976, v:5, n:4, pp:691-703 [Journal] - Alon Itai, Alan G. Konheim, Michael Rodeh
**A Sparse Table Implementation of Priority Queues.**[Citation Graph (1, 0)][DBLP] ICALP, 1981, pp:417-431 [Conf] - Oded Shmueli, Alon Itai
**Complexity of Views: Tree and Cyclic Schemas.**[Citation Graph (1, 0)][DBLP] SIAM J. Comput., 1987, v:16, n:1, pp:17-37 [Journal] - Ido Dagan, Alon Itai, Ulrike Schwall
**Two Languages Are More Informative Than One.**[Citation Graph (0, 0)][DBLP] ACL, 1991, pp:130-137 [Conf] - Rajeev Alur, Alon Itai, Robert P. Kurshan, Mihalis Yannakakis
**Timing Verification by Successive Approximation.**[Citation Graph (0, 0)][DBLP] CAV, 1992, pp:137-150 [Conf] - Reuven Bar-Yehuda, Alon Efrat, Alon Itai
**A Simple Algorithm for Maintaining the Center of a Planar Point-set.**[Citation Graph (0, 0)][DBLP] CCCG, 1993, pp:252-257 [Conf] - Ido Dagan, Alon Itai
**Automatic Processing of Large Corpora for the Resolution of Anaphora References.**[Citation Graph (0, 0)][DBLP] COLING, 1990, pp:330-332 [Conf] - Shai Ben-David, Alon Itai, Eyal Kushilevitz
**Learning by Distances.**[Citation Graph (0, 0)][DBLP] COLT, 1990, pp:232-245 [Conf] - Gyora M. Benedek, Alon Itai
**Learnability by Fixed Distributions.**[Citation Graph (0, 0)][DBLP] COLT, 1988, pp:80-90 [Conf] - Gyora M. Benedek, Alon Itai
**Dominating Distributions and Learnability.**[Citation Graph (0, 0)][DBLP] COLT, 1992, pp:253-264 [Conf] - Alon Efrat, Alon Itai
**Improvements on Bottleneck Matching and Related Problems Using Geometry.**[Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 1996, pp:301-310 [Conf] - Joseph Gil, Alon Itai
**The Complexity of Type Analysis of Object Oriented Programs.**[Citation Graph (0, 0)][DBLP] ECOOP, 1998, pp:601-634 [Conf] - Alexander Gaysinsky, Alon Itai, Hadas Shachnai
**Strongly Competitive Algorithms for Caching with Pipelined Prefetching.**[Citation Graph (0, 0)][DBLP] ESA, 2001, pp:49-61 [Conf] - Joseph Gil, Alon Itai
**Packing Trees.**[Citation Graph (0, 0)][DBLP] ESA, 1995, pp:113-127 [Conf] - Shimon Even, Alon Itai, Adi Shamir
**On the Complexity of Timetable and Multi-Commodity Flow Problems**[Citation Graph (0, 0)][DBLP] FOCS, 1975, pp:184-193 [Conf] - Alon Itai, Michael Rodeh
**Symmetry Breaking in Distributive Networks**[Citation Graph (0, 0)][DBLP] FOCS, 1981, pp:150-158 [Conf] - Alon Itai, Michael Rodeh
**The Multi-Tree Approach to Reliability in Distributed Networks**[Citation Graph (0, 0)][DBLP] FOCS, 1984, pp:137-147 [Conf] - Gyora M. Benedek, Alon Itai
**Nonuniform Learnability.**[Citation Graph (0, 0)][DBLP] ICALP, 1988, pp:82-92 [Conf] - Alon Itai, Michael Rodeh
**Some Matching Problems.**[Citation Graph (0, 0)][DBLP] ICALP, 1977, pp:258-268 [Conf] - Alon Itai, Michael Rodeh
**Covering a Graph by Circuits.**[Citation Graph (0, 0)][DBLP] ICALP, 1978, pp:289-299 [Conf] - Alon Itai
**Learning Morphology - Practice Makes Good.**[Citation Graph (0, 0)][DBLP] ICGI, 1994, pp:5-15 [Conf] - Shmuel Gal, Yona Hollander, Alon Itai
**Optimal Mapping in Direct Mapped Cache Environments.**[Citation Graph (0, 0)][DBLP] ISTCS, 1992, pp:91-102 [Conf] - Alon Itai, Hadas Shachnai
**Adaptive Source Routing in High-Speed Networks.**[Citation Graph (0, 0)][DBLP] ISTCS, 1993, pp:212-221 [Conf] - Alon Itai, Zvi Rosberg
**A Golden Ratio Control Policy for a Communication Channel.**[Citation Graph (0, 0)][DBLP] Computer Performance and Reliability, 1983, pp:387-401 [Conf] - Reuven Bar-Yehuda, Oded Goldreich, Alon Itai
**On the Time-Complexity of Broadcast in Radio Networks: An Exponential Gap Between Determinism and Randomization.**[Citation Graph (0, 0)][DBLP] PODC, 1987, pp:98-108 [Conf] - Alon Itai
**Parallel Arithmetic with Concurrent Writes.**[Citation Graph (0, 0)][DBLP] PODC, 1985, pp:293-299 [Conf] - Alon Itai
**Finding a Minimum Circuit in a Graph**[Citation Graph (0, 0)][DBLP] STOC, 1977, pp:1-10 [Conf] - 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.**[Citation Graph (0, 0)][DBLP] WDAG, 1989, pp:24-32 [Conf] - Nechama Allenberg-Navony, Alon Itai, Shlomo Moran
**Average and Randomized Complexity of Distributed Problems.**[Citation Graph (0, 0)][DBLP] WDAG, 1994, pp:311-325 [Conf] - Alon Itai
**The Communication Complexity of the Two List Problem.**[Citation Graph (0, 0)][DBLP] WDAG, 1991, pp:193-199 [Conf] - Alon Itai, Michael Rodeh
**Representation of Graphs.**[Citation Graph (0, 0)][DBLP] Acta Inf., 1982, v:17, n:, pp:215-219 [Journal] - Alon Efrat, Alon Itai, Matthew J. Katz
**Geometry Helps in Bottleneck Matching and Related Problems.**[Citation Graph (0, 0)][DBLP] Algorithmica, 2001, v:31, n:1, pp:1-28 [Journal] - Ido Dagan, Alon Itai
**A set expression based inheritance system.**[Citation Graph (0, 0)][DBLP] Ann. Math. Artif. Intell., 1991, v:4, n:, pp:269-280 [Journal] - Alon Itai, Yoav Raz
**The Number of Buffers Required for Sequential Processing of a Disk File.**[Citation Graph (0, 0)][DBLP] Commun. ACM, 1988, v:31, n:11, pp:1338-1342 [Journal] - Ido Dagan, Alon Itai
**Word Sense Disambiguation Using a Second Language Monolingual Corpus.**[Citation Graph (0, 0)][DBLP] Computational Linguistics, 1994, v:20, n:4, pp:563-596 [Journal] - Moshe Levinger, Uzzi Ornan, Alon Itai
**Learning Morpho-Lexical Probabilities from an Untagged Corpus with an Application to Hebrew.**[Citation Graph (0, 0)][DBLP] Computational Linguistics, 1995, v:21, n:3, pp:383-404 [Journal] - 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.**[Citation Graph (0, 0)][DBLP] Distributed Computing, 1991, v:5, n:, pp:67-71 [Journal] - Rajeev Alur, Alon Itai, Robert P. Kurshan, Mihalis Yannakakis
**Timing Verification by Successive Approximation**[Citation Graph (0, 0)][DBLP] Inf. Comput., 1995, v:118, n:1, pp:142-157 [Journal] - Shai Ben-David, Alon Itai, Eyal Kushilevitz
**Learning by Distances**[Citation Graph (0, 0)][DBLP] Inf. Comput., 1995, v:117, n:2, pp:240-250 [Journal] - Alon Itai, Michael Rodeh
**The Multi-Tree Approach to Reliability in Distributed Networks**[Citation Graph (0, 0)][DBLP] Inf. Comput., 1988, v:79, n:1, pp:43-59 [Journal] - Alon Itai, Michael Rodeh
**Symmetry breaking in distributed networks**[Citation Graph (0, 0)][DBLP] Inf. Comput., 1990, v:88, n:1, pp:60-87 [Journal] - Yefim Dinitz, Alon Itai, Michael Rodeh
**On an Algorithm of Zemlyachenko for Subtree Isomorphism.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1999, v:70, n:3, pp:141-146 [Journal] - Alexander Gaysinsky, Alon Itai, Hadas Shachnai
**Strongly competitive algorithms for caching with pipelined prefetching.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2004, v:91, n:1, pp:19-27 [Journal] - Amos Israeli, Alon Itai
**A Fast and Simple Randomized Parallel Algorithm for Maximal Matching.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1986, v:22, n:2, pp:77-80 [Journal] - Alon Itai
**A Randomized Algorithm for Checking Equivalence of Circular Lists.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1979, v:9, n:3, pp:118-121 [Journal] - Alon Itai
**Two-Commodity Flow.**[Citation Graph (0, 0)][DBLP] J. ACM, 1978, v:25, n:4, pp:596-611 [Journal] - Alon Itai, Michael Rodeh, Steven L. Tanimoto
**Some Matching Problems for Bipartite Graphs.**[Citation Graph (0, 0)][DBLP] J. ACM, 1978, v:25, n:4, pp:517-525 [Journal] - Noga Alon, László Babai, Alon Itai
**A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem.**[Citation Graph (0, 0)][DBLP] J. Algorithms, 1986, v:7, n:4, pp:567-583 [Journal] - Joseph Gil, Alon Itai
**How to Pack Trees.**[Citation Graph (0, 0)][DBLP] J. Algorithms, 1999, v:32, n:2, pp:108-132 [Journal] - Alon Itai, Michael Rodeh
**Scheduling Transmissions in a Network.**[Citation Graph (0, 0)][DBLP] J. Algorithms, 1985, v:6, n:3, pp:409-429 [Journal] - Alon Itai, Hadas Shachnai
**Adaptive Source Routing in High-Speed Networks.**[Citation Graph (0, 0)][DBLP] J. Algorithms, 1996, v:20, n:2, pp:218-243 [Journal] - Alon Itai
**Generating permutations and combinations in lexicographical order.**[Citation Graph (0, 0)][DBLP] J. Braz. Comp. Soc., 2001, v:7, n:3, pp:65-68 [Journal] - 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.**[Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 1992, v:45, n:1, pp:104-126 [Journal] - Gyora M. Benedek, Alon Itai
**Nonuniform Learnability.**[Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 1994, v:48, n:2, pp:311-323 [Journal] - Alon Itai, Johann A. Makowsky
**Unification as a Complexity Measure for Logic Programming.**[Citation Graph (0, 0)][DBLP] J. Log. Program., 1987, v:4, n:2, pp:105-117 [Journal] - Shmuel Gal, Yona Hollander, Alon Itai
**Optimal mapping in direct mapped cache environments.**[Citation Graph (0, 0)][DBLP] Math. Program., 1994, v:63, n:, pp:371-387 [Journal] - Nechama Allenberg-Navony, Alon Itai, Shlomo Moran
**Average and Randomized Complexity of Distributed Problems.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1996, v:25, n:6, pp:1254-1267 [Journal] - Reuven Bar-Yehuda, Amos Israeli, Alon Itai
**Multiple Communication in Multihop Radio Networks.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1993, v:22, n:4, pp:875-887 [Journal] - Alon Itai
**Optimal Alphabetic Trees.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1976, v:5, n:1, pp:9-18 [Journal] - Alon Itai, Richard J. Lipton, Christos H. Papadimitriou, Michael Rodeh
**Covering Graphs by Simple Circuits.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1981, v:10, n:4, pp:746-750 [Journal] - Alon Itai, Christos H. Papadimitriou, Jayme Luiz Szwarcfiter
**Hamilton Paths in Grid Graphs.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1982, v:11, n:4, pp:676-686 [Journal] - Alon Itai, Michael Rodeh
**Finding a Minimum Circuit in a Graph.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1978, v:7, n:4, pp:413-423 [Journal] - Alon Itai, Yossi Shiloach
**Maximum Flow in Planar Networks.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1979, v:8, n:2, pp:135-150 [Journal] - Gyora M. Benedek, Alon Itai
**Learnability with Respect to Fixed Distributions.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1991, v:86, n:2, pp:377-390 [Journal] - Alon Itai, Michael Rodeh, Hadas Shachnai
**The passport control problem or how to keep a dynamic service system load balanced?**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2002, v:282, n:2, pp:303-318 [Journal] - Alon Itai, Shay Kutten, Yaron Wolfstahl, Shmuel Zaks
**Optimal Distributed t-Resilient Election in Complete Networks.**[Citation Graph (0, 0)][DBLP] IEEE Trans. Software Eng., 1990, v:16, n:4, pp:415-420 [Journal] - Alon Itai, Avram Zehavi
**Bounds on path connectivity.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1984, v:51, n:1, pp:25-34 [Journal] - Alon Itai, Irit Katriel
**Canonical density control.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2007, v:104, n:6, pp:200-204 [Journal] **Covering a Tree by a Forest.**[Citation Graph (, )][DBLP]**Software Fingerprinting.**[Citation Graph (, )][DBLP]**Using Movie Subtitles for Creating a Large-Scale Bilingual Corpora.**[Citation Graph (, )][DBLP]
Search in 0.619secs, Finished in 0.622secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |