#### Filter Results:

- Full text PDF available (51)

#### Publication Year

1975

2015

- This year (0)
- Last 5 years (5)
- Last 10 years (17)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Data Set Used

#### Key Phrases

Learn More

- Alon Itai
- STOC
- 1977

Finding minimum circuits in graphs and digraphs is discussed. An almost minimum circuit is a circuit which may have only one edge more than the minimum. An <italic>0(n<supscrpt>2</supscrpt>)</italic> algorithm is presented to find an almost minimum circuit. The straightforward algorithm for finding a minimum circuit has an <italic>0(ne)</italic> behavior.… (More)

- Noga Alon, László Babai, Alon Itai
- J. Algorithms
- 1986

A simple parallel randomized algorithm to find a maximal independent set in a graph G = (V, E) on n vertices is presented. Its expected rmming time on a concurrent-read concurrent-write PRAM with 0(1 E 1 d,,) processors is O(log n), where d,, denotes the maximum degree. On an exclusive-read exclusive-write PRAM with 0(1 El) processors the algorithm runs in… (More)

This paper presents a new approach for resolving lexical ambiguities in one language using statistical data from a monolingual corpus of another language. This approach exploits the differences between mappings of words to senses in different languages. The paper concentrates on the problem of target word selection in machine translation, for which the… (More)

- Reuven Bar-Yehuda, Oded Goldreich, Alon Itai
- J. Comput. Syst. Sci.
- 1992

The time-complexity of deterministic and randomized protocols for achieving broadcast (distributing a message from a source to all other nodes) in arbitrary multi-hop radio networks is investigated. In many such networks, communication takes place in synchronous time-slots. A processor receives a message at a certain time-slot if exactly one if its… (More)

- Reuven Bar-Yehuda, Oded Goldreich, Alon Itai
- PODC
- 1987

The time-complexity of determinis-tic and randomized protocols for achieving broadcast (distributing a message from a source to all other nodes) in arbitrary multi-hop radio networks is investigated. In these networks communication takes place in synchronous time-slots. A processor receives a message at a certain time-slot if exactly one if its neighbors… (More)

- Alon Itai, Christos H. Papadimitriou, Jayme Luiz Szwarcfiter
- SIAM J. Comput.
- 1982

A grid graph is a node-induced finite subgraph of the infinite grid. It is rectangular if its set of nodes is the product of two intervals. Given a rectangular grid graph and two of its nodes, we give necessary and sufficient conditions for the graph to have a Hamilton path between these two nodes. In contrast, the Hamilton path (and circuit) problem for… (More)

- Moshe Levinger, Uzzi Ornan, Alon Itai
- Computational Linguistics
- 1995

Alon Itait Technion Uzzi Ornan t Technion This paper proposes a new approach for acquiring morpho-lexical probabilities from an untagged corpus. This approach demonstrates a way to extract very useful and nontrivial information from an untagged corpus, which otherwise would require laborious tagging of large corpora. The paper describes the use of these… (More)

- Alon Itai, Michael Rodeh
- Inf. Comput.
- 1990

Given a ring of n processors it is required to design the processors such that they will be able to choose a leader (a uniquely designated processor) by sending messages along the ring. If the processors are indistinguishable then there exists no deterministic algorithm to solve the problem. To overcome this difficulty, probabilistic algorithms are… (More)

- Alon Itai, Shuly Wintner
- Language Resources and Evaluation
- 2008

We describe a suite of standards, resources and tools for computational encoding and processing of Modern Hebrew texts. These include an array of XML schemas for representing linguistic resources; a variety of text corpora, raw, automatically processed and manually annotated; lexical databases, including a broad-coverage monolingual lexicon, a bilingual… (More)

- Alon Itai, Michael Rodeh
- Acta Informatica
- 1982

Given a formulation of a problem, a compact representation is required both for theoretical purposes — measuring the complexity of algorithms, and for practical purposes — data compression. The adjacency lists method for representing graphs is compared to the information theoretic lower bounds, and it is shown to be optimal in many instances. For n-vertex… (More)