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.~Control AND Volume=57
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Tree Automata and Attribute Grammars
Tsutomu Maimiura
Information and Control
57
(1), 1983, pp. 1-20
Commutative grammars: the complexity of uniform word problems
Dung T. Huynh
Information and Control
57
(1), 1983, April, pp. 21-39
On the Random Oracle Hypothesis
Stuart A. Kurtz
Information and Control
57
(1), 1983, pp. 40-47
Deterministic Dynamic Logic is Strictly Weaker than Dynamic Logic
A.P. Stolboushkin
,
M.A. Taitslin
Information and Control
57
(1), 1983, pp. 48-55
Deterministic Process Logic is Elementary
Joseph Y. Halpern
Information and Control
57
(1), 1983, pp. 56-89
Optimal Orientations of Cells in Slicing Floorplan Designs
Larry Stockmeyer
Information and Control
57
(2/3), 1983, pp. 91-101
Connections Between Two Theories of Concurrency: Metric Spaces and Synchronization Trees
William G. Golson
,
William C. Rounds
Information and Control
57
(2/3), 1983, pp. 102-124
The Non-sequential Behavior of Petri Nets
U. Goltz
,
W. Reisig
Information and Control
57
(2/3), 1983, pp. 125-147
Loops in Combinator-Based Compilers
Mitchell Wand
Information and Control
57
(2/3), 1983, pp. 148-164
On the Strength of ``Sometimes'' and ``Always'' in Program Verification
L. Csirmaz
Information and Control
57
(2/3), 1983, pp. 165-179
Complexity of the First-Order Theory of Almost All Finite Structures
Etienne Grandjean
Information and Control
57
(2/3), 1983, pp. 180-204
Some Applications of a Theorem of Shirshov to Language Theory
Antonio Restivo
,
Christophe Reutenauer
Information and Control
57
(2/3), 1983, pp. 205-213