Join Us
Sign In
My Subscriptions
Magazines
Journals
Video Library
Conference Proceedings
Individual CSDL Subscriptions
Institutional CSDL Subscriptions
Resources
Career Center
Tech News
Resource Center
Press Room
Advertising
Librarian Resources
IEEE.org
Help
About Us
Career Center
Cart
Create Account
Sign In
Toggle navigation
My Subscriptions
Browse Content
Resources
All
Home
Proceedings
FOCS
FOCS 1971
Generate Citations
12th Annual Symposium on Switching and Automata Theory (swat 1971)
Oct. 13 1971 to Oct. 15 1971
ISSN: 0272-4847
Table of Contents
Papers
Table of contents
Freely available from IEEE.
pp. iv-v
Boolean matrix multiplication and transitive closure
Full-text access may be available. Sign in or learn about subscription options.
pp. 129-131
by
M. J. Fischer
,
A. R. Meyer
Papers
Foreword
Full-text access may be available. Sign in or learn about subscription options.
pp. iii
Papers
High level languages of maximum power
Full-text access may be available. Sign in or learn about subscription options.
pp. 1-4
by
H. R. Strong
Papers
On classes of program schemata
Full-text access may be available. Sign in or learn about subscription options.
pp. 5-19
by
Robertx L. Constable
,
David Gries
Papers
On the composition of parallel program schemata
Full-text access may be available. Sign in or learn about subscription options.
pp. 20-23
by
Wm. A. Brinsfield
,
Raymond E. Miller
Papers
Toward a weakly invariant complexity theory
Full-text access may be available. Sign in or learn about subscription options.
pp. 24-32
by
W. A. Burkhard
,
F. W. Kroon
Papers
Effective computation over the real numbers
Full-text access may be available. Sign in or learn about subscription options.
pp. 33-37
by
Fred G. Abramson
Papers
On the design of easily testable sequential machines
Full-text access may be available. Sign in or learn about subscription options.
pp. 38-42
by
J. R. Kane
,
S. S. Yau
Papers
Universal base functions and modules for realizing arbitrary switching functions
Full-text access may be available. Sign in or learn about subscription options.
pp. 43-59
by
Mohamed Y. Osman
,
C. Dennis Weiss
Papers
Synthesis of asynchronous sequential circuits with master-slave subcircuits
Full-text access may be available. Sign in or learn about subscription options.
pp. 60-78
by
G. Frosini
,
G. B. Gerace
Papers
A rectangular logic array
Full-text access may be available. Sign in or learn about subscription options.
pp. 79-90
by
Sheldon B. Akers
Papers
Nand cellular arrays
Full-text access may be available. Sign in or learn about subscription options.
pp. 91-104
by
D. A. Stern
,
H. C. Torng
Papers
Computation by multi-head finite automata
Full-text access may be available. Sign in or learn about subscription options.
pp. 105-113
by
I. H. Sudborough
Papers
Depth-first search and linear grajh algorithms
Full-text access may be available. Sign in or learn about subscription options.
pp. 114-121
by
Robert Tarjan
Papers
A n5/2 algorithm for maximum matchings in bipartite
Full-text access may be available. Sign in or learn about subscription options.
pp. 122-125
by
John E. Hopcroft
,
Richard M. Karp
Papers
On decreasing the computing time for modular arithmetic
Full-text access may be available. Sign in or learn about subscription options.
pp. 126-128
by
Lee E. Heindel
,
Ellis Horowitzz
Papers
Optimal algorithms for parallel polynomial evaluation
Full-text access may be available. Sign in or learn about subscription options.
pp. 132-139
by
Ian Munro
,
Michael Paterson
Papers
Bounds on the evaluation time for rational polynomial
Full-text access may be available. Sign in or learn about subscription options.
pp. 140-143
by
Michael Paterson
,
Larry Stockmeyer
Papers
Two-dimensional formal languages and pattern recognition by cellular automata
Full-text access may be available. Sign in or learn about subscription options.
pp. 144-152
by
Alvy Ray Smith
Papers
LR-regular grammars—An extension of LR(k) grammars
Full-text access may be available. Sign in or learn about subscription options.
pp. 153-165
by
Rina Cohen
,
Karel Culik
Papers
Characterizations of locally testable events
Full-text access may be available. Sign in or learn about subscription options.
pp. 166-176
by
J. A. Brzozowski
,
Imre Simon
Papers
Priority paging algorithms and the extension problem
Full-text access may be available. Sign in or learn about subscription options.
pp. 177-181
by
E. G. Coffman
,
Neil D. Jones
Papers
Time bounds on space computations
Full-text access may be available. Sign in or learn about subscription options.
pp. 182-187
by
M. L. Dertouzos
Papers
Economy of description by automata, grammars, and formal systems
Full-text access may be available. Sign in or learn about subscription options.
pp. 188-191
by
A. R. Meyer
,
M. J. Fischer
Papers
Languages for defining sets in arbitrary algebras
Full-text access may be available. Sign in or learn about subscription options.
pp. 192-201
by
Eric G. Wagner
Papers
Complete linear proofs of systems of linear inequalities
Full-text access may be available. Sign in or learn about subscription options.
pp. 202-206
by
P. M. Spira
Papers
Analysis of sorting algorithms
Full-text access may be available. Sign in or learn about subscription options.
pp. 207-215
by
C. L. Liu
Papers
Computing the maximum and the median
Full-text access may be available. Sign in or learn about subscription options.
pp. 216-218
by
Edward M. Reingold
Showing 29 out of 29