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 YEAR=1991
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Bisimulation through Probabilistic Testing
Kim G. Larsen
,
Arne Skou
Information and Computation
94
(1), 1991, pp. 1-28
Improved Deterministic Parallel Integer Sorting
P.C.P. Bhatt
,
K. Diks
,
T. Hagerup
,
V.C. Prasad
,
T. Radzik
,
S. Saxena
Information and Computation
94
(1), 1991, pp. 29-47
Universal Homogeneous Event Structures and Domains
Manfred Droste
Information and Computation
94
(1), 1991, pp. 48-61
Simple Sentences That Are Hard to Decide
Erich Grädel
Information and Computation
94
(1), 1991, pp. 62-82
A Lower Bound for the Integer Element Distinctiveness Problem
Anna Lubiw
,
András Rácz
Information and Computation
94
(1), 1991, pp. 83-92
Algorithms for Graph Problems on BNLC Structured Graphs
Egon Wanke
Information and Computation
94
(1), 1991, pp. 93-122
Comparative Semantics for Flow of Control in Logic Programming without Logic
J.W. de Bakker
Information and Computation
94
(2), 1991, pp. 123-179
Decidability of Finite Probablistic Propositional Dynamic Logics
M.L. Tiomkin
,
J.A. Makowsky
Information and Computation
94
(2), 1991, pp. 180-203
Retractions on dI--domains as a model for Type:Type
Stefano Berardi
Information and Computation
94
(2), 1991, pp. 204-231
On Oblivious Branching Programs of Linear Length
Stephan Waack
,
Matthias Krause
Information and Computation
94
(2), 1991, pp. 232-249