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

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… Expand

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

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

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

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… Expand

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

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

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