


default search action
SIGACT News (ACM), Volume 16
Volume 16, Number 1, Winter - Spring 1984
- Barbara Simons:

The reentry Computer Science Program at U.C. Berkeley. 36 - W. Richard Stark:

Combinatory automaton. 37 - Abstracts. 48-56

- Jonathan S. Turner:

On the general graph embedding problem with applications to circuit layout. 59 - S. Louis Hakimi, Oded Kariv:

Midwest theory of computation symposium: on a generalization of edge-coloring in graphs. 60 - Ronald V. Book:

Relativizations of complexity classes. 61 - John Franco:

Duality, finite improvement and efficiently solved optimization problems. 62 - Eitan M. Gurari, Ten-Hwang Lai:

Deadlock detection in communicating finite state machines. 63-64
Volume 16, Number 2, Summer 1984
- David S. Johnson:

The genealogy of theoretical computer science: a preliminary report. 36-49 - Nicola Santoro:

Sense of direction, topological awareness and communication complexity. 50-56 - Abstracts. 57-62

Volume 16, Number 3, Fall 1984
- Charles B. Dunham:

A sequence of uncomputable functions. 48 - Andrei Z. Broder, Jorge Stolfi:

Pessimal algorithms and simplexity analysis. 49-53
Volume 16, Number 4, April 1985
- John C. Cherniavsky:

NSF news. 46-47 - Barbara Simons:

Some thoughts on running a conference. 48-52 - Severo M. Ornstein, Lucy A. Suchman:

Reliability and responsibility. 53-55 - Paul M. B. Vitányi, Lambert G. L. T. Meertens:

Big omega versus the wild functions. 56-59 - Jacques Morgenstern:

How to compute fast a function and all its derivatives: a variation on the theorem of Baur-strassen. 60-62

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














