• Publications
  • Influence
On the Time-Complexity of Broadcast in Multi-hop Radio Networks: An Exponential Gap Between Determinism and Randomization
TLDR
The time-complexity of deterministic and randomized protocols for achieving broadcast (distributing a message from a source to all other nodes) in multi-hop radio networks is investigated. Expand
  • 453
  • 79
  • PDF
On the Complexity of Timetable and Multicommodity Flow Problems
TLDR
A very primitive version of Gotlieb’s timetable problem is shown to be NP-complete, and therefore all the common timetable problems areNP-complete. Expand
  • 1,081
  • 54
  • PDF
A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem
TLDR
A simple parallel randomized algorithm to find a maximal independent set in a graph G = ( V , E ) on n vertices is presented. Expand
  • 738
  • 50
  • PDF
Hamilton Paths in Grid Graphs
TLDR
A grid graph is a node-induced finite subgraph of the infinite grid. Expand
  • 426
  • 41
  • PDF
Finding a minimum circuit in a graph
  • A. Itai
  • Mathematics, Computer Science
  • STOC '77
  • 4 May 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>Expand
  • 336
  • 33
  • PDF
On the time-complexity of broadcast in radio networks: an exponential gap between determinism randomization
TLDR
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. Expand
  • 177
  • 29
  • PDF
Word Sense Disambiguation Using a Second Language Monolingual Corpus
TLDR
This paper presents a new approach for resolving lexical ambiguities in one language using statistical data from a monolingual corpus of another language. Expand
  • 326
  • 23
  • PDF
A Fast and Simple Randomized Parallel Algorithm for Maximal Matching
TLDR
A parallel randomized algorithm to find a maximal matching is presented. Expand
  • 214
  • 23
  • PDF
On the complexity of time table and multi-commodity flow problems
TLDR
A very primitive version of Gotlieb's timetable problem is shown to be NP-complete, and therefore all the common timetable problems areNP-complete. Expand
  • 376
  • 20
Building a tree-bank of modern hebrew text
TLDR
This paper describes the process of building the first tree-bank for Modern Hebrew texts. Expand
  • 82
  • 19
  • PDF
...
1
2
3
4
5
...