Efficient and Elegant Subword-Tree Construction

A clean version of Weiner's linear-time compact-subword-tree construclion simultaneously constructs the smallest deterministic finite automaton recognizing the reverse subwords

An Information-Theoretic Approach toTime Bounds for On-Line Computation

Introduction Static, descriptional complexity (program size) [16, 9] can be used to obtain lower bounds on dynamic, computational complexity (such as running time). We describe and discuss this "information-theoretic approach" in the following section. Paul introduced it in [13], to obtain restricted lower bounds on the time complexity of sorting. We use the approach here to obtain lower time bounds for on-line simulation of one abstract storage unit by another. A major goal of our work is to promote the approach...

An Ω (n log n) Lower Bound for a Restricted Form of On-Line Labeling Algorithm

Under the Normalization Assumption on the algorithms, the labeling problem has a lower bound Ω(nlog n). This is proved by a mechanism dividing the label intervals into a list of collections whose corresponding costs are bounded from below by a suitably chosen function

Milking the Aanderaa Argument

In the early 1970's, by an intricate and involved counting argument, Stål Aanderaa managed to show for the first time that every additional tape adds to the power of a Turing machine that operates in real time. This was a full decade after Rabin had shown that the second tape adds power. With time, especially following the introduction of an information-theoretic approach based on Kolmogorov's notion of descriptional complexity, Aanderaa's argument has become better understood, and even extended to new results. In this paper, we present a clean version of the argument and some new extensions

Computer Science and Engineering Research Riview 1980-1981

Table of Contents: Experiences with the Generalized Hough Transform / K. R. Sloan, D. H. Ballard p. 3; The Rochester Natural Language Understanding Project, / J. F. Allen p. 9; An Information-Theoretic Approach to Time Bounds for On·Line Computation / W.J. Paul, J.I. Seiferas, J. Simon p. 17; Publications p. 28; Seminars p. 31; Grant Support p. 32