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=42
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On denotational versus predicative semantics
Manfred Broy
,
Christian Lengauer
Journal of Computer and System Sciences
42
, 1991, pp. 1-29
Realistic analysis of some randomized algorithms
Eric Bach
Journal of Computer and System Sciences
42
, 1991, pp. 30-53
Unification modulo an equality theory for equational logic programming
Jia-Huai You
Journal of Computer and System Sciences
42
, 1991, pp. 54-75
Relativized counting classes: Relations among thresholds, parity, and mods
Richard Beigel
Journal of Computer and System Sciences
42
, 1991, pp. 76-96
Some lower bound results for decentralized extrema-finding in rings of processors
H.L. Bodlaender
Journal of Computer and System Sciences
42
, 1991, pp. 97-118
Resource bounds for parallel computation of threshold and symmetric functions
Ming Li
,
Yaacov Yesha
Journal of Computer and System Sciences
42
, 1991, pp. 119-137
Kernel-LEAF: A logic plus functional language
Elio Giovannetti
,
Giorgio Levi
,
Corrado Moiso
,
Catuscia Palamidessi
Journal of Computer and System Sciences
42
, 1991, pp. 139-185
Overlaps in free partially commutative monoids
Friedrich Otto
,
Celia Wrathall
Journal of Computer and System Sciences
42
, 1991, pp. 186-198
One-sided recursions
Jeffrey F. Naughton
Journal of Computer and System Sciences
42
, 1991, pp. 199-236
On isomorphism testing of a class of 2-nilpotent groups
Max Garzon
,
Yechezkel Zalcstein
Journal of Computer and System Sciences
42
, 1991, pp. 237-248
Two lower bounds in asynchronous distributed computation
Pavol Dúris̑
,
Zvi Galil
Journal of Computer and System Sciences
42
, 1991, pp. 254-266
Lower bounds to randomized algorithms for graph properties
Andrew Chi-Chih Yao
Journal of Computer and System Sciences
42
, 1991, pp. 267-287
Improved algorithms for graph four-connectivity
Arkady Kanevsky
,
Vijaya Ramachandran
Journal of Computer and System Sciences
42
, 1991, pp. 288-306
How to emulate shared memory
Abhiram G. Ranade
Journal of Computer and System Sciences
42
, 1991, pp. 307-326
Statistical zero-knowledge languages can be recognized in two rounds
William Aiello
,
Johan Håstad
Journal of Computer and System Sciences
42
, 1991, pp. 327-345
Average case completeness
Yuri Gurevich
Journal of Computer and System Sciences
42
, 1991, pp. 346-398