Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Journal=J. Comput.~Syst.~Sci. AND Volume=23
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Completeness of context-free grammar forms
H.A. Maurer
,
A. Salomaa
,
D. Wood
Journal of Computer and System Sciences
23
(1), 1981, August, pp. 1-10
A complete proof of correctness of the Knuth-Bendix completion algorithm
Gérard Huet
Journal of Computer and System Sciences
23
(1), 1981, August, pp. 11-21
Synchronous to asynchronous transformation of polyautomata
K. Nakamura
Journal of Computer and System Sciences
23
(1), 1981, August, pp. 22-37
On maximal order for local and global numerical problems
A.G. Werschulz
Journal of Computer and System Sciences
23
(1), 1981, August, pp. 38-48
On correct refinement of programs
R.J.R. Back
Journal of Computer and System Sciences
23
(1), 1981, August, pp. 49-68
Recursion-closed algebraic theories
J.H. Gallier
Journal of Computer and System Sciences
23
(1), 1981, August, pp. 69-105
An information-theoretic approach to time bounds for on-line computation
Wolfgang J. Paul
,
Joel I. Seiferas
,
Janos Simon
Journal of Computer and System Sciences
23
(2), 1981, October, pp. 108-126
An optimal solution to a wire-routing problem
M. Tompa
Journal of Computer and System Sciences
23
(2), 1981, October, pp. 127-150
Pebbling with an auxiliary pushdown
N. Pippenger
Journal of Computer and System Sciences
23
(2), 1981, October, pp. 151-165
Maintenance of configurations in the plane
M.H. Overmars
,
J. van Leeuwen
Journal of Computer and System Sciences
23
(2), 1981, October, pp. 166-204
Complexity of algebraic implementations for abstract data types
H. Ehrig
,
B. Mahr
Journal of Computer and System Sciences
23
(2), 1981, October, pp. 223-253
Upper bounds for static resource allocation in a distributed system
N.A. Lynch
Journal of Computer and System Sciences
23
(2), 1981, October, pp. 254-278
Definability in dynamic logic
A.R. Meyer
,
R. Parikh
Journal of Computer and System Sciences
23
(2), 1981, October, pp. 279-298
Petri nets and regular languages
Rüdiger Valk
,
Guy Vidal-Naquet
Journal of Computer and System Sciences
23
(3), 1981, December, pp. 299-325
Some observations on
NP
, real numbers and
P
-selective sets
A.L. Selman
Journal of Computer and System Sciences
23
(3), 1981, December, pp. 326-332
Theft and conspiracy in the Take-Grant protection model
L. Snyder
Journal of Computer and System Sciences
23
(3), 1981, December, pp. 333-347
The complexity of restricted regular expressions and the synthesis problem for finite automata
Ernst Leiss
Journal of Computer and System Sciences
23
(3), 1981, December, pp. 348-354
Query time versus redundancy trade-offs for range queries
M.L. Fredman
,
D.J. Volper
Journal of Computer and System Sciences
23
(3), 1981, December, pp. 355-365
The equivalence problem for two dpda's, one of which is a finite-turn or one-counter machine
M. Oyamaguchi
,
Y. Inagaki
,
N. Honda
Journal of Computer and System Sciences
23
(3), 1981, December, pp. 366-382
An efficient interpreter for the lambda-calculus
L. Aiello
,
G. Prini
Journal of Computer and System Sciences
23
(3), 1981, December, pp. 383-424