Alon Itai

According to our database1, Alon Itai authored at least 76 papers between 1975 and 2021.

Collaborative distances:
  • Dijkstra number2 of two.
  • Erdős number3 of two.



In proceedings 
PhD thesis 




On the Optimization Landscape of Maximum Mean Discrepancy.
CoRR, 2021

Acronyms: identification, expansion and disambiguation.
Ann. Math. Artif. Intell., 2020

Randomized Broadcasting in Radio Networks.
Encyclopedia of Algorithms, 2016

Parsing Hebrew CHILDES transcripts.
Lang. Resour. Evaluation, 2015

A Hebrew verb-complement dictionary.
Lang. Resour. Evaluation, 2014

How to construct a multi-lingual domain ontology.
Proceedings of the Ninth International Conference on Language Resources and Evaluation, 2014

Covering a Tree by a Forest.
Proceedings of the Graph Theory, 2009

Randomized Broadcasting in Radio Networks.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Language resources for Hebrew.
Lang. Resour. Evaluation, 2008

Using Movie Subtitles for Creating a Large-Scale Bilingual Corpora.
Proceedings of the International Conference on Language Resources and Evaluation, 2008

Canonical density control.
Inf. Process. Lett., 2007

Detecting Data Structures from Traces.
Proceedings of the Workshop on Approaches and Applications of Inductive Programming, 2007

A Computational Lexicon of Contemporary Hebrew.
Proceedings of the Fifth International Conference on Language Resources and Evaluation, 2006

Software Fingerprinting.
Proceedings of the ITRE 2006, 2006

Strongly competitive algorithms for caching with pipelined prefetching.
Inf. Process. Lett., 2004

The passport control problem or how to keep a dynamic service system load balanced?
Theor. Comput. Sci., 2002

Generating permutations and combinations in lexicographical order.
J. Braz. Comput. Soc., 2001

Geometry Helps in Bottleneck Matching and Related Problems.
Algorithmica, 2001

How to Pack Trees.
J. Algorithms, 1999

On an Algorithm of Zemlyachenko for Subtree Isomorphism.
Inf. Process. Lett., 1999

The Complexity of Type Analysis of Object Oriented Programs.
Proceedings of the ECOOP'98, 1998

Average and Randomized Complexity of Distributed Problems.
SIAM J. Comput., 1996

Adaptive Source Routing in High-Speed Networks.
J. Algorithms, 1996

Improvements on Bottleneck Matching and Related Problems Using Geometry.
Proceedings of the Twelfth Annual Symposium on Computational Geometry, 1996

Timing Verification by Successive Approximation
Inf. Comput., April, 1995

Learning by Distances
Inf. Comput., March, 1995

Learning Morpho-Lexical Probabilities from an Untagged Corpus with an Application to Hebrew.
Comput. Linguistics, 1995

Packing Trees.
Proceedings of the Algorithms, 1995

Optimal mapping in direct mapped cache environments.
Math. Program., 1994

Nonuniform Learnability.
J. Comput. Syst. Sci., 1994

Word Sense Disambiguation Using a Second Language Monolingual Corpus.
Comput. Linguistics, 1994

Learning Morphology - Practice Makes Good.
Proceedings of the Grammatical Inference and Applications, Second International Colloquium, 1994

Multiple Communication in Multihop Radio Networks.
SIAM J. Comput., 1993

A Simple Algorithm for Maintaining the Center of a Planar Point-set.
Proceedings of the 5th Canadian Conference on Computational Geometry, 1993

On the Time-Complexity of Broadcast in Multi-hop Radio Networks: An Exponential Gap Between Determinism and Randomization.
J. Comput. Syst. Sci., 1992

Dominating Distributions and Learnability.
Proceedings of the Fifth Annual ACM Conference on Computational Learning Theory, 1992

Learnability with Respect to Fixed Distributions.
Theor. Comput. Sci., 1991

Efficient Emulation of Single-Hop Radio Network with Collision Detection on Multi-Hop Radio Network with no Collision Detection.
Distributed Comput., 1991

A set expression based inheritance system.
Ann. Math. Artif. Intell., 1991

The Communication Complexity of the Two List Problem.
Proceedings of the Distributed Algorithms, 5th International Workshop, 1991

Two Languages Are More Informative Than One.
Proceedings of the 29th Annual Meeting of the Association for Computational Linguistics, 1991

Symmetry breaking in distributed networks
Inf. Comput., September, 1990

Optimal Distributed t-Resilient Election in Complete Networks.
IEEE Trans. Software Eng., 1990

Automatic Processing of Large Corpora for the Resolution of Anaphora References.
Proceedings of the 13th International Conference on Computational Linguistics, 1990

Three tree-paths.
J. Graph Theory, 1989

The Multi-Tree Approach to Reliability in Distributed Networks
Inf. Comput., October, 1988

The Number of Buffers Required for Sequential Processing of a Disk File.
Commun. ACM, 1988

Learnability by Fixed Distributions.
Proceedings of the First Annual Workshop on Computational Learning Theory, 1988

Complexity of Views: Tree and Cyclic Schemas.
SIAM J. Comput., 1987

Unification as a Complexity Measure for Logic Programming.
J. Log. Program., 1987

On the Time-Complexity of Broadcast in Radio Networks: An Exponential Gap Between Determinism and Randomization.
Proceedings of the Sixth Annual ACM Symposium on Principles of Distributed Computing, 1987

A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem.
J. Algorithms, 1986

A Fast and Simple Randomized Parallel Algorithm for Maximal Matching.
Inf. Process. Lett., 1986

Scheduling Transmissions in a Network.
J. Algorithms, 1985

Parallel Arithmetic with Concurrent Writes.
Proceedings of the Fourth Annual ACM Symposium on Principles of Distributed Computing, 1985

Bounds on path connectivity.
Discret. Math., 1984

Maintenance of Views.
Proceedings of the SIGMOD'84, 1984

A Golden Ratio Control Policy for a Communication Channel.
Proceedings of the Computer Performance and Reliability, 1983

Hamilton Paths in Grid Graphs.
SIAM J. Comput., 1982

The complexity of finding maximum disjoint paths with length constraints.
Networks, 1982

Representation of Graphs.
Acta Informatica, 1982

Covering Graphs by Simple Circuits.
SIAM J. Comput., 1981

A Sparse Table Implementation of Priority Queues.
Proceedings of the Automata, 1981

Symmetry Breaking in Distributive Networks
Proceedings of the 22nd Annual Symposium on Foundations of Computer Science, 1981

Maximum Flow in Planar Networks.
SIAM J. Comput., 1979

A Randomized Algorithm for Checking Equivalence of Circular Lists.
Inf. Process. Lett., 1979

Finding a Minimum Circuit in a Graph.
SIAM J. Comput., 1978

Some Matching Problems for Bipartite Graphs.
J. ACM, 1978

Two-Commodity Flow.
J. ACM, 1978

Interpolation Search - A Log Log N Search.
Commun. ACM, 1978

Covering a Graph by Circuits.
Proceedings of the Automata, 1978

Finding a Minimum Circuit in a Graph
Proceedings of the 9th Annual ACM Symposium on Theory of Computing, 1977

Some Matching Problems.
Proceedings of the Automata, 1977

Optimal Alphabetic Trees.
SIAM J. Comput., 1976

On the Complexity of Timetable and Multicommodity Flow Problems.
SIAM J. Comput., 1976

On the Complexity of Timetable and Multi-Commodity Flow Problems
Proceedings of the 16th Annual Symposium on Foundations of Computer Science, 1975