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=1986
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
An automata-theoretical characterization of the OI-hierarchy
W. Damm
,
A. Goerdt
Information and Control
71
(1/2), 1986, pp. 1-32
Retraction map categories and their applications to the construction of lambda calculus models
H. Youkouchi
Information and Control
71
(1/2), 1986, pp. 33-86
An exponential lower bound for real-time branching programs
S. Zák
Information and Control
71
(1/2), 1986, pp. 87-94
An ideal model for recursive polymorphic types
D. MacQueen
,
G. Plotkin
,
R. Sethi
Information and Control
71
(1/2), 1986, pp. 95-130
On the power of two-way random generators and the impossibility of deterministic poly-space simulation
M. Karpinski
,
R. Verbeek
Information and Control
71
(1/2), 1986, pp. 131-142
Simulation of large networks on smaller networks
H.L. Bodlaender
,
J. van Leeuwen
Information and Control
71
, 1986, pp. 143-180
A note on succinct representations of graphs
C.H. Papadimitriou
,
M. Yannakakis
Information and Control
71
, 1986, pp. 181-185
Function definitions in term rewriting and applicative programming
C.K. Mohan
,
M.K. Srivas
Information and Control
71
, 1986, pp. 186-217
Systolic trellis automata: stability, decidability and complexity
K. Culik II
,
J. Gruska
,
A. Salomaa
Information and Control
71
, 1986, pp. 218-230
On relativized exponential and probabilistic complexity classes
H. Heller
Information and Control
71
, 1986, pp. 231-243
Functional dependencies and contraints on null values in database relations
P. Atzeni
,
N.M. Morfuni
Information and Control
70
(1), 1986, pp. 1-31
Deterministic coin tossing with applications to optimal parallel list ranking
R. Cole
,
U. Vishkin
Information and Control
70
(1), 1986, pp. 32-53
The density and complexity of polynomial cores for intractable sets
P. Orponen
,
U. Schöning
Information and Control
70
(1), 1986, pp. 54-68
Aggregating inductive expertise
D.N. Osherson
,
M. Stob
,
S. Weinstein
Information and Control
70
(1), 1986, pp. 69-95
Probabilistic propositional temporal logics
S. Hart
,
M. Sharir
Information and Control
70
(2/3), 1986, pp. 97-155
Inductive inference of approximations
J.S. Royer
Information and Control
70
(2/3), 1986, pp. 156-178
A note on some simultaneous relations among time, space, and reversal for single work tape nondeterministic Turing machines
E. Moriya
,
Sh. Iwata
,
T. Kasai
Information and Control
70
(2/3), 1986, pp. 179-185
Every sequence is reducible to a random one
P. Gács
Information and Control
70
(2/3), 1986, pp. 186-192
Pre-analysis locking
G. Lausen
,
E. Soisalon-Soininen
,
P. Widmayer
Information and Control
70
(2/3), 1986, pp. 193-215
Definability by constant-depth polynomial-size circuits
L. Denenberg
,
Y. Gurevich
,
S. Shelah
Information and Control
70
(2/3), 1986, pp. 216-240
Arithmetic theories for computational complexity problems
S. Homer
,
J. Reif
Information and Control
69
(1-3), 1986, pp. 1-11
On the complexity of inductive inference
R.P. Daley
,
C.H. Smith
Information and Control
69
(1-3), 1986, pp. 12-40
Machines for attribute grammars
G. Filé
Information and Control
69
(1-3), 1986, pp. 41-124
A decisive characterization of BPP
S. Zachos
,
H. Heller
Information and Control
69
(1-3), 1986, pp. 125-135
Boundary NLC graph grammars - basic definitions, normal forms, and complexity
G. Rozenberg
,
E. Welzl
Information and Control
69
(1-3), 1986, pp. 136-167
Seiten 1
2
>