#### 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

- 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… (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)

- 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)

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

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 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)

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, Amos Israeli, Alon Itai
- SIAM J. Comput.
- 1989

Two tasks of communication in a multi-hop synchronous radio network are considered: point-topoint communication and broadcast (sending a message to all nodes of a network). Efficient protocols for both problems are presented, Even though the protocols are probabilistic, it is shown how to acknowledge messages deterministically. Let n, D, and A be the number… (More)

- Alon Itai, Michael Rodeh
- FOCS
- 1984

Consider a network of asynchronous processors communicating by sending messages over unreliable lines. There are many advantages to restricting all communications to a spanning tree. To overcome the possible failure of k ′<k edges, we describe a communication protocol which uses k rooted spanning trees having the property that for every vertex v the paths… (More)

- Amos Israeli, Alon Itai
- Inf. Process. Lett.
- 1986

Let G(V, E) be an undirected graph. A set M ~ E is a matching if no two edges of M have a common vertex. The matching M is maximal if it is not properly contained in any other matching. Note that this does not necessarily imply that M has more edges than any other matching. A maximal matching can be found sequentially by the following greedy algorithm:… (More)

- Alon Itai, Yehoshua Perl, Yossi Shiloach
- Networks
- 1982