default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJCSS, Volume 23
Volume 23, Number 1, August 1981
- Hermann A. Maurer, Arto Salomaa, Derick Wood:
Completeness of Context-Free Grammar Forms. 1-10 - Gérard P. Huet:
A Complete Proof of Correctness of the Knuth-Bendix Completion Algorithm. 11-21 - Katsuhiko Nakamura:
Synchronous to Asynchronous Transformation of Polyautomata. 22-37 - Arthur G. Werschulz:
On Maximal Order for Local and Global Numerical Problems. 38-48 - Ralph-Johan Back:
On Correct Refinement of Programs. 49-68 - Jean H. Gallier
:
Recursion-Closed Algebraic Theories. 69-105 - Martin Tompa:
Corrigendum: Time-Space Tradeoffs for Computing Functions, Using Connectivity Properties of Their Circuits. 106
Volume 23, Number 2, October 1981
- Wolfgang J. Paul, Joel I. Seiferas, Janos Simon:
An Information-Theoretic Approach to Time Bounds for On-Line Computation. 108-126 - Martin Tompa:
An Optimal Solution to a Wire-Routing Problem. 127-150 - Nicholas Pippenger:
Pebbling with an Auxiliary Pushdown. 151-165 - Mark H. Overmars, Jan van Leeuwen:
Maintenance of Configurations in the Plane. 166-204 - Deborah Joseph, Paul Young:
Independence Results in Computer Science? 205-222 - Hartmut Ehrig, Bernd Mahr:
Complexity of Algebraic Implementations for Abstract Data Types. 223-253 - Nancy A. Lynch:
Upper Bounds for Static Resource Allocation in a Distributed System. 254-278 - Albert R. Meyer, Rohit Parikh:
Definability in Dynamic Logic. 279-298
Volume 23, Number 3, December 1981
- Rüdiger Valk, Guy Vidal-Naquet:
Petri Nets and Regular Languages. 299-325 - Alan L. Selman:
Some Observations on NP, Real Numbers and P-Selective Sets. 326-332 - Lawrence Snyder:
Theft and Conspiracy in the Take-Grant Protection Model. 333-347 - Ernst L. Leiss:
The Complexity of Restricted Regular Expressions and the Synthesis Problem for Finite Automata. 348-354 - Michael L. Fredman, Dennis J. Volper:
Query Time Versus Redundancy Trade-Offs for Range Queries. 355-365 - Michio Oyamaguchi, Yasuyoshi Inagaki, Namio Honda:
The Equivalence Problem for Two DPDA's, One of Which is a Finite-Turn or One-Counter Machine. 366-382 - Luigia Carlucci Aiello, Gianfranco Prini:
An Efficient Interpreter for the Lambda-Calculus. 383-424
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-15 22:37 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:
