default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSIGACT News (ACM), Volume 5
Volume 5, Number 1, January 1973
- David B. Benson:
Another comment on the null word definition problem. 14-17 - Recent technical reports. 21-24
Volume 5, Number 2, April 1973
- M. Bauer, D. Brand, Michael J. Fischer, Albert R. Meyer, Mike Paterson:
A note on disjunctive form tautologies. 17-20 - Gregory J. Chaitin:
Some philosophical implications of information-theoretic computational complexity. 21-23 - Some abstracts from The Computer Science Conference. 24-25
- Recent technical reports. 26-27
Volume 5, Number 3, July 1973
- Larry J. Stockmeyer:
Planar 3-colorability is polynomial complete. 19-25 - John Lind, Albert R. Meyer:
A characterization of log-space computable functions. 26-29 - Gabriele Ricci:
Some further comments about nothing. 29-30 - Recent technical reports. 31-32
Volume 5, Number 4, October 1973
- Louise H. Jones:
Microprogramming: an opportunity for SIGACT. 9-11 - David B. Benson:
An alternate proof of Aho & Ullman's LR(k) viable prefix theorem. 11-14 - Arnold L. Rosenberg:
On the time required to recognize properties of graphs: a problem. 15-16
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.
last updated on 2025-12-05 22:23 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
