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 YEAR=1983
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The Satisfiability Problem for a Class Consisting of Horn Sentences and Some Non-Horn Sentences in Proportional Logic
Susumu Yamasaki
,
Shuji Doshita
Information and Control
59
(1-3), 1983, pp. 1-12
Repetition of Subwords in DOL Languages
A. Ehrenfeucht
,
G. Rozenberg
Information and Control
59
(1-3), 1983, pp. 13-35
Synchronous and Asynchronous Experiments on Processes
M. Hennessy
Information and Control
59
(1-3), 1983, pp. 36-83
Mental Poker with Three or More Players
Imre Bárány
,
Zoltán Füredi
Information and Control
59
(1-3), 1983, pp. 84-93
Regular Dynamic Logic Is Not Interpretable in Deterministic Context-Free Dynamic Logic
A.P. Stolboushkin
Information and Control
59
(1-3), 1983, pp. 94-107
Algebraic Semantics of Recursive Flowchart Schemes
Hartmut Schmeck
Information and Control
59
(1-3), 1983, pp. 108-126
Semantics for Classical AUTOMATH and Related Systems
Henk Barendregt
,
Adrian Rezus
Information and Control
59
(1-3), 1983, pp. 127-147
Subspaces of
{\rm GF}(q)^w
and Convolutional Codes
Ludwig Staiger
Information and Control
59
(1-3), 1983, pp. 148-183
An
n^{3/2}
Lower Bound on the Monotone Network Complexity of the Boolean Convolution
Jürgen Weiss
Information and Control
59
(1-3), 1983, pp. 184-188
Discrete Random Process Stabilization
Aivar A. Lorenc
,
Jānis K. Lapiņs̑
Information and Control
58
(1-3), 1983, pp. 1-18
Patterns and Pattern-Matching in Trees: An Analysis
Jean-Marc Steyaert
,
Philippe Flajolet
Information and Control
58
(1-3), 1983, pp. 19-58
Nontrivial Definability by Flow-Chart Programs
Paweƚ Urzyczyn
Information and Control
58
(1-3), 1983, pp. 59-87
Relativizations Comparing
NP
and Exponential Time
W. Ian Gasarch
,
Steven Homer
Information and Control
58
(1-3), 1983, pp. 88-100
The Complexity of Evaluating Relational Queries
Stavros Cosmodakis
Information and Control
58
(1-3), 1983, pp. 101-112
Parallel Computation for Well-Endowed Rings and Space-Bounded Probabilistic Machines
A. Borodin
,
S. Cook
,
N. Pippenger
Information and Control
58
(1-3), 1983, pp. 113-136
Area-Time Optimal VLSI Integer Multiplier with Minimum Computation Time
Kurt Mehlhorn
,
Franco P. Preparata
Information and Control
58
(1-3), 1983, pp. 137-156
On the computational complexity of ordinary differential equations
Ker-I Ko
Information and Control
58
(1-3), 1983, pp. 157-194
Tree Automata and Attribute Grammars
Tsutomu Maimiura
Information and Control
57
(1), 1983, pp. 1-20
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
Seiten 1
2
>