• Publications
  • Influence
On the Time-Complexity of Broadcast in Multi-hop Radio Networks: An Exponential Gap Between Determinism and Randomization
TLDR
It is shown that any deterministic broadcast protocol requires 8(n) time-slots, even if the network has diameter 3, and n is known to all processors, which demonstrates an exponential gap in complexity between randomization and determinism. Expand
On the Complexity of Timetable and Multicommodity Flow Problems
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 teachersExpand
A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem
TLDR
A technique due to A. Joffe (1974) is applied and deterministic construction in fast parallel time of various combinatorial objects whose existence follows from probabilistic arguments is obtained. Expand
Hamilton Paths in Grid Graphs
TLDR
This work gives necessary and sufficient conditions for the graph to have a Hamilton path between these two nodes, and provides a new, relatively simple, proof of the result that the Euclidean traveling salesman problem is NP-complete. Expand
Finding a minimum circuit in a graph
  • A. Itai
  • Mathematics, Computer Science
  • STOC '77
  • 4 May 1977
TLDR
Finding minimum circuits in graphs and digraphs is discussed and an algorithm to find an almost minimum circuit is presented and an alternative method is to reduce the problem of finding a minimum circuit to that of finding an auxiliary graph. Expand
On the time-complexity of broadcast in radio networks: an exponential gap between determinism randomization
TLDR
It is shown that any deterministic broadcast protocol requires 8(n) time-slots, even if the network has diameter 3, and n is known to all processors, which demonstrates an exponential gap in complexity between randomization and determinism. Expand
Word Sense Disambiguation Using a Second Language Monolingual Corpus
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 differencesExpand
A Fast and Simple Randomized Parallel Algorithm for Maximal Matching
TLDR
A parallel randomized algorithm to find a maximal matching is presented that improves the best known deterministic algorithm by a factor of log 2 vbEvb. Expand
On the complexity of time table and multi-commodity flow problems
TLDR
The theorem that a meeting function always exists if all teachers and classes have no time constraints is proved and the multi-commodity integral flow problem is shown to be NP-complete even if the number of commodities is two. Expand
Building a tree-bank of modern hebrew text
TLDR
A semi-automatic procedure for future enlargement of the tree-bank is outlined, which starts out with the manual segmentation of words into morpheme sequences, then continues with automatic POS tagging and parsing, followed by manual correction of the resulting parse-trees. Expand
...
1
2
3
4
5
...