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=Inf.~Comput. AND Volume=91
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Lower bounds for depth-restricted branching programs
Matthias Krause
Information and Computation
91
(1), 1991, March, pp. 1-14
General logical databases and programs: Default logic semantics and stratification
Nicole Bidoit
,
Christine Froidevaux
Information and Computation
91
(1), 1991, March, pp. 15-54
Recursion over realizability structures
Roberto M. Amadio
Information and Computation
91
(1), 1991, March, pp. 55-85
On truth-table reducibility to SAT
Samuel R. Buss
,
Louise Hay
Information and Computation
91
(1), 1991, March, pp. 86-102
The complexity of controlled selection
Kirk Pruhs
,
Udi Manber
Information and Computation
91
(1), 1991, March, pp. 103-127
Axioms and algorithms for inferences involving probabilistic independence
Dan Geiger
,
Azaria Paz
,
Judea Pearl
Information and Computation
91
(1), 1991, March, pp. 128-141
Boolean circuits versus arithmetic circuits
Joachim von zur Gathen
,
Gadiel Seroussi
Information and Computation
91
(1), 1991, March, pp. 142-154
Approximate algorithms for the knapsack problem on parallel computers
P.S. Gopalakrishnan
,
I.V. Ramakrishnan
,
L.N. Kanal
Information and Computation
91
(2), 1991, April, pp. 155-171
Computing the order of centralizers in linear groups
Lajos Rónyai
Information and Computation
91
(2), 1991, April, pp. 172-176
Connectivity vs.~reachability
M. Chrobak
,
H. Karloff
,
T. Radzik
Information and Computation
91
(2), 1991, April, pp. 177-188
Telescopic mappings in typed lambda calculus
N.G. de Bruijn
Information and Computation
91
(2), 1991, April, pp. 189-204
Simultaneity is harder than agreement
Brian A. Coan
,
Cynthia Dwork
Information and Computation
91
(2), 1991, April, pp. 205-231
Using information systems to solve recursive domain equations
Kim Guldstrand Larsen
,
Glynn Winskel
Information and Computation
91
(2), 1991, April, pp. 232-258
Parallel random access machines with bounded memory wordsize
Stephen J. Bellatoni
Information and Computation
91
(2), 1991, April, pp. 259-273