default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJCSS, Volume 16
Volume 16, Number 1, February 1978
- Theodore P. Baker:
"Natural" Properties of Flowchart Step-Counting Measures. 1-22 - Michael B. Smyth:
Power Domains. 23-36 - Janusz A. Brzozowski, Robert Knast:
The Dot-Depth Hierarchy of Star-Free Languages is Infinite. 37-55 - Torleiv Kløve:
On Complements of Unary L Languages. 56-66 - Joost Engelfriet, Erik Meineche Schmidt:
IO and OI. II. 67-99 - J. Berger, Claude Pair:
Inference for Regular Bilanguages. 100-122
Volume 16, Number 2, April 1978
- Richard J. Lipton, Larry J. Stockmeyer:
Evaluation of Polynomials with Super-Preconditioning. 124-139 - Zvi Galil:
Palindrome Recognition in Real Time by a Multitape Turing Machine. 140-157 - Mike Paterson, Mark N. Wegman:
Linear Unification. 158-167 - Kenneth L. Manders, Leonard M. Adleman:
NP-Complete Decision Problems for Binary Quadratics. 168-184 - Thomas J. Schaefer:
On the Complexity of Some Two-Person Perfect-Information Games. 185-225 - Leonidas J. Guibas, Endre Szemerédi:
The Analysis of Double Hashing. 226-274
Volume 16, Number 3, June 1978
- Rina S. Cohen, Arie Y. Gold:
Omega-Computations on Deterministic Pushdown Machines. 275-300 - Arne T. Jonassen, Donald E. Knuth:
A Trivial Algorithm Whose Analysis Isn't. 301-322 - Derek C. Oppen:
A 2^2^2^pn Upper Bound on the Complexity of Presburger Arithmetic. 323-332 - Francis Y. L. Chin, David Houck:
Algorithms for Updating Minimal Spanning Trees. 333-344 - Hermann A. Maurer, Arto Salomaa, Derick Wood:
ETOL Forms. 345-361 - Calvin C. Elgot, Stephen L. Bloom, Ralph Tindell:
On the Algebraic Atructure of Rooted Trees. 362-399 - P. F. Schuler:
Inductive Definability in Formal Language Theory. 400-412 - David P. Dobkin, Richard J. Lipton:
A Lower Bound of the ½n² on Linear Search Programs for the Knapsack Problem. 413-417 - Juris Hartmanis, Leonard Berman:
On Polynomial Time Isomorphisms of Some New Complete Sets. 418-422 - Paul M. B. Vitányi, Walter J. Savitch:
On Inverse Deterministic Pushdown Transductions. 423-444 - Andrew G. Barto:
A Note on Pattern Reproduction in Tessellation Structures. 445-455 - Detlef Wotschke:
Nondeterminism and Boolean Operations in PDAs. 456-461
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-17 20:51 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:
