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=25
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Algebraic dependencies
M. Yannakakis
,
C.H. Papadimitriou
Journal of Computer and System Sciences
25
(1), 1982, August, pp. 2-41
Isomorphism of graphs of bounded valence can be tested in polynomial time
E.M. Luks
Journal of Computer and System Sciences
25
(1), 1982, August, pp. 42-65
N
-process mutual exclusion with bounded waiting by
4\log_2 N
-valued shared variable
Michael O. Rabin
Journal of Computer and System Sciences
25
, 1982, pp. 66-75
Upper and lower bounds for first order expressibility
N. Immerman
Journal of Computer and System Sciences
25
(1), 1982, August, pp. 76-98
Structure and complexity of relational queries
A. Chandra
,
D. Harel
Journal of Computer and System Sciences
25
(1), 1982, August, pp. 99-128
Sparse complete sets of
NP
: solution of a conjecture of Berman and Hartmanis
S.R. Mahaney
Journal of Computer and System Sciences
25
(2), 1982, October, pp. 130-143
Process logic: expressiveness, decidability, completeness
D. Harel
,
D. Kozen
,
R. Parikh
Journal of Computer and System Sciences
25
(2), 1982, October, pp. 144-170
The average height of binary trees and other simple trees
P. Flajolet
,
A. Odlyzko
Journal of Computer and System Sciences
25
(2), 1982, October, pp. 171-213
A general class of resource tradeoffs
J.L. Bentley
,
D.J. Brown
Journal of Computer and System Sciences
25
(2), 1982, October, pp. 214-238
Proofs by induction in equational theories with constructors
G. Huet
,
J.-M. Hullot
Journal of Computer and System Sciences
25
(2), 1982, October, pp. 239-266
Expressiveness and the completeness of Hoare's logic
J.A. Bergstra
,
J.V. Tucker
Journal of Computer and System Sciences
25
(3), 1982, December, pp. 267-284
Homomorphisms between models of parallel computation
T. Kasai
,
R.E. Miller
Journal of Computer and System Sciences
25
(3), 1982, December, pp. 285-331
Subcomplete generalizations of graph isomorphism
C.M. Hoffmann
Journal of Computer and System Sciences
25
(3), 1982, December, pp. 332-359
Classifying regular events in symbolic logic
W. Thomas
Journal of Computer and System Sciences
25
(3), 1982, December, pp. 360-376
An algebraic characterization of some principal regulated rational cones
W. Kuich
Journal of Computer and System Sciences
25
, 1982, pp. 377-401
Deterministic propositional dynamic logic: finite models, complexity, and completeness
M. Ben-Ari
,
J.Y. Halpern
,
A. Pnueli
Journal of Computer and System Sciences
25
(3), 1982, December, pp. 402-417
The copying power of one-state tree transducers
J. Engelfriet
,
S. Skyum
Journal of Computer and System Sciences
25
(3), 1982, December, pp. 418-435