2013 IEEE 54th Annual Symposium on Foundations of Computer Science (1974)

Oct. 14, 1974 to Oct. 16, 1974

ISSN: 0272-5428

TABLE OF CONTENTS

Papers

Table of contents (PDF)

pp. c1

Foreword (PDF)

pp. iii

On the power of multiplication in random access machines (Abstract)

pp. 13-23

Ianov schemas augmented by a pushdown memory (Abstract)

pp. 84-94

Bounds on the complexity of the longest common subsequence problem (Abstract)

pp. 104-109

On the computational complexity of finding the maxima of a set of vectors (Abstract)

pp. 117-121

Combinational complexity of some monotone functions (Abstract)

pp. 140-144

A comparative study of models of parallel computation (Abstract)

pp. 145-155

Characterization of context-free grammatical families (Abstract)

pp. 199-204

On Boolean functions having maximal number of subfunction classes (Abstract)

pp. 205-210