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

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

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

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

This paper presents a new approach for resolving lexical ambiguities in one language using statistical data from a monolingual corpus of another language.Expand

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