default search action
Alon Itai
Publications
- 2020
- [j47]Kayla Jacobs, Alon Itai, Shuly Wintner:
Acronyms: identification, expansion and disambiguation. Ann. Math. Artif. Intell. 88(5-6): 517-532 (2020) - 2015
- [j46]Shai Gretz, Alon Itai, Brian MacWhinney, Bracha Nir, Shuly Wintner:
Parsing Hebrew CHILDES transcripts. Lang. Resour. Evaluation 49(1): 107-145 (2015) - 2014
- [j45]Hanna Fadida, Alon Itai, Shuly Wintner:
A Hebrew verb-complement dictionary. Lang. Resour. Evaluation 48(2): 249-278 (2014) - 2009
- [c34]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. Lang. Resour. Evaluation 42(1): 75-98 (2008) - 2006
- [c30]Alon Itai, Shuly Wintner, Shlomo Yona:
A Computational Lexicon of Contemporary Hebrew. LREC 2006: 19-22 - 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) - [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) - 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. SCG 1996: 301-310 - 1995
- [j34]Moshe Levinger, Uzzi Ornan, Alon Itai:
Learning Morpho-Lexical Probabilities from an Untagged Corpus with an Application to Hebrew. Comput. 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) - 1994
- [j31]Ido Dagan, Alon Itai:
Word Sense Disambiguation Using a Second Language Monolingual Corpus. Comput. Linguistics 20(4): 563-596 (1994) - [j30]Gyora M. Benedek, Alon Itai:
Nonuniform Learnability. J. Comput. Syst. Sci. 48(2): 311-323 (1994) - [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]Alon Itai, Hadas Shachnai:
Adaptive Source Routing in High-Speed Networks. ISTCS 1993: 212-221 - 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]Gyora M. Benedek, Alon Itai:
Dominating Distributions and Learnability. COLT 1992: 253-264 - 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 Comput. 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 - 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]Shai Ben-David, Alon Itai, Eyal Kushilevitz:
Learning by Distances. COLT 1990: 232-245 - 1989
- [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
- [j19]Alon Itai, Michael Rodeh:
The Multi-Tree Approach to Reliability in Distributed Networks. Inf. Comput. 79(1): 43-59 (1988) - [c13]Gyora M. Benedek, Alon Itai:
Learnability by Fixed Distributions. COLT 1988: 80-90 - [c12]Gyora M. Benedek, Alon Itai:
Nonuniform Learnability. ICALP 1988: 82-92 - 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]Alon Itai, Michael Rodeh:
Scheduling Transmissions in a Network. J. Algorithms 6(3): 409-429 (1985) - 1984
- [c9]Alon Itai, Michael Rodeh:
The Multi-Tree Approach to Reliability in Distributed Networks. FOCS 1984: 137-147 - [c8]Oded Shmueli, Alon Itai:
Maintenance of Views. SIGMOD Conference 1984: 240-255 - 1982
- [j12]Alon Itai, Michael Rodeh:
Representation of Graphs. Acta Informatica 17: 215-219 (1982) - [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]Alon Itai, Michael Rodeh:
Symmetry Breaking in Distributive Networks. FOCS 1981: 150-158 - [c5]Alon Itai, Alan G. Konheim, Michael Rodeh:
A Sparse Table Implementation of Priority Queues. ICALP 1981: 417-431 - 1979
- [j7]Alon Itai, Yossi Shiloach:
Maximum Flow in Planar Networks. SIAM J. Comput. 8(2): 135-150 (1979) - 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) - [j3]Alon Itai, Michael Rodeh:
Finding a Minimum Circuit in a Graph. SIAM J. Comput. 7(4): 413-423 (1978) - [c4]Alon Itai, Michael Rodeh:
Covering a Graph by Circuits. ICALP 1978: 289-299 - 1977
- [c3]Alon Itai, Michael Rodeh:
Some Matching Problems. ICALP 1977: 258-268 - 1976
- [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
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-20 21:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint