#### Filter Results:

- Full text PDF available (27)

#### Publication Year

1971

2018

- This year (0)
- Last 5 years (6)
- Last 10 years (9)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Shimon Even, Alon Itai, Asaph Shamir
- SIAM J. Comput.
- 1976

A very primitive version of Gotlieb’s timetable problem is shown to be NP-complete, and therefore all the common timetable problems are NP-complete. A polynomial time algorithm, in case all teachers… (More)

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

Abstract A simple parallel randomized algorithm to find a maximal independent set in a graph G = ( V , E ) on n vertices is presented. Its expected running time on a concurrent-read concurrent-write… (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… (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.… (More)

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

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

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

Abstract A parallel randomized algorithm to find a maximal matching is presented. Its expected running time on a CRCW-PRAM with vbEvb processors in O(logvbEvb). The expected time is independent of… (More)

- Alon Efrat, Alon Itai, Matthew J. Katz
- Algorithmica
- 2001

Abstract. Let A and B be two sets of n objects in \realsd , and let Match be a (one-to-one) matching between A and B . Let min(Match ), max(Match ), and Σ(Match) denote the length of the shortest… (More)

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

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