


default search action
SIGACT News (ACM), Volume 7
Volume 7, Number 1, January 1975
- Richard E. Ladner

:
The circuit value problem is log space complete for P. 18-20 - Y. Edmund Lien:

Periodic properties of strings. 21-25 - M. S. Krishnamoorthy:

An NP-hard problem in bipartite graphs. 26
Volume 7, Number 2, April 1975
- Peter Kugel:

Trees. 19 - Technical reports. 20-24

Volume 7, Number 3, Summer 1975
- Barry K. Rosen:

A Church-Rosser theorem for graph grammars. 26-31 - Lieuwe de Jong, Jan van Leeuwen:

An improved bound on the number of multiplications and divisions necessary to evaluate a polynomial and all its derivatives. 32-34 - Recent technical reports. 35-39

Volume 7, Number 4, November - December 1975
- Richard E. Schneider:

Automata theory: what is it used for? 8-11 - Richard J. Lipton, Nancy A. Lynch:

A quantifier characterization for nondeterministic log space. 24-25 - Zvi Galil:

On converting on-line algorithms into real-time and on real-time algorithms for string-matching and palindrome recognition. 26-30 - Helmut Alt, Kurt Mehlhorn:

A language over a one symbol alphabet requiring only O (log log n) space. 31-33 - Harold N. Gabow:

How to gracefully number certain symmetric trees. 33-36

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














