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=44
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Connection-trap-free database schemes
Edward P.F. Chan
,
Paolo Atzeni
Journal of Computer and System Sciences
44
, 1992, pp. 1-22
Contraction algebras and unification of (infinite) terms
Răzvan Diaconescu
Journal of Computer and System Sciences
44
, 1992, pp. 23-42
Parallel restructuring and evaluation of expressions
D.E. Muller
,
F.P. Preparata
Journal of Computer and System Sciences
44
, 1992, pp. 43-62
The correlation between the complexities of the nonhierarchical and hierarchical versions of graph problems
T. Lengauer
,
K.W. Wagner
Journal of Computer and System Sciences
44
, 1992, pp. 63-93
Perfect matching for regular graphs is
AC^0
-hard for the general matching problem
Elias Dahlhaus
,
Marek Karpinski
Journal of Computer and System Sciences
44
, 1992, pp. 94-102
Processor-time tradeoffs in PRAM simulations
Prabhakar Ragde
Journal of Computer and System Sciences
44
, 1992, pp. 103-113
Self-similarity of linear cellular automata
Satoshi Takahashi
Journal of Computer and System Sciences
44
, 1992, pp. 114-140
Undecidability of safety for the schematic protection model with cyclic creates
Ravinderpal Singh Sandhu
Journal of Computer and System Sciences
44
, 1992, pp. 141-159
Some remarks on a theorem of Sakarovitch
Thomas Herbst
Journal of Computer and System Sciences
44
, 1992, pp. 160-165
The complexity types of computable sets
Wolfgang Maass
,
Theodore A. Slaman
Journal of Computer and System Sciences
44
, 1992, pp. 168-192
On the theory of average case complexity
Shai Ben-David
,
Benny Chor
,
Oded Goldreich
,
Michael Luby
Journal of Computer and System Sciences
44
, 1992, pp. 193-219
Almost everywhere high nonuniform complexity
Jack H. Lutz
Journal of Computer and System Sciences
44
, 1992, pp. 220-258
Multi-oracle interactive protocols with constant space verifiers
Uriel Feige
,
Adi Shamir
Journal of Computer and System Sciences
44
, 1992, pp. 259-271
Turing machines with few accepting computations and low sets for PP
Johannes Köbler
,
Uwe Schöning
,
Seinosuke Toda
,
Jacobo Torán
Journal of Computer and System Sciences
44
, 1992, pp. 272-286
Oracles for structural properties: The isomorphism problem and public-key cryptography
Steven Homer
,
Alan L. Selman
Journal of Computer and System Sciences
44
, 1992, pp. 287-301
The complexity of circuit value and network stability
Ernst W. Mayr
,
Ashok Subramanian
Journal of Computer and System Sciences
44
, 1992, pp. 302-323
Results on communication complexity classes
Tak Wah Lam
,
Walter L. Ruzzo
Journal of Computer and System Sciences
44
, 1992, pp. 324-342
Inductive reasoning and Kolmogorov complexity
Ming Li
,
Paul M.B. Vitányi
Journal of Computer and System Sciences
44
, 1992, pp. 343-384
The invariant problem for binary string structures and the parallel complexity theory of queries
Steven Lindell
Journal of Computer and System Sciences
44
, 1992, pp. 385-410
Distributed event algebras
A. Klapper
Journal of Computer and System Sciences
44
, 1992, pp. 411-424
Finite automata on directed graphs
Michael Kaminski
,
Shlomit S. Pinter
Journal of Computer and System Sciences
44
, 1992, pp. 425-446
B-fairness and structural B-fairness in Petri net models of concurrent systems
Manuel Silva
,
Tadao Murata
Journal of Computer and System Sciences
44
, 1992, pp. 447-477
Regular languages in
NC^1
David A. Mix Barrington
,
Kevin Compton
,
Howard Straubing
,
Denis Thérien
Journal of Computer and System Sciences
44
, 1992, pp. 478-499
On polynomial time one-truth-table reducibility to a sparse set
Osamu Watanabe
Journal of Computer and System Sciences
44
, 1992, pp. 500-516