Showing papers in "Information Processing Letters in 1978"

TL;DR: A probabilistic solution is presented which achieves small probability of error on 30 points for m-ary multinomials in Howden's method for algebraic program testing.

TL;DR: A bit-vector can be compressed, if the frequence of zeroes (or ones as well) differs from 0.5 or if the vector is clustered in some way (i.e. not random).

TL;DR: An O(V cubed) algorithm is given for finding maximum flow in capacitated networks and is being posted here to make it accessible to all in electronic form.

TL;DR: This paper describes a new sorting method with a worst-case time complexity of O(n log n) and an expected time of O (n) for uniform distribution and a more detailed study of the behaviour of the presented algorithm is in preparation.

TL;DR: The space complexities necessary and sufficient for seven-way four- dimensional Turing machines to simulate four-dimensional finite automata are shown, where each sidelength of each input tape of these automata is equivalent.

TL;DR: An " oracle " or decision rule is defined by which a r ath, P,, is distinguished in each decision tree for the LCS problem by proving that n log II is a lower bound on the nunber of " less thanequal-greater than " comparisons requi't.

TL;DR: A reevaluation of Graham’s algorithm is presented which shows it to be much more efficient than it appears from his description, and concludes that although angles are obviously useful for describing an algorithm, sines and cosines are usually a more “natural” representation computationally.

TL;DR: At least part of the speed up is due to the model rather than the probabilistic nature of the algorithm, which is asymtomatically linear whereas the best of the known deterministic algorithms take order $n \log n$ time.

TL;DR: In 1973 Bl~m, Floyd et al. presented a linear algorithm to select the i-th smallest element of a se?